메뉴 건너뛰기




Volumn 33, Issue 2, 2014, Pages

Decoupling Noise and Features via Weighted ℓ-Analysis Compressed Sensing

Author keywords

Asymptotic optimality; Denoising; Sharp feature; analysis compressed sensing

Indexed keywords

INVERSE PROBLEMS; LAPLACE TRANSFORMS; OPTIMIZATION; SIGNAL RECONSTRUCTION;

EID: 84899073091     PISSN: 07300301     EISSN: 15577368     Source Type: Journal    
DOI: 10.1145/2557449     Document Type: Article
Times cited : (111)

References (35)
  • 1
    • 78649976586 scopus 로고    scopus 로고
    • ℓ-sparse reconstruction of sharp point set surfaces
    • H. Avron, A. Sharf, C. Greif, and D. Cohen-Or. 2010. ℓ-sparse reconstruction of sharp point set surfaces. ACM Trans. Graph. 29, 5, 135-154.
    • (2010) ACM Trans. Graph. , vol.29 , Issue.5 , pp. 135-154
    • Avron, H.1    Sharf, A.2    Greif, C.3    Cohen-Or., D.4
  • 2
    • 0037877561 scopus 로고    scopus 로고
    • Anisotropic diffusion of surfaces and functions on surfaces
    • DOI 10.1145/588272.588276
    • C. Bajaj and G. Xu. 2003. Anisotropic diffusion of surfaces and functions on surfaces. ACM Trans. Graph. 22, 1, 4-32. (Pubitemid 44769056)
    • (2003) ACM Transactions on Graphics , vol.22 , Issue.1 , pp. 4-32
    • Bajaj, C.L.1    Xu, G.2
  • 3
    • 78649983184 scopus 로고    scopus 로고
    • Feature-preserving mesh denoising based on vertices classification
    • Z. Bian and R. Tong. 2011. Feature-preserving mesh denoising based on vertices classification. Comput.-Aided Geom. Des. 28, 1, 50-64.
    • (2011) Comput.-Aided Geom. Des. , vol.28 , Issue.1 , pp. 50-64
    • Bian, Z.1    Tong, R.2
  • 7
    • 29144439194 scopus 로고    scopus 로고
    • Decoding by linear programming
    • DOI 10.1109/TIT.2005.858979
    • E. Candes and T. Tao. 2005. Decoding by linear programming. IEEE Trans. Inf. Theory 51, 12, 4203-4215. (Pubitemid 41800353)
    • (2005) IEEE Transactions on Information Theory , vol.51 , Issue.12 , pp. 4203-4215
    • Candes, E.J.1    Tao, T.2
  • 8
    • 85032750937 scopus 로고    scopus 로고
    • An introduction to compressive sampling
    • E. Candes and M. Wakin. 2008. An introduction to compressive sampling. IEEE Signal Process. Mag. 25, 2, 21-30.
    • (2008) IEEE Signal Process. Mag. , vol.25 , Issue.2 , pp. 21-30
    • Candes, E.1    Wakin, M.2
  • 9
    • 57349174008 scopus 로고    scopus 로고
    • Enhancing sparsity by reweighted ℓ minimization
    • E. Candes, M.Wakin, and S. Boyd. 2008. Enhancing sparsity by reweighted ℓ minimization. J. Fourier Anal. Appl. 14, 5-6, 877-905.
    • (2008) J. Fourier Anal. Appl. , vol.14 , Issue.5-6 , pp. 877-905
    • Candes, E.1    Wakin, M.2    Boyd, S.3
  • 13
    • 33645712892 scopus 로고    scopus 로고
    • Compressed sensing
    • D. Donoho. 2006. Compressed sensing. IEEE Trans. Inf. Theory 25, 4, 1289-1306.
    • (2006) IEEE Trans. Inf. Theory , vol.25 , Issue.4 , pp. 1289-1306
    • Donoho, D.1
  • 16
    • 76849088927 scopus 로고    scopus 로고
    • Robust feature-Preservingmesh denoising based on consistent sub-Neighborhoods
    • H. Fan, Y. Yu, and Q. Peng. 2010. Robust feature-preservingmesh denoising based on consistent sub-neighborhoods. IEEE Trans. Vis. Comput. Graph. 16, 2, 312-324
    • (2010) IEEE Trans. Vis. Comput. Graph. , vol.16 , Issue.2 , pp. 312-324
    • Fan, H.1    Yu, Y.2    Peng, Q.3
  • 18
    • 84877630704 scopus 로고    scopus 로고
    • Linear analysis of nonlinear constraints for interactive geometric modeling
    • M. Habbecke and L. Kobbelt. 2012. Linear analysis of nonlinear constraints for interactive geometric modeling. Comput. Graph. Forum 31, 2, 1-10.
    • (2012) Comput. Graph. Forum , vol.31 , Issue.2 , pp. 1-10
    • Habbecke, M.1    Kobbelt, L.2
  • 19
    • 84880828872 scopus 로고    scopus 로고
    • Mesh denoising via l0 minimization
    • L. He and S. Schaefer. 2013. Mesh denoising via l0 minimization. ACM Trans. Graph. 32, 4, 64:1-64:8.
    • (2013) ACM Trans. Graph. , vol.32 , Issue.4 , pp. 641-648
    • He, L.1    Schaefer, S.2
  • 20
    • 4644236313 scopus 로고    scopus 로고
    • Anisotropic filtering of nonlinear surface features
    • K. Hildebrandt and K. Polthier. 2004. Anisotropic filtering of nonlinear surface features. Comput. Graph. Forum 23, 3, 391-400.
    • (2004) Comput. Graph. Forum , vol.23 , Issue.3 , pp. 391-400
    • Hildebrandt, K.1    Polthier, K.2
  • 22
    • 77954022927 scopus 로고    scopus 로고
    • Non-Iterative, feature-Preserving mesh smoothing
    • T. Jones, F. Durand, andM.Desbrun. 2003. Non-iterative, feature-preserving mesh smoothing. ACM Trans. Graph. 22, 3, 943-949.
    • (2003) ACM Trans. Graph. , vol.22 , Issue.3 , pp. 943-949
    • Jones, T.1    Durand, F.2    Desbrun, M.3
  • 24
    • 34447633552 scopus 로고    scopus 로고
    • Non-iterative approach for global mesh optimization
    • DOI 10.1016/j.cad.2007.03.004, PII S0010448507000760
    • L. Liu, C. Tai, Z. Ji, and G. Wang. 2007. Non-iterative approach for global mesh optimization. Comput.-Aided Des. 39, 9, 772-782. (Pubitemid 47094760)
    • (2007) CAD Computer Aided Design , vol.39 , Issue.9 , pp. 772-782
    • Liu, L.1    Tai, C.-L.2    Ji, Z.3    Wang, G.4
  • 25
    • 84941871856 scopus 로고
    • The kolmogorov-smirnov test for goodness of fit
    • F. J. Massey. 1951. The kolmogorov-smirnov test for goodness of fit. J. Amer. Statist. Assoc. 46, 253, 68-78.
    • (1951) J. Amer. Statist. Assoc. , vol.46 , Issue.253 , pp. 68-78
    • Massey, F.J.1
  • 33
    • 84855424887 scopus 로고    scopus 로고
    • Image smoothing via L0 gradient minimization
    • L. Xu, C. Lu, Y. Xu, and J. Jia. 2011. Image smoothing via L0 gradient minimization. ACM Trans. Graph. 30, 6, 174:1-174:12.
    • (2011) ACM Trans. Graph. , vol.30 , Issue.6 , pp. 1741-17412
    • Xu, L.1    Lu, C.2    Xu, Y.3    Jia, J.4


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