International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April 26-30 2004, Tehran 1 II SIZE FUNCTIONS:

Slides:



Advertisements
Similar presentations
3D Geometry for Computer Graphics
Advertisements

November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Size Function Jianwei Hu Author Patrizio Frosini Ricercatore presso la Facolt à di Ingegneria dell'Universit à di Bologna Ricercatore presso.
Extended Gaussian Images
Representing Relations Using Matrices
Comparison Methodologies. Evaluating the matching characteristics Properties of the similarity measure Robustness of the similarity measure – Low variation.
September 10, 2013Computer Vision Lecture 3: Binary Image Processing 1Thresholding Here, the right image is created from the left image by thresholding,
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 IV COMPUTING SIZE.
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 I THE NATURAL PSEUDODISTANCE:
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 III SIZE FUNCTIONS.
Applied Discrete Mathematics Week 10: Equivalence Relations
October 8, 2013Computer Vision Lecture 11: The Hough Transform 1 Fitting Curve Models to Edges Most contours can be well described by combining several.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Separable functions University of Illinois at Chicago ECE 427, Dr. D. Erricolo University of Illinois at Chicago ECE 427, Dr. D. Erricolo A function of.
October 14, 2014Computer Vision Lecture 11: Image Segmentation I 1Contours How should we represent contours? A good contour representation should meet.
Digital Image Processing Lecture 20: Representation & Description
7.1. Mean Shift Segmentation Idea of mean shift:
Edge Linking & Boundary Detection
April 10, 2002Applied Discrete Mathematics Week 10: Relations 1 Counting Relations Example: How many different reflexive relations can be defined on a.
1 7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to.
Digital Image Fundamentals II 1.Image modeling and representations 2.Pixels and Pixel relations 3.Arithmetic operations of images 4.Image geometry operation.
General (point-set) topology Jundong Liu Ohio Univ.
Intelligent Vision Systems ENT 496 Object Shape Identification and Representation Hema C.R. Lecture 7.
University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction to computer vision Chapter 2: Image.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 9 (Part 2): Graphs  Graph Terminology (9.2)
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 CCS331 Relationships of Pixel 1.
Computer Graphics 2D Transformations. 2 of 74 Contents In today’s lecture we’ll cover the following: –Why transformations –Transformations Translation.
Precalculus Fifth Edition Mathematics for Calculus James Stewart Lothar Redlin Saleem Watson.
April 14, 2015Applied Discrete Mathematics Week 10: Equivalence Relations 1 Properties of Relations Definition: A relation R on a set A is called transitive.
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Affine Transformations.
Chapter SETS DEFINITION OF SET METHODS FOR SPECIFYING SET SUBSETS VENN DIAGRAM SET IDENTITIES SET OPERATIONS.
CSE 311 Foundations of Computing I Lecture 9 Proofs and Set Theory Autumn 2012 CSE
Discrete Mathematical Structures: Theory and Applications
CS654: Digital Image Analysis Lecture 36: Feature Extraction and Analysis.
1 Copyright © Cengage Learning. All rights reserved. 3 Functions and Graphs 3.1Rectangular Coordinate Systems.
Relation. Combining Relations Because relations from A to B are subsets of A x B, two relations from A to B can be combined in any way two sets can be.
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.
Lecture 4 Infinite Cardinals. Some Philosophy: What is “2”? Definition 1: 2 = 1+1. This actually needs the definition of “1” and the definition of the.
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
VECTORS AND THE GEOMETRY OF SPACE 10. VECTORS AND THE GEOMETRY OF SPACE In this chapter, we introduce vectors and coordinate systems for three-dimensional.
1 Overview representing region in 2 ways in terms of its external characteristics (its boundary)  focus on shape characteristics in terms of its internal.
Basic Theory (for curve 01). 1.1 Points and Vectors  Real life methods for constructing curves and surfaces often start with points and vectors, which.
Morphological Image Processing Robotics. 2/22/2016Introduction to Machine Vision Remember from Lecture 12: GRAY LEVEL THRESHOLDING Objects Set threshold.
BYST Morp-1 DIP - WS2002: Morphology Digital Image Processing Morphological Image Processing Bundit Thipakorn, Ph.D. Computer Engineering Department.
4. Affine transformations. Reading Required:  Watt, Section 1.1. Further reading:  Foley, et al, Chapter  David F. Rogers and J. Alan Adams,
Relationship between pixels Neighbors of a pixel – 4-neighbors (N,S,W,E pixels) == N 4 (p). A pixel p at coordinates (x,y) has four horizontal and vertical.
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
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.
Discrete Mathematics Lecture # 17 Function. Relations and Functions  A function F from a set X to a set Y is a relation from X to Y that satisfies the.
April 21, 2016Introduction to Artificial Intelligence Lecture 22: Computer Vision II 1 Canny Edge Detector The Canny edge detector is a good approximation.
Singular Value Decomposition and its applications
Graphs and Applications of Linear Equations
Image Representation and Description – Representation Schemes
Digital Image Processing Lecture 20: Representation & Description
Set Topology MTH 251 Lecture # 8.
Mean Shift Segmentation
Slope and Curvature Density Functions
Computer Vision Lecture 5: Binary Image Processing
Fitting Curve Models to Edges
Introduction to linear Lie groups
Section 1.2 Relations.
Lecture 2 Section 1.3 Objectives: Continuous Distributions
Discrete Surfaces and Manifolds: A Potential tool to Image Processing
Introduction to Algebraic Topology and Persistent Homology
Fourier Transform of Boundaries
Chapter 5: Morse functions and function-induced persistence
Introduction to Artificial Intelligence Lecture 22: Computer Vision II
Presentation transcript:

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 II SIZE FUNCTIONS: COMPARING SHAPES BY COUNTING EQUIVALENCE CLASSES Patrizio Frosini Vision Mathematics Group University of Bologna - Italy

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 2 Assume a size pair (M,  ) is given (i.e. M =topological space,  :M  IR) We want to take each size pair into a function describing the shape of M with respect to . Instead of comparing manifolds, we shall compare these descriptors.

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 3 Definition of size function Let M be a topological space and assume that a continuous function  : M  IR is given. For each real number y we denote by M   y  the set of all points of M at which the measuring function  takes a value not greater than y. For each real number y we say that two points P,Q are   y  -connected if and only if they belong to the same component in M   y .

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 4 We call size function (of the size pair (M,  )) the function l (M,  ) : IR x IR  IN  +  that takes each point (x,y) of the real plane to the number of equivalence classes of M   x  with respect to   y  -connectedness. EQUIVALENT DEFINITION For x<y, l (M,  ) (x,y) is the number of connected components of M   y  that contain at least one point of M   x .

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 5 Let us make the definition clear

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 6 Example: M is the displayed curve,  is the distance from C. This is the size function l (M,  ).

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 7 More details about our example

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 8

9

10

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 11 An evolving curve and its evolving size function

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 12 We observe that 1) l (M,  ) (x,y) is non-decreasing in x and non- increasing in y; 2) Discontinuities in x propagate vertically towards the diagonal  ={(x,y):x=y}, while discontinuities in y propagate horizontally towards the diagonal .

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 13 Theorem. Suppose that M is a closed C 2 - manifold and the measuring function  is C 1. If (x,y) is a discontinuity point for the size function and x<y, then either x or y or both are critical values for . The following result locates the discontinuity points of a size function:

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 14 Main properties of Size Functions

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 15 Size functions are easily computable (from the discrete point of view, we only have to count the connected components of a graph) (We shall tell about this in the last lecture)

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 16 Size functions change the problem of comparing shapes into a simple comparison of functions (e.g., by using an L p - norm) (where K is a compact subset of the real plane)

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 17 Size functions distribute the information all over the real plane, so that they can be used in presence of noise and occlusions.

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 18 Resistance to perturbation

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 19 Measuring function:  (P,Q) = -||P-Q|| (Compare the green structures, revealing the presence of the house)

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 20 Resistance to noise

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 21 What about noise? NOISE Size functions count the number of connected components. How can they resist noise?

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 22 Changing the topological space We have to remember that the topological space doesn’t need to be the original object. The topological space may be, e.g., the rectangle cointaining the image The measuring function  may be, e.g., depending on the local density of black pixels. This way we get resistance to noise.

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 23 Call D(P) the local density of black points at a point P in the rectangle R. Call d(P) the distance of P from the center of mass of the set of black points.We can set  =-d  D/  where  =max{D(P):P  R}. Example

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 24 This way we get resistance to noise:

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 25 Getting resistance to noise by a different kind of measuring function: the  –technique. In this approach, we take the rectangle of the image as a topological space and change the measuring function by adding a function . The function  increases when we leave the shape we are studying. This way we can bridge the gap between two components, provided that the cost  is paid.

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 26 Resistance to occlusions

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 27 Choosing the right topological space Example: topological spaces M =AxA, N =BxB Measuring functions:  ((P,Q)) =  ((P,Q)) = - ||P-Q|| AB

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 28 is the fingerprint of the wrench Measuring function:  (P,Q) = -||P-Q||

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 29 LEVEL OF COMPARISON Size functions allow to choose the LEVEL OF COMPARISON: details are described by small triangles close to the diagonal , while more general aspects of shape are described by large triangles.

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 30 Size functions inherit invariance from measuring functions. Hence we can get the invariance we want. = The size function with respect to  =y does not see any horizontal deformations.

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 31 The size function with respect to  P  =||P-C|| does not see any deformation which preserves the distance from the center of mass C. =

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 32 Measuring functions invariant under affine or projective transformations can easily be obtained. Therefore, we can easily get size functions invariant under affine or projective transformations. =

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 33 However, size functions are mostly useful when there is NO GROUP OF INVARIANCE

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 34 A curvature driven plane curve evolution and the corresponding size function (w.r.t. the distance from the center of mass) Thanks to Frederic Cao for the curvature evolution code and to Michele d’Amico for making this animation.

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 35 The algebraic representation of a size function by a formal series of lines and points. r+a+b+c

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 36 r’+a’+c’ Another size function with its formal series of lines and points.

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 37 The algebraic representation of size functions allows us to compare them by a matching distance:

International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 38 We have introduced the size function as another flexible geometrical-topological tool for comparing shapes. Size functions are Summary 1)Suitable for comparing shapes; 2)Easy to compute; 3)Easy to compare; 4)Resistant to noise and occlusions (if suitable topological spaces and measuring functions are chosen); 5)Suitable for multilevel description of shape; 6)Suitable for getting the invariance we want; 7)Describable in a compact way by using formal series.