A. I. P 9512514 郭瓊蓮 922014 柯瑋明 922508 吳榮軒 Term Project.

Slides:



Advertisements
Similar presentations
CS Spring 2009 CS 414 – Multimedia Systems Design Lecture 4 – Digital Image Representation Klara Nahrstedt Spring 2009.
Advertisements

November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Digital Image Processing
CS & CS Multimedia Processing Lecture 2. Intensity Transformation and Spatial Filtering Spring 2009.
Transforming images to images
Chapter 3 Image Enhancement in the Spatial Domain.
Digital Image Processing
1Ellen L. Walker ImageJ Java image processing tool from NIH Reads / writes a large variety of images Many image processing operations.
Digital Image Processing In The Name Of God Digital Image Processing Lecture3: Image enhancement M. Ghelich Oghli By: M. Ghelich Oghli
Image enhancement in the spatial domain. Human vision for dummies Anatomy and physiology Wavelength Wavelength sensitivity.
AP Statistics Chapter 16. Discrete Random Variables A discrete random variable X has a countable number of possible values. The probability distribution.
CHAPTER 4 Image Enhancement in Frequency Domain
Digital Image Processing
1 Image Filtering Readings: Ch 5: 5.4, 5.5, 5.6,5.7.3, 5.8 (This lecture does not follow the book.) Images by Pawan SinhaPawan Sinha formal terminology.
Image Enhancement.
Fourier Transform and Applications
02/12/02 (c) 2002 University of Wisconsin, CS 559 Filters A filter is something that attenuates or enhances particular frequencies Easiest to visualize.
A Gentle Introduction to Bilateral Filtering and its Applications Limitation? Pierre Kornprobst (INRIA) 0:20.
Fast Bilateral Filtering
Introduction to Image Processing Grass Sky Tree ? ? Review.
High dynamic range imaging. Camera pipeline 12 bits8 bits.
Neighborhood Operations
Interactive Time-Dependent Tone Mapping Using Programmable Graphics Hardware Nolan GoodnightGreg HumphreysCliff WoolleyRui Wang University of Virginia.
Matlab tools for controlling low-level image properties
CIS 601 Image ENHANCEMENT in the SPATIAL DOMAIN Dr. Rolf Lakaemper.
EE663 Image Processing Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
Digital Image Processing Lecture 5: Neighborhood Processing: Spatial Filtering Prof. Charlene Tsai.
Image Processing Edge detection Filtering: Noise suppresion.
03/05/03© 2003 University of Wisconsin Last Time Tone Reproduction If you don’t use perceptual info, some people call it contrast reduction.
Part I: Image Transforms DIGITAL IMAGE PROCESSING.
09/19/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Dithering.
Tone Mapping on GPUs Cliff Woolley University of Virginia Slides courtesy Nolan Goodnight.
Digital Image Processing CSC331 Image Enhancement 1.
DCT.
A Gentle Introduction to Bilateral Filtering and its Applications Sylvain Paris – MIT CSAIL Pierre Kornprobst – INRIA Odyssée Jack Tumblin – Northwestern.
Chapter 5: Neighborhood Processing
Digital Image Processing (Digitaalinen kuvankäsittely) Exercise 2
Digtial Image Processing, Spring ECES 682 Digital Image Processing Oleh Tretiak ECE Department Drexel University.
1.5 Solving Inequalities. Write each inequality using interval notation, and illustrate each inequality using the real number line.
1.7 “Absolute Value” Absolute Value is always positive!! 7 = 7-7 = 7 **When solving equations or inequalities, you MUST set up 2 separate problems, one.
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
HYPR Project Presentation By Nasser Abbasi HYPR Input-Output view.
Digital Image Processing Lecture 5: Neighborhood Processing: Spatial Filtering March 9, 2004 Prof. Charlene Tsai.
Domain x Range y Domain x Range y Domain x Range y n n n1234n n n0123n n + 5 PW page 14 questions.
CS 691B Computational Photography
(c) 2002 University of Wisconsin, CS 559
Image Enhancement in Spatial Domain Presented by : - Mr. Trushar Shah. ME/MC Department, U.V.Patel College of Engineering, Kherva.
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Basic idea Input Image, I(x,y) (spatial domain) Mathematical Transformation.
Unit 1 Rational Numbers Integers.
: Chapter 5: Image Filtering 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Digital Image Processing Lecture 4: Image Enhancement: Point Processing January 13, 2004 Prof. Charlene Tsai.
Sharpening Spatial Filters ( high pass)  Previously we have looked at smoothing filters which remove fine detail  Sharpening spatial filters seek to.
Solve a two-step equation by combining like terms EXAMPLE 2 Solve 7x – 4x = 21 7x – 4x = 21 Write original equation. 3x = 21 Combine like terms. Divide.
Color Image Segmentation Mentor : Dr. Rajeev Srivastava Students: Achit Kumar Ojha Aseem Kumar Akshay Tyagi.
Sampling Rate Conversion by a Rational Factor, I/D
CPSC 6040 Computer Graphics Images
Discrete-time Systems
Filter Design Techniques
Histogram Histogram is a graph that shows frequency of anything. Histograms usually have bars that represent frequency of occuring of data. Histogram has.
A Computational Darkroom for Black-and-White Photography
CSC 381/481 Quarter: Fall 03/04 Daniela Stan Raicu
Digital Visual Effects, Spring 2006 Yung-Yu Chuang 2006/3/8
A Computational Darkroom for BW Photography
Digital Image Processing
Filtering Images Work in the spatial domain
Lecture 2: Image filtering
Intensity Transformation
Winter in Kraków photographed by Marcin Ryczek
Presentation transcript:

A. I. P 郭瓊蓮 柯瑋明 吳榮軒 Term Project

Implement this paper : “Two-scale Tone Management for photographic Look,” Bae, Paris, and Durand. Apply the method to different kind of pictures. Add HDR technique. Subject Review

Algorithm Review model input base detail bilateral filter high pass and local averaging textureness transfer large-scale transfer

Algorithm Review modified base modified detail final output constrained combination postprocess black-and-white output

Our works Our input Our model

Our works Our detail Our base

Our works With edge preserving Without edge preserving

Our works Our result Author’s result

HDR

Uncertainty. Poisson equation. Histogram matching. Textureness. Color channel. Problems

An old problem while using fast bilateral filter. Uncertainty

Cost most time in our pipeline. Use Discrete Sine Transform to reduce time complexity. Easy to implement. Poisson

General Poisson Equation: –I xx + I yy = f For discrete version, we can rewrite the equation to matrix form: –TI + IT = F,where T is a N*N triagonal matrix of {1,-2,1}. Poisson

We define Poisson

DX+XD=B is easy to solve Then we use I=SXS to get final answer. Poisson

In fact, SXS performs 2-D DST on X Implementation steps: –Perform 2-D DST on F –Divide the sum of the corresponding eigenvalue and a constant. –Perform 2-D DST again Poisson

The gray-value in log domain are always negative or zero. The range could be even wider if HDR added. The function implemented by MATLAB can only handle the interval from 0 to 1…… Hist-matching

Input distribution histogram

Hist-matching Mask distribution histogram

Hist-matching Output distribution histogram

Hist-matching Input Output Mask

Textureness ρ p = max( 0, ( T’ p – T(B’) p ) / T(D) p ) T( I ) p = 1/k * ∑ gσ s ( |p – q| ) gσ r ( |I p - I q | )|H| q q ∈ |H| k = ∑ gσ s ( |p – q| ) gσ r ( |I p - I q | ) q ∈ I O = B’ + ρ D H is the high-pass version of the image.

Textureness Input

Textureness High frequency of H

Textureness Absolute value of H

Textureness T

0+

Which color channel could work best? –RGB channel. Process separately. Process intensity only and then interpolate the three channel. –YUV channel. Color Channel

More Images InputModel

More Images InputOutput

More Images Input Model

More Images InputOutput

More Images Input Model

More Images Input Output

More Images Input Model

More Images Input Output

Questions Thanks for your attention.