Abstract

Traditional sparse coding treats local descriptors separately, leading to random locations of non-zero coefficients. To overcome this problem, group sparse coding was proposed. By leveraging mixed-norm regularisation, the locations of non-zero coefficients tend to cluster into groups. However, how to rationally constitute 'a group' is still a problem, since forcing local descriptors in a group to have uniform sparse pattern may be too rigid and bring about larger reconstruction error and information loss, especially when descriptors in a group are not very similar. In this paper, we propose multi-level K-means clustering and group sparse coding to address this issue, which is called MK-GSC. Moreover, we present a novel local descriptor based on SIFT to further promote the power of representation for images. Our method is tested on two public benchmarks, and achieves competitive or better results than the state-of-the-art methods.

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.