Low‐rank nonnegative sparse representation and local preservation‐based matrix regression for supervised image feature selection
Abstract Matrix regression has attracted much attention due to directly select some meaningful features from matrix data. However, most existing matrix regressions do not consider the global and local structure of the matrix data simultaneously. To this end, we propose a low‐rank nonnegative sparse...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-11-01
|
Series: | IET Image Processing |
Online Access: | https://doi.org/10.1049/ipr2.12281 |
id |
doaj-99a12bca9bf34471a577003683149ed4 |
---|---|
record_format |
Article |
spelling |
doaj-99a12bca9bf34471a577003683149ed42021-10-04T12:09:56ZengWileyIET Image Processing1751-96591751-96672021-11-0115133021303610.1049/ipr2.12281Low‐rank nonnegative sparse representation and local preservation‐based matrix regression for supervised image feature selectionXingyu Zhu0Xiuhong Chen1Department of Digital Media Technology School of Artificial Intelligence and Computer Science Jiangnan University Jiangsu Wuxi ChinaDepartment of Digital Media Technology School of Artificial Intelligence and Computer Science Jiangnan University Jiangsu Wuxi ChinaAbstract Matrix regression has attracted much attention due to directly select some meaningful features from matrix data. However, most existing matrix regressions do not consider the global and local structure of the matrix data simultaneously. To this end, we propose a low‐rank nonnegative sparse representation and local preserving matrix regression (LNSRLP‐MR) model for image feature selection. Here, the loss function is defined by the left and right regression matrices. To capture the global structure and discriminative information of the training images and reduce the effect of heterogeneous data and noises, we impose the low‐rank constraint on the self‐representation error matrix and the nonnegative sparse constraint on the coefficient vector. The graph matrix can be learned adaptively through representation coefficients, so that accurate local structure information in samples can be revealed. Feature selection is performed by obtained row sparse transformation matrix. An optimization procedure and its performance are also present. Experimental results on several image datasets show that compared with the‐state‐of‐the‐art method, the average classification accuracy of the proposed method is improved by at least 1.2% and up to 3.3%. For images with noise or occlusion, the accuracy is improved significantly, up to 4%, which indicates that this method has strong robustness.https://doi.org/10.1049/ipr2.12281 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Xingyu Zhu Xiuhong Chen |
spellingShingle |
Xingyu Zhu Xiuhong Chen Low‐rank nonnegative sparse representation and local preservation‐based matrix regression for supervised image feature selection IET Image Processing |
author_facet |
Xingyu Zhu Xiuhong Chen |
author_sort |
Xingyu Zhu |
title |
Low‐rank nonnegative sparse representation and local preservation‐based matrix regression for supervised image feature selection |
title_short |
Low‐rank nonnegative sparse representation and local preservation‐based matrix regression for supervised image feature selection |
title_full |
Low‐rank nonnegative sparse representation and local preservation‐based matrix regression for supervised image feature selection |
title_fullStr |
Low‐rank nonnegative sparse representation and local preservation‐based matrix regression for supervised image feature selection |
title_full_unstemmed |
Low‐rank nonnegative sparse representation and local preservation‐based matrix regression for supervised image feature selection |
title_sort |
low‐rank nonnegative sparse representation and local preservation‐based matrix regression for supervised image feature selection |
publisher |
Wiley |
series |
IET Image Processing |
issn |
1751-9659 1751-9667 |
publishDate |
2021-11-01 |
description |
Abstract Matrix regression has attracted much attention due to directly select some meaningful features from matrix data. However, most existing matrix regressions do not consider the global and local structure of the matrix data simultaneously. To this end, we propose a low‐rank nonnegative sparse representation and local preserving matrix regression (LNSRLP‐MR) model for image feature selection. Here, the loss function is defined by the left and right regression matrices. To capture the global structure and discriminative information of the training images and reduce the effect of heterogeneous data and noises, we impose the low‐rank constraint on the self‐representation error matrix and the nonnegative sparse constraint on the coefficient vector. The graph matrix can be learned adaptively through representation coefficients, so that accurate local structure information in samples can be revealed. Feature selection is performed by obtained row sparse transformation matrix. An optimization procedure and its performance are also present. Experimental results on several image datasets show that compared with the‐state‐of‐the‐art method, the average classification accuracy of the proposed method is improved by at least 1.2% and up to 3.3%. For images with noise or occlusion, the accuracy is improved significantly, up to 4%, which indicates that this method has strong robustness. |
url |
https://doi.org/10.1049/ipr2.12281 |
work_keys_str_mv |
AT xingyuzhu lowranknonnegativesparserepresentationandlocalpreservationbasedmatrixregressionforsupervisedimagefeatureselection AT xiuhongchen lowranknonnegativesparserepresentationandlocalpreservationbasedmatrixregressionforsupervisedimagefeatureselection |
_version_ |
1716844147002834944 |