Slope and Curvature Density Functions

Slides:



Advertisements
Similar presentations
Binary Shape Clustering via Zernike Moments
Advertisements

Hough Transforms CSE 6367 – Computer Vision Vassilis Athitsos University of Texas at Arlington.
電腦視覺 Computer and Robot Vision I
Developable Surface Fitting to Point Clouds Martin Peternell Computer Aided Geometric Design 21(2004) Reporter: Xingwang Zhang June 19, 2005.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Document Image Processing
October 2, 2014Computer Vision Lecture 8: Edge Detection I 1 Edge Detection.
Computer Vision Lecture 16: Texture
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
Vicenç Parisi Baradad, Joan Cabestany, Jaume Piera
November 4, 2014Computer Vision Lecture 15: Shape Representation II 1Signature Another popular method of representing shape is called the signature. In.
Lecture 6: Feature matching CS4670: Computer Vision Noah Snavely.
Image Filtering CS485/685 Computer Vision Prof. George Bebis.
COMP322/S2000/L23/L24/L251 Camera Calibration The most general case is that we have no knowledge of the camera parameters, i.e., its orientation, position,
Information that lets you recognise a region.
September 25, 2014Computer Vision Lecture 6: Spatial Filtering 1 Computing Object Orientation We compute the orientation of an object as the orientation.
3D Graphics Goal: To produce 2D images of a mathematically described 3D environment Issues: –Describing the environment: Modeling (mostly later) –Computing.
KINEMATICS ANALYSIS OF ROBOTS (Part 1) ENG4406 ROBOTICS AND MACHINE VISION PART 2 LECTURE 8.
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.
Digital Image Processing
Machine Vision for Robots
October 14, 2014Computer Vision Lecture 11: Image Segmentation I 1Contours How should we represent contours? A good contour representation should meet.
Analysis of shape Biomedical Image processing course, Yevhen Hlushchuk and Jukka Parviainen.
OBJECT RECOGNITION. The next step in Robot Vision is the Object Recognition. This problem is accomplished using the extracted feature information. The.
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.
Intelligent Vision Systems ENT 496 Object Shape Identification and Representation Hema C.R. Lecture 7.
Digital Image Processing CSC331
September 23, 2014Computer Vision Lecture 5: Binary Image Processing 1 Binary Images Binary images are grayscale images with only two possible levels of.
September 17, 2013Computer Vision Lecture 5: Image Filtering 1ColorRGB HSI.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Representation & Description.
Electric Potential Chapter 25. ELECTRIC POTENTIAL DIFFERENCE The fundamental definition of the electric potential V is given in terms of the electric.
October 29, 2013Computer Vision Lecture 13: Fourier Transform II 1 The Fourier Transform In the previous lecture, we discussed the Hough transform. There.
December 9, 2014Computer Vision Lecture 23: Motion Analysis 1 Now we will talk about… Motion Analysis.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Fourier Descriptors For Shape Recognition Applied to Tree Leaf Identification By Tyler Karrels.
CS654: Digital Image Analysis Lecture 5: Pixels Relationships.
CS654: Digital Image Analysis Lecture 36: Feature Extraction and Analysis.
October 16, 2014Computer Vision Lecture 12: Image Segmentation II 1 Hough Transform The Hough transform is a very general technique for feature detection.
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
September 26, 2013Computer Vision Lecture 8: Edge Detection II 1Gradient In the one-dimensional case, a step edge corresponds to a local peak in the first.
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.
April 21, 2016Introduction to Artificial Intelligence Lecture 22: Computer Vision II 1 Canny Edge Detector The Canny edge detector is a good approximation.
October 3, 2013Computer Vision Lecture 10: Contour Fitting 1 Edge Relaxation Typically, this technique works on crack edges: pixelpixelpixel pixelpixelpixelebg.
Parametric equations Parametric equation: x and y expressed in terms of a parameter t, for example, A curve can be described by parametric equations x=x(t),
Image Representation and Description – Representation Schemes
IT472: Digital Image Processing
Digital Image Processing Lecture 20: Representation & Description
Math II: Unit 1: Transformations
Curl and Divergence.
Mean Shift Segmentation
Image gradients and edges
Paper Presentation: Shape and Matching
Fourier Transform: Real-World Images
Computer Vision Lecture 5: Binary Image Processing
Fitting Curve Models to Edges
Range Imaging Through Triangulation
Computer Vision Lecture 9: Edge Detection II
Computer Vision Lecture 16: Texture II
Phase and Amplitude in Fourier Transforms, Meaning of frequencies
Magnetic Resonance Imaging
Fourier Transform of Boundaries
Intensity Transformation
Physics 417/517 Introduction to Particle Accelerator Physics
Introduction to Artificial Intelligence Lecture 22: Computer Vision II
Presentation transcript:

Slope and Curvature Density Functions The slope density function is the histogram of all slopes (tangent angles) in a contour. This function can be used for recognizing objects. We can also use the derivative of the slope representation, which we can call the curvature representation. Its histogram is the curvature density function. The curvature density function can also be used to recognize objects. Its advantage is its rotation invariance, i.e., matching two curvature density functions determines similarity even if the two objects have different orientations. April 3, 2018 Computer Vision Lecture 14: Shape Representation II

Examples of Slope Density Functions 0 90 180 270 0 90 180 270 360 Angle Density 0 90 180 270 360 Angle Density Square Diamond 0 90 180 270 360 Angle Density 0 90 180 270 360 Angle Density Circle Ellipse April 3, 2018 Computer Vision Lecture 14: Shape Representation II

Computer Vision Lecture 14: Shape Representation II Signature Another popular method of representing shape is called the signature. In order to compute the signature of a contour, we choose an (arbitrary) starting point A on it. Then we measure the shortest distance from A to any other point on the contour, measured in perpendicular direction to the tangent at point A. Now we keep moving along the contour while measuring this distance. The resulting measure of distance as a function of path length is the signature of the contour. April 3, 2018 Computer Vision Lecture 14: Shape Representation II

Computer Vision Lecture 14: Shape Representation II Signature Notice that if you normalize the path length, the signature representation is position, rotation, and scale invariant. Smoothing of the contour before computing its signature may be necessary for a useful computation of the tangent. April 3, 2018 Computer Vision Lecture 14: Shape Representation II

Computer Vision Lecture 14: Shape Representation II Bending Energy April 3, 2018 Computer Vision Lecture 14: Shape Representation II

Computer Vision Lecture 14: Shape Representation II Region Skeleton April 3, 2018 Computer Vision Lecture 14: Shape Representation II

Computer Vision Lecture 14: Shape Representation II Region Skeleton April 3, 2018 Computer Vision Lecture 14: Shape Representation II

Computer Vision Lecture 14: Shape Representation II Region Skeleton April 3, 2018 Computer Vision Lecture 14: Shape Representation II

Fourier Transform of Boundaries As we discussed before, a 2D contour can be represented by two 1D functions of a parameter s. Let S be our (arbitrary) starting point on the contour. Let us move in counterclockwise direction (for example, we can use a boundary-following algorithm to do that). In our discrete (pixel) space, the points of the contour can then be specified by [v[s], h[s]], where s is the distance from S (measured along the contour) and v and h are the functions describing our vertical and horizontal position on the contour for a given s. April 3, 2018 Computer Vision Lecture 14: Shape Representation II

Fourier Transform of Boundaries April 3, 2018 Computer Vision Lecture 14: Shape Representation II

Fourier Transform of Boundaries April 3, 2018 Computer Vision Lecture 14: Shape Representation II

Fourier Transform of Boundaries Obviously, both v[s] and h[s] are periodic functions, as we will pass the same points over and over again in constant time intervals. This gives us a brilliant idea: Why not represent the contour in Fourier space? In fact, this can be done. We simply compute separate 1D Fourier transforms for v[s] and h[s]. When we convert the result into the magnitude/phase representation, the transform gives us the functions Mv[l], Mh[l], v[l], and h[l] for frequency l ranging from 0 (offset) to s/2. April 3, 2018 Computer Vision Lecture 14: Shape Representation II

Fourier Transform of Boundaries As with images, higher frequencies do not usually contribute much to a function and can be disregarded without any noticeable consequences. Let us see what happens when we delete all functions above frequency lmax and perform the inverse Fourier transform. Will the original contour be conserved even for small values of lmax? April 3, 2018 Computer Vision Lecture 14: Shape Representation II

Fourier Transform of Boundaries April 3, 2018 Computer Vision Lecture 14: Shape Representation II

Fourier Transform of Boundaries April 3, 2018 Computer Vision Lecture 14: Shape Representation II