An algorithm for learning sparsifying transforms of multidimensional signals
DOI:
https://doi.org/10.17533/udea.redin.n83a10Keywords:
sparse representation, dictionary learning, sparsifying transforms, multidimensional signal processingAbstract
Multidimensional signals contain information of an object in more than one dimension, and usually their processing relies on complex methods in comparison with their unidimensional counterparts. In signal processing, finding a sparse representation of a signal is of great importance for compression purposes. Analytical multidimensional bases such as the Fourier, Cosine, or Wavelet Transform have been conventionally used. Recently, the use of learned dictionaries that directly adapt to the given signal are becoming popular in tasks such as image classification, image denoising, spectral unmixing, and medical image reconstruction. This paper presents an algorithm to learn transformation bases for the sparse representation of multidimensional signals. The proposed algorithm alternates between a sparse coding step solved by hard or soft thresholding strategies, and an updating dictionary step solved by a conjugate gradient method. Furthermore, the algorithm is tested using both: two-dimensional and three-dimensional patches, which are compared in terms of the sparsity performance for different types of multidimensional signals such as hyperspectral images, computerized axial tomography images and, magnetic resonance images. The attained results are compared against traditional analytical transforms and the state-of-the-art dictionary learning method: K-SVD.
Downloads
References
J. Bushberg, J. Seibert, E. Leidholdt, and J. Boone, The essential physics of medical imaging, 3rd ed. Philadelphia, USA: Lippincott Williams & Wilkins, 2011.
Ó. Espitia, Y. Mejía, and H. Arguello, “Tomografía computarizada: proceso de adquisición, tecnología y estado actual,” Tecnura, vol. 20, no. 47, pp. 119–135, 2016.
G. A. Shaw and H. K. Burke, “Spectral Imaging for Remote Sensing,” Lincoln Laboratory Journal, vol. 14, no. 1, pp. 3–28, 2003.
A. Camacho, C. Vargas, F. Rojas, S. Castillo, and H. Arguello, “Aplicaciones y retos del sensado remoto hiperespectral en la geología colombiana,” Facultad de Ingeniería, vol. 24, no. 40, pp. 17–29, 2015.
G. R. Arce, D. J. Brady, L. Carin, H. Arguello, and D. S. Kittle, “Compressive Coded Aperture Spectral Imaging: An Introduction,” IEEE Signal Processing Magazine, vol. 31, no. 1, pp. 105–115, 2014.
E. J. Candes and T. Tao, “Decoding by linear programming,” I IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4203–4215, 2005.
E. Candès and M. Wakin, “An Introduction To Compressive Sampling,” IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 21–30, 2008.
S. Qaisar, R. M. Bilal, W. Iqbal, M. Naureen, and S. Lee, “Compressive sensing: From theory to applications, a survey,” Journal of Communications and Networks, vol. 15, no. 5, pp. 443–456, 2013.
A. Bruckstein, D. Donoho, and M. Elad, “From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images,” SIAM Rev., vol. 51, no. 1, pp. 34–81, 2009.
M. Elad, M. A. T. Figueiredo, and Y. Ma, “On the Role of Sparse and Redundant Representations in Image Processing,” Proceedings of the IEEE, vol. 98, no. 6, pp. 972–982, 2010.
G. Kutyniok, “Theory and applications of compressed sensing,” GAMM-Mitteilungen, vol. 36, no. 1, pp. 79–101, 2013.
S. Mallat, A Wavelet Tour of Signal Processing, 1st ed. London, UK: Academic Press, 1999.
R. Rubinstein, A. M. Bruckstein, and M. Elad, “Dictionaries for Sparse Representation Modeling,” Proceedings of the IEEE, vol. 98, no. 6, pp. 1045–1057, 2010.
M. Elad, P. Milanfar, and R. Rubinstein, “Analysis versus synthesis in signal priors,” Inverse Problems, vol. 23, no. 3, p. 947–968, 2007.
D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289–1306, 2006.
R. Rubinstein, T. Faktor, and M. Elad, “K-SVD dictionary-learning for the analysis sparse model,” in IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Kyoto, Japan, 2012, pp. 5405–5408.
M. Aharon, M. Elad, and A. Bruckstein, “K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation,” IEEE Transactions on Signal Processing, vol. 54, no. 11, pp. 4311–4322, 2006.
M. Yaghoobi, T. Blumensath, and M. E. Davies, “Dictionary Learning for Sparse Approximations With the Majorization Method,” IEEE Transactions on Signal Processing, vol. 57, no. 6, pp. 2178–2191, 2009.
R. Rubinstein, T. Peleg, and M. Elad, “Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model,” IEEE Transactions on Signal Processing, vol. 61, no. 3, pp. 661–677, 2013.
M. Yaghoobi, S. Nam, R. Gribonval, and M. E. Davies, “Constrained Overcomplete Analysis Operator Learning for Cosparse Signal Modelling,” IEEE Transactions on Signal Processing, vol. 61, no. 9, pp. 2341–2355, 2013.
M. Yaghoobi, S. Nam, R. Gribonval, and M. E. Davies, “Noise aware analysis operator learning for approximately cosparse signals,” in IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Kyoto, Japan, 2012, pp. 5409–5412.
S. Ravishankar and Y. Bresler, “Learning Sparsifying Transforms,” IEEE Transactions on Signal Processing, vol. 61, no. 5, pp. 1072–1086, 2013.
J. Nocedal and S. Wright, Numerical Optimization, 2nd ed. New York, USA: Springer, 2006.
H. F. Rueda and H. Arguello, “Spatial super-resolution in coded aperture-based optical compressive hyperspectral imaging systems,” Revista Facultad de Ingeniería Universidad de Antioquia, no. 67, pp. 7–18, 2013.
M. J. Ackerman, The Visible Human Project, 1994. [Online]. Available: https://www.nlm.nih.gov/research/visible/getting_data.html. Accessed on: Apr. 26, 2016.
R. G. Lyons, Understanding Digital Signal Processing, 3rd ed. New Jersey, USA: Prentice Hall, 2011.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2017 Revista Facultad de Ingeniería Universidad de Antioquia
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Revista Facultad de Ingeniería, Universidad de Antioquia is licensed under the Creative Commons Attribution BY-NC-SA 4.0 license. https://creativecommons.org/licenses/by-nc-sa/4.0/deed.en
You are free to:
Share — copy and redistribute the material in any medium or format
Adapt — remix, transform, and build upon the material
Under the following terms:
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
NonCommercial — You may not use the material for commercial purposes.
ShareAlike — If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
The material published in the journal can be distributed, copied and exhibited by third parties if the respective credits are given to the journal. No commercial benefit can be obtained and derivative works must be under the same license terms as the original work.
Twitter