OSA's Digital Library

Applied Optics

Applied Optics

APPLICATIONS-CENTERED RESEARCH IN OPTICS

  • Editor: Joseph N. Mait
  • Vol. 51, Iss. 17 — Jun. 10, 2012
  • pp: 3941–3949

Denoising infrared maritime imagery using tailored dictionaries via modified K-SVD algorithm

L. N. Smith, C. C. Olson, K. P. Judd, and J. M. Nichols  »View Author Affiliations


Applied Optics, Vol. 51, Issue 17, pp. 3941-3949 (2012)
http://dx.doi.org/10.1364/AO.51.003941


View Full Text Article

Enhanced HTML    Acrobat PDF (1148 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

Recent work has shown that tailored overcomplete dictionaries can provide a better image model than standard basis functions for a variety of image processing tasks. Here we propose a modified K-SVD dictionary learning algorithm designed to maintain the advantages of the original approach but with a focus on improved convergence. We then use the learned model to denoise infrared maritime imagery and compare the performance to the original K-SVD algorithm, several overcomplete “fixed” dictionaries, and a standard wavelet denoising algorithm. Results indicate the superiority of overcomplete representations and show that our tailored approach provides similar peak signal-to-noise ratios as the traditional K-SVD at roughly half the computational cost.

OCIS Codes
(100.2000) Image processing : Digital image processing
(100.2980) Image processing : Image enhancement
(100.3020) Image processing : Image reconstruction-restoration

ToC Category:
Image Processing

History
Original Manuscript: January 11, 2012
Revised Manuscript: April 5, 2012
Manuscript Accepted: April 10, 2012
Published: June 8, 2012

Citation
L. N. Smith, C. C. Olson, K. P. Judd, and J. M. Nichols, "Denoising infrared maritime imagery using tailored dictionaries via modified K-SVD algorithm," Appl. Opt. 51, 3941-3949 (2012)
http://www.opticsinfobase.org/ao/abstract.cfm?URI=ao-51-17-3941


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. D. L. Donoho, “De-noising by soft-thresholding,” IEEE Trans. Inf. Theory 41, 613–627 (1995). [CrossRef]
  2. H. Krim, D. Tucker, and S. Mallat, “On denoising and best signal representation,” IEEE Trans. Inf. Theory 45, 2225–2238 (1999). [CrossRef]
  3. M. Lang, H. Guo, J. E. Odegard, C. S. Burrus, and R. O. Wells, “Noise reduction using an undecimated discrete wavelet transform,” IEEE Signal Process. Lett. 3, 10–12 (1996). [CrossRef]
  4. J.-L. Starck, E. J. Candes, and D. L. Donoho, “The curvelet transform for image denoising,” IEEE Trans. Image Process. 11, 670–684 (2002). [CrossRef]
  5. M. Aharon, M. Elad, and A. Bruckstein, “K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation,” IEEE Trans. Signal Process. 54, 4311–4322 (2006). [CrossRef]
  6. R. Rubinstein, M. Zibulevsky, and M. Elad, “double sparsity: learning sparse dictionaries for sparse signal approximation,” IEEE Trans. Signal Process. 58, 1553–1564 (2010). [CrossRef]
  7. R. Neff, and A. Zakhor, “Very low bit-rate video coding based on matching pursuits,” IEEE Trans. Circuits Syst. Video Technol. 7, 158–171 (1997). [CrossRef]
  8. K. Skretting, and K. Engan, “Recursive least squares dictionary learning algorithm,” IEEE Trans. Signal Process. 58, 2121–2130 (2010). [CrossRef]
  9. A. M. Bruckstein, D. L. Donoho, and M. Elad, “From sparse solutions of systems of equations to sparse modeling of signals and images,” SIAM Rev. 51, 34–81 (2009). [CrossRef]
  10. S. G. Mallat, and Z. Zhang, “Matching pursuits with time-frequency dictionaries,” IEEE Trans. Signal Process. 41, 3397–3415 (1993). [CrossRef]
  11. Y. Pati, R. Rezaifar, and P. Krishnaprasad, “Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition,” in 1993 Conference Record of the 27th Asilomar Conference on Signals, Systems and Computers (1993), Vol. 1, pp. 40–44.
  12. J. A. Tropp, and A. C. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,” IEEE Trans. Inf. Theory 53, 4655–4666 (2007). [CrossRef]
  13. K. Kreutz-Delgado, J. F. Murray, B. D. Rao, K. Engan, T. Lee, and T. J. Sejnowski, “Dictionary learning algorithms for sparse representations,” Neural Comput. 15, 349–396 (2003). [CrossRef]
  14. S. Lesage, R. Gribonval, F. Bimbot, and L. Benaroya, “Learning unions of orthonormal bases with thresholded singular value decomposition,” in IEEE International Conference on Acoustics, Speech, and Signal Processing (2005), Vol. 5, pp. 293–296.
  15. R. Rubinstein, M. Zibulevsky, and M. Elad, “Efficient implementation of the K-SVD algorithm using batch orthogonal matching pursuit,” CS Technical Report (Technion—Israel Institute of Technology, 2008).
  16. M. Elad, and M. Aharon, “Image denoising via sparse and redundant representations over learned dictionaries,” IEEE Trans. Image Process. 15, 3736–3745 (2006). [CrossRef]
  17. J. Yang, J. Wright, T. Huang, and Y. Ma, “Image super-resolution via sparse representation,” IEEE Trans. Image Process. 19, 2861–2873 (2010). [CrossRef]
  18. R. Zeyde, M. Elad, and M. Protter, “On single image scale-up using sparse-representations,” Lect. Notes Comput. Sci. 6920/2012, 711–730 (2012). [CrossRef]
  19. M. Elad, Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing (Springer, 2010).

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.


« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited