Abstract

Sparse representation (SR) for signals over an overcomplete dictionary fascinates a lot of researchers in the past decade. Using an overcomplete dictionary that contains prototype signal—atoms, signals are described by sparse linear combinations of these atoms. This paper addresses the problem of dictionary generation in SR. Recent studies show that this problem is equivalent to the problem of codebook estimation in vector quantization (VQ). A kernel fuzzy codebook estimation (KFCE) algorithm is proposed in this paper. The principle of the KFCE algorithm is to integrate the distance kernel trick with the fuzzy clustering algorithm to generate dictionary for SR. Experimental results on real image data show that the KFCE is fit for generating dictionary for SR.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.