LCIS: A Boundary Hierarchy For Detail-Preserving Contrast Reduction Jack Tumblin and Greg Turk Georgia Institute of Technology SIGGRAPH 1999 Presented.

Slides:



Advertisements
Similar presentations
An Active contour Model without Edges
Advertisements

Boundary Detection - Edges Boundaries of objects –Usually different materials/orientations, intensity changes.
Spatial Filtering (Chapter 3)
Image Processing Lecture 4
EDGE DETECTION ARCHANA IYER AADHAR AUTHENTICATION.
Johann Radon Institute for Computational and Applied Mathematics: 1/39 The Gaussian Kernel, Regularization.
2D/3D Shape Manipulation, 3D Printing
Lecture 4 Edge Detection
Computational Photography Prof. Feng Liu Spring /15/2015.
Image Filtering CS485/685 Computer Vision Prof. George Bebis.
1 Image filtering Hybrid Images, Oliva et al.,
Announcements Mailing list: –you should have received messages Project 1 out today (due in two weeks)
MSU CSE 803 Stockman Linear Operations Using Masks Masks are patterns used to define the weights used in averaging the neighbors of a pixel to compute.
Computer Vision Introduction to Image formats, reading and writing images, and image environments Image filtering.
Edge Detection Today’s reading Forsyth, chapters 8, 15.1
Lecture 1: Images and image filtering
CS485/685 Computer Vision Dr. George Bebis
1 Image filtering
Modeling Fluid Phenomena -Vinay Bondhugula (25 th & 27 th April 2006)
Matlab Tutorial Continued Files, functions and images.
Edge Detection Today’s readings Cipolla and Gee –supplemental: Forsyth, chapter 9Forsyth Watt, From Sandlot ScienceSandlot Science.
EE565 Advanced Image Processing Copyright Xin Li Different Frameworks for Image Processing Statistical/Stochastic Models: Wiener’s MMSE estimation.
Lecture 2. Intensity Transformation and Spatial Filtering
MSU CSE 803 Linear Operations Using Masks Masks are patterns used to define the weights used in averaging the neighbors of a pixel to compute some result.
Linear Filtering About modifying pixels based on neighborhood. Local methods simplest. Linear means linear combination of neighbors. Linear methods simplest.
Post-rendering Cel Shading & Bloom Effect
Motivation from Real-World Applications EE565 Advanced Image Processing Copyright Xin Li Noisy Photos Noisy ultrasound data.
Tone mapping with slides by Fredo Durand, and Alexei Efros Digital Image Synthesis Yung-Yu Chuang 11/08/2005.
September 10, 2012Introduction to Artificial Intelligence Lecture 2: Perception & Action 1 Boundary-following Robot Rules 1  2  3  4  5.
Smoothed Particle Hydrodynamics (SPH) Fluid dynamics The fluid is represented by a particle system Some particle properties are determined by taking an.
Anisotropic Diffusion Summing of the article “scale-space and edge detection using anisotropic diffusion” By Pietro Perona And Jitendra Malik Nerya Agam.
Image Processing Jitendra Malik. Different kinds of images Radiance images, where a pixel value corresponds to the radiance from some point in the scene.
Digital Image Processing Lecture 10: Image Restoration March 28, 2005 Prof. Charlene Tsai.
A Gentle Introduction to Bilateral Filtering and its Applications Sylvain Paris – MIT CSAIL Pierre Kornprobst – INRIA Odyssée Jack Tumblin – Northwestern.
Effective Optical Flow Estimation
Digital Image Processing Lecture 10: Image Restoration
Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 15/16 – TP7 Spatial Filters Miguel Tavares Coimbra.
1 Dr. Scott Schaefer Diffusion Curves. 2/38 Diffusion Curves Vector graphics-based representation for 2D images Images are piecewise smooth with discontinuities.
CSE 6367 Computer Vision Image Operations and Filtering “You cannot teach a man anything, you can only help him find it within himself.” ― Galileo GalileiGalileo.
03/03/03© 2003 University of Wisconsin Last Time Subsurface scattering models Sky models.
Tone mapping Digital Visual Effects, Spring 2007 Yung-Yu Chuang 2007/3/13 with slides by Fredo Durand, and Alexei Efros.
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Basic idea Input Image, I(x,y) (spatial domain) Mathematical Transformation.
Scale-Space and Edge Detection Using Anisotropic Diffusion Presented By:Deepika Madupu Reference: Pietro Perona & Jitendra Malik.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Instructor: Mircea Nicolescu Lecture 7
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
Lecture 1: Images and image filtering CS4670/5670: Intro to Computer Vision Noah Snavely Hybrid Images, Oliva et al.,
1 Edge Operators a kind of filtering that leads to useful features.
Spatial Filtering (Chapter 3) CS474/674 - Prof. Bebis.
Miguel Tavares Coimbra
Digital Image Processing
PDE Methods for Image Restoration
- photometric aspects of image formation gray level images
Digital Image Processing CSC331
Scale Invariant Feature Transform (SIFT)
Digital Image Processing Lecture 10: Image Restoration
Edge Detection CS485/685 Computer Vision Dr. George Bebis.
Fast Bilateral Filtering for the Display of High-Dynamic-Range Images
Image Processing - in short
Lecture 2: Edge detection
Contourlet Transforms For Feature Detection
a kind of filtering that leads to useful features
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
Diffusion Curves Dr. Scott Schaefer.
a kind of filtering that leads to useful features
Digital Visual Effects, Spring 2006 Yung-Yu Chuang 2006/3/8
Linear Operations Using Masks
Magnetic Resonance Imaging
Lecture 1: Images and image filtering
Winter in Kraków photographed by Marcin Ryczek
Presentation transcript:

LCIS: A Boundary Hierarchy For Detail-Preserving Contrast Reduction Jack Tumblin and Greg Turk Georgia Institute of Technology SIGGRAPH 1999 Presented by Rob Glaubius Jack Tumblin and Greg Turk Georgia Institute of Technology SIGGRAPH 1999 Presented by Rob Glaubius

Motivation  Detail visible almost everywhere in a scene  Difficult to capture rich detail in high- contrast scenes  CRT contrast: 100:1  Target scene contrast: ~100,000:1  Detail visible almost everywhere in a scene  Difficult to capture rich detail in high- contrast scenes  CRT contrast: 100:1  Target scene contrast: ~100,000:1

Motivation  Simple scene intensity adjustment I d = F(m·I s  ) I d : display intensity I s : scene intensity m: scale factor  : compression/expansion term F: enforces boundary conditions  Simple scene intensity adjustment I d = F(m·I s  ) I d : display intensity I s : scene intensity m: scale factor  : compression/expansion term F: enforces boundary conditions

LCIS - A Preview  “Mathematically mimic a well-known artistic technique for rendering high contrast scenes”  Coarse-to-fine rendering of boundaries and shading  “Mathematically mimic a well-known artistic technique for rendering high contrast scenes”  Coarse-to-fine rendering of boundaries and shading

LCIS - A Preview  Low Curvature Image Simplifier  Hierarchy of sharp boundaries and smooth shadings  Goal - low contrast, highly detailed images  Low Curvature Image Simplifier  Hierarchy of sharp boundaries and smooth shadings  Goal - low contrast, highly detailed images

LCIS vs. Linear Filter Hierarchies

Anisotropic Diffusion  Treat intensity as heat fluid  Temperature wants to flow from hot to cold I t =  ·(C(x,y,t)  I) I t : derivative of temperature change w.r.t. time C : Conductivity  Constant conductivity  repeated convolution with a Gaussian filter (isotropic diffusion)  Treat intensity as heat fluid  Temperature wants to flow from hot to cold I t =  ·(C(x,y,t)  I) I t : derivative of temperature change w.r.t. time C : Conductivity  Constant conductivity  repeated convolution with a Gaussian filter (isotropic diffusion)

Anisotropic Diffusion, cont’d Conductivity depends on image - as local “edginess” increases, conductivity decreases C(x,y,t) = g(||  I||) where g(m) = (1+(m/K) 2 ) -1 K is a conductance threshold for m Conductivity depends on image - as local “edginess” increases, conductivity decreases C(x,y,t) = g(||  I||) where g(m) = (1+(m/K) 2 ) -1 K is a conductance threshold for m

Anisotropic Diffusion Illustrated

LCIS vs. Anisotropic Diffusion

LCIS - Theory  3 rd order derivatives instead of 2 nd order  Equalize curvature rather than intensity I t (x,y,t) =  ·(C(x,y,t)F(x,y,t))  F: motive force from high to low curvature F = (I xxx + I yyx, I xxy + I yyy )  C: Conductivity C(x,y,t) = g(0.5(I 2 xx + I 2 yy ) + I 2 xy )  3 rd order derivatives instead of 2 nd order  Equalize curvature rather than intensity I t (x,y,t) =  ·(C(x,y,t)F(x,y,t))  F: motive force from high to low curvature F = (I xxx + I yyx, I xxy + I yyy )  C: Conductivity C(x,y,t) = g(0.5(I 2 xx + I 2 yy ) + I 2 xy )

LCIS - Implementation  Discrete images, so quantities are approximate, based on 4-connected neighbors and a constant time step

LCIS Hierarchy Convert (R in,G in,B in )  LCIS K 0 = 0 LCIS K 1 LCIS K 2 LCIS K (R out,G out,B out ) exp()  w color w0w0 w1w1 w2w2 w3w3 log(L) log(R/L,G/L,B/L)