Fast Search of a Similar Patch for Self-Similarity Based Image Super Resolution
- Authors
- Yoo, Jun-Sang; Choi, Ji-Hoon; Choi, Kang-Sun; Lee, Dae-Yeol; Kim, Hui-Yong; Kim, Jong-Ok
- Issue Date
- 8월-2016
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- Keywords
- super-resolution; self-similarity; kick-out condition; fast search
- Citation
- IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E99D, no.8, pp.2194 - 2198
- Indexed
- SCIE
- Journal Title
- IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
- Volume
- E99D
- Number
- 8
- Start Page
- 2194
- End Page
- 2198
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/87981
- DOI
- 10.1587/transinf.2016EDL8049
- ISSN
- 1745-1361
- Abstract
- In the self-similarity super resolution (SR) approach, similar examples are searched across down-scales in the image pyramid, and the computations of searching similar examples are very heavy. This makes it difficult to work in a real-time way under common software implementation. Therefore, the search process should be further accelerated at an algorithm level. Cauchy-Schwarz inequality has been used previously for fast vector quantization (VQ) encoding. The candidate patches in the search region of SR are analogous to the code-words in the VQ, and Cauchy-Schwarz inequality is exploited to exclude implausible candidate patches early. Consequently, significant acceleration of the similar patch search process is achieved. The proposed method can easily make an optimal trade-off between running speed and visual quality by appropriately configuring the bypass-threshold.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Electrical Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.