Robust Sparse Representation for Incomplete and Noisy Data
AbstractOwing to the robustness of large sparse corruptions and the discrimination of class labels, sparse signal representation has been one of the most advanced techniques in the fields of pattern classification, computer vision, machine learning and so on. This paper investigates the problem of robust face classification when a test sample has missing values. Firstly, we propose a classification method based on the incomplete sparse representation. This representation is boiled down to an l1 minimization problem and an alternating direction method of multipliers is employed to solve it. Then, we provide a convergent analysis and a model extension on incomplete sparse representation. Finally, we conduct experiments on two real-world face datasets and compare the proposed method with the nearest neighbor classifier and the sparse representation-based classification. The experimental results demonstrate that the proposed method has the superiority in classification accuracy, completion of the missing entries and recovery of noise. View Full-Text
Share & Cite This Article
Shi, J.; Zheng, X.; Yang, W. Robust Sparse Representation for Incomplete and Noisy Data. Information 2015, 6, 287-299.
Shi J, Zheng X, Yang W. Robust Sparse Representation for Incomplete and Noisy Data. Information. 2015; 6(3):287-299.Chicago/Turabian Style
Shi, Jiarong; Zheng, Xiuyun; Yang, Wei. 2015. "Robust Sparse Representation for Incomplete and Noisy Data." Information 6, no. 3: 287-299.