{"title":"用于低分辨率图像识别的 K-同构近邻驱动判别图耦合非负矩阵因式分解","authors":"Jihong Pei, Yebin Chen, Yang Zhao, Xuan Yang","doi":"10.1007/s10044-024-01316-6","DOIUrl":null,"url":null,"abstract":"<p>The coupled nonnegative matrix factorization method can utilize the information in high-resolution images to assist in the extraction of local semantic features of low-resolution (LR) images. However, since the supervised information is not fully considered in the existing methods, the discriminative performance of the extracted features is limited. In this paper, <i>k</i>-homogeneous nearest neighbor-driven discriminant graph coupled nonnegative matrix factorization (KHNNDG-CNMF) is proposed for low-resolution image recognition (LRIR). In the proposed approach, a <i>k</i>-homogeneous nearest neighbor-driven discriminant graph (KHNNDG) is constructed, which is a discriminant graph matrix constructed within the geometrical nearest neighbors of <i>k</i> homogeneous samples. In discriminant graph construction methods, the two problems of insufficient utilization of data information in local neighborhoods existing in the previous neighbor graph and the inability to reflect the real data distribution in the local neighborhood can be improved. According to the geometrical spatial distribution of samples, the KHNNDG can adaptively reflect the relationship between intra-class samples and inter-class samples, and relatively few hyperparameters are required. Therefore, the coupled nonnegative matrix factorization algorithm combined with the KHNNDG embedding regularized term can more accurately and effectively utilize the local discriminativeness of the original space to constrain the coupled features. Furthermore, we further strengthen the class separability among features by incorporating a consistent projection constraint from features to labels. The proposed algorithm performs experiments on 6 image databases. Three different LR images are involved in the experiment. Compared to the best-performing comparative method, the proposed method shows an average improvement of approximately 2.36% in recognition performance. Particularly in tasks involving extremely LR levels (<span>\\(8\\times 7\\)</span>), the proposed method achieves an average improvement of 3.03%. Ablation experiments show that each module in the method can improve the recognition performance of LR images.</p>","PeriodicalId":54639,"journal":{"name":"Pattern Analysis and Applications","volume":"17 1","pages":""},"PeriodicalIF":3.7000,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"K-homogeneous nearest neighbor-driven discriminant graph coupled nonnegative matrix factorization for low-resolution image recognition\",\"authors\":\"Jihong Pei, Yebin Chen, Yang Zhao, Xuan Yang\",\"doi\":\"10.1007/s10044-024-01316-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The coupled nonnegative matrix factorization method can utilize the information in high-resolution images to assist in the extraction of local semantic features of low-resolution (LR) images. However, since the supervised information is not fully considered in the existing methods, the discriminative performance of the extracted features is limited. In this paper, <i>k</i>-homogeneous nearest neighbor-driven discriminant graph coupled nonnegative matrix factorization (KHNNDG-CNMF) is proposed for low-resolution image recognition (LRIR). In the proposed approach, a <i>k</i>-homogeneous nearest neighbor-driven discriminant graph (KHNNDG) is constructed, which is a discriminant graph matrix constructed within the geometrical nearest neighbors of <i>k</i> homogeneous samples. In discriminant graph construction methods, the two problems of insufficient utilization of data information in local neighborhoods existing in the previous neighbor graph and the inability to reflect the real data distribution in the local neighborhood can be improved. According to the geometrical spatial distribution of samples, the KHNNDG can adaptively reflect the relationship between intra-class samples and inter-class samples, and relatively few hyperparameters are required. Therefore, the coupled nonnegative matrix factorization algorithm combined with the KHNNDG embedding regularized term can more accurately and effectively utilize the local discriminativeness of the original space to constrain the coupled features. Furthermore, we further strengthen the class separability among features by incorporating a consistent projection constraint from features to labels. The proposed algorithm performs experiments on 6 image databases. Three different LR images are involved in the experiment. Compared to the best-performing comparative method, the proposed method shows an average improvement of approximately 2.36% in recognition performance. Particularly in tasks involving extremely LR levels (<span>\\\\(8\\\\times 7\\\\)</span>), the proposed method achieves an average improvement of 3.03%. Ablation experiments show that each module in the method can improve the recognition performance of LR images.</p>\",\"PeriodicalId\":54639,\"journal\":{\"name\":\"Pattern Analysis and Applications\",\"volume\":\"17 1\",\"pages\":\"\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2024-08-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Pattern Analysis and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s10044-024-01316-6\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Analysis and Applications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10044-024-01316-6","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
摘要
耦合非负矩阵因式分解法可以利用高分辨率图像中的信息来辅助提取低分辨率(LR)图像的局部语义特征。然而,由于现有方法没有充分考虑监督信息,因此提取特征的判别性能有限。本文提出了用于低分辨率图像识别(LRIR)的 k-同构近邻驱动判别图耦合非负矩阵因式分解(KHNNDG-CNMF)。在所提出的方法中,构建了 k 个同质近邻驱动判别图(KHNNDG),它是在 k 个同质样本的几何近邻内构建的判别图矩阵。在判别图构建方法中,可以改善前一个邻域图中存在的局部邻域数据信息利用不足和无法反映局部邻域真实数据分布的两个问题。根据样本的几何空间分布,KHNNDG 可以自适应地反映类内样本和类间样本之间的关系,所需的超参数相对较少。因此,耦合非负矩阵因式分解算法与 KHNNDG 嵌入正则化项相结合,能更准确、有效地利用原始空间的局部判别性来约束耦合特征。此外,我们还通过加入从特征到标签的一致投影约束,进一步加强了特征之间的类别可分性。所提出的算法在 6 个图像数据库上进行了实验。实验涉及三种不同的 LR 图像。与表现最好的比较方法相比,所提出的方法在识别性能上平均提高了约 2.36%。特别是在涉及极高 LR 级别(8 倍)的任务中,所提出的方法平均提高了 3.03%。消融实验表明,该方法中的每个模块都能提高 LR 图像的识别性能。
The coupled nonnegative matrix factorization method can utilize the information in high-resolution images to assist in the extraction of local semantic features of low-resolution (LR) images. However, since the supervised information is not fully considered in the existing methods, the discriminative performance of the extracted features is limited. In this paper, k-homogeneous nearest neighbor-driven discriminant graph coupled nonnegative matrix factorization (KHNNDG-CNMF) is proposed for low-resolution image recognition (LRIR). In the proposed approach, a k-homogeneous nearest neighbor-driven discriminant graph (KHNNDG) is constructed, which is a discriminant graph matrix constructed within the geometrical nearest neighbors of k homogeneous samples. In discriminant graph construction methods, the two problems of insufficient utilization of data information in local neighborhoods existing in the previous neighbor graph and the inability to reflect the real data distribution in the local neighborhood can be improved. According to the geometrical spatial distribution of samples, the KHNNDG can adaptively reflect the relationship between intra-class samples and inter-class samples, and relatively few hyperparameters are required. Therefore, the coupled nonnegative matrix factorization algorithm combined with the KHNNDG embedding regularized term can more accurately and effectively utilize the local discriminativeness of the original space to constrain the coupled features. Furthermore, we further strengthen the class separability among features by incorporating a consistent projection constraint from features to labels. The proposed algorithm performs experiments on 6 image databases. Three different LR images are involved in the experiment. Compared to the best-performing comparative method, the proposed method shows an average improvement of approximately 2.36% in recognition performance. Particularly in tasks involving extremely LR levels (\(8\times 7\)), the proposed method achieves an average improvement of 3.03%. Ablation experiments show that each module in the method can improve the recognition performance of LR images.
期刊介绍:
The journal publishes high quality articles in areas of fundamental research in intelligent pattern analysis and applications in computer science and engineering. It aims to provide a forum for original research which describes novel pattern analysis techniques and industrial applications of the current technology. In addition, the journal will also publish articles on pattern analysis applications in medical imaging. The journal solicits articles that detail new technology and methods for pattern recognition and analysis in applied domains including, but not limited to, computer vision and image processing, speech analysis, robotics, multimedia, document analysis, character recognition, knowledge engineering for pattern recognition, fractal analysis, and intelligent control. The journal publishes articles on the use of advanced pattern recognition and analysis methods including statistical techniques, neural networks, genetic algorithms, fuzzy pattern recognition, machine learning, and hardware implementations which are either relevant to the development of pattern analysis as a research area or detail novel pattern analysis applications. Papers proposing new classifier systems or their development, pattern analysis systems for real-time applications, fuzzy and temporal pattern recognition and uncertainty management in applied pattern recognition are particularly solicited.