Fast query for exemplar-based image completion.
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.
Kwok
Tsz-Ho
TH
Department of Mechanical and Automation Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong. thkwok@mae.cuhk.edu.hk
Sheung
Hoi
H
Wang
Charlie C L
CC
D000465:Algorithms; D003196:Computer Graphics; D007089:Image Enhancement / Q000379:methods*; D010363:Pattern Recognition, Automated; D012815:Signal Processing, Computer-Assisted