|Title:||Spectrally optimal factorization of incomplete matrices||Journal:||26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR||Conference:||26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR; Anchorage, AK; United States; 23 June 2008 through 28 June 2008||Issue Date:||23-Sep-2008||ISBN:||978-1-424-42243-2||DOI:||10.1109/CVPR.2008.4587675||Abstract:||
From the recovery of structure from motion to the separation of style and content, many problems in computer vision have been successfully approached by using bilinear models. The reason for the success of these models is that a globally optimal decomposition is easily obtained from the Singular Value Decomposition (SVD) of the observation matrix. However, in practice, the observation matrix is often incomplete, the SVD can not be used, and only suboptimal solutions are available. The majority of these solutions are based on iterative local refinements of a given cost function, and lack any guarantee of convergence to the global optimum. In this paper, we propose a globally optimal solution, for particular patterns of missing entries. To achieve this goal, we re-formulate the problem as the minimization of the spectral norm of the matrix of residuals, i.e., we seek the completion of the observation matrix such that the largest singular value of its difference to a low rank matrix is the smallest possible. The class of patterns of missing entries we deal with is known as the Young diagram, which includes, as particular cases, many relevant situations, such as the missing of an entire submatrix. We describe experiments that illustrate how our globally optimal solution has impact in practice.
Show full item record
checked on Jul 5, 2022
checked on Jul 6, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.