Schools of thoughts on texture

Similar documents
Anno accademico 2006/2007. Davide Migliore

CS443: Digital Imaging and Multimedia Binary Image Analysis. Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University

BSB663 Image Processing Pinar Duygulu. Slides are adapted from Selim Aksoy

Image Processing Fundamentals. Nicolas Vazquez Principal Software Engineer National Instruments

Image Acquisition Image Digitization Spatial domain Intensity domain Image Characteristics

Problem definition Image acquisition Image segmentation Connected component analysis. Machine vision systems - 1

Feature descriptors. Alain Pagani Prof. Didier Stricker. Computer Vision: Object and People Tracking

CS534 Introduction to Computer Vision Binary Image Analysis. Ahmed Elgammal Dept. of Computer Science Rutgers University

Local Feature Detectors

Image Processing. Bilkent University. CS554 Computer Vision Pinar Duygulu

CITS 4402 Computer Vision

Image Processing: Final Exam November 10, :30 10:30

Lecture 6: Texture. Tuesday, Sept 18

Processing of binary images

2D Image Processing Feature Descriptors

ME/CS 132: Introduction to Vision-based Robot Navigation! Low-level Image Processing" Larry Matthies"

EE795: Computer Vision and Intelligent Systems

EE 584 MACHINE VISION

Fundamentals of Digital Image Processing

Schedule for Rest of Semester

Dense Image-based Motion Estimation Algorithms & Optical Flow

IMAGE SEGMENTATION. Václav Hlaváč

SECTION 5 IMAGE PROCESSING 2

Computer and Machine Vision

Local invariant features

Binary Image Processing. Introduction to Computer Vision CSE 152 Lecture 5

Color and Shading. Color. Shapiro and Stockman, Chapter 6. Color and Machine Vision. Color and Perception

CEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt.

Edges and Binary Images

CPSC 425: Computer Vision

Image Analysis Lecture Segmentation. Idar Dyrdal

[ ] Review. Edges and Binary Images. Edge detection. Derivative of Gaussian filter. Image gradient. Tuesday, Sept 16

Image processing and features

Texture. Outline. Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation

What is an Image? Image Acquisition. Image Processing - Lesson 2. An image is a projection of a 3D scene into a 2D projection plane.

Capturing, Modeling, Rendering 3D Structures

Filters (cont.) CS 554 Computer Vision Pinar Duygulu Bilkent University

Templates, Image Pyramids, and Filter Banks

Motion Estimation and Optical Flow Tracking

Feature descriptors and matching

Texture. Texture. 2) Synthesis. Objectives: 1) Discrimination/Analysis

Analysis of Image and Video Using Color, Texture and Shape Features for Object Identification

SE 263 R. Venkatesh Babu. Object Tracking. R. Venkatesh Babu

Computer vision: models, learning and inference. Chapter 13 Image preprocessing and feature extraction

CS 378: Autonomous Intelligent Robotics. Instructor: Jivko Sinapov

Binary Image Analysis. Binary Image Analysis. What kinds of operations? Results of analysis. Useful Operations. Example: red blood cell image

Edges and Binary Image Analysis. Thurs Jan 26 Kristen Grauman UT Austin. Today. Edge detection and matching

Robot vision review. Martin Jagersand

Biomedical Image Analysis. Mathematical Morphology

Augmented Reality VU. Computer Vision 3D Registration (2) Prof. Vincent Lepetit

Matching. Compare region of image to region of image. Today, simplest kind of matching. Intensities similar.

Outline 7/2/201011/6/

A New Algorithm for Shape Detection

Comparison of Local Feature Descriptors

Local Image Features

Image Analysis - Lecture 5

Introduction to Medical Imaging (5XSA0)

Age Invariant Face Recognition Aman Jain & Nikhil Rasiwasia Under the Guidance of Prof R M K Sinha EE372 - Computer Vision and Document Processing

morphology on binary images

Local features: detection and description. Local invariant features

Designing Applications that See Lecture 7: Object Recognition

Texture. D. Forsythe and J. Ponce Computer Vision modern approach Chapter 9 (Slides D. Lowe, UBC) Previously

Why is computer vision difficult?

Digital Image Processing

Review for the Final

Automatic Image Alignment

Lecture 6: Edge Detection

Chapter 9 Morphological Image Processing

Corner Detection. GV12/3072 Image Processing.

Detection of Edges Using Mathematical Morphological Operators

Image matching. Announcements. Harder case. Even harder case. Project 1 Out today Help session at the end of class. by Diva Sian.

Region-based Segmentation

CS 4495 Computer Vision A. Bobick. CS 4495 Computer Vision. Features 2 SIFT descriptor. Aaron Bobick School of Interactive Computing

2D Image Processing INFORMATIK. Kaiserlautern University. DFKI Deutsches Forschungszentrum für Künstliche Intelligenz

C E N T E R A T H O U S T O N S C H O O L of H E A L T H I N F O R M A T I O N S C I E N C E S. Image Operations II

Harder case. Image matching. Even harder case. Harder still? by Diva Sian. by swashford

Previously. Edge detection. Today. Thresholding. Gradients -> edges 2/1/2011. Edges and Binary Image Analysis

IN5520 Digital Image Analysis. Two old exams. Practical information for any written exam Exam 4300/9305, Fritz Albregtsen

Edge and corner detection

Evaluation and comparison of interest points/regions

09/11/2017. Morphological image processing. Morphological image processing. Morphological image processing. Morphological image processing (binary)

Visual Tracking. Image Processing Laboratory Dipartimento di Matematica e Informatica Università degli studi di Catania.

Computer Vision Course Lecture 04. Template Matching Image Pyramids. Ceyhun Burak Akgül, PhD cba-research.com. Spring 2015 Last updated 11/03/2015

Features Points. Andrea Torsello DAIS Università Ca Foscari via Torino 155, Mestre (VE)

Visual Tracking (1) Tracking of Feature Points and Planar Rigid Objects

A Robust Automated Process for Vehicle Number Plate Recognition

K S Prasanna Kumar et al,int.j.computer Techology & Applications,Vol 3 (1),

Edges and Binary Image Analysis April 12 th, 2018

HISTOGRAMS OF ORIENTATIO N GRADIENTS

Local Image Features

3D from Photographs: Automatic Matching of Images. Dr Francesco Banterle

Data Term. Michael Bleyer LVA Stereo Vision

Texture. Announcements. 2) Synthesis. Issues: 1) Discrimination/Analysis

Texture April 17 th, 2018

SIFT: SCALE INVARIANT FEATURE TRANSFORM SURF: SPEEDED UP ROBUST FEATURES BASHAR ALSADIK EOS DEPT. TOPMAP M13 3D GEOINFORMATION FROM IMAGES 2014

The. Handbook ijthbdition. John C. Russ. North Carolina State University Materials Science and Engineering Department Raleigh, North Carolina

Lecture 4: Spatial Domain Transformations

Introduction to behavior-recognition and object tracking

MediaTek Video Face Beautify

Computer Vision. Exercise 3 Panorama Stitching 09/12/2013. Compute Vision : Exercise 3 Panorama Stitching

Transcription:

Cameras Images Images Edges Talked about images being continuous (if you blur them, then you can compute derivatives and such). Two paths: Edges something useful Or Images something besides edges. Images something besides edges. May still want invariant properties, so find things that do not depend (too much) on brightness of the image, or which direction the light comes from. Goals for today: feature detection cross-correlation ssd (sum of squared differences) What is Texture? (or, a different kind of edge) Schools of thoughts on texture Texture: repeated elements, subject to randomization of their location, size, color orientation Julesz: Nth-order joint empirical densities of textons Bergen-Adelson,Malik, Tuner: Multi-scale filter banks, wavelets Non-parametric: Image prototypes Texture problems Representation Choice of model, Parametric vs. Non-parametric Method of measuring: Filter Banks, Local Statistics Similarity Invariant properties: (some feature all parts of the texture share, or some function that is constant over the texture). Choice of distance function Texture indexing Synthesis Choices of texture models Method of image generation, deterministic vs. stochastic Filter bank for texture representation

Gaussian Filter Image filtering: smoothing R(x,y) = I *g =sum_(u,v) I(x-u,y-v) g(u,v) Difference of Gaussian (DOG) Filter Banks Dot (DOG) filter response Odd symmetric filter outputs (derivatives)

Even symmetric filter ( bars) Filter Banks. (automatically constructed) Segmentation through filter response Simple filters can model complex shapes: (wavelets). Other computations on images. 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

Unix man page for ppmtopgm NAME ppmtopgm - convert a portable pixmap into a portable graymap SYNOPSIS ppmtopgm [ppmfile] DESCRIPTION Reads a portable pixmap as input. Produces a portable graymap as output. The output is a "black and white" rendering of the original image, as in a black and white photograph. The quantization formula used is.299 r +.587 g +.114 b. QUOTE Cold-hearted orb that rules the night Removes the colors from our sight Red is gray, and yellow white But we decide which is right And which is a quantization error. Thresholding Grayscale Binary: Choose threshold based on histogram of image intensities Image Histogramming Connected Components Uniquely label each n-connected region in binary image 4- and 8-connectedness Example: Connected Components Binary Operations Dilation, erosion Dilation: All 0 s next to a 1 1 (Enlarge foreground) Erosion: All 1 s next to a 0 0 (Enlarge background) courtesy of HIPR Original Eroded Dilated courtesy of Reindeer Graphics

Moments: Region Statistics Back to filter like things. Zeroth-order: Size/area First-order: Position (centroid) Second-order: Orientation Template matching Define a template a model of the object to be recognised Define a measure of similarity between template and similar sized image region Similarity Measure dissimilarity between image f[i,j] and template g[i,j] Place template on image and compare corresponding intensities Need a measure of dissimilarity Last is best... max f g [ i, j] R [ i, j] R f g SAD 2 ( f g) [ i, j] R SSD 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

1 Normalized Cross-Correlation Input Template Output Shift template image over search image, measuring normalized correlation at each point Local maxima indicate template matches 100 80 60 40 20 from Jain, Kasturi, & Schunck 0 120 26 51 76 101 126 151 176 201 226 251 276 301 326 351 376 401 Non-Normalised Correlation 426 Position Matching Criteria Cross Correlation Handling illumination changes Why Normalized cross-correlation is used? The image to search (I 2 ) The window to search The maximum cross correlation score The cross correlation score I 1 I 2 Good and Bad Features. The aperture problem (cont )??? Hard to track vertically. Easy to track in both directions. Filter response is same if you move the filter up and down, (no local maxima)

Pattern Recognition Demo Watch the next slide very carefully it will only appear for a fraction of a second. Pattern Recognition Demo Pattern Recognition: Definition What did you see? Pattern Recognition: Definition Theories: 1. Template Matching Theory Ability to recognize and identify incoming stimuli Compares external stimuli to stored information about past experience Example: recognizing handwriting or type Other examples Compare stimuli to templates stored in memory When match found, stimulus is identified Template for every pattern Examples Bar code Numbers on check

Theories: 1. Template Matching Theory Problems: Variability (of form, style, size, orientation) Context effects Theories: 1. Template Matching Theory Problems: Different interpretations of the same stimulus Theories: 1. Template Matching Theory Problems: Different interpretations of the same stimulus (other examples) Theories: 2. Feature Detection based Recognition? Each pattern is stored as a set of features and a label The stimulus compared to these features and the best match is found Label stimulus as the one that matches the set of features that produces the greatest amount of feature overlap Next Time: Comparisons of whole images (and how you automatically define interesting filter banks).