Images Course web page: vision.cis.udel.edu/cv March 3, 2003  Lecture 8.

Slides:



Advertisements
Similar presentations
Image Display MATLAB functions for displaying image Bit Planes
Advertisements

Computational Biology, Part 23 Biological Imaging II Robert F. Murphy Copyright  1996, 1999, All rights reserved.
Computer vision: models, learning and inference Chapter 13 Image preprocessing and feature extraction.
CS 4487/9587 Algorithms for Image Analysis
Each pixel is 0 or 1, background or foreground Image processing to
September 10, 2013Computer Vision Lecture 3: Binary Image Processing 1Thresholding Here, the right image is created from the left image by thresholding,
Vision Review: Image Processing Course web page: September 17, 2002.
Detecting Image Region Duplication Using SIFT Features March 16, ICASSP 2010 Dallas, TX Xunyu Pan and Siwei Lyu Computer Science Department University.
A Novel 2D To 3D Image Technique Based On Object- Oriented Conversion.
Binary Image Analysis. YOU HAVE TO READ THE BOOK! reminder.
1 Image filtering Hybrid Images, Oliva et al.,
CS4670: Computer Vision Kavita Bala Lecture 7: Harris Corner Detection.
September 25, 2014Computer Vision Lecture 6: Spatial Filtering 1 Computing Object Orientation We compute the orientation of an object as the orientation.
Scale-Invariant Feature Transform (SIFT) Jinxiang Chai.
Filtering Course web page: vision.cis.udel.edu/cv March 5, 2003  Lecture 9.
Machine Vision for Robots
1 Interest Operators Harris Corner Detector: the first and most basic interest operator Kadir Entropy Detector and its use in object recognition SIFT interest.
Recognition and Matching based on local invariant features Cordelia Schmid INRIA, Grenoble David Lowe Univ. of British Columbia.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Simple Image Processing Speaker : Lin Hsiu-Ting Date : 2005 / 04 / 27.
Image and Video Processing in MATLAB Partly based on slides by Dmitri Roduy.
Segmentation Course web page: vision.cis.udel.edu/~cv May 7, 2003  Lecture 31.
CS 6825: Binary Image Processing – binary blob metrics
Digital Image Fundamentals II 1.Image modeling and representations 2.Pixels and Pixel relations 3.Arithmetic operations of images 4.Image geometry operation.
Gulsah Tumuklu Ozyer MATLAB IMAGE PROCESSING TOOLBOX.
September 23, 2014Computer Vision Lecture 5: Binary Image Processing 1 Binary Images Binary images are grayscale images with only two possible levels of.
Digital Image Processing Lecture 4: Image Enhancement: Point Processing Prof. Charlene Tsai.
Image Processing Edge detection Filtering: Noise suppresion.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Classification Course web page: vision.cis.udel.edu/~cv May 12, 2003  Lecture 33.
Data Extraction using Image Similarity CIS 601 Image Processing Ajay Kumar Yadav.
CHAPTER 8 Color and Texture Mapping © 2008 Cengage Learning EMEA.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Histograms and Color Balancing Computational Photography Derek Hoiem, University of Illinois 09/10/15 “Empire of Light”, Magritte.
Templates, Image Pyramids, and Filter Banks
CS654: Digital Image Analysis Lecture 5: Pixels Relationships.
Autonomous Robots Vision © Manfred Huber 2014.
CS 376b Introduction to Computer Vision 03 / 18 / 2008 Instructor: Michael Eckmann.
CS654: Digital Image Analysis
Shape from Shading Course web page: vision.cis.udel.edu/cv February 26, 2003  Lecture 6.
CS654: Digital Image Analysis
Machine Vision ENT 273 Hema C.R. Binary Image Processing Lecture 3.
Camera Calibration Course web page: vision.cis.udel.edu/cv March 24, 2003  Lecture 17.
Digital Image Processing CCS331 Relationships of Pixel 1.
Lecture 4b Data augmentation for CNN training
图像处理技术讲座(3) Digital Image Processing (3) Basic Image Operations
Image Pyramids and Applications
Slope and Curvature Density Functions
Feature description and matching
Computer Vision Jia-Bin Huang, Virginia Tech
Computer Vision Lecture 5: Binary Image Processing
Computer Vision Lecture 4: Color
EE/CSE 576 HW 1 Notes.
Computer Vision Lecture 16: Texture II
Image filtering Images by Pawan Sinha.
CS654: Digital Image Analysis
Image filtering Images by Pawan Sinha.
EE/CSE 576 HW 1 Notes.
Image filtering Images by Pawan Sinha.
Image filtering
Digital Image Processing Lecture 26: Color Processing
Digital Image Processing
Magnetic Resonance Imaging
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
Vision Review: Image Processing
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
Intensity Transformation
ECE/CSE 576 HW 1 Notes.
DIGITAL IMAGE PROCESSING Elective 3 (5th Sem.)
Histograms and Color Balancing
Presentation transcript:

Images Course web page: vision.cis.udel.edu/cv March 3, 2003  Lecture 8

Announcements Homework is due tonight by midnight (LaTeX broken in Smith 040) Read about convolution in Chapter , of Forsyth and Ponce for Wednesday

Outline Digitization will be discussed in the camera lecture (#16) Image types, basic operations in Matlab Binary images Image comparison Texture mapping

Matlab Image Types Note: Although we write I(x, y), remember that Matlab uses I(r, c) Intensity: m x n matrix. Can be: –uint8 : Unsigned 8-bit integer—i.e., in the range [0…255] –double : Real number in range [0…1] True color: m x n x 3 –Basically, stacked red, green, and blue intensity images (aka channels) Binary: Values are 0 or 1, type logical

Image Type Conversions Many functions work on just one channel –Run on each channel independently –Convert from color  grayscale weighting each channel by perceptual importance ( rgb2gray ) Some operations want the pixels to be real-valued –Type conversion: I2 = double(I1)

Image Arithmetic Just like matrices, we can do pixelwise arithmetic on images Some useful operations –Differencing: Measure of similarity –Averaging: Blend separate images or smooth a single one over time –Thresholding: Apply function to each pixel, test value In Matlab: imadd, imsubtract, imcomplement, imlincomb, etc. –Beware of truncation –Can do all of these with matrix operations if you pay attention to types and truncation

Thresholding Grayscale  Binary: Choose threshold based on histogram of image intensities (Matlab: imhist )

Example: Image Histograms courtesy of MathWorks

Derived Images: Color Similarity as Chrominance Distance Distance to red in YIQ space ( rgb2ntsc ) Can threshold on this

Connected Components Uniquely label each n-connected region in binary image 4- and 8-connectedness Matlab: bwfill, bwselect

Example: Connected Components courtesy of HIPR

Binary Operations Dilation, erosion (Matlab: imdilate, imerode ) –Dilation: All 0’s next to a 1  1 (Enlarge foreground) –Erosion: All 1’s next to a 0  0 (Enlarge background) OriginalDilatedEroded courtesy of Reindeer Graphics

Moments: Region Statistics Zeroth-order: Size/area First-order: Position (centroid) Second-order: Orientation

Geometric Image Comparison: SSD Given a template image I T and an image I, how to quantify the similarity between them? Vector difference: Sum of squared differences (SSD)

Correlation for Template Matching Note that SSD formula can be written: When the last term is big, the mismatch is small—the dot product measures correlation: By normalizing by the vectors’ lengths, we are measuring the angle between them

Normalized Cross-Correlation Shift template image over search image, measuring normalized correlation at each point Local maxima indicate template matches Matlab: normxcorr2 from Jain, Kasturi, & Schunck

Statistical Image Comparison: Color Histograms Steps –Histogram RGB/HSI triplets over two images to be compared –Normalize each histogram by respective total number of pixels to get frequencies –Similarity is Euclidean distance between color frequency vectors Insensitive to geometric changes, including different-sized images Matlab: imhist, hist

Image Transformations Geometric: Compute new pixel locations –Rotate –Scale –Undistort (e.g., radial distortion from lens) Photometric: How to compute new pixel values when non-integral –Nearest neighbor: Value of closest pixel –Bilinear interpolation (2 x 2 neighborhood) –Bicubic interpolation (4 x 4)

Bilinear Interpolation Idea: Blend four pixel values surrounding source, weighted by nearness Vertical blend Horizontal blend