Technique 6: General gray-level transformations

Slides:



Advertisements
Similar presentations
Environmental Remote Sensing GEOG 2021
Advertisements

This terms course Last term we both worked on learning 2 things –Processing –The concepts of graphics etc. This term will focus more on the basic concepts.
QR Code Recognition Based On Image Processing
CS & CS Multimedia Processing Lecture 2. Intensity Transformation and Spatial Filtering Spring 2009.
6. Gray level enhancement Some of the simplest, yet most useful, image processing operations involve the adjustment of brightness, contrast or colour in.
1Ellen L. Walker ImageJ Java image processing tool from NIH Reads / writes a large variety of images Many image processing operations.
December 5, 2013Computer Vision Lecture 20: Hidden Markov Models/Depth 1 Stereo Vision Due to the limited resolution of images, increasing the baseline.
MIPR Lecture 5 Copyright Oleh Tretiak, Medical Imaging and Pattern Recognition Lecture 5 Image Measurements and Operations Oleh Tretiak.
Detecting Digital Image Forgeries Using Sensor Pattern Noise presented by: Lior Paz Jan Lukas, jessica Fridrich and Miroslav Goljan.
Multimedia Data Introduction to Image Processing Dr Mike Spann Electronic, Electrical and Computer.
Image Analysis Preprocessing Image Quantization Binary Image Analysis
Image Analysis Preprocessing Arithmetic and Logic Operations
1 Vladimir Botchko Lecture 4. Image Enhancement Lappeenranta University of Technology (Finland)
Digital Image Processing
CS 376b Introduction to Computer Vision 02 / 25 / 2008 Instructor: Michael Eckmann.
Image Enhancement.
Image Analysis Preprocessing Arithmetic and Logic Operations Spatial Filters Image Quantization.
Lecture 2. Intensity Transformation and Spatial Filtering
Image Processing1 Image Filtering Filtering can be use to enhance some features and de- enhance others. Usually used as a pre-processing step.
CS 376b Introduction to Computer Vision 02 / 26 / 2008 Instructor: Michael Eckmann.
Multimedia Data Introduction to Image Processing Dr Sandra I. Woolley Electronic, Electrical.
Point Operations – Chapter 5. Definition Some of the things we do to an image involve performing the same operation on each and every pixel (point) –We.
EE663 Image Processing Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
AdeptSight Image Processing Tools Lee Haney January 21, 2010.
Video Segmentation Prepared By M. Alburbar Supervised By: Mr. Nael Abu Ras University of Palestine Interactive Multimedia Application Development.
: Chapter 4: Statistical Operations 1 Montri Karnjanadecha ac.th/~montri Image Processing.
CS 450: Introduction to Digital Signal and Image Processing Image Arithmetic.
1.3 New functions from old functions: Transformations.
Image Processing Part II. 2 Classes of Digital Filters global filters transform each pixel uniformly according to the function regardless of its location.
Course Website: Digital Image Processing Image Enhancement (Spatial Filtering 1)
Image Manipulation CSC361/661 – Digital Media Spring 2002 Burg/Wong.
By: David Gelbendorf, Hila Ben-Moshe Supervisor : Alon Zvirin
Lecture # 19 Image Processing II. 2 Classes of Digital Filters Global filters transform each pixel uniformly according to the function regardless of.
Visual Tracking by Cluster Analysis Arthur Pece Department of Computer Science University of Copenhagen
The number which appears most often in a set of numbers. Example: in {6, 3, 9, 6, 6, 5, 9, 3} the Mode is 6 (it occurs most often). Mode : The middle number.
: Chapter 5: Image Filtering 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Lecture 10 Chapter 5: Image Restoration. Image restoration Image restoration is the process of recovering the original scene from the observed scene which.
Algorithm Design Techniques, Greedy Method – Knapsack Problem, Job Sequencing, Divide and Conquer Method – Quick Sort, Finding Maximum and Minimum, Dynamic.
Describing Distributions of Quantitative Data
Environmental Remote Sensing GEOG 2021
Lecture Six Figures from Gonzalez and Woods, Digital Image Processing, Second Edition, Copyright 2002.
Absolute Value Equations
Represent the solutions of the following inequalities graphically.
Digital Image Processing
Arithmetic & Geometric Sequences
Other Algorithms Follow Up
Digital Image Processing
Design Theory By: Sarah Wasilewski
Histogram Histogram is a graph that shows frequency of anything. Histograms usually have bars that represent frequency of occuring of data. Histogram has.
ECE 692 – Advanced Topics in Computer Vision
Unit-2 Divide and Conquer
Image Enhancement in the
Image Processing, Lecture #8
Digital Image Processing
Image Processing, Lecture #8
Spatial operations and transformations
Digital Image Processing
Digital Image Processing
Interesting article in the March, 2006 issue of Wired magazine
Technique 6: General gray-level transformations
Lecture 2: Image filtering
Quantizing Compression
Intensity Transform Contrast Stretching Y ← u0+γ*(Y-u)/s
Statistical Operations
REDUKSI NOISE Pertemuan-8 John Adler
Histogram The histogram of an image is a plot of the gray _levels values versus the number of pixels at that value. A histogram appears as a graph with.
Quantizing Compression
Spatial operations and transformations
DIGITAL IMAGE PROCESSING Elective 3 (5th Sem.)
New function graphs from old ones: Using Transformations
Presentation transcript:

Technique 6: General gray-level transformations USE: To combine thresholding, bunching and splitting into one operation. This is also useful as a single tool in a set of software tools for image processing, since it does anyone of the technique on any part of the histogram. OPERATION: A function F(g) can be specified which transforms any gray level g to a new gray level q. Original histogram Final histogram F(g) transform 17/01/62 240-373 Image Processing

Histogram equalization Technique 7: Histogram equalization USE: To improve contrast of an image. Can be used on a whole image or just on a part of an image. THEORY: where G is total number of gray levels. OPERATION: if t(g) is the actual number of pixels at old gray level g or less, then 240-373 Image Processing, Lecture #6 17/01/62 240-373 Image Processing

Histogram equalization example 17/01/62 240-373 Image Processing

Example 17/01/62 240-373 Image Processing

Example 17/01/62 240-373 Image Processing

Multi-image operations Occasionally, it is useful to prepare a new image from a number of previous images. Example: white shape on white paper problem: difficult to distinguish between the shape and the paper due to bad lighting. solution 1: improve the lighting solution 2: capture an extra image of pure white paper without shape under the same lighting, then subtract the two images. Technique 8: Background subtraction USE: To remove light shading or discover movement from one image to another. THEORY: Gray level in each pixel in one image is subtracted from the gray level in the corresponding pixel in other image, i.e. result = x-y (x >= y) If x < y the result is negative: -1 is held as 255 -2 is held as 254 and so on 17/01/62 240-373 Image Processing

Technique 8 cont’d A better operation: result = | x - y | OPERATION: Collect both images. One image, x, should be on a pure background. The image with object will form image y. For each pixel calculate abs(x-y) This will give a negative image of the object. To return the image to a positive, use the following formula new image = MAX - abs(x-y) 17/01/62 240-373 Image Processing

17/01/62 240-373 Image Processing

Multi-image averaging A series of poor images of the same scene can be used to find a better image. Averaging or filtering can be used to enhance the picture. Multi-image modal filtering Chose the most popular gray level for each corresponding pixel in a sequence of images Multi-image median filtering Similar to modal filtering, except the middle value is chosen sorting is needed Multi-image averaging filtering Using a weighted averaging technique 17/01/62 240-373 Image Processing

Technique 9 Technique 9: Recursive filtering USE: To improve a sequence of still images--reducing noise by producing new images that correspond to weighted averages of previous images. OPERATION: It is assumed that newly collected images are available from a frame store with a fixed delay between each image. 1. Setting up: copy an image into a separate frame store, dividing all the gray levels by an integer, n. Add to that image n-1 subsequent images, the gray levels of which are also divided by n. You should now have the average of the first n images in the frame store. 2. Recursion: For every new image, multiply the contents of the frame store by (n-1)/n and the new image by 1/n, add them together and put the result back into the frame store. THEORY: At setup the frame store contains 17/01/62 240-373 Image Processing

Recursive filtering cont’d Then after many images the following steady state is created: n=10 n=5 n=2 new one 0.100 0.200 0.500 last one 0.090 0.128 0.250 last but 1 0.081 0.102 0.125 last but 2 0.073 0.080 0.063 last but 3 0.066 0.066 0.031 last but 4 0.059 0.052 0.016 last but 5 0.053 0.042 0.008 last but 6 0.048 0.034 0.004 last but 7 0.043 0.027 0.002 last but 8 0.039 0.021 0.001 last but 9 0.035 0.017 0.000 and so on 17/01/62 240-373 Image Processing