2008
DOI: 10.1016/j.jvcir.2008.03.001
|View full text |Cite
|
Sign up to set email alerts
|

Compression of facial images using the K-SVD algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
198
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 281 publications
(203 citation statements)
references
References 24 publications
1
198
0
Order By: Relevance
“…In recent years, sparse representation has gained much interest in the computer vision field [1,2] and has been widely applied to image restoration [3,4], image compression [5,6], and image classification [7][8][9][10][11]. The success of sparse representation is partially because natural images can be generally and sparsely coded by structural primitives (e.g., edges and line segments) and the images or signals can be represented sparsely by dictionary atoms from the same class.…”
Section: Introductionmentioning
confidence: 99%
“…In recent years, sparse representation has gained much interest in the computer vision field [1,2] and has been widely applied to image restoration [3,4], image compression [5,6], and image classification [7][8][9][10][11]. The success of sparse representation is partially because natural images can be generally and sparsely coded by structural primitives (e.g., edges and line segments) and the images or signals can be represented sparsely by dictionary atoms from the same class.…”
Section: Introductionmentioning
confidence: 99%
“…In particular, sparsity based regularization has achieved great success, offering solutions that outperform classical approaches in various image and signal processing applications. Among the others, we can mention inverse problems such as denoising [35,36], reconstruction [22,37], classification [38], recognition [39,40], and compression [41,42]. The underlying assumption of methods based on sparse representation is that signals such as audio and images are naturally generated by a multivariate linear model, driven by a small number of basis or regressors.…”
Section: Sparse Image Representationmentioning
confidence: 99%
“…Some available methods of texture classification and retrieval can be found in [1,2,3,4]. SVD is an important matrix theory and has been popularly employed in image processing, such as data compression [5], texture segmentation [6], and texture classification [7]. Specifically, wavelet-based methods have been intensively researched since wavelet analysis offers an efficient representation of multiresolutions and orientations of images [8,9,10,11].…”
Section: Introductionmentioning
confidence: 99%