Computer Science – Computer Vision and Pattern Recognition
Scientific paper
2009-02-26
Computer Science
Computer Vision and Pattern Recognition
Submitted to CVPR2009 in Nov. 20, 2008
Scientific paper
For tensor decompositions such as HOSVD and ParaFac, the objective functions are nonconvex. This implies, theoretically, there exists a large number of local optimas: starting from different starting point, the iteratively improved solution will converge to different local solutions. This non-uniqueness present a stability and reliability problem for image compression and retrieval. In this paper, we present the results of a comprehensive investigation of this problem. We found that although all tensor decomposition algorithms fail to reach a unique global solution on random data and severely scrambled data; surprisingly however, on all real life several data sets (even with substantial scramble and occlusions), HOSVD always produce the unique global solution in the parameter region suitable to practical applications, while ParaFac produce non-unique solutions. We provide an eigenvalue based rule for the assessing the solution uniqueness.
Ding Chris
Huang Heng
Luo Dijun
No associations
LandOfFree
Are Tensor Decomposition Solutions Unique? On the global convergence of HOSVD and ParaFac algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Are Tensor Decomposition Solutions Unique? On the global convergence of HOSVD and ParaFac algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Are Tensor Decomposition Solutions Unique? On the global convergence of HOSVD and ParaFac algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-254167