메뉴 건너뛰기




Volumn 98, Issue 6, 2010, Pages 959-971

Low-dimensional models for dimensionality reduction and signal recovery: A geometric perspective

Author keywords

Compression; Compressive sensing; Dimensionality reduction; Manifold; Point cloud; Sparsity; Stable embedding

Indexed keywords

COMPACTION; GEOMETRY;

EID: 77952743002     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2009.2038076     Document Type: Review
Times cited : (142)

References (74)
  • 1
    • 0030737323 scopus 로고    scopus 로고
    • Modeling the manifolds of images of handwritten digits
    • PII S1045922797002373
    • G. E. Hinton, P. Dayan, and M. Revow, "Modeling the manifolds of images of handwritten digits," IEEE Trans. Neural Netw., vol.8, no.1, pp. 65-74, Jan. 1997. (Pubitemid 127767781)
    • (1997) IEEE Transactions on Neural Networks , vol.8 , Issue.1 , pp. 65-74
    • Hinton, G.E.1    Dayan, P.2    Revow, M.3
  • 3
    • 0002702476 scopus 로고
    • The imbedding problem for Riemannian manifolds
    • Jan.
    • J. Nash, "The imbedding problem for Riemannian manifolds," Ann. Math., vol.63, pp. 20-63, Jan. 1956.
    • (1956) Ann. Math. , vol.63 , pp. 20-63
    • Nash, J.1
  • 4
    • 0001387808 scopus 로고
    • The widths of certain finite-dimensional sets and classes of smooth functions
    • B. Kashin, "The widths of certain finite-dimensional sets and classes of smooth functions," Izv. Akad. Nauk SSSR Ser. Mat, vol.41, no.2, pp. 334-351, 1977.
    • (1977) Izv. Akad. Nauk SSSR Ser. Mat , vol.41 , Issue.2 , pp. 334-351
    • Kashin, B.1
  • 5
    • 0000286901 scopus 로고
    • On the widths of the Euclidean ball
    • A. Garnaev and E. Gluskin, "On the widths of the Euclidean ball," Doklady, Akad. Nauk SSSR, vol.277, pp. 1048-1052, 1984.
    • (1984) Doklady, Akad. Nauk SSSR , vol.277 , pp. 1048-1052
    • Garnaev, A.1    Gluskin, E.2
  • 8
    • 55649115527 scopus 로고    scopus 로고
    • A simple proof of the restricted isometry property for random matrices
    • Dec.
    • R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, "A simple proof of the restricted isometry property for random matrices," Constr. Approx., vol.28, pp. 253-263, Dec. 2008.
    • (2008) Constr. Approx. , vol.28 , pp. 253-263
    • Baraniuk, R.1    Davenport, M.2    Devore, R.3    Wakin, M.4
  • 11
    • 29144439194 scopus 로고    scopus 로고
    • Decoding by linear programming
    • DOI 10.1109/TIT.2005.858979
    • E. J. Cand̀es and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol.51, no.12, pp. 4203-4215, Dec. 2005. (Pubitemid 41800353)
    • (2005) IEEE Transactions on Information Theory , vol.51 , Issue.12 , pp. 4203-4215
    • Candes, E.J.1    Tao, T.2
  • 12
    • 33645712892 scopus 로고    scopus 로고
    • Compressed sensing
    • Sep.
    • D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol.52, no.9, pp. 1289-1306, Sep. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.9 , pp. 1289-1306
    • Donoho, D.L.1
  • 13
    • 85032751965 scopus 로고    scopus 로고
    • Compressive sensing
    • Jul.
    • R. G. Baraniuk, "Compressive sensing," IEEE Signal Process. Mag., vol.24, pp. 118-120, 124, Jul. 2007.
    • (2007) IEEE Signal Process. Mag. , vol.24 , Issue.124 , pp. 118-120
    • Baraniuk, R.G.1
  • 14
    • 42649140570 scopus 로고    scopus 로고
    • The restricted isometry property and its implications for compressed sensing
    • May
    • E. J. Cand̀es, "The restricted isometry property and its implications for compressed sensing," Compte Rendus de l'Academie des Sciences, ser. I, vol.346, pp. 589-592, May 2008.
    • (2008) Compte Rendus de l'Academie des Sciences, Ser. i , vol.346 , pp. 589-592
    • Cand̀es, E.J.1
  • 15
    • 64749092799 scopus 로고    scopus 로고
    • Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
    • Jun.
    • D. Needell and R. Vershynin, "Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit," Found. Comput. Math., vol.9, pp. 317-334, Jun. 2009.
    • (2009) Found. Comput. Math. , vol.9 , pp. 317-334
    • Needell, D.1    Vershynin, R.2
  • 16
    • 62749175137 scopus 로고    scopus 로고
    • CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
    • May
    • D. Needell and J. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmon. Anal., vol.26, pp. 301-321, May 2009.
    • (2009) Appl. Comput. Harmon. Anal. , vol.26 , pp. 301-321
    • Needell, D.1    Tropp, J.2
  • 17
    • 69949164527 scopus 로고    scopus 로고
    • Iterative hard thresholding for compressed sensing
    • Nov.
    • T. Blumensath and M. E. Davies, "Iterative hard thresholding for compressed sensing," Appl. Comput. Harmon. Anal., vol.27, pp. 265-274, Nov. 2009.
    • (2009) Appl. Comput. Harmon. Anal. , vol.27 , pp. 265-274
    • Blumensath, T.1    Davies, M.E.2
  • 18
    • 57349181932 scopus 로고    scopus 로고
    • Compressed sensing and best k-term approximation
    • A. Cohen, W. Dahmen, and R. DeVore, "Compressed sensing and best k-term approximation," J. Amer. Math. Soc., vol.22, pp. 211-231, 2009.
    • (2009) J. Amer. Math. Soc. , vol.22 , pp. 211-231
    • Cohen, A.1    Dahmen, W.2    Devore, R.3
  • 20
    • 77952743989 scopus 로고    scopus 로고
    • Rice Univ., Spring ELEC 631 course notes. [Online]
    • R. A. DeVore, "Lecture notes on compressed sensing," Rice Univ., Spring 2006, ELEC 631 course notes. [Online]. Available: http://cnx.org/content/col10458/latest/
    • (2006) Lecture Notes on Compressed Sensing
    • Devore, R.A.1
  • 21
    • 33947416035 scopus 로고    scopus 로고
    • Near-optimal signal recovery from random projections: Universal encoding strategies?
    • DOI 10.1109/TIT.2006.885507
    • E. Candès and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies?" IEEE Trans. Inf. Theory, vol.52, no.12, pp. 5406-5425, Dec. 2006. (Pubitemid 46445381)
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.12 , pp. 5406-5425
    • Candes, E.J.1    Tao, T.2
  • 22
    • 3543103176 scopus 로고    scopus 로고
    • Sparse bayesian learning for basis selection
    • Aug.
    • D. P. Wipf and B. D. Rao, "Sparse Bayesian learning for basis selection," IEEE Trans. Signal Process., vol.52, no.8, pp. 2153-2164, Aug. 2004.
    • (2004) IEEE Trans. Signal Process. , vol.52 , Issue.8 , pp. 2153-2164
    • Wipf, D.P.1    Rao, B.D.2
  • 23
    • 44849087307 scopus 로고    scopus 로고
    • Bayesian compressive sensing
    • DOI 10.1109/TSP.2007.914345
    • S. Ji, Y. Xue, and L. Carin, "Bayesian compressive sensing," IEEE Trans. Signal Process., vol.56, no.6, pp. 2346-2356, Jun. 2008. (Pubitemid 351795888)
    • (2008) IEEE Transactions on Signal Processing , vol.56 , Issue.6 , pp. 2346-2356
    • Ji, S.1    Xue, Y.2    Carin, L.3
  • 25
    • 0001224048 scopus 로고    scopus 로고
    • Sparse Bayesian Learning and the Relevance Vector Machine
    • DOI 10.1162/15324430152748236
    • M. Tipping, "Sparse Bayesian learning and the relevance vector machine," J. Mach. Learn. Res., vol.1, pp. 211-244, 2001. (Pubitemid 33687203)
    • (2001) Journal of Machine Learning Research , vol.1 , Issue.3 , pp. 211-244
    • Tipping, M.E.1
  • 27
    • 0001287271 scopus 로고    scopus 로고
    • Regression shrinkage and selection via the lasso
    • R. Tibshirani, "Regression shrinkage and selection via the lasso," J. R. Stat. Soc., pp. 267-288, 1996.
    • (1996) J. R. Stat. Soc. , pp. 267-288
    • Tibshirani, R.1
  • 28
    • 51449102007 scopus 로고    scopus 로고
    • Stable sparse approximations via nonconvex optimization
    • R. Saab, R. Chartrand, and O. Yilmaz, "Stable sparse approximations via nonconvex optimization," in Proc. ICASSP, 2008, pp. 3885-3888.
    • (2008) Proc. ICASSP , pp. 3885-3888
    • Saab, R.1    Chartrand, R.2    Yilmaz, O.3
  • 29
    • 84886368258 scopus 로고    scopus 로고
    • Learning with compressible priors
    • Vancouver, BC, Canada, Dec. 7-12
    • V. Cevher, "Learning with compressible priors," in Neural Inf. Process. Syst. (NIPS), Vancouver, BC, Canada, Dec. 7-12, 2008.
    • (2008) Neural Inf. Process. Syst. (NIPS)
    • Cevher, V.1
  • 30
    • 64549135334 scopus 로고    scopus 로고
    • Sampling theorems for signals from the union of finite-dimensional linear subspaces
    • to be published
    • T. Blumensath and M. E. Davies, "Sampling theorems for signals from the union of finite-dimensional linear subspaces," IEEE Trans. Inf. Theory, to be published.
    • IEEE Trans. Inf. Theory
    • Blumensath, T.1    Davies, M.E.2
  • 31
    • 85032750886 scopus 로고    scopus 로고
    • Sampling signals from a union of subspaces
    • Mar.
    • Y. M. Lu and M. N. Do, "Sampling signals from a union of subspaces," IEEE Signal Process. Mag., vol.25, pp. 41-47, Mar. 2008.
    • (2008) IEEE Signal Process. Mag. , vol.25 , pp. 41-47
    • Lu, Y.M.1    Do, M.N.2
  • 32
  • 34
    • 30844445842 scopus 로고    scopus 로고
    • Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit
    • DOI 10.1016/j.sigpro.2005.05.030, PII S0165168405002227, Sparse Approximations in Signal and Image Processing
    • J. Tropp, A. C. Gilbert, and M. J. Strauss, "Algorithms for simultaneous sparse approximation, Part I: Greedy pursuit," Signal Process., vol.86, pp. 572-588, Apr. 2006. (Pubitemid 43106572)
    • (2006) Signal Processing , vol.86 , Issue.3 , pp. 572-588
    • Tropp, J.A.1    Gilbert, A.C.2    Strauss, M.J.3
  • 35
    • 70350743173 scopus 로고    scopus 로고
    • Robust recovery of signals from a structured union of subspaces
    • Nov.
    • Y. C. Eldar and M. Mishali, "Robust recovery of signals from a structured union of subspaces," IEEE Trans. Inf. Theory, vol.55, no.11, pp. 5302-5316, Nov. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.11 , pp. 5302-5316
    • Eldar, Y.C.1    Mishali, M.2
  • 36
    • 68249141421 scopus 로고    scopus 로고
    • On the reconstruction of block-sparse signals with an optimal number of measurements
    • Aug.
    • M. Stojnic, F. Parvaresh, and B. Hassibi, "On the reconstruction of block-sparse signals with an optimal number of measurements," IEEE Trans. Signal Process., vol.57, no.8, pp. 3075-3085, Aug. 2009.
    • (2009) IEEE Trans. Signal Process. , vol.57 , Issue.8 , pp. 3075-3085
    • Stojnic, M.1    Parvaresh, F.2    Hassibi, B.3
  • 37
    • 33746126624 scopus 로고    scopus 로고
    • Blockwise sparse regression
    • Y. Kim, J. Kim, and Y. Kim, "Blockwise sparse regression," Stat. Sinica, vol.16, no.2, p. 375, 2006. (Pubitemid 44085508)
    • (2006) Statistica Sinica , vol.16 , Issue.2 , pp. 375-390
    • Kim, Y.1    Kim, J.2    Kim, Y.3
  • 39
    • 47049098617 scopus 로고    scopus 로고
    • Recovering sparse signals using sparse measurement matrices in compressed DNA microarrays
    • F. Parvaresh, H. Vikalo, S. Misra, and B. Hassibi, "Recovering sparse signals using sparse measurement matrices in compressed DNA microarrays," IEEE J. Sel. Topics Signal Process., vol.2, no.3, pp. 275-285, 2008.
    • (2008) IEEE J. Sel. Topics Signal Process. , vol.2 , Issue.3 , pp. 275-285
    • Parvaresh, F.1    Vikalo, H.2    Misra, S.3    Hassibi, B.4
  • 40
    • 0028805010 scopus 로고
    • Neuromagnetic source imaging with FOCUSS: A recursive weighted minimum norm algorithm
    • I. F. Gorodnitsky, J. S. George, and B. D. Rao, "Neuromagnetic source imaging with FOCUSS: A recursive weighted minimum norm algorithm," Electroenceph. Clin. Neurophys., vol.95, no.4, pp. 231-251, 1995.
    • (1995) Electroenceph. Clin. Neurophys. , vol.95 , Issue.4 , pp. 231-251
    • Gorodnitsky, I.F.1    George, J.S.2    Rao, B.D.3
  • 41
    • 33747727601 scopus 로고    scopus 로고
    • Wavelet-based statistical signal processing using hidden Markov models
    • PII S1053587X98025045
    • M. S. Crouse, R. D. Nowak, and R. G. Baraniuk, "Wavelet-based statistical signal processing using hidden Markov models," IEEE Trans. Signal Process., vol.46, no.4, pp. 886-902, Apr. 1998. (Pubitemid 128743828)
    • (1998) IEEE Transactions on Signal Processing , vol.46 , Issue.4 , pp. 886-902
    • Crouse, M.S.1    Nowak, R.D.2    Baraniuk, R.G.3
  • 42
    • 0035398091 scopus 로고    scopus 로고
    • Bayesian tree-structured image modeling using wavelet-domain hidden Markov models
    • DOI 10.1109/83.931100, PII S1057714901054410
    • J. K. Romberg, H. Choi, and R. G. Baraniuk, "Bayesian tree-structured image modeling using wavelet-domain hidden Markov models," IEEE Trans. Image Process., vol.10, pp. 1056-1068, Jul. 2001. (Pubitemid 32650882)
    • (2001) IEEE Transactions on Image Processing , vol.10 , Issue.7 , pp. 1056-1068
    • Romberg, J.K.1    Choi, H.2    Baraniuk, R.G.3
  • 43
    • 0242636409 scopus 로고    scopus 로고
    • Image denoising using a scale mixture of Gaussians in the wavelet domain
    • Nov.
    • J. Portilla, V. Strela, M. J. Wainwright, and E. P. Simoncelli, "Image denoising using a scale mixture of Gaussians in the wavelet domain," IEEE Trans. Image Process., vol.12, pp. 1338-1351, Nov. 2003.
    • (2003) IEEE Trans. Image Process. , vol.12 , pp. 1338-1351
    • Portilla, J.1    Strela, V.2    Wainwright, M.J.3    Simoncelli, E.P.4
  • 44
    • 0027798110 scopus 로고
    • Embedded image coding using zerotrees of wavelet coefficients
    • Dec.
    • J. Shapiro, "Embedded image coding using zerotrees of wavelet coefficients," IEEE Trans. Signal Process., vol.41, no.12, pp. 3445-3462, Dec. 1993.
    • (1993) IEEE Trans. Signal Process. , vol.41 , Issue.12 , pp. 3445-3462
    • Shapiro, J.1
  • 47
    • 50949096624 scopus 로고    scopus 로고
    • Estimation of subspace arrangements with applications in modeling and segmenting mixed data
    • Y. Ma, A. Yang, H. Derksen, and R. Fossum, "Estimation of subspace arrangements with applications in modeling and segmenting mixed data," SIAM Rev., vol.50, no.3, pp. 413-458, 2008.
    • (2008) SIAM Rev. , vol.50 , Issue.3 , pp. 413-458
    • Ma, Y.1    Yang, A.2    Derksen, H.3    Fossum, R.4
  • 50
    • 69349089478 scopus 로고    scopus 로고
    • Exploiting structure in wavelet-based Bayesian compressive sensing
    • Sep.
    • L. He and L. Carin, "Exploiting structure in wavelet-based Bayesian compressive sensing," IEEE Trans. Signal Process., vol.57, no.9, pp. 3488-3497, Sep. 2009.
    • (2009) IEEE Trans. Signal Process. , vol.57 , Issue.9 , pp. 3488-3497
    • He, L.1    Carin, L.2
  • 52
    • 30844461481 scopus 로고    scopus 로고
    • Algorithms for simultaneous sparse approximation. Part II: Convex relaxation
    • DOI 10.1016/j.sigpro.2005.05.031, PII S0165168405002239, Sparse Approximations in Signal and Image Processing
    • J. Tropp, "Algorithms for simultaneous sparse approximation, Part II: Convex relaxation," Signal Process., vol.86, pp. 589-602, Mar. 2006. (Pubitemid 43106573)
    • (2006) Signal Processing , vol.86 , Issue.3 , pp. 589-602
    • Tropp, J.A.1
  • 54
    • 60349105482 scopus 로고    scopus 로고
    • K-t FOCUSS: A general compressed sensing framework for high resolution dynamic MRI
    • H. Jung, K. Sung, K. Nayak, E. Kim, and J. Ye, "k-t FOCUSS: A general compressed sensing framework for high resolution dynamic MRI," Magn. Res. Med., vol.61, no.1, 2009.
    • (2009) Magn. Res. Med. , vol.61 , Issue.1
    • Jung, H.1    Sung, K.2    Nayak, K.3    Kim, E.4    Ye, J.5
  • 55
    • 70449659764 scopus 로고    scopus 로고
    • A multiscale framework for compressive sensing of video
    • Chicago, IL, May
    • J. Y. Park and M. B. Wakin, "A multiscale framework for compressive sensing of video," in Proc. Picture Coding Symp. (PCS), Chicago, IL, May 2009.
    • (2009) Proc. Picture Coding Symp. (PCS)
    • Park, J.Y.1    Wakin, M.B.2
  • 59
    • 58649110599 scopus 로고    scopus 로고
    • Multi-task compressive sensing
    • Jan.
    • S. Ji, D. Dunson, and L. Carin, "Multi-task compressive sensing," IEEE Trans. Signal Process., vol.57, no.1, pp. 92-106, Jan. 2009.
    • (2009) IEEE Trans. Signal Process. , vol.57 , Issue.1 , pp. 92-106
    • Ji, S.1    Dunson, D.2    Carin, L.3
  • 60
    • 57349084589 scopus 로고    scopus 로고
    • Tighter bounds for random projections of manifolds
    • College Park, MD
    • K. L. Clarkson, "Tighter bounds for random projections of manifolds," in Proc. Annu. Symp. Comput. Geometry, College Park, MD, 2008, pp. 39-48.
    • (2008) Proc. Annu. Symp. Comput. Geometry , pp. 39-48
    • Clarkson, K.L.1
  • 61
    • 36749019495 scopus 로고    scopus 로고
    • Recovery algorithms for vector valued data with joint sparsity constraints
    • M. Fornasier and H. Rauhut, "Recovery algorithms for vector valued data with joint sparsity constraints," SIAM J. Numer. Anal., vol.46, no.2, pp. 577-613, 2008.
    • (2008) SIAM J. Numer. Anal. , vol.46 , Issue.2 , pp. 577-613
    • Fornasier, M.1    Rauhut, H.2
  • 62
    • 57349143370 scopus 로고    scopus 로고
    • Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
    • R. Gribonval, H. Rauhut, K. Schnass, and P. Vandergheynst, "Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms," J. Fourier Anal. Applicat., vol.14, no.5, pp. 655-687, 2008.
    • (2008) J. Fourier Anal. Applicat. , vol.14 , Issue.5 , pp. 655-687
    • Gribonval, R.1    Rauhut, H.2    Schnass, K.3    Vandergheynst, P.4
  • 63
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • P. Indyk and R. Motwani, "Approximate nearest neighbors: Towards removing the curse of dimensionality," in Proc. Symp. Theory Comput., 1998, pp. 604-613.
    • (1998) Proc. Symp. Theory Comput. , pp. 604-613
    • Indyk, P.1    Motwani, R.2
  • 64
    • 58849146227 scopus 로고    scopus 로고
    • Random projections of smooth manifolds
    • Feb.
    • R. G. Baraniuk and M. B. Wakin, "Random projections of smooth manifolds," Found. Comput. Math., vol.9, pp. 51-77, Feb. 2009.
    • (2009) Found. Comput. Math. , vol.9 , pp. 51-77
    • Baraniuk, R.G.1    Wakin, M.B.2
  • 66
    • 35348892607 scopus 로고    scopus 로고
    • Embeddings of surfaces, curves, and moving points in euclidean space
    • DOI 10.1145/1247069.1247135, Proceedings of the Twenty-third Annual Symposium on Computational Geometry, SCG'07
    • P. Agarwal, S. Har-Peled, and H. Yu, "Embeddings of surfaces, curves, and moving points in euclidean space," in Proc. 23rd Annu. ACM Symp. Comput. Geometry, New York, 2007, pp. 381-389. (Pubitemid 47582085)
    • (2007) Proceedings of the Annual Symposium on Computational Geometry , pp. 381-389
    • Agarwal, P.K.1    Har-Peled, S.2    Yu, H.3
  • 67
    • 57049122948 scopus 로고    scopus 로고
    • Random projection trees and low dimensional manifolds
    • New York
    • S. Dasgupta and Y. Freund, "Random projection trees and low dimensional manifolds," in Proc. 40th Annu. ACM Symp. Theory Comput., New York, 2008, pp. 537-546.
    • (2008) Proc. 40th Annu. ACM Symp. Theory Comput. , pp. 537-546
    • Dasgupta, S.1    Freund, Y.2
  • 71
    • 70449673414 scopus 로고    scopus 로고
    • A manifold lifting algorithm for multi-view compressive imaging
    • Chicago, IL, May
    • M. B. Wakin, "A manifold lifting algorithm for multi-view compressive imaging," in Proc. Picture Coding Symp. (PCS 2009), Chicago, IL, May 2009.
    • (2009) Proc. Picture Coding Symp. (PCS 2009)
    • Wakin, M.B.1
  • 74
    • 0031530514 scopus 로고    scopus 로고
    • On some inequalities for the incomplete gamma function
    • DOI 10.1090/S0025-5718-97-00814-4
    • H. Alzer, "On some inequalities for the incomplete gamma function," Math. Comput., vol.66, no.218, pp. 771-778, 1997. (Pubitemid 127058736)
    • (1997) Mathematics of Computation , vol.66 , Issue.218 , pp. 771-778
    • Alzer, H.1


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