Proceedings: GI 2007

Improved image quilting

Jeremy Long, David Mould

Proceedings of Graphics Interface 2007: Montréal, Québec, Canada, 28 - 30 May 2007, 257-264

DOI 10.1145/1268517.1268559

  • BibTex

    author = {Long, Jeremy and Mould, David},
    title = {Improved image quilting},
    booktitle = {Proceedings of Graphics Interface 2007},
    series = {GI 2007},
    year = {2007},
    issn = {0713-5424},
    isbn = {978-1-56881-337-0},
    location = {Montr{\'e}al, Qu{\'e}bec, Canada},
    pages = {257--264},
    numpages = {8},
    doi = {10.1145/1268517.1268559},
    acmdoi = {10.1145/1268517.1268559},
    publisher = {Canadian Human-Computer Communications Society},
    address = {University of Waterloo, Waterloo, Ontario, Canada},


In this paper, we present an improvement to the minimum error boundary cut, a method of shaping texture patches for non-parametric texture synthesis from example algorithms such as Efros and Freeman's Image Quilting [4]. Our method uses an alternate distance metric for Dijkstra's algorithm [3], and as a result we are able to prevent the path from taking short cuts through high cost areas, as can sometimes be seen in traditional image quilting. Furthermore, our method is able to reduce both the maximum error in the resulting texture and the visibility of the remaining defects by spreading them over a longer path. Post-process methods such as pixel re-synthesis [9] can easily be modified and applied to our minimum boundary cut to increase the quality of the results.