K-SVD: Dictionary Developing Algorithms for Sparse Representation of Signal. | Zendy

Ms Snehal Patil | Zendy; Prof A.G. Patil | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

K-SVD: Dictionary Developing Algorithms for Sparse Representation of Signal.

Author(s) -

Ms Snehal Patil,

Prof A.G. Patil

Publication year - 2019

Publication title -

international journal of recent technology and engineering (ijrte)

Language(s) - English

Resource type - Journals

ISSN - 2277-3878

DOI - 10.35940/ijrte.c4139.098319

Subject(s) - k svd , sparse approximation , algorithm , signal (programming language) , singular value decomposition , computer science , representation (politics) , pattern recognition (psychology) , artificial intelligence , politics , political science , law , programming language

The sparse representation of signal is more interested in recent days. It contains overcomplete dictionaries that provides the signal atom. All signals of sparse explained with the help of linear combination of atom. Our proposed system mainly worked on different types of pursuit algorithm that decompose signal with respect to given dictionary D. In K-SVD algorithm description with the help of K-means algorithm. In analytical manner we developed all the algorithm with the help of calculation of dictionary D and it also apply to various method to get updated data. After correction of data we developed K-SVD algorithm which is adaptable. It also work in future work.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research