메뉴 건너뛰기




Volumn , Issue , 2013, Pages 540-547

Robust canonical time warping for the alignment of grossly corrupted sequences

Author keywords

l1 norm; Nuclear Norm; Rank Minimization; Temporal Alignment

Indexed keywords

CONVEX OPTIMIZATION PROBLEMS; DYNAMIC TIME WARPING; L1 NORM; LOCALIZATION AND TRACKING; MACHINE LEARNING METHODS; NUCLEAR NORM; RANK MINIMIZATIONS; TEMPORAL ALIGNMENT;

EID: 84887348151     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2013.76     Document Type: Conference Paper
Times cited : (13)

References (27)
  • 1
    • 84864138018 scopus 로고    scopus 로고
    • Inductive robust principal component analysis
    • B. Bao, G. Liu, C. Xu, and Y. S. Inductive robust principal component analysis. IEEE Trans. Image Processing, 21(8):3794-3800, 2012.
    • (2012) IEEE Trans. Image Processing , vol.21 , Issue.8 , pp. 3794-3800
    • Bao, B.1    Liu, G.2    Xu Y S, C.3
  • 2
    • 77952743002 scopus 로고    scopus 로고
    • Low-dimensional models for dimensionality reduction and signal recovery: A geometric perspective
    • R. Baraniuk, V. Cevher, and M. Wakin. Low-dimensional models for dimensionality reduction and signal recovery: A geometric perspective. Proceedings of the IEEE, 98(6):959-971, 2010.
    • (2010) Proceedings of the IEEE , vol.98 , Issue.6 , pp. 959-971
    • Baraniuk, R.1    Cevher, V.2    Wakin, M.3
  • 3
    • 77954290345 scopus 로고    scopus 로고
    • Constrained optimization and lagrange multiplier methods
    • Belmont, MA, 2nd edition
    • D. P. Bertsekas. Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific, Belmont, MA, 2nd edition, 1996.
    • (1996) Athena Scientific
    • Bertsekas, D.P.1
  • 4
    • 84863765409 scopus 로고    scopus 로고
    • A singular value thresholding algorithm for matrix completion
    • J. F. Cai, E. J. Candes, and Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM Journal Optimization, 2(2):569-592, 2009.
    • (2009) SIAM Journal Optimization , vol.2 , Issue.2 , pp. 569-592
    • Cai, J.F.1    Candes, E.J.2    Shen, Z.3
  • 5
    • 79960675858 scopus 로고    scopus 로고
    • Robust principal component analysis?
    • E. J. Candes, X. Li, Y. Ma, and J. Wright. Robust principal component analysis? Journal of ACM, 58(3):1-37, 2011.
    • (2011) Journal of ACM , vol.58 , Issue.3 , pp. 1-37
    • Candes, E.J.1    Li, X.2    Ma, Y.3    Wright, J.4
  • 6
    • 33744552752 scopus 로고    scopus 로고
    • For most large underdetermined systems of equations, the minimal l1-norm near-solution approximates the sparsest near-solution
    • D. Donoho. For most large underdetermined systems of equations, the minimal l1-norm near-solution approximates the sparsest near-solution. Communications on Pure and Applied Mathematics, 59(7):907-934, 2006.
    • (2006) Communications on Pure and Applied Mathematics , vol.59 , Issue.7 , pp. 907-934
    • Donoho, D.1
  • 7
    • 0142257025 scopus 로고    scopus 로고
    • PhD thesis, Dept. Electrical Engineering, Stanford University, CA, USA
    • M. Fazel. Matrix Rank Minimization with Applications. PhD thesis, Dept. Electrical Engineering, Stanford University, CA, USA, 2002.
    • (2002) Matrix Rank Minimization with Applications
    • Fazel, M.1
  • 8
    • 84856634625 scopus 로고    scopus 로고
    • Dynamic manifold warping for view invariant action recognition
    • D. Gong and G. Medioni. Dynamic manifold warping for view invariant action recognition. In Proc. 13th IEEE Int. Conf. Computer Vision, pages 571-578, 2011.
    • (2011) Proc. 13th IEEE Int. Conf. Computer Vision , pp. 571-578
    • Gong, D.1    Medioni, G.2
  • 9
    • 0000107975 scopus 로고
    • Relations between two sets of variates
    • H. Hotelling. Relations between two sets of variates. Biometrika, 28(3/4):321-377, 1936.
    • (1936) Biometrika , vol.28 , Issue.3-4 , pp. 321-377
    • Hotelling, H.1
  • 13
    • 85162350693 scopus 로고    scopus 로고
    • Linearized alternating direction method with adaptive penalty for low-rank representation
    • Granada, Spain
    • Z. Lin, R. Liu, and Z. Su. Linearized alternating direction method with adaptive penalty for low-rank representation In Proc. 2011 Neural Information Processing Systems Conf., pages 612-620, Granada, Spain, 2011.
    • (2011) Proc. 2011 Neural Information Processing Systems Conf. , pp. 612-620
    • Lin, Z.1    Liu, R.2    Su, Z.3
  • 15
    • 0029291966 scopus 로고
    • Sparse approximate solutions to linear systems
    • B. K. Natarajan. Sparse approximate solutions to linear systems. SIAM J. Comput., 24(2):227-234, 1995.
    • (1995) SIAM J. Comput. , vol.24 , Issue.2 , pp. 227-234
    • Natarajan, B.K.1
  • 20
    • 10044233701 scopus 로고    scopus 로고
    • Recognizing human actions: A local SVM approach
    • Washington, DC, USA
    • C. Schuldt, I. Laptev, and B. C. Recognizing human actions: A local SVM approach. In Proc. 17th Int. Conf. Pattern Recognition, pages 32-36, Washington, DC, USA, 2004.
    • (2004) Proc. 17th Int. Conf. Pattern Recognition , pp. 32-36
    • Schuldt, C.1    Laptev B C, I.2
  • 22
    • 84886375708 scopus 로고    scopus 로고
    • Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
    • Y. Shen, Z. Wen, and Y. Zhang. Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization. Optimization Methods and Software, pages 1-25, 2012.
    • (2012) Optimization Methods and Software , pp. 1-25
    • Shen, Y.1    Wen, Z.2    Zhang, Y.3
  • 23
    • 0030106462 scopus 로고    scopus 로고
    • Semidefinite programming
    • L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38(1):49-95, 1996.
    • (1996) SIAM Review , vol.38 , Issue.1 , pp. 49-95
    • Vandenberghe, L.1    Boyd, S.2


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