rrc1 robust低秩快速表示.pdfVIP

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 26, NO. 5, MAY 2017 2203 Robust and Low-Rank Representation for Fast Face Identification With Occlusions Michael Iliadis, Student Member, IEEE, Haohong Wang, Member, IEEE , Rafael Molina, Member, IEEE , and Aggelos K. Katsaggelos, Fellow, IEEE Digital Object Identifier 10.1109/TIP.2017.2675206 — In this paper, we propose an i tive method to address the face identification problem with block occlusions. Our approach utilizes a robust representation based on two characteristics in order to model contiguous errors (e.g., block occlusion) effectively. The first fits to the errors a distribution described by a tailored loss function. The second describes the error image as having a specific structure (resulting in low-rank omparison with image size). We will show that this joint characterization is effective for describing errors with spatial continuity. Our approach is computationally efficient due to the utilization of the alternating direction method of multipliers. A special case of our fast i tive algorithm leads to the robust representation method, which is normally used to handle non- contiguous errors (e.g., pixel corruption). Extensive results on representative face databases ( onstrained and unconstrained environments) the effectiveness of our method over existing robust representation methods with respect to