Size Function Jianwei Hu 2007-05-23. Author Patrizio Frosini Ricercatore presso la Facolt à di Ingegneria dell'Universit à di Bologna Ricercatore presso.

Slides:



Advertisements
Similar presentations
Distinctive Image Features from Scale-Invariant Keypoints
Advertisements

อ. สนั่น ศรีสุข Computer Graphics and Multimedia (EECP0462) อ. สนั่น ศรีสุข Bachelor of Engineering (MUT) Master of Engineering (MUT)
1 A camera is modeled as a map from a space pt (X,Y,Z) to a pixel (u,v) by ‘homogeneous coordinates’ have been used to ‘treat’ translations ‘multiplicatively’
An Application of Lie theory to Computer Graphics Applied Topology 25 th July Będlewo Shizuo KAJI Yamaguchi University JST/CREST.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Extended Gaussian Images
Comparison Methodologies. Evaluating the matching characteristics Properties of the similarity measure Robustness of the similarity measure – Low variation.
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
Topology Senior Math Presentation Nate Black Bob Jones University 11/19/07.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Effective Image Database Search via Dimensionality Reduction Anders Bjorholm Dahl and Henrik Aanæs IEEE Computer Society Conference on Computer Vision.
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 II SIZE FUNCTIONS:
Lecture 6: Feature matching CS4670: Computer Vision Noah Snavely.
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:
1 Bronstein, Bronstein, and Kimmel Joint extrinsic and intrinsic similarity of non-rigid shapes Rock, paper, and scissors Joint extrinsic and intrinsic.
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 III SIZE FUNCTIONS.
1 Matching Shapes with a Reference Point Volkan Çardak.
Numerical geometry of non-rigid shapes
Approaches to Representing and Recognizing Objects Visual Classification CMSC 828J – David Jacobs.
00/4/103DVIP-011 Part Three: Descriptions of 3-D Objects and Scenes.
CS 485/685 Computer Vision Face Recognition Using Principal Components Analysis (PCA) M. Turk, A. Pentland, "Eigenfaces for Recognition", Journal of Cognitive.
Using 3D-SURFER. Before you start 3D-Surfer can be accessed at For visualization.
Chapter 5 Linear Inequalities and Linear Programming Section R Review.
Lecture 1: Introduction to Pattern Recognition
Section 9.2 Infinite Series: “Monotone Sequences”.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Performance Evaluation of Grouping Algorithms Vida Movahedi Elder Lab - Centre for Vision Research York University Spring 2009.
CSE 788 X.14 Topics in Computational Topology: --- An Algorithmic View Lecture 1: Introduction Instructor: Yusu Wang.
Chapters 1 & 6 Intro to Graphics Communication & Technical Drawing Tools Scales.
Robust Image Topological Feature Extraction Kārlis Freivalds, Paulis Ķikusts Theory Days at Jõulumäe October 2008 University of Latvia.
Machine Vision for Robots
1 TEMPLATE MATCHING  The Goal: Given a set of reference patterns known as TEMPLATES, find to which one an unknown pattern matches best. That is, each.
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
7.1. Mean Shift Segmentation Idea of mean shift:
CSIE in National Chi-Nan University1 Approximate Matching of Polygonal Shapes Speaker: Chuang-Chieh Lin Advisor: Professor R. C. T. Lee National Chi-Nan.
General (point-set) topology Jundong Liu Ohio Univ.
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.
University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction to computer vision Chapter 2: Image.
S. Kurtek 1, E. Klassen 2, Z. Ding 3, A. Srivastava 1 1 Florida State University Department of Statistics 2 Florida State University Department of Mathematics.
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Invariants to affine transform What is affine transform ?
13.2Series. Sequence 2, 4, 6, …, 2n, … A sequence is a list. Related finite series Related infinite series … + 2n + … Series.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Lecture 7: Features Part 2 CS4670/5670: Computer Vision Noah Snavely.
Similar Figures, Day 2. Warm Up Two figures are similar if one can be obtained from the other using a sequence of transformations in the plane.
Positively Expansive Maps and Resolution of Singularities Wayne Lawton Department of Mathematics National University of Singapore
Methods for 3D Shape Matching and Retrieval
CSE 5559 Computational Topology: Theory, algorithms, and applications to data analysis Lecture 0: Introduction Instructor: Yusu Wang.
Two Finger Caging of Concave Polygon Peam Pipattanasomporn Advisor: Attawith Sudsang.
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.
Introduction to Scale Space and Deep Structure. Importance of Scale Painting by Dali Objects exist at certain ranges of scale. It is not known a priory.
Activation—Unit 5 Day 1 August 5 th, 2013 Draw a coordinate plane and answer the following: 1. What are the new coordinates if (2,2) moves right 3 units?
Image features and properties. Image content representation The simplest representation of an image pattern is to list image pixels, one after the other.
Geometric Transformations
Feature description and matching
Object Recognition in the Dynamic Link Architecture
3D Models and Matching particular matching techniques
Outline Peter N. Belhumeur, Joao P. Hespanha, and David J. Kriegman, “Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection,”
outline Two region based shape analysis approach
Chapter 5 Linear Inequalities and Linear Programming
Discrete Surfaces and Manifolds: A Potential tool to Image Processing
Comparing Images Using Hausdorff Distance
Descriptions of 3-D Objects and Scenes
Presentation transcript:

Size Function Jianwei Hu

Author Patrizio Frosini Ricercatore presso la Facolt à di Ingegneria dell'Universit à di Bologna Ricercatore presso la Facolt à di Ingegneria dell'Universit à di Bologna Dipartimento di Matematica, Piazza di Porta San Donato, 5, BOLOGNA Dipartimento di Matematica, Piazza di Porta San Donato, 5, BOLOGNA

References 1. Frosini, P., A distance for similarity classes of submanifolds of a Euclidean space, Bull. Austral. Math. Soc. 42, 3 (1990), Verri, A., Uras, C., Frosini, P., Ferri, M., On the use of size functions for shape analysis, Biol. Cybern. 70, (1993), Frosini, P., Landi, C., Size Theory as a Topological Tool for Computer Vision, Pattern Recognition and Image Analysis, Vol. 9, No. 4, , Frosini, P., Pittore, M., New methods for reducing size graphs, Intern. J. Computer Math. 70, , Frosini, P., Landi, C., Size functions and formal series, Applicable Algebra in Engin. Communic. Comput., 12(4) (2001), Cerri, A., Ferri, M., Giorgi, D., Retrieval of trademark images by means of size functions, Graph. Models, 68 (2006), d'Amico, M., Frosini, P., and Landi, C., Using matching distance in Size Theory: a survey, International Journal of Imaging Systems and Technology, Vol. 16 (2006), No. 5, 154 – Donatini, P., Frosini, P., Natural pseudodistances between closed surfaces, Journal of the European Mathematical Society, Vol. 9 (2007), No. 2, 231 – d'Amico, M., Frosini, P., and Landi, C., Natural pseudo-distance and optimal matching between reduced size functions (submitted).

Outline General Concepts of Size Function General Concepts of Size Function Definition Definition Invariant Properties Invariant Properties Comparing Size Function Comparing Size Function Corner Points & Formal Series Corner Points & Formal Series Reducing Size Graphs Reducing Size Graphs  -reduction  -reduction ⊿ -reduction ⊿ -reduction Measuring Functions Measuring Functions Applications Applications Images Retrieval Images Retrieval 3D Shape Matching 3D Shape Matching

What are Size Functions Size Functions are a new kind of mathematical transform Size Functions are a new kind of mathematical transform Size Functions are a mathematical tool for describing and comparing shapes of topological spaces Size Functions are a mathematical tool for describing and comparing shapes of topological spaces Shape Size graph Natural number Shape Size graph Natural number measuring function size function

Definitions Definition 1: Size Pair Definition 1: Size Pair is a compact topological space. is a compact topological space. is a continuous function from to the set (called measuring function). is a continuous function from to the set (called measuring function). Definition 2: homotopy Definition 2: homotopy For every we define a relation in by setting if and only if either or there exists a continuous path such that and for every. In this second case we shall say that and are homotopic and call a homotopy from to. The BULLETIN of the Australian Mathematical Society 1990

Definitions (Contd.) Remark 3: Remark 3: For every we shall denote by the set. Definition 4: Size Function Definition 4: Size Function Consider the function defined by setting equal to the (finite or infinite) number of equivalence classes in which is divided by the equivalence relation. Such a function will be called the size function associated with the size pair. The BULLETIN of the Australian Mathematical Society 1990

Example

Invariant Properties Euclidean Invariance Euclidean Invariance Biological Cybernetics 1993

Invariant Properties “ Ad hoc ” Invariance“ Ad hoc ” Invariance Biological Cybernetics 1993

Resistant to Noise Biological Cybernetics 1993

Resistant to Occlusions Biological Cybernetics 1993

Concepts for Comparison Cornerpoint Cornerpoint Formal Series Formal Series 3A+B+4C+5D+E 3A+B+4C+5D+E Applicable Algebra in Engineering, Communication and Computing 2001

How to Compare Compare formal series and Hausdorff distance Hausdorff distance Two sets and Two sets and Matching distance Matching distance Two sets and Two sets and is the set of all bijections from to is the set of all bijections from to Applicable Algebra in Engineering, Communication and Computing 2001

Reduction of Size Graphs A global method:  -reduction A global method:  -reduction A local method: ⊿ -reduction A local method: ⊿ -reduction International Journal of Computer Mathematics 1999

 -reduction is the set of one ring neighbor of is the set of one ring neighbor of is the set for which takes the largest value is the set for which takes the largest value is the single step descent flow function is the single step descent flow function is the descent flow operator is the descent flow operator Minimum vertex Minimum vertex Main saddle Main saddle International Journal of Computer Mathematics 1999

 -reduction International Journal of Computer Mathematics 1999

⊿ -reduction Three simple ⊿ -moves Three simple ⊿ -moves International Journal of Computer Mathematics 1999

⊿ -reduction International Journal of Computer Mathematics 1999

⊿ -reduction Does a total ⊿ -reduction exist? Does a total ⊿ -reduction exist? Two different ways to obtain the same total ⊿ - reduction Two different ways to obtain the same total ⊿ - reduction International Journal of Computer Mathematics 1999

 -reduction vs ⊿ -reduction  KO ⊿ ⊿  KO  International Journal of Computer Mathematics 1999

 -reduction vs ⊿ -reduction Sometimes  -reduction makes the size graph worse Sometimes  -reduction makes the size graph worse The procedure of applying simple ⊿ -moves cannot proceed indefinitely The procedure of applying simple ⊿ -moves cannot proceed indefinitely International Journal of Computer Mathematics 1999

Measuring Functions Distance from points Distance from points Projections Projections Jumps Jumps Graphical Models 2006

Images Retrieval Graphical Models 2006

3D Shape Matching Measuring Functions Measuring Functions Distance from the center of mass to each vertex Distance from the center of mass to each vertex Transformations invariance Transformations invariance Distance from some fixed planes Distance from some fixed planes Distance from the point user specified Distance from the point user specified Deformed model retrieval Deformed model retrieval Curvature of each point (patch) Curvature of each point (patch) Feature sensitive Feature sensitive

3D Shape Matching Size graph reduction Size graph reduction Salient Geometric Features for Partial Shape Matching and Similarity, Ran Gal and Daniel Cohen-or, ACM Transactions on Graphics, Vol. 25, No. 1, January 2006, Pages 130 – 150.