typodupeerror

## Content-Aware Image Resizing174

An anonymous reader writes "At the SIGGRAPH 2007 conference in San Diego, two Israeli professors, Shai Avidan and Ariel Shamir, have demonstrated a new method to shrink images. The method is called 'Seam Carving for Content-Aware Image Resizing' (PDF paper here) and it figures out which parts of an image are less significant. This makes it possible to change the aspect ratio of an image without making the content look skewed or stretched out. There is a video demonstration up on YouTube."
This discussion has been archived. No new comments can be posted.

## Content-Aware Image Resizing

• #### The paper via ACM (Score:5, Informative)

on Saturday August 25, 2007 @06:38PM (#20357465) Homepage
The author's website was pegged serving that 20MB PDF before slashdot got ahold of it, I doubt it'll survive now. The paper is also hosted by the ACM [acm.org], if you're a subscriber.
• #### Prior art (Score:2, Informative)

on Saturday August 25, 2007 @06:59PM (#20357625)
The technique was already invented by the Soviets in the '30s:

Before [wikipedia.org]

After [wikipedia.org]

Insignificant person removed.
• #### Re:The paper via ACM (Score:5, Informative)

<(hastur) (at) (hasturkun.com)> on Saturday August 25, 2007 @07:09PM (#20357685) Homepage
The Coral Cache" [nyud.net] has it also.
• #### Re:The paper via ACM (Score:5, Informative)

by Anonymous Coward on Saturday August 25, 2007 @07:23PM (#20357763)
I used a lossy compression algorithm on their paper and got this...

Shrink image:
Step 1: Run an edge detection algorithm.
Step 2: Find minimal energy (least amount of edges crossed) path from top to bottom or left to right (graph-cut algorithm).
Step 3: Remove pixels along that path.
Step 4: Repeat steps 2 and 3 as necessary.

Extend image:
Step 1: Run an edge detection algorithm.
Step 2: Find minimal energy (least amount of edges crossed) path from top to bottom or left to right (graph-cut algorithm).
Step 3: Insert pixels along that path (interpolated from neighbors)
Step 4: Repeat steps 2 and 3 as necessary.

Remove objects:
Step 1: Run an edge detection algorithm.
Step 2: Mask object by giving its pixels low/negative energy values.
Step 3: Find minimal energy (least amount of edges crossed) path from top to bottom or left to right (graph-cut algorithm).
Step 4: Remove pixels along that path.
Step 5: Repeat steps 3 and 4 as necessary.
• #### Re:A picture speaks a thousand words... (Score:5, Informative)

on Saturday August 25, 2007 @07:58PM (#20357923)
It's not removing any more pixels than normal resizing or cropping would, it's just doing it such that the least important ones are removed first. Instead of:

he uic bownfoxjumed verthelaz yelowdog

You get:

Th qik brwn fx jmpd ovr th lzy ylo dog

Which reduces the total size by the same amount, but retains more information than treating every bit of information the same.
• #### Re:The Commissar Vanishes (Score:2, Informative)

on Saturday August 25, 2007 @09:48PM (#20358427) Journal
• #### Re:The paper via ACM (Score:2, Informative)

on Saturday August 25, 2007 @10:23PM (#20358579)
This excellent website http://trowley.org/sig2007.html [trowley.org] has a host of links to almost all of the papers presented at SIGGRAPH 2007.
• #### Re:DP Approach (Score:3, Informative)

on Saturday August 25, 2007 @11:18PM (#20359033)

Also the paper doesn't go into too much details about the dynamic programming approach they used to find the path of least energy, I guess that aspect of it is patentable.

Not so much patentable, as "Easy enough for the reader to implement that it deserves little mention."

• #### Ariel Shamir (Score:3, Informative)

on Saturday August 25, 2007 @11:32PM (#20359121) Homepage
... not to be confused with Adi Shamir [wikipedia.org] (the cryptographer).
• #### Video is on youtube.... (Score:3, Informative)

on Sunday August 26, 2007 @02:23AM (#20360109) Homepage Journal
Been up for a while now too, at least I saw it a few days ago...