Image Segmentation Using Overlapping Group Sparsity
Sparse decomposition has been widely used for different applications, such as source separation, image classification and image denoising. This paper presents a new algorithm for segmentation of an image into background and foreground text and graphics using sparse decomposition. First, the background is represented using a suitable smooth model, which is a linear combination of a few smoothly varying basis functions, and the foreground text and graphics are modeled as a sparse component overlaid on the smooth background. Then the background and foreground are separated using a sparse decomposition framework and imposing some prior information, which promote the smoothness of background, and the sparsity and connectivity of foreground pixels. This algorithm has been tested on a dataset of images extracted from HEVC standard test sequences for screen content coding, and is shown to outperform prior methods, including least absolute deviation fitting, k-means clustering based segmentation in DjVu, and shape primitive extraction and coding algorithm.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDenoisingimage-classificationImage ClassificationImage DenoisingImage SegmentationSegmentationSemantic SegmentationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
New explicit thresholding/shrinkage formulas for one class of regularization problems with overlapping group sparsity and their applications
The least-square regression problems or inverse problems have been widely studied in many fields such as compressive sensing, signal processing, and image processing. To solve this kind of ill-posed problems, a regulariz…
Compressive SensingDeblurringDenoisingTranslationBlind Image Deconvolution using Student's-t Prior with Overlapping Group Sparsity
In this paper, we solve blind image deconvolution problem that is to remove blurs form a signal degraded image without any knowledge of the blur kernel. Since the problem is ill-posed, an image prior plays a significant …
Image DeconvolutionExclusive Feature Learning on Arbitrary Structures via \ell_{1,2}-norm
Group lasso is widely used to enforce the structural sparsity, which achieves the sparsity at inter-group level. In this paper, we propose a new formulation called ``exclusive group lasso'', which brings out sparsity at …
feature selectionOrthogonal Matching Pursuit for Text Classification
In text classification, the problem of overfitting arises due to the high dimensionality, making regularization essential. Although classic regularizers provide sparsity, they fail to return highly accurate models. On th…
ClassificationGeneral Classificationtext-classificationText Classification+1Image Restoration using Total Variation with Overlapping Group Sparsity
Image restoration is one of the most fundamental issues in imaging science. Total variation (TV) regularization is widely used in image restoration problems for its capability to preserve edges. In the literature, howeve…
Image Restoration