Matrix cofactorization for joint representation learning and supervised classification - Application to hyperspectral image analysis

被引:3
作者
Lagrange, Adrien [1 ]
Fauvel, Mathieu [2 ]
May, Stephane [3 ]
Bioucas-Dias, Jose [5 ]
Dobigeon, Nicolas [1 ,4 ]
机构
[1] Univ Toulouse, IRIT INP ENSEEIHT Toulouse, BP 7122, F-31071 Toulouse 7, France
[2] Univ Toulouse, CESBIO, CNES CNRS INRA IRD UPS, BPI 2801, F-31401 Toulouse 9, France
[3] CNES, DCT SI AP, 18 Ave Edouard Belin, F-31400 Toulouse, France
[4] Inst Univ France, Paris, France
[5] Univ Lisbon, Inst Super Tecn, Inst Telecomunicacoes, P-1049001 Lisbon, Portugal
关键词
Image interpretation; Supervised learning; Representation learning; Hyperspectral images; Non-convex optimization; Matrix cofactorization; SPARSE REGRESSION; FACTORIZATION; DECOMPOSITION; SEGMENTATION; DICTIONARY; ALGORITHMS; ERROR; MODEL;
D O I
10.1016/j.neucom.2019.12.068
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Supervised classification and representation learning are two widely used classes of methods to analyze multivariate images. Although complementary, these methods have been scarcely considered jointly in a hierarchical modeling. In this paper, a method coupling these two approaches is designed using a matrix cofactorization formulation. Each task is modeled as a factorization matrix problem and a term relating both coding matrices is then introduced to drive an appropriate coupling. The link can be interpreted as a clustering operation over the low-dimensional representation vectors. The attribution vectors of the clustering are then used as features vectors for the classification task, i.e., the coding vectors of the corresponding factorization problem. A proximal gradient descent algorithm, ensuring convergence to a critical point of the objective function, is then derived to solve the resulting non-convex non-smooth optimization problem. An evaluation of the proposed method is finally conducted both on synthetic and real data in the specific context of hyperspectral image interpretation, unifying two standard analysis techniques, namely unmixing and classification. (C) 2019 Published by Elsevier B.V.
引用
收藏
页码:132 / 147
页数:16
相关论文
共 62 条
[1]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[2]   Nonparametric Coupled Bayesian Dictionary and Classifier Learning for Hyperspectral Classification [J].
Akhtar, Naveed ;
Mian, Ajmal .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2018, 29 (09) :4038-4050
[3]  
[Anonymous], 2010, Photogramm. Rec., DOI 10.1201/9781420055139
[4]  
[Anonymous], 2016, Deep Learning
[5]  
[Anonymous], TECHNICAL REPORT
[6]  
[Anonymous], 2018, MATH MODELS REMOTE S
[7]   Random forest in remote sensing: A review of applications and future directions [J].
Belgiu, Mariana ;
Dragut, Lucian .
ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, 2016, 114 :24-31
[8]  
Benediktsson JA, 2015, ARTECH HSE REMOTE SE, P1
[9]   Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-Based Approaches [J].
Bioucas-Dias, Jose M. ;
Plaza, Antonio ;
Dobigeon, Nicolas ;
Parente, Mario ;
Du, Qian ;
Gader, Paul ;
Chanussot, Jocelyn .
IEEE JOURNAL OF SELECTED TOPICS IN APPLIED EARTH OBSERVATIONS AND REMOTE SENSING, 2012, 5 (02) :354-379
[10]   A VARIABLE SPLITTING AUGMENTED LAGRANGIAN APPROACH TO LINEAR SPECTRAL UNMIXING [J].
Bioucas-Dias, Jose M. .
2009 FIRST WORKSHOP ON HYPERSPECTRAL IMAGE AND SIGNAL PROCESSING: EVOLUTION IN REMOTE SENSING, 2009, :1-4