The Patch Transform
Name
Cho-2010-The patch transform.pdf
Size
4.07 MB
Format
Adobe PDF
Checksum (MD5)
7d54ea56a7afc8e305c0b7a18ed134a1
Author(s)
Avidan, Shai
Cho, Taeg Sang
Freeman, William T.
Date Issued
June 2009
Journal
IEEE Transactions on Pattern Analysis and Machine Intelligence
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Taeg Sang Cho, Shai Avidan, and William T Freeman. “The Patch Transform.” IEEE Transactions on Pattern Analysis and Machine Intelligence 32.8 (2010): 1489–1501. Web. 4 Apr. 2012. © 2009 Institute of Electrical and Electronics Engineers
Version
Final published version
Abstract
The patch transform represents an image as a bag of overlapping patches sampled on a regular grid. This representation allows users to manipulate images in the patch domain, which then seeds the inverse patch transform to synthesize modified images. Possible modifications include the spatial locations of patches, the size of the output image, or the pool of patches from which an image is reconstructed. When no modifications are made, the inverse patch transform reduces to solving a jigsaw puzzle. The inverse patch transform is posed as a patch assignment problem on a Markov random field (MRF), where each patch should be used only once and neighboring patches should fit to form a plausible image. We find an approximate solution to the MRF using loopy belief propagation, introducing an approximation that encourages the solution to use each patch only once. The image reconstruction algorithm scales well with the total number of patches through label pruning. In addition, structural misalignment artifacts are suppressed through a patch jittering scheme that spatially jitters the assigned patches. We demonstrate the patch transform and its effectiveness on natural images.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/TPAMI.2009.133
