# US 8,280,186 B1 · Seam-based reduction and expansion of images with table-based priority

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 8,280,186 B1
- Document ID: US8280186B1
- Status: Granted
- Kind: B1
- Application number: 12/184,039
- Filed: 2008-07-31
- Granted: 2012-10-02
- Earliest claimed: 2008-07-31
- Assignees: Adobe Systems Incorporated
- Inventors: Shmuel Avidan; Jen-Chan Chien; Chintan Intwala
- Web page: https://patentgrep.com/patent/US8280186B1

## CPC

- G06T 3/04: Context-preserving transformations, e.g. by using an importance map (panospheric to cylindrical image transformations G06T3/12)
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

A system and method for expansion and reduction of images uses a look-up table to define an arbitrary mapping of data (e.g., pixel values) representing an image to respective energy values. Each pixel value may represent an absolute color or intensity value, a difference in color or intensity values, or an average, derivative, minimum, or maximum of two or more pixel values. The energy values may then be used to determine one or more low-cost seams of the image to be removed for an image reduction operation or replicated for an image expansion operation, where the cost of each seam is dependent on the energy values of the pixels of the seam. The look-up table may be used to apply a threshold and/or cap on the energy values mapped to pixel values. The look-up table may also provide a mechanism for reconfiguring mappings, thresholds, and/or caps.

## Claims

### Claim 1

A system, comprising:
one or more processors; and
a memory coupled to the one or more processors and storing program instructions executable by the one or more processors to implement:
accessing data representing an image;
accessing a look-up table defining a mapping of pixel values to respective energy values, wherein the energy values indicate the importance of each pixel with respect to resizing operations;
determining a respective energy value for each pixel of the image dependent on said mapping;
identifying a seam of the image having a lowest cost, wherein the cost of the seam is dependent on the respective energy values of pixels of the seam; and
performing a resizing operation on the image along the identified seam to produce a resized version of the image.

### Claim 2 (depends on 1)

The system of claim 1, wherein the program instructions are further executable to implement repeating said identifying and said performing for a next lowest cost seam until the resized version of the image meets a specified target size or a specified target aspect ratio.

### Claim 3 (depends on 1)

The system of claim 1,
wherein the resizing operation comprises a reduction operation; and
wherein said performing comprises removing the pixels of the seam.

### Claim 4 (depends on 1)

The system of claim 1,
wherein the resizing operation comprises an expansion operation; and
wherein said performing comprises replicating the pixels of the seam and inserting the replicated pixels into the image.

### Claim 5 (depends on 1)

The system of claim 1, wherein the cost of the seam is dependent on one or more of: a sum of the respective energy values of all pixels of the seam, an average of the respective energy values of all pixels of the seam a weighted average of the respective energy values of all pixels of the seam, or a maximum value of the respective energy values of all pixels of the seam.

### Claim 6 (depends on 1)

The system of claim 1, wherein said identifying a seam of the image having a lowest cost comprises identifying a shortest path across the image.

### Claim 7 (depends on 1)

The system of claim 1, wherein said identifying a seam of the image having a lowest cost comprises applying a dynamic programming technique.

### Claim 8 (depends on 1)

The system of claim 1, wherein the look-up table maps one or more ranges of pixel values to respective energy values.

### Claim 9 (depends on 1)

The system of claim 1, wherein the look-up table maps a pre-defined maximum or minimum energy value to two or more pixel values.

### Claim 10 (depends on 9)

The system of claim 9, wherein the two or more pixel values are determined dependent on a pixel value threshold.

### Claim 11 (depends on 1)

The system of claim 1, wherein the program instructions are further executable to implement modifying the mapping of pixel values to respective energy values in the look-up table.

### Claim 12 (depends on 11)

The system of claim 11, wherein said modifying the mapping is dependent on user input.

### Claim 13 (depends on 1)

The system of claim 1, wherein each of the pixel values mapped to respective energy values represents one or more of: an absolute color value, an absolute intensity value, a difference in color values, a difference in intensity values, a derivative of two or more pixel values, an average of two or more pixel values, a maximum of two or more pixel values, or a minimum of two or more pixel values.

### Claim 14 (depends on 1)

The system of claim 1, wherein the one or more processors comprise at least one of: a general-purpose central processing unit (CPU), or a graphics processing unit (GPU).

### Claim 15

A non-transitory computer-readable storage medium, storing program instructions computer-executable to implement:
accessing data representing an image;
accessing a look-up table defining a mapping of pixel values to respective energy values, wherein the energy values indicate the importance of each pixel with respect to resizing operations;
determining a respective energy value for each pixel of the image dependent on said mapping;
identifying a seam of the image having a lowest cost, wherein the cost of the seam is dependent on the respective energy values of pixels of the seam; and
performing a resizing operation on the image along the identified seam to produce a resized version of the image.

### Claim 16 (depends on 15)

The storage medium of claim 15, wherein the program instructions are further executable to implement repeating said identifying and said performing for a next lowest cost seam until the resized version of the image meets a specified target size or a specified target aspect ratio.

### Claim 17 (depends on 15)

The storage medium of claim 15,
wherein the resizing operation comprises a reduction operation; and
wherein said performing comprises removing the pixels of the seam.

### Claim 18 (depends on 15)

The storage medium of claim 15,
wherein the resizing operation comprises an expansion operation; and
wherein said performing comprises replicating the pixels of the seam and inserting the replicated pixels into the image.

### Claim 19 (depends on 15)

The storage medium of claim 15, wherein the cost of the seam is dependent on one or more of: a sum of the respective energy values of all pixels of the seam, an average of the respective energy values of all pixels of the seam, a weighted average of the respective energy values of all pixels of the seam, or a maximum value of the respective energy values of all pixels of the seam.

### Claim 20 (depends on 15)

The storage medium of claim 15, wherein said identifying a seam of the image having a lowest cost comprises one or more of: identifying a shortest path across the image or applying a dynamic programming technique.

### Claim 21 (depends on 15)

The storage medium of claim 15, wherein the look-up table maps one or more ranges of pixel values to respective energy values.

### Claim 22 (depends on 15)

The storage medium of claim 15, wherein the look-up table maps a pre-defined maximum or minimum energy value to two or more pixel values.

### Claim 23 (depends on 22)

The storage medium of claim 22, wherein the two or more pixel values are determined dependent on a pixel value threshold.

### Claim 24 (depends on 15)

The storage medium of claim 15, wherein the program instructions are further executable to implement modifying the mapping of pixel values to respective energy values in the look-up table.

### Claim 25 (depends on 15)

The storage medium of claim 15, wherein each of the pixel values mapped to respective energy values represents one or more of: an absolute color value, an absolute intensity value, a difference in color values, a difference in intensity values, a derivative of two or more pixel values, an average of two or more pixel values, a maximum of two or more pixel values, or a minimum of two or more pixel values.

### Claim 26

A computer-implemented method, comprising:
accessing data representing an image;
accessing a look-up table defining a mapping of pixel values to respective energy values, wherein the energy values indicate the importance of each pixel with respect to resizing operations;
determining a respective energy value for each pixel of the image dependent on said mapping;
identifying a seam of the image having a lowest cost, wherein the cost of the seam is dependent on the respective energy values of pixels of the seam; and
performing a resizing operation on the image along the identified seam to produce a resized version of the image.

### Claim 27 (depends on 26)

The method of claim 26, further comprising repeating said identifying and said performing for a next lowest cost seam until the resized version of the image meets a specified target size or a specified target aspect ratio.

### Claim 28 (depends on 26)

The method of claim 26,
wherein the resizing operation comprises a reduction operation; and
wherein said performing comprises removing the pixels of the seam.

### Claim 29 (depends on 26)

The method of claim 26,
wherein the resizing operation comprises an expansion operation; and
wherein said performing comprises replicating the pixels of the seam and inserting the replicated pixels into the image.

### Claim 30 (depends on 26)

The method of claim 26, wherein the cost of the seam is dependent on one or more of: a sum of the respective energy values of all pixels of the seam, an average of the respective energy values of all pixels of the seam, a weighted average of the respective energy values of all pixels of the seam, or a maximum value of the respective energy values of all pixels of the seam.

### Claim 31 (depends on 26)

The method of claim 26, wherein said identifying a seam of the image having a lowest cost comprises one or more of: identifying a shortest path across the image or applying a dynamic programming technique.

### Claim 32 (depends on 26)

The method of claim 26, wherein the look-up table maps one or more ranges of pixel values to respective energy values.

### Claim 33 (depends on 26)

The method of claim 26, wherein the look-up table maps a pre-defined maximum or minimum energy value to two or more pixel values.

### Claim 34 (depends on 33)

The method of claim 33, wherein the two or more pixel values are determined dependent on a pixel value threshold.

### Claim 35 (depends on 26)

The method of claim 26, further comprising modifying the mapping of pixel values to respective energy values in the look-up table.

### Claim 36 (depends on 26)

The method of claim 26, wherein each of the pixel values mapped to respective energy values represents one or more of: an absolute color value, an absolute intensity value, a difference in color values, a difference in intensity values, a derivative of two or more pixel values, an average of two or more pixel values, a maximum of two or more pixel values, or a minimum of two or more pixel values.
