A smoothed rank function algorithm based Hyperbolic Tangent function for matrix completion

The matrix completion problem is to recover the matrix from its partially known samples. A recent convex relaxation of the rank minimization problem minimizes the nuclear norm instead of the rank of the matrix. In this paper, we use a smooth function-Hyperbolic Tangent function to approximate the ra...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2012 International Conference on Machine Learning and Cybernetics Jg. 4; S. 1333 - 1338
Hauptverfasser: Juan Geng, Lai-Sheng Wang, Ai-Min Fu, Qi-Qing Song
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.07.2012
Schlagworte:
Abstracts
Hyperbolic Tangent function Approximation
Image reconstruction
MATLAB
Nuclear norm minimization
Periodic structures
Smoothed rank function approximation
ISBN:1467314846, 9781467314848
ISSN:2160-133X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The matrix completion problem is to recover the matrix from its partially known samples. A recent convex relaxation of the rank minimization problem minimizes the nuclear norm instead of the rank of the matrix. In this paper, we use a smooth function-Hyperbolic Tangent function to approximate the rank function, and then using gradient projection method to minimize it. Our algorithm is named as Hyperbolic Tangent function Approximation algorithm (HTA). We report numerical results for solving randomly generated matrix completion problems and image reconstruction. The numerical results suggest that significant improvement be achieved by our algorithm when compared to the previous ones. Numerical results show that accuracy of HTA is higher than that of SVT and FPC, and the requisite number of sampling to recover a matrix is typically reduced. Meanwhile we can see the power of HTA algorithm for missing data estimate in images.
ISBN:1467314846
9781467314848
ISSN:2160-133X
DOI:10.1109/ICMLC.2012.6359558