Analyzing the group sparsity based on the rank minimization methods
Zha, Zhiyuan; Liu, Xin; Huang, Xiaohua; Shi, Henglin; Xu, Yingyue; Wang, Qiong; Tang, Lan; Zhang, Xinggan (2017-07-10)
Z. Zha et al., "Analyzing the group sparsity based on the rank minimization methods," 2017 IEEE International Conference on Multimedia and Expo (ICME), Hong Kong, 2017, pp. 883-888. doi: 10.1109/ICME.2017.8019334
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
https://urn.fi/URN:NBN:fi-fe201902226054
Tiivistelmä
Abstract
Sparse coding has achieved a great success in various image processing studies. However, there is not any benchmark to measure the sparsity of image patch/group because sparse discriminant conditions cannot keep unchanged. This paper analyzes the sparsity of group based on the strategy of the rank minimization. Firstly, an adaptive dictionary for each group is designed. Then, we prove that group-based sparse coding is equivalent to the rank minimization problem, and thus the sparse coefficients of each group are measured by estimating the singular values of each group. Based on that measurement, the weighted Schatten p-norm minimization (WSNM) has been found to be the closest solution to the real singular values of each group. Thus, WSNM can be equivalently transformed into a non-convex ℓp-norm minimization problem in group-based sparse coding. Experimental results on two applications: image in painting and image compressive sensing (CS) recovery show that the proposed scheme outperforms many state-of-the-art methods.
Kokoelmat
- Avoin saatavuus [38697]