IEEE Transactions on Image Processing · 2010 · 64 citations · 28 references
ComputingComputer ScienceHigh-performance ComputingComputer GraphicsComputer VisionDigital ImagingDigital Image ProcessingGraphics Processing Unit ComputingGraphics Processing UnitsImage ProcessingParallel SearchingImage MatchingImage Processing UnitsImage QueryingMatchingParallel Image ProcessingParallel Maps
In this paper, we present a fast algorithm for filling unknown regions in an image using the strategy of exemplar-matching. Unlike the original exemplar-based method using exhaustive search, we decompose exemplars into the frequency coefficients and select fewer coefficients which are the most significant to evaluate the matching score. We have also developed a local gradient-based algorithm to fill the unknown pixels in a query image block. These two techniques bring the ability of input with varied dimensions to the fast query of similar image exemplars. The fast query is based upon a search-array data structure, and can be conducted very efficiently. Moreover, the evaluation of search-arrays runs in parallel maps well on the modern graphics hardware with graphics processing units (GPU). The functionality of the approach has been demonstrated by experimental results on real photographs.
28
Marcelo Bertalmı́o, Guillermo Sapiro, V. Caselles et al. · 2000 · 3.6K citations · Full text
Connelly Barnes, Eli Shechtman, Adam Finkelstein et al. · ACM Transactions on Graphics · 2009 · 2.9K citations
A Tutorial on Principal Component Analysis
Jonathon Shlens · arXiv (Cornell University) · 2014 · 2.3K citations · Full text
Fast texture synthesis using tree-structured vector quantization
Li‐Yi Wei, Marc Levoy · 2000 · 1.4K citations