A Perceptual Shape Descriptor

Slides:



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

Shape Matching and Object Recognition using Low Distortion Correspondence Alexander C. Berg, Tamara L. Berg, Jitendra Malik U.C. Berkeley.
Object Recognition Using Locality-Sensitive Hashing of Shape Contexts Andrea Frome, Jitendra Malik Presented by Ilias Apostolopoulos.
Complex Networks for Representation and Characterization of Images For CS790g Project Bingdong Li 9/23/2009.
Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
Shape Analysis and Retrieval D2 Shape Distributions Notes courtesy of Funk et al., SIGGRAPH 2004.
Wavelets Fast Multiresolution Image Querying Jacobs et.al. SIGGRAPH95.
Presented by Xinyu Chang
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.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Complex Networks for Representation and Characterization of Object For CS790g Project Bingdong Li 11/9/2009.
Planning Paths for Elastic Objects Under Manipulation Constraints Florent Lamiraux Lydia E. Kavraki Rice University Presented by: Michael Adams.
CS 326A: Motion Planning Configuration Space. Motion Planning Framework Continuous representation (configuration space and related spaces + constraints)
Visual Querying By Color Perceptive Regions Alberto del Bimbo, M. Mugnaini, P. Pala, and F. Turco University of Florence, Italy Pattern Recognition, 1998.
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.
Shape Classification Using the Inner-Distance Haibin Ling David W. Jacobs IEEE TRANSACTION ON PATTERN ANAYSIS AND MACHINE INTELLIGENCE FEBRUARY 2007.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
1 Fingerprint Classification sections Fingerprint matching using transformation parameter clustering R. Germain et al, IEEE And Fingerprint Identification.
Hubert CARDOTJY- RAMELRashid-Jalal QURESHI Université François Rabelais de Tours, Laboratoire d'Informatique 64, Avenue Jean Portalis, TOURS – France.
1 Faculty of Information Technology Generic Fourier Descriptor for Shape-based Image Retrieval Dengsheng Zhang, Guojun Lu Gippsland School of Comp. & Info.
2D Shape Matching (and Object Recognition)
Recognition and Matching based on local invariant features Cordelia Schmid INRIA, Grenoble David Lowe Univ. of British Columbia.
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
Shape Matching with Occlusion in Image Databases Aristeidis Diplaros Euripides G.M. Petrakis Evangelos Milios Technical University of Crete.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Texture. Texture is an innate property of all surfaces (clouds, trees, bricks, hair etc…). It refers to visual patterns of homogeneity and does not result.
Shape Based Image Retrieval Using Fourier Descriptors Dengsheng Zhang and Guojun Lu Gippsland School of Computing and Information Technology Monash University.
A 3D Model Alignment and Retrieval System Ding-Yun Chen and Ming Ouhyoung.
Shape Analysis and Retrieval Statistical Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Axial Flip Invariance and Fast Exhaustive Searching with Wavelets Matthew Bolitho.
CS B659: Principles of Intelligent Robot Motion Configuration Space.
Geometry: Similar Triangles. MA.912.G.2.6 Use coordinate geometry to prove properties of congruent, regular and similar polygons, and to perform transformations.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Local invariant features Cordelia Schmid INRIA, Grenoble.
DEFINING SIMILARITY ~ADAPTED FROM WALCH EDUCATION.
Bart M. ter Haar Romeny.  Question: can top-points be used for object- retrieval tasks?
CS654: Digital Image Analysis Lecture 36: Feature Extraction and Analysis.
Methods for 3D Shape Matching and Retrieval
Shape similarity and Visual Parts Longin Jan Latecki Temple Univ., In cooperation with Rolf Lakamper (Temple Univ.),
Shape-Representation and Shape Similarity Dr. Rolf Lakaemper Part 1: Shapes.
CS654: Digital Image Analysis
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.
Image features and properties. Image content representation The simplest representation of an image pattern is to list image pixels, one after the other.
J. Flusser, T. Suk, and B. Zitová Moments and Moment Invariants in Pattern Recognition The slides accompanying.
1 Faculty of Information Technology Enhanced Generic Fourier Descriptor for Object-Based Image Retrieval Dengsheng Zhang, Guojun Lu Gippsland School of.
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.
Find the optimal alignment ? +. Optimal Alignment Find the highest number of atoms aligned with the lowest RMSD (Root Mean Squared Deviation) Find a balance.
What is a rigid transformation?  A transformation that does not change the size or shape of a figure.
Image Representation and Description – Representation Schemes
EQ: How do we know if polygons are similar?
Paper Presentation: Shape and Matching
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
Feature description and matching
Object Recognition in the Dynamic Link Architecture
Fitting Curve Models to Edges
Aim of the project Take your image Submit it to the search engine
Improving Retrieval Performance of Zernike Moment Descriptor on Affined Shapes Dengsheng Zhang, Guojun Lu Gippsland School of Comp. & Info Tech Monash.
Multimedia Information Retrieval
Noah Snavely.
What Is Good Clustering?
Scale-Space Representation for Matching of 3D Models
Comparing Images Using Hausdorff Distance
Mod 16.3: Corresponding Parts of Similar Figures
Recognition and Matching based on local invariant features
Calibration and homographies
Defining Similarity (5.3.1)
Presentation transcript:

A Perceptual Shape Descriptor Nafiz ARICA, Fatoş T. YARMAN-VURAL METU, Department of Computer Engineering {nafiz, vural}@ceng.metu.edu.tr METU, Department of Computer Engineering

BAS: A shape Descriptor with Beam Angle Statistics Represents each boundary point with the statistics of the beam angles in a set of neighborhood, Elaborates the idea of using the statistics of the representations at all scales, Avoids heuristics or threshold values for selecting a representation at an “appropriate” scale, Insensitive to distortions, rotation, translation and scale, Measures similarity by elastic matching. METU, Department of Computer Engineering

Beams at Boundary Points Beams, are the lines connecting a point with the rest of the points on the boundary. beams of the point p(i) is the set of lines    Vi+j and Vi-j are the forward and backward vectors connecting p(i) with, p(i+j) and p(i-j), for j=1,…N/2 METU, Department of Computer Engineering

Kth Order Neighborhood System For each neighborhood system K, there is only one pair of beams, METU, Department of Computer Engineering

METU, Department of Computer Engineering Beam Angle For the point p(i), the angle between the beams in the kth order neighborhood system: METU, Department of Computer Engineering

METU, Department of Computer Engineering Plots of CK(i)’s with fix K values k=N/40 k=N/10 k=N/4 k=N/40 : N/4 METU, Department of Computer Engineering

METU, Department of Computer Engineering What is the most appropriate value for K which discriminates the shapes in large database and represents the shape information at all scale ? Answer: Find a representation which employs the information in CK(i) for all values of K. Output of a stochastic process at each point METU, Department of Computer Engineering

METU, Department of Computer Engineering C(i) is a Random Variable of the stochastic process which generates the beam angles mth moment of random variable C(i) Each boundary point i is represented by the moments of C(i) METU, Department of Computer Engineering

First three moments of C(i)’s METU, Department of Computer Engineering

METU, Department of Computer Engineering Correspondence of Visual Parts and Insensitivity to Affine Transformation METU, Department of Computer Engineering

Robustness to Polygonal Approximation Robustness to Noise METU, Department of Computer Engineering

Similarity Measurement Elastic Matching Algorithm Similarity Measurement method Application of dynamic programming Minimize the distance between two patterns by allowing deformations on the patterns. Cost of matching two items is calculated by Euclidean metric. Robust to distortions promises to approximate human ways of perceiving similarity METU, Department of Computer Engineering

TEST RESULT FOR MPEG 7 CE PART A-1 Robustness to Scaling METU, Department of Computer Engineering

TEST RESULT FOR MPEG 7 CE PART A-2 Robustness to Rotation METU, Department of Computer Engineering

TEST RESULT FOR MPEG 7 CE PART B Similarity-based Retrieval METU, Department of Computer Engineering

TEST RESULT FOR MPEG 7 CE PART C Motion and Non-Rigid Deformations METU, Department of Computer Engineering

METU, Department of Computer Engineering Comparison Best Studies in MPEG 7 CE Shape 1; Data Set Shape Context Tangent Space Curvature Scale Space Zernika Moments Wavelet DAG SBA with length 40 SBA with length 60 Part A1 _ 88.65 89.76 92.54 88.04 85 89.32 90.87 Part A2 100 99.37 99.60 97.46 99.82 Part B 76.51 76.45 75.44 70.22 67.76 60 81.04 82.37 Part C 92 96 94.5 93 83 93.5 METU, Department of Computer Engineering

Performance Evaluation (1) Average performance with the average over the three parts; Total Score1 = 1/3 A + 1/3 B + 1/3 C Tangent Space Curvature Scale Space Zernika Moments Wavelet DAG SBA with length 40 SBA with length 60 Total Score 1 87.59 88.67 86.93 84.50 76 90.80 91.69 (2) Average performance with the average over the number of queries; Total Score2 = 840/2241 A + 1400/2241 B+ 1 / 2241 C Tangent Space Curvature Scale Space Zernika Moments Wavelet DAG SBA with length 40 SBA with length 60 Total Score 2 83.16 82.62 79.92 77.14 69.38 86.12 87.27 METU, Department of Computer Engineering