Screen Content Image Segmentation Using Sparse-Smooth Decomposition

Abstract

Sparse decomposition has been extensively used for different applications including signal compression and denoising and document analysis. In this paper, sparse decomposition is used for image segmentation. The proposed algorithm separates the background and foreground using a sparse-smooth decomposition technique such that the smooth and sparse components correspond to the background and foreground respectively. This algorithm is tested on several test images from HEVC test sequences and is shown to have superior performance over other methods, such as the hierarchical k-means clustering in DjVu. This segmentation algorithm can also be used for text extraction, video compression and medical image segmentation.

Asilomar Conference on Signals, Systems and Computers, IEEE, 2015, (to Appear)

References in corpus (1)

• High Dimensional Low Rank plus Sparse Matrix Decomposition

Cited by in corpus (7)

• Sparsity-based Color Image Super Resolution via Exploiting Cross Channel Constraints
• Fast Algorithms for Demixing Sparse Signals from Nonlinear Observations
• Low Rank Matrix Recovery with Simultaneous Presence of Outliers and Sparse Corruption
• Towards Coordinated Bandwidth Adaptations for Hundred-Scale 3D Tele-Immersive Systems
• Image Segmentation For Improved Lossless Screen Content Compression
• Screen Content Image Segmentation Using Sparse Decomposition and Total Variation Minimization
• Enhanced Signal Recovery via Sparsity Inducing Image Priors