Skip to main content
SpringerLink
Log in

Reconstruction of finite rate of innovation signals in a noisy scenario: a robust, accurate estimation algorithm

  • Original Paper
  • Published:
Signal, Image and Video Processing Aims and scope Submit manuscript

Abstract

The paradigmatic example of signals with finite rate of innovation (FRI) is a linear combination of a finite number of Diracs per time unit, a.k.a. spike sequence. Many researchers have investigated the problem of estimating the innovative part of a spike sequence, i.e., time instants tks and weights cks of Diracs and proposed various deterministic or stochastic algorithms, particularly while the samples were corrupted by digital noise. In the presence of noise, maximum likelihood estimation method proved to be a powerful tool for reconstructing FRI signals, which is inherently an optimization problem. Wein and Srinivasan presented an algorithm, namely IterML, for reconstruction of streams of Diracs in noisy situations, which achieved promising reconstruction error and runtime. However, IterML is prone to limited resolution of search grid for tk, so as to avoid a phenomenon known as the curse of dimensionality, that makes it an inappropriate algorithm for applications that require highly accurate reconstruction of time instants. In order to overcome this shortcoming, we introduce a novel modified local best particle swarm optimization (MLBPSO) algorithm aimed at maximizing likelihood estimation of innovative parameters of a sparse spike sequence given noisy low-pass filtered samples. We demonstrate via extensive simulations that MLBPSO algorithm outperforms the IterML in terms of robustness to noise and accuracy of estimated parameters while maintaining comparable computational cost.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Notes

  1. The use of Delta for simplification.

References

  1. Unser, M.: Sampling—50 years after Shannon. In: Proceedings of the IEEE (2000)

  2. Blu, T., Dragotti, P.L., Vetterli, M., Marziliano, P., Coulot, L.: Sparse sampling of signal innovations: theory, algorithms and performance bounds. IEEE Signal Process. Mag. 25, 31–40 (2008)

    Article  Google Scholar 

  3. Vetterli, M., Marziliano, P., Blu, T.: Sampling signals with finite rate of innovation. IEEE Trans. Signal Process. 50, 1417–1428 (2002)

    Article  MathSciNet  Google Scholar 

  4. Oñativia, J., Dragotti, P.L.: Sparse sampling: theory, methods and an application in neuroscience. Biol. Cybern. 109, 125–139 (2015)

    Article  MathSciNet  Google Scholar 

  5. Akhondi Asl, H., Dragotti, P.L.: Simultaneous estimation of sparse signals and systems at sub-Nyquist rates. In: 19th European Signal Processing Conference (2011)

  6. Duval, V., Peyré, G.: Exact support recovery for sparse spikes deconvolution. Found. Comput. Math. 15, 1315–1355 (2015)

    Article  MathSciNet  Google Scholar 

  7. Denoyelle, Q., Duval, V., Peyré, G.: Support recovery for sparse superresolution of positive measures. J. Fourier Anal. Appl. 23, 1153–1194 (2017)

    Article  MathSciNet  Google Scholar 

  8. Candès, E.J., Fernandez-Granda, C.: Super-resolution from noisy data. J. Fourier Anal. Appl. 19, 1229–1254 (2013)

    Article  MathSciNet  Google Scholar 

  9. Degraux, K., Peyré, G., Fadili, J., Jacques, L.: Sparse support recovery with non-smooth loss functions. In: Advances in Neural Information Processing Systems (2016)

  10. El Mouatasim, A., Wakrim, M.: Control subgradient algorithm for image L1-regularization. SIViP 9, 275–283 (2015)

    Article  Google Scholar 

  11. El Mouatasim, A.: Control proximal gradient algorithm for image L1-regularization. SIViP 13, 1113–1121 (2019)

    Article  Google Scholar 

  12. Dossal, C.: A necessary and sufficient condition for exact sparse recovery by L1-minimization. C.R. Math. 350, 117–120 (2012)

    Article  MathSciNet  Google Scholar 

  13. Meignen, S., Legros, Q., Altmann, Y., McLaughlin, S.: A novel algorithm for the identification of Dirac impulses from filtered noisy measurements. Sig. Process. 162, 268–281 (2019)

    Article  Google Scholar 

  14. Condat, L., Hirabayashi, A.: Cadzow denoising upgraded: a new projection method for the recovery of Dirac pulses from noisy linear measurements. Sampl. Theory Signal Image Process. 14(1), 17–47 (2015)

    MathSciNet  MATH  Google Scholar 

  15. Dragotti, P.L., Vetterli, M., Blu, T.: Sampling moments and reconstructing signals of finite rate of innovation: Shannon meets Strang-fix. IEEE Trans. Signal Process. 55, 1741–1757 (2007)

    Article  MathSciNet  Google Scholar 

  16. Tan, V.Y.F., Goyal, V.K.: Estimating signals with finite rate of innovation from noisy samples: a stochastic algorithm. IEEE Trans. Signal Process. 56, 5135–5146 (2008)

    Article  MathSciNet  Google Scholar 

  17. Erdozain, A., Crespo, P.M.: A new stochastic algorithm inspired on genetic algorithms to estimate signals with finite rate of innovation from noisy samples. Sig. Process. 90, 134–144 (2010)

    Article  Google Scholar 

  18. Wein, A., Srinivasan, L.: IterML: a fast, robust algorithm for estimating signals with finite rate of innovation. IEEE Trans. Signal Process. 61, 5324–5336 (2013)

    Article  Google Scholar 

  19. Khan, S., Kamran, M., Rehman, O.U., Liu, L., Yang, S.: A modified PSO algorithm with dynamic parameters for solving complex engineering design problem. Int. J. Comput. Math. 95(11), 2308–2329 (2018)

    Article  Google Scholar 

  20. Khan, S.U., Yang, S., Wang, L., Liu, L.: A modified particle swarm optimization algorithm for global optimizations of inverse problems. IEEE Trans. Magn. 52, 1–4 (2015)

    Google Scholar 

  21. Caballero, J., Urigiien, J.A., Schultz, S.R., Dragotti, P.L.: Spike sorting at sub-Nyquist rates. In: International Conference on Acoustic, Speech, and Signal Processing (2012)

  22. Õnativia, J., Schultz, S.R., Dragotti, P.L.: A finite rate of innovation algorithm for fast and accurate spike detection from two-photon calcium imaging. J. Neural Eng. 10, 046017 (2013)

    Article  Google Scholar 

  23. Najjarzadeh, M., Ayatollahi, A.: FIR digital filters design: particle swarm optimization utilizing LMS and minimax strategies. In: Proceedings of the IEEE International Symposium on Signal Processing and Information Technology (2008)

  24. Najjarzadeh, M., Ayatollahi, A.: A comparison between genetic algorithm and PSO for linear phase FIR digital filter design. In: 9th International Conference on Signal Processing (2008)

  25. Harrison, K.R., Engelbrecht, A.P., Ombuki-Berman, B.M.: Inertia weight control strategies for particle swarm optimization. Swarm Intell. 10, 267–305 (2016)

    Article  Google Scholar 

  26. Panigrahi, B.K., Ravikumar Pandi, V., Das, S.: Adaptive particle swarm optimization approach for static and dynamic economic load dispatch. Energy Convers. Manag. 49, 1407–1415 (2008)

    Article  Google Scholar 

  27. Ye, W., Feng, W., Fan, S.: A novel multi-swarm particle swarm optimization with dynamic learning strategy. Appl. Soft Comput. 61, 832–843 (2017)

    Article  Google Scholar 

  28. Wang, D., Tan, D., Liu, L.: Particle swarm optimization algorithm: an overview. Soft. Comput. 22, 387–408 (2018)

    Article  Google Scholar 

  29. Cheng, S., Lu, H., Lei, X., Shi, Y.: A quarter century of particle swarm optimization. Complex Intell. Syst. 4, 227–239 (2018)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Shahed University, Tehran, Iran

    Meisam Najjarzadeh & Hamed Sadjedi

  2. Acoustic Research Laboratory, Shahed University, Tehran, Iran

    Meisam Najjarzadeh & Hamed Sadjedi

Authors
  1. Meisam Najjarzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hamed Sadjedi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hamed Sadjedi.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Najjarzadeh, M., Sadjedi, H. Reconstruction of finite rate of innovation signals in a noisy scenario: a robust, accurate estimation algorithm. SIViP 14, 1707–1715 (2020). https://doi.org/10.1007/s11760-020-01712-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11760-020-01712-5

Keywords

Search

Navigation