Kyoungju Park kjpark@cau.ac.kr http://graphics.cau.ac.kr Computer Graphics Kyoungju Park kjpark@cau.ac.kr http://graphics.cau.ac.kr.

Slides:



Advertisements
Similar presentations
Image Processing … computing with and about data, … where "data" includes the values and relative locations of the colors that make up an image.
Advertisements

3-D Computer Vision CSc83020 / Ioannis Stamos  Revisit filtering (Gaussian and Median)  Introduction to edge detection 3-D Computater Vision CSc
CS Spring 2009 CS 414 – Multimedia Systems Design Lecture 4 – Digital Image Representation Klara Nahrstedt Spring 2009.
Spatial Filtering (Chapter 3)
Digital Image Processing In The Name Of God Digital Image Processing Lecture3: Image enhancement M. Ghelich Oghli By: M. Ghelich Oghli
Computer Vision Introduction to Image formats, reading and writing images, and image environments Image filtering.
Lecture 1: Images and image filtering
Image representation using arrays Image processing examples
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.
Announcements Kevin Matzen office hours – Tuesday 4-5pm, Thursday 2-3pm, Upson 317 TA: Yin Lou Course lab: Upson 317 – Card access will be setup soon Course.
1 Image filtering Images by Pawan SinhaPawan Sinha.
Lecture 2: Image filtering
Matlab Tutorial Continued Files, functions and images.
Image Processing Point Processing Filters Dithering Image Compositing
Image Analysis Preprocessing Arithmetic and Logic Operations Spatial Filters Image Quantization.
Computer Vision Lecture 3: Digital Images
Image Filtering. Problem! Noise is a problem, even in images! Gaussian NoiseSalt and Pepper Noise.
Most slides from Steve Seitz
Lecture 1: Images and image filtering CS4670/5670: Intro to Computer Vision Kavita Bala Hybrid Images, Oliva et al.,
IIS for Image Processing Michael J. Watts
Machine Vision ENT 273 Image Filters Hema C.R. Lecture 5.
CS559: Computer Graphics Lecture 3: Digital Image Representation Li Zhang Spring 2008.
Computer Vision – Enhancement(Part II) Hanyang University Jong-Il Park.
University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Image processing.
Multimedia Data Introduction to Image Processing Dr Sandra I. Woolley Electronic, Electrical.
Lecture 03 Area Based Image Processing Lecture 03 Area Based Image Processing Mata kuliah: T Computer Vision Tahun: 2010.
Image processing Fourth lecture Image Restoration Image Restoration: Image restoration methods are used to improve the appearance of an image.
Why is computer vision difficult?
Introduction to Image processing using processing.
Linear filtering. Motivation: Noise reduction Given a camera and a still scene, how can you reduce noise? Take lots of images and average them! What’s.
Machine Vision ENT 273 Image Filters Hema C.R. Lecture 5.
Image Subtraction Mask mode radiography h(x,y) is the mask.
Intelligent Vision Systems ENT 496 Image Filtering and Enhancement Hema C.R. Lecture 4.
Non-Linear Transformations Michael J. Watts
Filtering the Images.  Filtering images using low-pass filters  Filtering images using a median filter  Applying directional filters to detect edges.
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
CSE 185 Introduction to Computer Vision Image Filtering: Spatial Domain.
Grauman Today: Image Filters Smooth/Sharpen Images... Find edges... Find waldo…
Lecture 1: Images and image filtering CS4670/5670: Intro to Computer Vision Noah Snavely Hybrid Images, Oliva et al.,
Non-linear filtering Example: Median filter Replaces pixel value by median value over neighborhood Generates no new gray levels.
Images and 2D Graphics COMP
Miguel Tavares Coimbra
Image Subtraction Mask mode radiography h(x,y) is the mask.
Program Studi S-1 Teknik Informatika FMIPA Universitas Padjadjaran
David Meredith Aalborg University
ECE 692 – Advanced Topics in Computer Vision
Practical TULIP lecture next Tues 12th Feb. Wed 13th Feb 11-1 am.
IIS for Image Processing
Math 3360: Mathematical Imaging
Sampling Theorem told us …
Histogram Histogram is a graph that shows frequency of anything. Histograms usually have bars that represent frequency of occuring of data. Histogram has.
Lecture 1: Images and image filtering
Recap from Wednesday Spectra and Color Light capture in cameras and humans.
Computer Vision Lecture 3: Digital Images
Image Enhancement in the Spatial Domain
9th Lecture - Image Filters
Image filtering Images by Pawan Sinha.
Linear filtering.
Digital Image Processing Week IV
Harris detector Convert image to greyscale
Magnetic Resonance Imaging
Lecture 2: Image filtering
Lecture 1: Images and image filtering
Intensity Transformation
Image Filtering Readings: Ch 5: 5. 4, 5. 5, 5. 6, , 5
Image Filtering with GLSL
Lecture 7 Spatial filtering.
REDUKSI NOISE Pertemuan-8 John Adler
Review and Importance CS 111.
Even Discrete Cosine Transform The Chinese University of Hong Kong
Presentation transcript:

Kyoungju Park kjpark@cau.ac.kr http://graphics.cau.ac.kr Computer Graphics Kyoungju Park kjpark@cau.ac.kr http://graphics.cau.ac.kr

Image Processing 2D generalization of signal processing Image as a two-dimensional signal Point processing: modify pixels independently Filtering: modify based on neighborhood Compositing: combine several images Image compression: space-efficient formats Related topics (not in this lecture or this course) Image enhancement and restoration Computer vision

Outline Point Processing Filters Dithering Image Compositing Image Compression

Point Processing f(v) = v identity; no change f(v) = 1-v negate an image (black to white, white to black) f(v) = vp, p<1 brighten f(v) = vp, p>1 darken f(v) v Processing Examples -> Topics -> Image Processing->Brightness

PImage img; void setup() { size(200, 200); frameRate(30); img = loadImage("wires.jpg"); } void draw() { loadPixels(); for (int x = 0; x < img.width; x++) { for (int y = 0; y < img.height; y++ ) { int loc = x + y*img.width; float r = red (img.pixels[loc]); float maxdist = 50; float d = dist(x,y,mouseX,mouseY); float adjustbrightness = 255*(maxdist-d)/maxdist; r += adjustbrightness; color c = color(r); pixels[loc] = c; } updatePixels();

Convolution filters gaussian box tent

PImage img; int w = 80; float[][] matrix = { { -1, -1, -1 }, { -1, 9, -1 }, { -1, -1, -1 } }; void setup() { size(200, 200); frameRate(30); img = loadImage("end.jpg"); } void draw() { image(img,0,0); int matrixsize = 3; loadPixels(); for (int x = width/4; x < 3*width/4; x++) { for (int y = height/4; y < 3*height/4; y++ ) { color c = convolution(x,y,matrix,matrixsize,img); int loc = x + y*img.width; pixels[loc] = c; updatePixels();

color convolution(int x, int y, float[][] matrix,int matrixsize, PImage img) { float rtotal = 0.0; float gtotal = 0.0; float btotal = 0.0; int offset = matrixsize / 2; for (int i = 0; i < matrixsize; i++){ for (int j= 0; j < matrixsize; j++){ int loc = (x + i - offset) + img.width*(y + j - offset); rtotal += (red(img.pixels[loc]) * matrix[i][j]); gtotal += (green(img.pixels[loc]) * matrix[i][j]); btotal += (blue(img.pixels[loc]) * matrix[i][j]); } return color(rtotal,gtotal,btotal);

Blurring Filters A simple blurring effect can be achieved with a 3x3 filter centered around a pixel, More blurring is achieved with a wider nn filter: Original Image Blur 3x3 mask Blur 7x7 mask

Image Filtering: Blurring original, 64x64 pixels 3x3 blur 5x5 blur

Blurring Filters Average values of surrounding pixels Can be used for anti-aliasing What do we do at the edges and corners? For noise reduction, use median, not average Eliminates intensity spikes Non-linear filter Processing Examples -> Topics -> Image Processing->Blur

Example: Noise Reduction Image with noise Median filter (5x5)

Example: Noise Reduction Original image Image with noise Median filter (5x5)

Example of Edge Filter Original image Edge filter, then brightened

Image Filtering: Edge Detection

Dithering Dithering takes advantage of the human eye's tendency to "mix" two colors in close proximity to one another.

Dithering Dithering takes advantage of the human eye's tendency to "mix" two colors in close proximity to one another. original no dithering with dithering Colors = 224 Colors = 28 Colors = 28

Floyd-Steinberg Error Diffusion

Floyd-Steinberg Error Diffusion Enhances edges Retains high frequency Some checkerboarding From http://www.cs.rit.edu/~pga/pics2000/node1.html