|Table of Contents|

Fuzzy adaptive method for optimizing recovery of compressive sensing matrix

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

Issue:
2013年04期
Page:
479-
Research Field:
Publishing date:

Info

Title:
Fuzzy adaptive method for optimizing recovery of compressive sensing matrix
Author(s):
Song Xiaoning123Xue Yishi4Yu Dongjun1Yang Xibei123Liu Zi12
1.School of Computer Science and Engineering,NUST,Nanjing 210094,China; 2.Post-doctoral Research Center,Jiangsu Sunboon Information Technology Co.,Ltd.,Wuxi 214072,China; 3.School of Computer Science and Engineering,Jiangsu University of Science and Technology, Zhenjiang 212003,China; 4.Overseas Education College,Nanjing University of Posts and Telecommunications,Nanjing 210023,China
Keywords:
sparse representation sensing matrix compressive measurement optimization recovery image recognition
PACS:
TP391.41
DOI:
-
Abstract:
To solve the underdetermined linear problem in the signal recovery from high-dimensional data,a fuzzy adaptive method for optimizing recovery of compressive sensing matrix is proposed for image reconstruction and recognition.By this means,each high dimensional input sample is firstly partitioned into the several local blocks,and those local blocks are combined to represent the sample as a third-order tensor.Moreover,the compressive measurement is performed on the dimensionality-reduced source signal,which is able to find the properties of statistical independence and linear singular by using multi-scale structural analysis and independent component analysis.Finally,a new fuzzy cost function for optimization of sensing matrix is proposed,in which the update of atoms from sensing matrix are fuzzily handled,and the low coherence is obtained between the properties of observation matrix and dictionary matrix.The merit of the method is that the sparse signal has desirable properties for the number of measurements and representation qualities under the same reconstruction conditions.Extensive experimental studies conducted on ORL,Yale face images and 91 natural images databases show that the effectiveness of the proposed method.

References:

[1] Candes E,Wakin M.An introduction to compressive sampling[J].IEEE Signal Processing Magazine,2008,25(2):21-30.
[2]焦李成,杨淑媛,刘芳,等.压缩感知回顾与展望[J].电子学报,2011,39(7):1651-1661.
Jiao Licheng,Yang Shuyuan,Liu Fang,et al.Development and prospect of compressive sensing[J].Acta Electronica Sinica,2011,39(7):1651-1661.
[3]何楚,刘明,冯倩,等.基于多尺度压缩感知金字塔的极化干涉SAR图像分类[J].自动化学报,2011,37(7):820-827.
He Chu,Liu Ming,Feng Qian,et al.PolInSAR image classifcation based on compressed sensing and multi-scale pyramid[J].Acta Automatica Sinica,2011,37(7):820-827.
[4]肖亮,韦志辉.图像超分辨率重建的非局部正则化模型与算法研究[J].计算机学报,2011,34(5):931-942.
Xiao Liang,Wei Zhihui.Research on non-local regularization model and algorithms for image super-resolution reconstruction[J].Chinese Journal of Computers,2011,34(5):931-942.
[5]李星秀,韦志辉,肖亮.基于稀疏支撑集先验的压缩感知图像序列重建算法[J].南京理工大学学报,2012,36(6):973-978.
Li Xingxiu,Wei Zhihui,Xiao Liang.Compressed sensing image sequence reconstruction algorithm based on sparse support prior[J].Journal of Nanjing University of Science and Technology,2012,36(6):973-978.
[6]余正涛,邹俊杰,赵兴,等.基于主动学习的最小二乘支持向量机稀疏化[J].南京理工大学学报,2012,36(1):12-17.
Yu Zhengtao,Zou Junjie,Zhao Xing,et al.Sparseness of least squares support vector machines based on active learning[J].Journal of Nanjing University of Science and Technology,2012,36(1):12-17.
[7]Duarte-Carvajalino J M,Sapiro G.Learning to sense sparse signals:simultaneous sensing matrix and sparsifying dictionary optimization[J].IEEE Transactions on Image Processing,2009,18(7):1395-1408.
[8]Mehran S,Mohammad T M S.Three-dimensional modular discriminant analysis(3DMDA):A new feature extraction approach for face recognition[J].Computers and Electrical Engineering,2011,37:811-823.
[9]邓承志.图像稀疏表示理论及其应用研究[D].武汉:华中科技大学电子与信息工程系,2008.
[10]Aharon M,Elad M,Bruckstein A.K-SVD:An algorithm for designing overcomplete dictionaries for sparse representation[J].IEEE Transactions on Signal Processing,2006,54(11):4311-4322.
[11]AT&T Laboratories Cambridge.ORL face database[EB/OL],[M/OL],[M/OL].[2009-02-14].Http://www.camorl.co.uk/facedatabase.htm.
[12]Yale database,Available from:<http://cvc.yale.edu/projects/yalefaces/yalefaces.html>.
[13]Yu Hua,Yang Jie.A direct LDA algorithm for high-dimensional data with application to face recognition[J].Pattern Recognition,2001,34:2067-2070.
[14]Yang Jian,Frangi A F,Yang Jingyu,et al.KPCA plus LDA:A complete kernel Fisher discriminant framework for feature extraction and recognition[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2005,27(2):230-244.
[15]Bartlett M S,Movellan J R,Sejnowski T J.Face recogni-tion by independent component analysis[J].IEEE Transactions on Neural Networks,2002,13(6):1450-1464.
[16]Zhang Xiaoxun,Jia Yunde.A linear discriminant analysis framework based on random subspace for face recognition[J].Pattern Recognition,2007,40:2585-2591.
[17]Liang Zhizheng,Li Youfu,Shi Pengfei.A note on two-dimensional linear discriminant analysis[J].Pattern Recognition Letters,2008,29(16):2122-2128.
[18]He Xiaofei,Yan Shuicheng,Hu Yuxiao,et al.Face recognition using laplacianfaces[J].IEEE Transaction on Pattern Analysis and Machine Intelligence,2005,27:328-40.
[19]You Qubo,Zheng Nanning,Du Shaoyi,et al.Neighborhood discriminant projection for face recognition[J].Pattern Recognition Letters,2007,28:1156-1163.

Memo

Memo:
-
Last Update: 2013-08-31