Non-Negative Matrix Factorization Based on Double Sparsity K-SVD

Zheng Hong; Li Zhen; Li Zhao

doi:10.4028/www.scientific.net/AMM.190-191.352

Paper Titles

Constrained Optimization Solution Based on an Improved Genetic Algorithm
p.334

Dynamic Simulation of the Heat Exchanger Based on Simulink
p.338

Fitting Algorithm of Parameterized Continued Fractions with Keeping Endpoints and its Application
p.343

Multivariate Decision Tree Algorithm Based on Rough Set
p.347

Non-Negative Matrix Factorization Based on Double Sparsity K-SVD
p.352

Research on Embedded Computer Techniques Used in Agricultural Equipments ATS
p.356

Research on New Algorithm of Network Topology Design Based on Cloud Integration
p.360

Secret Image Sharing with Threshold Set
p.364

Discrete Element Method Analysis of Mechanical Properties of Railway Ballast during Tamping Process under Different Vibration Frequency
p.369

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 190-191Non-Negative Matrix Factorization Based on Double...

Non-Negative Matrix Factorization Based on Double Sparsity K-SVD

Abstract:

This paper presents a novel non-negative matrix factorization algorithm based on double sparsity K-SVD. It keeps the good parts-based representation. And meanwhile it has a well sparsity as sparse coding. The influences given by different initialization condition have been successfully overcome. Compared with other algorithms, the algorithm proposed is much faster. This dissertation demonstrates the advantages of the proposed algorithm by simulator experimentation.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 190-191)

Pages:

352-355

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.190-191.352

Citation:

Cite this paper

Online since:

July 2012

Authors:

Zheng Hong, Li Zhen, Li Zhao

Keywords:

Double Sparisity, K-SVD, Non-Negative Matrix Factorization

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] D. Lee and H. Seung: Learning the parts of objects by non-negative matrix factorization. Nature, 1999: 788-791.

DOI: 10.1038/44565

Google Scholar

[2] D. Lee and H. Seung: Algorithms for Non-negative Matrix Factorization. Neural Information Processing, (2001).

Google Scholar

[3] M Aharon and M Elad: K-SVD: Design of dictionaries for sparse representation. A Bruckstein in Signals, (2006).

Google Scholar

[4] P. O. Hoyer: Non-negative sparse coding. In Neural Networks for Signal Processing XII, 2002: 557–565.

Google Scholar

[5] W. Liu, N. Zheng, etc: Non-negative matrix factorization for visual coding. ICASSP, (2003).

Google Scholar

[6] M. Aharon, M. Elad, etc: K-SVD and its Non-Negative Variant for Dictionary Design. Proceedings of the SPIE conference wavelets, 2005, Vol. 5914.

DOI: 10.1117/12.613878

Google Scholar

[7] R. Rubinstein, M. Zibulevsky, etc: Double Sparsity Learning Sparse Dictionaries for Sparse Signal Approximation, IEEE Transactions On Signal Processing, 2010, Vol. 58.

DOI: 10.1109/tsp.2009.2036477

Google Scholar

[8] A. M. Bruckstein, D. L. Donoho, etc: From sparse solutions of systems of equations to sparse modeling of signals and images, SIAM, 2009: 34–81.

DOI: 10.1137/060657704

Google Scholar