Name
Abstract | ||
|---|---|---|
The paper compares a sparse approximation based spatial texture prediction method with the template matching based prediction. Template matching algorithms have been widely considered for image prediction. These approaches rely on the assumption that the predicted texture contains a similar textural structure with the template in the sense of a simple distance metric between template and candidate. However, in real images, there are more complex textured areas where template matching fails. The basic idea instead is to consider sparse approximation algorithms. The proposed sparse spatial prediction is assessed against the prediction method based on template matching with a static and optimized dynamic templates. The spatial prediction method is then assessed in a coding scheme where the prediction residue is encoded with a coding approach similar to JPEG. Experimental observations show that the proposed method outperforms the conventional template matching based prediction. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ICIP.2010.5652548 | 2010 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING |
Keywords | Field | DocType |
Texture prediction, sparse approximation, matching pursuits, template matching, dynamic template | Template matching,Approximation algorithm,Computer vision,Pattern recognition,Image texture,Computer science,Sparse approximation,Metric (mathematics),Prediction by partial matching,JPEG,Artificial intelligence,Real image | Conference |
ISSN | Citations | PageRank |
1522-4880 | 10 | 0.99 |
References | Authors | |
4 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mehmet Türkan | 1 | 93 | 12.68 |
| Christine Guillemot | 2 | 1286 | 104.25 |