Improved Structured Dictionary Learning via Correlation and Class Based Block Formation

被引:8
作者
Kumar, Nagendra [1 ]
Sinha, Rohit [1 ]
机构
[1] Indian Inst Technol Guwahati, Dept Elect & Elect Engn, Gauhati 781039, India
关键词
Block-KSVD dictionary; block orthogonal matching pursuit; sparse representation classification; SPARSE REPRESENTATION; SPEAKER VERIFICATION; DISCRIMINATIVE DICTIONARY; EFFICIENT RECOVERY; K-SVD; SIGNALS; CLASSIFICATION; RECOGNITION;
D O I
10.1109/TSP.2018.2865442
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In recent years, the creation of the block-structured dictionary has attracted a lot of interest. It involves a two-step process: block formation and dictionary update. Both the steps are important in producing an effective dictionary. The existing works mostly assume that the block structure is known a priori while learning the dictionary. For finding the unknown block structure of a given dictionary, the sparse agglomerative clustering (SAC) is most commonly used. It groups atoms based on their consistency in sparse coding of the data over the given dictionary. This paper explores two innovations toward improving the reconstruction, as well as the classification ability achieved with the block-structured dictionary. First, we propose a novel block structuring approach that makes use of the correlation among dictionary atoms. Unlike the SAC approach, which groups diverse atoms, in the proposed approach the blocks are formed by grouping the top most correlated atoms of the dictionary. The proposed block clustering approach is noted to yield significant reduction in redundancy. It also provides a direct control on the block size when compared with the existing SAC-based block structuring. Second, we present a novel dictionary learning rule, which includes the class-specific reconstruction error as a regularization to further enhance the classification ability of the block dictionary. The impact of the proposed innovations on the reconstruction ability has been demonstrated on synthetic data while that on the classification ability has been assessed on both speaker verification and face recognition tasks.
引用
收藏
页码:5082 / 5095
页数:14
相关论文
共 34 条
[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]  
[Anonymous], P ANN IEEE IND C IND
[3]  
[Anonymous], [No title captured]
[4]  
[Anonymous], 2011, INTERSPEECH
[5]  
[Anonymous], 2012, NIST YEAR 2012 SPEAK
[6]  
[Anonymous], 2006, IEEE COMP SOC C COMP
[7]   Block and Group Regularized Sparse Modeling for Dictionary Learning [J].
Chi, Yu-Tseh ;
Ali, Mohsen ;
Rajwade, Ajit ;
Ho, Jeffrey .
2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2013, :377-382
[8]   Front-End Factor Analysis for Speaker Verification [J].
Dehak, Najim ;
Kenny, Patrick J. ;
Dehak, Reda ;
Dumouchel, Pierre ;
Ouellet, Pierre .
IEEE TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING, 2011, 19 (04) :788-798
[9]   Orthonormal dictionary learning and its application to face recognition [J].
Dong, Zhen ;
Pei, Mingtao ;
Jia, Yunde .
IMAGE AND VISION COMPUTING, 2016, 51 :13-21
[10]   Least angle regression - Rejoinder [J].
Efron, B ;
Hastie, T ;
Johnstone, I ;
Tibshirani, R .
ANNALS OF STATISTICS, 2004, 32 (02) :494-499