Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 842017, 17 pages
http://dx.doi.org/10.1155/2015/842017
Research Article

Backtracking-Based Simultaneous Orthogonal Matching Pursuit for Sparse Unmixing of Hyperspectral Data

1College of Astronautics, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
2State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China

Received 12 November 2014; Revised 3 April 2015; Accepted 3 April 2015

Academic Editor: Kishin Sadarangani

Copyright © 2015 Fanqiang Kong et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. N. Keshava and J. F. Mustard, “Spectral unmixing,” IEEE Signal Processing Magazine, vol. 19, no. 1, pp. 44–57, 2002. View at Publisher · View at Google Scholar · View at Scopus
  2. Y. H. Hu, H. B. Lee, and F. L. Scarpace, “Optimal linear spectral unmixing,” IEEE Transactions on Geoscience and Remote Sensing, vol. 37, no. 1, pp. 639–644, 1999. View at Publisher · View at Google Scholar · View at Scopus
  3. J. M. Bioucas-Dias, A. Plaza, N. Dobigeon et al., “Hyperspectral unmixing overview: geometrical, statistical, and sparse regression-based approaches,” IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, vol. 5, no. 2, pp. 354–379, 2012. View at Publisher · View at Google Scholar · View at Scopus
  4. M. Graña, I. Villaverde, J. O. Maldonado, and C. Hernandez, “Two lattice computing approaches for the unsupervised segmentation of hyperspectral images,” Neurocomputing, vol. 72, no. 10-12, pp. 2111–2120, 2009. View at Publisher · View at Google Scholar · View at Scopus
  5. J. Li and J. M. Bioucas-Dias, “Minimum volume simplex analysis: a fast algorithm to unmix hyperspectral data,” in Proceedings of the IEEE International Geoscience and Remote Sensing Symposium (IGARSS '08), pp. III-250–III-253, Boston, Mass, USA, July 2008. View at Publisher · View at Google Scholar · View at Scopus
  6. H. Pu, B. Wang, and L. Zhang, “Simplex geometry-based abundance estimation algorithm for hyperspectral unmixing,” Scientia Sinica Informationis, vol. 42, no. 8, pp. 1019–1033, 2012. View at Publisher · View at Google Scholar
  7. G. Zhou, S. Xie, Z. Yang, J.-M. Yang, and Z. He, “Minimum-volume-constrained nonnegative matrix factorization: enhanced ability of learning parts,” IEEE Transactions on Neural Networks, vol. 22, no. 10, pp. 1626–1637, 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. T.-H. Chan, C.-Y. Chi, Y.-M. Huang, and W.-K. Ma, “A convex analysis-based minimum-volume enclosing simplex algorithm for hyperspectral unmixing,” IEEE Transactions on Signal Processing, vol. 57, no. 11, pp. 4418–4432, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. M. Arngren, M. N. Schmidt, and J. Larsen, “Bayesian nonnegative matrix factorization with volume prior for unmixing of hyperspectral images,” in Proceedings of the IEEE International Workshop on Machine Learning for Signal Processing (MLSP '09), pp. 1–6, IEEE, Grenoble, France, September 2009. View at Publisher · View at Google Scholar · View at Scopus
  10. V. P. Pauca, J. Piper, and R. J. Plemmons, “Nonnegative matrix factorization for spectral data analysis,” Linear Algebra and Its Applications, vol. 416, no. 1, pp. 29–47, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. N. Wang, B. Du, and L. Zhang, “An endmember dissimilarity constrained non-negative matrix factorization method for hyperspectral unmixing,” IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, vol. 6, no. 2, pp. 554–569, 2013. View at Publisher · View at Google Scholar · View at Scopus
  12. Z. Wu, S. Ye, J. Liu, L. Sun, and Z. Wei, “Sparse non-negative matrix factorization on GPUs for hyperspectral unmixing,” IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, vol. 7, no. 8, pp. 3640–3649, 2014. View at Publisher · View at Google Scholar · View at Scopus
  13. J. B. Greer, “Sparse demixing of hyperspectral images,” IEEE Transactions on Image Processing, vol. 21, no. 1, pp. 219–228, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. J. A. Tropp and S. J. Wright, “Computational methods for sparse solution of linear inverse problems,” Proceedings of the IEEE, vol. 98, no. 6, pp. 948–958, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. M. Elad, Sparse and Redundant Representations, Springer, New York, NY, USA, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  16. J. A. Tropp and A. C. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,” IEEE Transactions on Information Theory, vol. 53, no. 12, pp. 4655–4666, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. W. Dai and O. Milenkovic, “Subspace pursuit for compressive sensing signal reconstruction,” IEEE Transactions on Information Theory, vol. 55, no. 5, pp. 2230–2249, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. I. Marques and M. Graña, “Hybrid sparse linear and lattice method for hyperspectral image unmixing,” in Hybrid Artificial Intelligence Systems, vol. 8480 of Lecture Notes in Computer Science, pp. 266–273, Springer, 2014. View at Publisher · View at Google Scholar
  19. I. Marques and M. Graña, “Greedy sparsification WM algorithm for endmember induction in hyperspectral images,” in Natural and Artificial Computation in Engineering and Medical Applications, vol. 7931 of Lecture Notes in Computer Science, pp. 336–344, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar
  20. M. V. Afonso, J. M. Bioucas-Dias, and M. A. Figueiredo, “An augmented Lagrangian approach to the constrained optimization formulation of imaging inverse problems,” IEEE Transactions on Image Processing, vol. 20, no. 3, pp. 681–695, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. M.-D. Iordache, J. M. Bioucas-Dias, and A. Plaza, “Total variation spatial regularization for sparse hyperspectral unmixing,” IEEE Transactions on Geoscience and Remote Sensing, vol. 50, no. 11, pp. 4484–4502, 2012. View at Publisher · View at Google Scholar · View at Scopus
  22. M.-D. Iordache, J. M. Bioucas-Dias, and A. Plaza, “Collaborative sparse unmixing of hyperspectral data,” in Proceedings of the IEEE International Geoscience and Remote Sensing Symposium (IGARSS '12), pp. 7488–7491, IEEE, Munich, Germany, July 2012. View at Publisher · View at Google Scholar · View at Scopus
  23. J. M. Bioucas-Dias and M. A. T. Figueiredo, “Alternating direction algorithms for constrained sparse regression: Application to hyperspectral unmixing,” in Proceedings of the 2nd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing (WHISPERS '10), pp. 1–4, Reykjavik, Iceland, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. Z. Shi, W. Tang, Z. Duren, and Z. Jiang, “Subspace matching pursuit for sparse unmixing of hyperspectral data,” IEEE Transactions on Geoscience and Remote Sensing, vol. 52, no. 6, pp. 3256–3274, 2014. View at Publisher · View at Google Scholar · View at Scopus
  25. J. A. Tropp, A. C. Gilbert, and M. J. Strauss, “Algorithms for simultaneous sparse approximation. Part I: greedy pursuit,” Signal Processing, vol. 86, no. 3, pp. 572–588, 2006. View at Publisher · View at Google Scholar · View at Scopus
  26. W. Tang, Z. Shi, and Y. Wu, “Regularized simultaneous forward-backward greedy algorithm for sparse unmixing of hyperspectral data,” IEEE Transactions on Geoscience and Remote Sensing, vol. 52, no. 9, pp. 5271–5288, 2014. View at Publisher · View at Google Scholar · View at Scopus
  27. J. Chen and X. Huo, “Theoretical results on sparse representations of multiple-measurement vectors,” IEEE Transactions on Signal Processing, vol. 54, no. 12, pp. 4634–4643, 2006. View at Publisher · View at Google Scholar · View at Scopus
  28. G. Davis, S. Mallat, and M. Avellaneda, “Greedy adaptive approximation,” Journal of Constructive Approximation, vol. 13, no. 1, pp. 57–98, 1997. View at Google Scholar
  29. J. A. Tropp, “Greed is good: algorithmic results for sparse approximation,” IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2231–2242, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. D. L. Donoho and M. Elad, “Maximal sparsity representation via l1 minimization,” Proceedings of the National Academy of Sciences of the United States of America, vol. 100, pp. 2197–2202, 2003. View at Google Scholar
  31. R. N. Clark, G. A. Swayze, R. Wise et al., USGS Digital Spectral Library splib06a, U.S. Geological Survey, Denver, Colo, USA, 2007.
  32. J. Plaza, A. Plaza, P. Martínez, and R. Pérez, “H-COMP: a tool for quantitative and comparative analysis of endmember identification algorithms,” in Proceedings of the Geoscience and Remote Sensing Symposium (IGARSS '03), vol. 1, pp. 291–293, 2003.