Image recoloring induced by palette color associations Gary R. Greenfield, Donald H. House University of Richmond, Texas A&M University WSCG ' 2003.

Slides:



Advertisements
Similar presentations
Road-Sign Detection and Recognition Based on Support Vector Machines Saturnino, Sergio et al. Yunjia Man ECG 782 Dr. Brendan.
Advertisements


November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Chapter 8 Content-Based Image Retrieval. Query By Keyword: Some textual attributes (keywords) should be maintained for each image. The image can be indexed.
Color spaces CIE - RGB space. HSV - space. CIE - XYZ space.
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
Color Image Processing
2004/05/03 Clustering 1 Clustering (Part One) Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
Tutorial 2 – Computational Geometry
A new approach for modeling and rendering existing architectural scenes from a sparse set of still photographs Combines both geometry-based and image.
EE 7730 Image Segmentation.
Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.
Natural and Seamless Image Composition Wenxian Yang, Jianmin Zheng, Jianfei Cai, Senior Member, IEEE, Susanto Rahardja, Senior Member, IEEE, and Chang.
Apparent Greyscale: A Simple and Fast Conversion to Perceptually Accurate Images and Video Kaleigh SmithPierre-Edouard Landes Joelle Thollot Karol Myszkowski.
Texture Synthesis on Surfaces Paper by Greg Turk Presentation by Jon Super.
Visual Querying By Color Perceptive Regions Alberto del Bimbo, M. Mugnaini, P. Pala, and F. Turco University of Florence, Italy Pattern Recognition, 1998.
Smart Traveller with Visual Translator for OCR and Face Recognition LYU0203 FYP.
Clustering Ram Akella Lecture 6 February 23, & 280I University of California Berkeley Silicon Valley Center/SC.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
Image processing Lecture 4.
Input: Original intensity image. Target intensity image (i.e. a value sketch). Using Value Images to Adjust Intensity in 3D Renderings and Photographs.
Tal Mor  Create an automatic system that given an image of a room and a color, will color the room walls  Maintaining the original texture.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Digital Images The digital representation of visual information.
Chapter 10: Image Segmentation
CS 376b Introduction to Computer Vision 04 / 02 / 2008 Instructor: Michael Eckmann.
Efficient Editing of Aged Object Textures By: Olivier Clément Jocelyn Benoit Eric Paquette Multimedia Lab.
Color Correct and Remove Keystoning A minimalist approach to photographing your art By Paul Marley.
Graph-based Segmentation. Main Ideas Convert image into a graph Vertices for the pixels Vertices for the pixels Edges between the pixels Edges between.
CSE554AlignmentSlide 1 CSE 554 Lecture 5: Alignment Fall 2011.
Digital Image Processing CCS331 Relationships of Pixel 1.
1 COMS 161 Introduction to Computing Title: Digital Images Date: November 12, 2004 Lecture Number: 32.
Stylization and Abstraction of Photographs Doug Decarlo and Anthony Santella.
Chapter 10, Part II Edge Linking and Boundary Detection The methods discussed in the previous section yield pixels lying only on edges. This section.
Introduction Image geometry studies rotation, translation, scaling, distortion, etc. Image topology studies, e.g., (i) the number of occurrences.
CS 376b Introduction to Computer Vision 03 / 21 / 2008 Instructor: Michael Eckmann.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
CS654: Digital Image Analysis
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Automatic License Plate Location Using Template Matching University of Wisconsin - Madison ECE 533 Image Processing Fall 2004 Project Kerry Widder.
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Hybrid Algorithms K. H. Ko School of Mechatronics Gwangju Institute.
Machine Vision ENT 273 Regions and Segmentation in Images Hema C.R. Lecture 4.
1 Mathematic Morphology used to extract image components that are useful in the representation and description of region shape, such as boundaries extraction.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities May 2, 2005 Prof. Charlene Tsai.
Robotics Chapter 6 – Machine Vision Dr. Amit Goradia.
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
Digital Image Processing, 3rd ed. © 1992–2008 R. C. Gonzalez & R. E. Woods Gonzalez & Woods Chapter 11 Representation and.
Color Image Segmentation Mentor : Dr. Rajeev Srivastava Students: Achit Kumar Ojha Aseem Kumar Akshay Tyagi.
May 2003 SUT Color image segmentation – an innovative approach Amin Fazel May 2003 Sharif University of Technology Course Presentation base on a paper.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
April 21, 2016Introduction to Artificial Intelligence Lecture 22: Computer Vision II 1 Canny Edge Detector The Canny edge detector is a good approximation.
Graph-based Segmentation
Machine Vision ENT 273 Lecture 4 Hema C.R.

Image Representation and Description – Representation Schemes
Graphcut Textures:Image and Video Synthesis Using Graph Cuts
Color Image Processing
Color Image Processing
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Computer Vision Lecture 13: Image Segmentation III
Color Image Processing
Mean Shift Segmentation
K Nearest Neighbor Classification
Computer Vision Lecture 16: Texture II
Color Image Processing
COMS 161 Introduction to Computing
Color Image Processing
Comparing Images Using Hausdorff Distance
Presentation transcript:

Image recoloring induced by palette color associations Gary R. Greenfield, Donald H. House University of Richmond, Texas A&M University WSCG ' 2003

Introduction The idea of transferring the color content from one image to another is not new [Rei01]. Our goal in this paper is to investigate the problem of transferring the color scheme of a source image to a destination image automatically.

Introduction We take into consideration two ideas classically trained painters:  Paintings should be organized by value – the pattern of lights and darks.  To develop a painting on canvas. These ideas furnish two cornerstones for our design:  The value patterns of the destination image should survive color transfer from the source.  An image should be “deconstructed” using an image pyramid.

Background Reinhard et al. [Rei01] is best suited for working with images (or portions of images) whose palettes are similar. Their results are quite dramatic and successful. A key contribution of their paper is the identification of the Lαβ color space of Ruderman et al.

Algorithm Color segmentation The image pyramid Palette construction Palette color association Pixel level color transfer

Color segmentation Our primary objectives  It can be analyzed for artistic intent.  It can be quantitatively transferred from one image to another. To handle both objectives simultaneously, we construct regions of pixels bottom-up using a region-merging algorithm that assigns binary trees to regions. Colors obtained by averaging color over all the pixels within a region are used when we need to determine artistic intent, and binary trees are used when we need to transfer color texture.

Color segmentation Geometrically, a pixel consists of a vertex, left and top edges, and a face. The vertex is determined by the pixel’s row and column. The geometry of pixels Associated with each edge is a flag for determining whether or not the edge is currently serving as a boundary between two regions of pixels, and a time stamp for remembering which merge event caused the edge to become converted from a boundary edge to an interior edge.

Color segmentation A region is represented by a binary tree whose leaves are pixels, and has an identifier, area, average color, height, a flag, and a distinguished pixel. Any two active adjacent regions are candidates to be merged to form a new active region. During a scanline traversal, edges of the pixel that are boundaries with adjacent pixels are placed into a priority queue. The merge priority of an edge is defined to be the inverse of the sum of the squares of the color component differences across the edge, computed in Lαβ space.

The image pyramid We organize each digital image into a pyramid. Our down sampling method is nonstandard. The apex forms one “logical” active region. To descend through an image pyramid, we select an active region in the current layer and we mask those pixels in the layer directly beneath which can be projected back up to pixels in the region selected. We repeat the process on down to the base.

The image pyramid We can usually achieve good approximations to the color organization for the image. One problem that arises is that there can be too many small regions (areas contain highlights, shadows, and transitional colors). Some of these small regions consist of single never-merged accent pixels, whose boundary edges are of such low merge priority that continued merging will preserve these “rogue” regions at the expense of the structural integrity of the composition as a whole.

The image pyramid To help prevent image corruption, we interrupt the region merging algorithm before the major structural elements are lost and work the rogue regions into the merged framework by absorption until the desired granularity is obtained.

The image pyramid Largest nearest neighborsSmallest nearest neighbors Never merged pixels

Palette construction Our first step is to compensate for this color duplication within the set of segmented colors. We partition the set of segmented colors into subsets of colors and select one color representative from each subset. These representatives form the set of identified colors. Identifying duplicate colors

Palette construction The color chosen as the canonical representative for a subset is the one that is associated to the region having the largest area. Working in RGB space, we define two colors to be perceptually identical provided their Euclidean distance does not exceed a specified threshold. space is not appropriate. “Starry Night” 159 colors -> 22 colors “Skulls” 119 colors -> 13 colors

We want a bare minimum number of colors. We must account for the fact that within the set of identified colors there may be a number of shades of a given color. We need to partition the set of identified colors into subsets such that all colors within a subset are similar up to shading. “Starry Night” 22 colors -> 10 colors “Skulls” 13 colors -> 8 colors Palette construction

Palettes for the low resolution test images

Palette color association An anchor pairing between source and destination based on largest areas. Within each palette, the mean and standard deviation of each component is calculated, and all components are replaced by their z-scores, i.e. the number of standard deviations from the mean. We then translate a second time so that the anchor color remains at the origin.

Palette color association To encourage the colors representing the second largest areas to be paired, we rotate each normalized palette around its L-axis so that the β components of the normalized colors corresponding to the second largest summed areas are zero. Associate to each normalized, rotated color in the destination palette the color in the source palette that is closest to under Euclidean distance measure. Source colors Corrected source colors Destination colors Palette color associations for the test images.

Pixel level color transfer There is insufficient space for the full details, but our traversal algorithm has the following properties:  If presented with identical trees it pairs identical pixels  If a source pixel is transferred to a destination region  If a source region is transferred to a destination pixel  When neither the source region nor destination region is a leaf

Pixel level color transfer region pixel

Color correction Two problems arise:  Color corruption due to large discrepancies in the L channels i.e. excessive lightening or darkening of a color If destination image value>source image value then attenuate  Out-of-gamut colors due to significant differences in hues 96-th percentile Source colors Correct source colors

result A recoloring of “Starry Night” with itself. The original is on the left, and the recoloring is on the right.

result High resolution recoloring of “Skulls” by “Starry Night.”

result Source Destination

Conclusion We attempted to establish a framework to investigate the problem of transferring the chromatic content from one image to another in such a way that its artistic intent was preserved. To summarize, we feel that the key problems that remain are:  Deciding which colors within a palette are the most important ones to use for associations  Establishing “rule sets” for making color associations between palettes  Refining color associations while descending through an image pyramid  Making color transfer decisions that keep colors in gamut.

Conclusion We attempted to establish a framework to investigate the problem of transferring the chromatic content from one image to another in such a way that its artistic intent was preserved. To summarize, we feel that the key problems that remain are:  deciding which colors within a palette are the most important ones to use for associations  establishing “rule sets” for making color associations between palettes  refining color associations while descending through an image pyramid  making color transfer decisions that keep colors in gamut.