2D Feature Selection by Sparse Matrix Regression

For many image processing and computer vision problems, data points are in matrix form. Traditional methods often convert a matrix into a vector and then use vector-based approaches. They will ignore the location of matrix elements and the converted vector often has high dimensionality. How to selec...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 26(2017), 9 vom: 14. Sept., Seite 4255-4268
1. Verfasser: Hou, Chenping (VerfasserIn)
Weitere Verfasser: Jiao, Yuanyuan, Nie, Feiping, Luo, Tingjin, Zhou, Zhi-Hua
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2017
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM272922676
003 DE-627
005 20231224235922.0
007 cr uuu---uuuuu
008 231224s2017 xx |||||o 00| ||eng c
024 7 |a 10.1109/TIP.2017.2713948  |2 doi 
028 5 2 |a pubmed24n0909.xml 
035 |a (DE-627)NLM272922676 
035 |a (NLM)28613175 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Hou, Chenping  |e verfasserin  |4 aut 
245 1 0 |a 2D Feature Selection by Sparse Matrix Regression 
264 1 |c 2017 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 30.07.2018 
500 |a Date Revised 30.07.2018 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a For many image processing and computer vision problems, data points are in matrix form. Traditional methods often convert a matrix into a vector and then use vector-based approaches. They will ignore the location of matrix elements and the converted vector often has high dimensionality. How to select features for 2D matrix data directly is still an uninvestigated important issue. In this paper, we propose an algorithm named sparse matrix regression (SMR) for direct feature selection on matrix data. It employs the matrix regression model to accept matrix as input and bridges each matrix to its label. Based on the intrinsic property of regression coefficients, we design some sparse constraints on the coefficients to perform feature selection. An effective optimization method with provable convergence behavior is also proposed. We reveal that the number of regression vectors can be regarded as a tradeoff parameter to balance the capacity of learning and generalization in essence. To examine the effectiveness of SMR, we have compared it with several vector-based approaches on some benchmark data sets. Furthermore, we have also evaluated SMR in the application of scene classification. They all validate the effectiveness of our method 
650 4 |a Journal Article 
700 1 |a Jiao, Yuanyuan  |e verfasserin  |4 aut 
700 1 |a Nie, Feiping  |e verfasserin  |4 aut 
700 1 |a Luo, Tingjin  |e verfasserin  |4 aut 
700 1 |a Zhou, Zhi-Hua  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 26(2017), 9 vom: 14. Sept., Seite 4255-4268  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:26  |g year:2017  |g number:9  |g day:14  |g month:09  |g pages:4255-4268 
856 4 0 |u http://dx.doi.org/10.1109/TIP.2017.2713948  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 26  |j 2017  |e 9  |b 14  |c 09  |h 4255-4268