paper-with-me

홈 › Papers

A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization

2017-09-12 · Zhiyuan Zha, Xin Yuan, Bihan Wen, Jiantao Zhou, Jiachao Zhang, Ce Zhu

Sparse coding has achieved a great success in various image processing tasks. However, a benchmark to measure the sparsity of image patch/group is missing since sparse coding is essentially an NP-hard problem. This work attempts to fill the gap from the perspective of rank minimization. More details please see the manuscript....

📄 PDF Abstract BibTeX arXiv:1709.03979

Code (0)

등록된 구현이 없습니다.

Tasks

Dictionary LearningImage InpaintingImage Restoration

Similar Papers 제목 키워드 기반

Analyzing the group sparsity based on the rank minimization methods

2016-11-28 · Zhiyuan Zha, Xin Liu, Xiaohua Huang, Henglin Shi 외

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 unchange…

Compressive SensingImage Inpainting

Joint group and residual sparse coding for image compressive sensing

2019-01-23 · Lizhao Li, Song Xiao

Nonlocal self-similarity and group sparsity have been widely utilized in image compressive sensing (CS). However, when the sampling rate is low, the internal prior information of degraded images may be not enough for acc…

Compressive Sensing

Group Sparsity Residual with Non-Local Samples for Image Denoising

2018-03-22 · Zhiyuan Zha, Xinggan Zhang, Qiong Wang, Yechao Bai 외

Inspired by group-based sparse coding, recently proposed group sparsity residual (GSR) scheme has demonstrated superior performance in image processing. However, one challenge in GSR is to estimate the residual by using …

DenoisingImage Denoising

High-dimensional Joint Sparsity Random Effects Model for Multi-task Learning

2013-09-26 · Krishnakumar Balasubramanian, Kai Yu, Tong Zhang

Joint sparsity regularization in multi-task learning has attracted much attention in recent years. The traditional convex formulation employs the group Lasso relaxation to achieve joint sparsity across tasks. Although th…

Multi-Task LearningVocal Bursts Intensity Prediction

Tight Performance Bounds for Compressed Sensing With Conventional and Group Sparsity

2016-06-19 · Shashank Ranjan, Mathukumalli Vidyasagar

In this paper, we study the problem of recovering a group sparse vector from a small number of linear measurements. In the past the common approach has been to use various "group sparsity-inducing" norms such as the Grou…

compressed sensing