Multi-View Multi-Label Learning With Sparse Feature Selection for Image Annotation

• Published in: IEEE transactions on multimedia Vol. 22; no. 11; pp. 2844 - 2857
• Main Authors: Zhang, Yongshan, Wu, Jia, Cai, Zhihua, Yu, Philip S.
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01.11.2020; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Computer science; Correlation; Feature extraction; Feature selection; Image analysis; Image annotation; Iterative algorithms; Iterative methods; Kernel; Labels; Learning; Learning systems; multi-label learning; multi-view learning; Noise measurement; Regression analysis; Regression models; Representations; sparse learning; Task analysis
• ISSN: 1520-9210; 1941-0077
• DOI: 10.1109/TMM.2020.2966887

In image analysis, image samples are always represented by multiple view features and associated with multiple class labels for better interpretation. However, multiple view data may include noisy, irrelevant and redundant features, while multiple class labels can be noisy and incomplete. Due to the special data characteristic, it is hard to perform feature selection on multi-view multi-label data. To address these challenges, in this paper, we propose a novel multi-view multi-label sparse feature selection (MSFS) method, which exploits both view relations and label correlations to select discriminative features for further learning. Specifically, the multi-labeled information is decomposed into a reduced latent label representation to capture higher level concepts and correlations among multiple labels. Multiple local geometric structures are constructed to exploit visual similarities and relations for different views. By taking full advantage of the latent label representation and multiple local geometric structures, the sparse regression model with an <inline-formula><tex-math notation="LaTeX">l_{2,1}</tex-math></inline-formula>-norm and an Frobenius norm (<inline-formula><tex-math notation="LaTeX">F</tex-math></inline-formula>-norm) penalty terms is utilized to perform hierarchical feature selection, where the <inline-formula><tex-math notation="LaTeX">F</tex-math></inline-formula>-norm penalty performs high-level (i.e., view-wise) feature selection to preserve the informative views and the <inline-formula><tex-math notation="LaTeX">l_{2,1}</tex-math></inline-formula>-norm penalty conducts low-level (i.e., row-wise) feature selection to remove noisy features. To solve the proposed formulation, we also devise a simple yet efficient iterative algorithm. Experiments and comparisons on real-world image datasets demonstrate the effectiveness and potential of MSFS.