메뉴 건너뛰기




Volumn , Issue , 2013, Pages

Greedy algorithms for pure pixels identification in hyperspectral unmixing: A multiple-measurement vector viewpoint

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SIGNAL PROCESSING;

EID: 84901322359     PISSN: 22195491     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (10)

References (16)
  • 2
  • 3
    • 0033310314 scopus 로고    scopus 로고
    • N-findr: An algorithm for fast autonomous spectral endmember determination in hyperspectral data
    • M. E. Winter, "N-findr: an algorithm for fast autonomous spectral endmember determination in hyperspectral data," in Proc. SPIE's Inter. Sym. Opt. Sci. Eng. Inst., 1999, pp. 266-275.
    • (1999) Proc. SPIE's Inter. Sym. Opt. Sci. Eng. Inst. , pp. 266-275
    • Winter, M.E.1
  • 5
    • 1642290713 scopus 로고    scopus 로고
    • Automatic spectral target recognition in hyperspectral imagery
    • H. Ren and C. I. Chang, "Automatic spectral target recognition in hyperspectral imagery," IEEE Trans. Aerosp. Electron. Syst., vol. 39, no. 4, pp. 1232-1249, 2003.
    • (2003) IEEE Trans. Aerosp. Electron. Syst. , vol.39 , Issue.4 , pp. 1232-1249
    • Ren, H.1    Chang, C.I.2
  • 6
    • 16444373735 scopus 로고    scopus 로고
    • Vertex component analysis: A fast algorithm to unmix hyperspectral data
    • J. M. P. Nascimento and J. M. Bioucas-Dias, "Vertex component analysis: A fast algorithm to unmix hyperspectral data," IEEE Trans. Geosci. Remote Sens., vol. 43, no. 4, pp. 898-910, 2005.
    • (2005) IEEE Trans. Geosci. Remote Sens. , vol.43 , Issue.4 , pp. 898-910
    • Nascimento, J.M.P.1    Bioucas-Dias, J.M.2
  • 7
    • 80455174042 scopus 로고    scopus 로고
    • A simplex volume maximization framework for hyperspectral endmember extraction
    • Nov.
    • T.-H. Chan, W.-K. Ma, A. Ambikapathi, and C.-Y. Chi, "A simplex volume maximization framework for hyperspectral endmember extraction," IEEE Trans. Geosci. Remote Sens., vol. 49, no. 11, pp. 4177-4193, Nov. 2011.
    • (2011) IEEE Trans. Geosci. Remote Sens. , vol.49 , Issue.11 , pp. 4177-4193
    • Chan, T.-H.1    Ma, W.-K.2    Ambikapathi, A.3    Chi, C.-Y.4
  • 9
    • 84862519707 scopus 로고    scopus 로고
    • A convex model for nonnegative matrix factorization and dimensionality reduction on physical space
    • Jul.
    • E. Esser, M. Moller, S. Osher, G. Sapiro, and J. Xin, "A convex model for nonnegative matrix factorization and dimensionality reduction on physical space," IEEE Trans. Image Process., vol. 21, no. 7, pp. 3239-3252, Jul. 2012.
    • (2012) IEEE Trans. Image Process , vol.21 , Issue.7 , pp. 3239-3252
    • Esser, E.1    Moller, M.2    Osher, S.3    Sapiro, G.4    Xin, J.5
  • 10
    • 84866685721 scopus 로고    scopus 로고
    • See all by looking at a few: Sparse modeling for finding representative objects
    • E. Elhamifar, G. Sapiro, and R. Vidal, "See all by looking at a few: Sparse modeling for finding representative objects," in Proc. IEEE CVPR 2012, 2012, pp. 1600-1607.
    • (2012) Proc. IEEE CVPR 2012 , pp. 1600-1607
    • Elhamifar, E.1    Sapiro, G.2    Vidal, R.3
  • 11
    • 33947142837 scopus 로고    scopus 로고
    • Theoretical results on sparse representations of multiple-measurement vectors
    • Dec.
    • J. Chen and X. Huo, "Theoretical results on sparse representations of multiple-measurement vectors," IEEE Trans. Signal Process., vol. 54, no. 12, pp. 4634-4643, Dec. 2006.
    • (2006) IEEE Trans. Signal Process , vol.54 , Issue.12 , pp. 4634-4643
    • Chen, J.1    Huo, X.2
  • 12
    • 30844445842 scopus 로고    scopus 로고
    • Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit
    • J. A. Tropp, A. C. Gilbert, and M. J. Strauss, "Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit," Signal Process., vol. 86, no. 3, pp. 572-588, 2006.
    • (2006) Signal Process , vol.86 , Issue.3 , pp. 572-588
    • Tropp, J.A.1    Gilbert, A.C.2    Strauss, M.J.3
  • 13
    • 30844461481 scopus 로고    scopus 로고
    • Algorithms for simultaneous sparse approximation. Part II: Convex relaxation
    • J. A. Tropp, "Algorithms for simultaneous sparse approximation. Part II: Convex relaxation," Signal Process., vol. 86, no. 3, pp. 589-602, 2006.
    • (2006) Signal Process , vol.86 , Issue.3 , pp. 589-602
    • Tropp, J.A.1
  • 14
    • 53149111169 scopus 로고    scopus 로고
    • Reduce and boost: Recovering arbitrary sets of jointly sparse vectors
    • M. Mishali and Y. C. Eldar, "Reduce and boost: Recovering arbitrary sets of jointly sparse vectors," IEEE Trans. Signal Process., vol. 56, no. 10, pp. 4692-4702, 2008.
    • (2008) IEEE Trans. Signal Process , vol.56 , Issue.10 , pp. 4692-4702
    • Mishali, M.1    Eldar, Y.C.2
  • 16
    • 80455128741 scopus 로고    scopus 로고
    • Convex analysis for non-negative blind source separation with application in imaging
    • D. P. Palomar and Y. C. Eldar, Eds. Cambridge University Press
    • W.-K. Ma, T.-H. Chan, C.-Y. Chi, and Y. Wang, "Convex analysis for non-negative blind source separation with application in imaging," in Convex Optimization in Signal Processing and Communications, D. P. Palomar and Y. C. Eldar, Eds. Cambridge University Press, 2010.
    • (2010) Convex Optimization in Signal Processing and Communications
    • Ma, W.-K.1    Chan, T.-H.2    Chi, C.-Y.3    Wang, Y.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.