Integral Invariants for Shape

Slides:



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

Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
Scale & Affine Invariant Interest Point Detectors Mikolajczyk & Schmid presented by Dustin Lennon.
BRIEF: Binary Robust Independent Elementary Features
Alignment Visual Recognition “Straighten your paths” Isaiah.
By: Michael Vorobyov. Moments In general, moments are quantitative values that describe a distribution by raising the components to different powers.
Extended Gaussian Images
1 Deformation Invariant Shape and Image Matching Polikovsky Senya Advanced Topics in Computer Vision Seminar Faculty of Mathematics and Computer Science.
Space-time interest points Computational Vision and Active Perception Laboratory (CVAP) Dept of Numerical Analysis and Computer Science KTH (Royal Institute.
Image Segmentation some examples Zhiqiang wang
Vicenç Parisi Baradad, Joan Cabestany, Jaume Piera
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.
© 2003 by Davi GeigerComputer Vision November 2003 L1.1 Shape Representation and Similarity OcclusionArticulation Shape similarities should be preserved.
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 II SIZE FUNCTIONS:
EE663 Image Processing Edge Detection 5 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
1 Curvature Driven Flows Allen Tannenbaum. 2 Basic curve evolution: Invariant Flows  Planar curve:  General flow:  General geometric flow:
Edge detection. Edge Detection in Images Finding the contour of objects in a scene.
1 Numerical geometry of non-rigid shapes Spectral Methods Tutorial. Spectral Methods Tutorial 6 © Maks Ovsjanikov tosca.cs.technion.ac.il/book Numerical.
Distinctive Image Feature from Scale-Invariant KeyPoints
Data smoothing Raymond Cuijpers. Index The moving average Convolution The difference operator Fourier transforms Gaussian smoothing Butterworth filters.
Object Recognition Using Distinctive Image Feature From Scale-Invariant Key point D. Lowe, IJCV 2004 Presenting – Anat Kaspi.
1Ellen L. Walker Matching Find a smaller image in a larger image Applications Find object / pattern of interest in a larger picture Identify moving objects.
1 Invariant Local Feature for Object Recognition Presented by Wyman 2/05/2006.
Image Primitives and Correspondence
Introduction to Object Tracking Presented by Youyou Wang CS643 Texas A&M University.
Distinctive Image Features from Scale-Invariant Keypoints David G. Lowe – IJCV 2004 Brien Flewelling CPSC 643 Presentation 1.
MASKS © 2004 Invitation to 3D vision Lecture 3 Image Primitives andCorrespondence.
Computer vision.
Advanced Computer Vision Chapter 4 Feature Detection and Matching Presented by: 傅楸善 & 許承偉
Recognition and Matching based on local invariant features Cordelia Schmid INRIA, Grenoble David Lowe Univ. of British Columbia.
V. Space Curves Types of curves Explicit Implicit Parametric.
Local invariant features Cordelia Schmid INRIA, Grenoble.
7.1. Mean Shift Segmentation Idea of mean shift:
Shape Based Image Retrieval Using Fourier Descriptors Dengsheng Zhang and Guojun Lu Gippsland School of Computing and Information Technology Monash University.
Introduction EE 520: Image Analysis & Computer Vision.
Axial Flip Invariance and Fast Exhaustive Searching with Wavelets Matthew Bolitho.
CVPR 2003 Tutorial Recognition and Matching Based on Local Invariant Features David Lowe Computer Science Department University of British Columbia.
Non-Euclidean Example: The Unit Sphere. Differential Geometry Formal mathematical theory Work with small ‘patches’ –the ‘patches’ look Euclidean Do calculus.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Extracting features from spatio-temporal volumes (STVs) for activity recognition Dheeraj Singaraju Reading group: 06/29/06.
CS654: Digital Image Analysis Lecture 36: Feature Extraction and Analysis.
Hough Transform Procedure to find a shape in an image Shape can be described in parametric form Shapes in image correspond to a family of parametric solutions.
Features, Feature descriptors, Matching Jana Kosecka George Mason University.
Methods for 3D Shape Matching and Retrieval
Distinctive Image Features from Scale-Invariant Keypoints
Joint Moments and Joint Characteristic Functions.
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.
MASKS © 2004 Invitation to 3D vision Lecture 3 Image Primitives andCorrespondence.
1 Shape Descriptors for Maximally Stable Extremal Regions Per-Erik Forss´en and David G. Lowe Department of Computer Science University of British Columbia.
SIFT.
SIFT Scale-Invariant Feature Transform David Lowe
Global TRANSFORMATION ESTIMATION VIA LOCAL REGION CONSENSUS
Lecture 07 13/12/2011 Shai Avidan הבהרה: החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
LOCUS: Learning Object Classes with Unsupervised Segmentation
A Perceptual Shape Descriptor
Slope and Curvature Density Functions
Paper Presentation: Shape and Matching
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
Dynamical Statistical Shape Priors for Level Set Based Tracking
Image Retrieval Longin Jan Latecki.
SIFT.
Detecting image intensity changes
Edge Detection in Computer Vision
Integrated Math One Module 7 Test Review.
Fourier Transform of Boundaries
Which equation does the function {image} satisfy ?
Presented by Xu Miao April 20, 2005
Recognition and Matching based on local invariant features
Unit 1 Transformations in the Coordinate Plane
Presentation transcript:

Integral Invariants for Shape Siddharth Manay1, Byung-Woo Hong2, Anthony Yezzi3 and Stefano Soatto4 {manay,hong,soatto@cs.ucla.edu ayezzi@ece.gatech.edu} 1University of California at Los Angeles 2University of Oxford 3Georgia Institute of Technology Problem: Describing Shape Example: Local Distance Invariant Results: Invariants Design a representation of shape that is invariant to a group (e.g. Euclidian or Affine), local (hence robust to occlusions and deformations), and robust to noise. Traditional differential invariants are invariant and local, but not robust to noise. For invariance to rigid transformation in 2D (G=SE(2)). Where q(p,x) is a local kernel (e.g. a Gaussian kernel with variance s). We seek a representation based on integral computations rather than derivatives. Start with closed, planar contours. Example: Local Area Invariant Shape Distance Invariant Local Area Invariant Differential Invariant Results: Shape Matching Discussion Since integral invariants are robust, not invariant, to occlusions, large occlusions result in high shape distance. Unlike smoothing, robust invariants do not destroy information. Solution: Integral Invariant For a contour and a group G acting on , is an integral G-invariant if such that For invariance to rigid transformation in 2D (G=SE(2)). where h(·, ·) satisfies Contribution is the interior of the contour, and Br(p) is a kernel (e.g. Gaussian with variance s or ball with scale r). In the limit this invariant is a function of curvature. for Different choices of kernel h (·, ·) yield different families of invariants. Defined families of invariants based on integral computations: Invariant Local Robust to noise. UCLAVISION LABORATORY http://vision.ucla.edu