Shift-Map Image Complition
Computer Graphics in 2-Dimensions


Pictures are taken from the paper “Shift-Map Image Editing” \ Yael Pritch, Eitam Kav-Venaki, and Shmuel Peleg.

Project Description:

Geometric rearrangement of images includes operations such as image retargeting, inpainting, or object rearrangement. Each such operation can be characterized by a shiftmap: the relative shift of every pixel in the output image from its source in an input image.
The paper describe a new representation of these operations as an optimal graph labeling, where the shift-map represents the selected label for each output pixel. Two terms are used in computing the optimal shift-map: (i) A data term which indicates constraints such as the change in image size, object rearrangement, a possible saliency map, etc. (ii) A smoothness term, minimizing the new discontinuities in the output image caused by discontinuities in the shift-map.
This graph labeling problem can be solved using graph cuts. Since the optimization is global and discrete, it outperforms state of the art methods in most cases. Efficient hierarchical solutions for graph-cuts are presented, and operations on 1M images can take only a few seconds.

Project Goal:

In this project we will implement the paper written by Yael Pritch et al. and try to improve it in its weakness points.

Project Details:
  1. Supervisor:
    Anna Oyzerman

  2. Field:
    Computer Graphics in 2-Dimensions
  3. Requirements:
    Image Processing
  4. Project status:
    Taken by the students BatEl Shlomo and Itamar Degani
  5. Visit:
    Project web site
New Projects Current Projects Archive Projects
CG&M Lab    Contact Us EE Labs ECE Department Technion