Sciweavers

9 search results - page 1 / 2
» Inpainting with sparse linear combinations of exemplars
Sort
View
ICASSP
2009
IEEE
14 years 1 months ago
Inpainting with sparse linear combinations of exemplars
We introduce a new exemplar-based inpainting algorithm that represents the region to be inpainted as a sparse linear combination of example blocks, extracted from the image being ...
Brendt Wohlberg
INTERSPEECH
2010
13 years 1 months ago
Artificial and online acquired noise dictionaries for noise robust ASR
Recent research has shown that speech can be sparsely represented using a dictionary of speech segments spanning multiple frames, exemplars, and that such a sparse representation ...
Jort F. Gemmeke, Tuomas Virtanen
CVPR
2003
IEEE
14 years 9 months ago
Object Removal by Exemplar-Based Inpainting
A new algorithm is proposed for removing large objects from digital images. The challenge is to fill in the hole that is left behind in a visually plausible way. In the past, this...
Antonio Criminisi, Kentaro Toyama, Patrick P&eacut...
TIP
2010
189views more  TIP 2010»
13 years 5 months ago
Image Inpainting by Patch Propagation Using Patch Sparsity
Abstract—This paper introduces a novel examplar-based inpainting algorithm through investigating the sparsity of natural image patches. Two novel concepts of sparsity at the patc...
Zongben Xu, Jian Sun
SCALESPACE
2007
Springer
14 years 1 months ago
Non-negative Sparse Modeling of Textures
This paper presents a statistical model for textures that uses a non-negative decomposition on a set of local atoms learned from an exemplar. This model is described by the varianc...
Gabriel Peyré