CS654: Digital Image Analysis Lecture 36: Feature Extraction and Analysis.

Slides:



Advertisements
Similar presentations
Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
Advertisements

電腦視覺 Computer and Robot Vision I
The Ellipsoid Faculty of Applied Engineering and Urban Planning
Projective Estimators for Point/Tangent Representations of Planar Curves Thomas Lewiner/ Marcos Craizer Dep. Matemática -PUC-Rio.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Computer vision: models, learning and inference Chapter 13 Image preprocessing and feature extraction.
Document Image Processing
Extended Gaussian Images
Chapter 8 Content-Based Image Retrieval. Query By Keyword: Some textual attributes (keywords) should be maintained for each image. The image can be indexed.
Computer Vision Lecture 16: Region Representation
Mapping: Scaling Rotation Translation Warp
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Vicenç Parisi Baradad, Joan Cabestany, Jaume Piera
1Ellen L. Walker Edges Humans easily understand “line drawings” as pictures.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
November 4, 2014Computer Vision Lecture 15: Shape Representation II 1Signature Another popular method of representing shape is called the signature. In.
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 II SIZE FUNCTIONS:
1 Curvature Driven Flows Allen Tannenbaum. 2 Basic curve evolution: Invariant Flows  Planar curve:  General flow:  General geometric flow:
Projective geometry- 2D Acknowledgements Marc Pollefeys: for allowing the use of his excellent slides on this topic
Curves Locus of a point moving with one degree of freedom
Introduction to Differential Geometry
Scale Invariant Feature Transform (SIFT)
Edge Detection Today’s readings Cipolla and Gee –supplemental: Forsyth, chapter 9Forsyth Watt, From Sandlot ScienceSandlot Science.
CS4670: Computer Vision Kavita Bala Lecture 7: Harris Corner Detection.
CS4670: Computer Vision Kavita Bala Lecture 8: Scale invariance.
Chapter 11 Representation and Description. Preview Representing a region involves two choices: In terms of its external characteristics (its boundary)
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
October 8, 2013Computer Vision Lecture 11: The Hough Transform 1 Fitting Curve Models to Edges Most contours can be well described by combining several.
Computer vision.
Machine Vision for Robots
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 11 Representation & Description Chapter 11 Representation.
Digital Image Processing Lecture 20: Representation & Description
Image Processing and Analysis (ImagePandA) 9 – Shape Christoph Lampert / Chris Wojtan.
Homogeneous Coordinates (Projective Space) Let be a point in Euclidean space Change to homogeneous coordinates: Defined up to scale: Can go back to non-homogeneous.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Shape Based Image Retrieval Using Fourier Descriptors Dengsheng Zhang and Guojun Lu Gippsland School of Computing and Information Technology Monash University.
Intelligent Vision Systems ENT 496 Object Shape Identification and Representation Hema C.R. Lecture 7.
Digital Image Processing CSC331
Geometric Camera Models
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Representation & Description.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
A survey of different shape analysis techniques 1 A Survey of Different Shape Analysis Techniques -- Huang Nan.
Local invariant features Cordelia Schmid INRIA, Grenoble.
CS654: Digital Image Analysis
October 16, 2014Computer Vision Lecture 12: Image Segmentation II 1 Hough Transform The Hough transform is a very general technique for feature detection.
CS654: Digital Image Analysis
1 Overview representing region in 2 ways in terms of its external characteristics (its boundary)  focus on shape characteristics in terms of its internal.
Instructor: Mircea Nicolescu Lecture 7
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
Sheng-Fang Huang Chapter 11 part I.  After the image is segmented into regions, how to represent and describe these regions? ◦ In terms of its external.
Materi 09 Analisis Citra dan Visi Komputer Representasi and Deskripsi 1.
Image Representation and Description – Representation Schemes
Digital Image Processing Lecture 20: Representation & Description
Homogeneous Coordinates (Projective Space)
Mean Shift Segmentation
Slope and Curvature Density Functions
Image gradients and edges
Fitting Curve Models to Edges
Geometric Transformations
Geometric Transformations
Geometric Camera Models
Geometric Transformations
Geometric Transformations
Representation and Description
Edge Detection Today’s readings Cipolla and Gee Watt,
Lecture VI: Corner and Blob Detection
Geometric Transformations
Introduction to Artificial Intelligence Lecture 22: Computer Vision II
Review and Importance CS 111.
Geometric Transformations
Presentation transcript:

CS654: Digital Image Analysis Lecture 36: Feature Extraction and Analysis

Recap of Lecture 35 JPEG DCT

Outline of Lecture 36 Feature representation Shape feature Curvature Curvature Scale Space Other shape features

Introduction The goal in digital image analysis is to extract useful information for solving application-based problems. The first step to this is to reduce the amount of image data using methods that we have discussed before: Image segmentation Filtering in frequency domain Morphology, …

What next ?? The next step would be to extract features that are useful in solving computer imaging problems. What features to be extracted are application dependent. After the features have been extracted, then analysis can be done.

Shape features Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Shape context Perimeter Compactness Eccentricity Fourier Descriptors Wavelet Descriptors Curvature Scale Space Shape Signature Chain Code Hausdorff Distance Elastic Matching Non-Structural Area Euler Number Eccentricity Geometric Moments Zernike Moments Pseudo-Zernike Mmts Legendre Moments Grid Method

Planer curves Parameterized curve y x y x

Planer curves: tangent, curvature Parameterized curve Tangent

Curvature Magnitude of the second derivative  curvature Change in the tangent between two successive point is more Curvature is more  curve is curving a lot

Linear Transformation Affine transformation: Euclidean transformation: Euclidean Affine

Linear Transformation Equi- Affine transformation: Euclidean Equi-Affine

Differential Signature Euclidean invariant signature Starting point?

Affine transformation What would be the definition of arc length and curvature in case of affine transformation?

Re-parameterization

Euclidean arc-length Only allows for rotation and translation Length is preserved

Equi-affine arclength Length is not preserved any more, however area is preserved

Equi-affine curvature

Differential signature Affine invariant signature

Curvature Scale Space Defined a unique way of observing and studying 2-D closed shapes Trace the outer most closed curve of the object and thus proceed Mapping to a space which represents each point as a curvature w.r.t. the arc length. Matching is performed using CSS image

CSS Image It is a multi-scale organization of the inflection points (zero crossing points) of an evolving contour Curvature is a local measure of how fast a planar contour is turning

Process 1.This method convolutes a path (arc length ) based parametric representation of a planar curve with a Gaussian function 2.As the Gaussian width varies from a small to a large value. 3.Plot the curvature vs. the normalized arc length of the planar curve. 4.As the Gaussian width is increased, the scale of the image increases or the image evolves and thus the amount of noise is reduced and the curve distortions smoothened. The benefits of this representation are that it is invariant under rotation,uniform scaling and translation of the curve.

Illustration arclength parameter on the original contour standard deviation of the Gaussian filter CSS Image Curvature zero-crossing segments Input image

Matching

Illustration

Binary Object Features – Area The area of the ith object is defined as follows: The area A i is measured in pixels and indicates the relative size of the object.

Binary Object Features – Center of Area The center of area is defined as follows: These correspond to the row and column coordinate of the center of the i-th object.

Binary Object Features – Axis of Least Second Moment The Axis of Least Second Moment is expressed as  - the angle of the axis relatives to the vertical axis.

Binary Object Features – Axis of Least Second Moment This assumes that the origin is as the center of area. This feature provides information about the object’s orientation. This axis corresponds to the line about which it takes the least amount of energy to spin an object.

Binary Object Features – Aspect Ratio The equation for aspect ratio is as follows: reveals how the object spread in both vertical and horizontal direction. High aspect ratio indicates the object spread more towards horizontal direction.