740 likes | 751 Views
Behind The Scenes of the ISS - Database: Modern Techniques of Shape Recognition and Database Retrieval. Dr. Rolf Lakaemper Dept. of Computer and Information Sciences Temple University. Overview. Topics: The Shape Recognition Algorithm Implemented in ISS
E N D
Behind The Scenes of the ISS - Database: Modern Techniques of Shape Recognition and Database Retrieval Dr. Rolf Lakaemper Dept. of Computer and Information Sciences Temple University
Overview • Topics: • The Shape Recognition Algorithm Implemented in ISS • Possible Applications in Different Areas of Computer Vision • Database Query by Vantage Objects - an Alternative to Classical Clustering ?
The Task Comparisonof shape – features...
The Task ... without semantical knowledge.
Results first… • ISS = Intelligent Shape Selection • Image Database providing query by • Keyword • Texture • Shape • Shape is given by user-sketch, a mouse-drawn outline
Key Steps Retrieval by Vantage Objects Retrieval by Direct Shape Comparison
The 2nd Step First: Shape Comparison ISS implements the ASR (Advanced Shape Recognition) Algorithm Developed by Hamburg University in cooperation with Siemens AG, Munich, for industrial applications in... ... robotics ... multimedia (MPEG – 7)
Reticent Proudness… MPEG-7: ASR outperformes classical approaches ! Similarity test (70 basic shapes, 20 different deformations): ASR Hamburg Univ./Siemens AG 76.45 % Curvature Scale Space Mitsubishi ITE-VIL 75.44 % Multilayer Eigenvector Hyundai 70.33 % Zernicke Moments Hanyang University 70.22 % Wavelet Contour Heinrich Hertz Institute Berlin 67.67 % DAG Ordered Trees Mitsubishi/Princeton University 60.00 % (Capitulation :-) IBM --.-- %
Requirements Robust automatic recognition of arbitrary shaped objects which is in accord with human visual perception Wide range of applications... ... recognition of complex and arbitrary patterns ... invariance to basic transformations ... results which are in accord with human perception ... applicable to three main tasks of recognition ... parameter-free operation Industrial requirements... ... robustness ... low processing time
Requirements Next: Strategy Scaling (or resolution) Rotation Robust automatic recognition of arbitrary shaped objects which is in accord with human visual perception Rigid / non-rigid deformation Wide range of applications... ... recognition of complex and arbitrary patterns ... invariance to basic transformations ... results which are in accord with human perception ... applicable to three main tasks of recognition ... parameter-free operation Industrial requirements... ... robustness ... low processing time
Requirements Simple Recognition (yes / no) ... robustness ... low processing time Robust automatic recognition of arbitrary shaped objects which is in accord with human visual perception Common Rating (best of ...) Wide range of applications... ... recognition of complex and arbitrary patterns Analytical Rating (best of, but...) ... results which are in accord with human perception ... invariance to basic transformations ... applicable to three main tasks of recognition ... parameter-free operation Industrial requirements... ... robustness ... low processing time
Different Approaches Pattern Matching... ... Correlation Geometrical description... ... Hough – Transformation Feature – Vectors... ... (Zernicke - ) Moments Based on Visual Parts... ... Mokhtarian ... ASR
Curvature Scale Space (Mokhtarian, Mitsubishi) Creation of reflection-point based feature-vector which implicitely contains part – information
Visual Parts Motivated by psychological experiments (Hoffmann/Richards): split bounding-curve into convex / concave arcs
ASR: Strategy ASR: Strategy Source: 2D - Image Object - Segmentation Contour Extraction Evolution Contour – Segmentation Arc – Matching
Scale Space Ordered set of representations on different information levels
Curve Evolution Target: reduce data by elimination of irrelevant features, preserve relevant features ... noise reduction ... shape simplification:
Curve Evolution: Tangent Space next: TS-properties Transformation from image-space to tangent-space bild s.22
Tangent Space: Properties next: Step-Compensation In tangent space... ... the height of a step shows the turn-angle ... monotonic increasing intervals represent convex arcs ... height-shifting corresponds to rotation ... the resulting curve can be interpreted as 1 – dimensional signal => idea: filter signal in tangent space (demo: 'fishapplet')
Curve Evolution: Step Compensation New nonlinear filter: merging of 2 steps with area – difference F given by: (a-b)pq p + q F = q a g b F F p
Curve Evolution: Step Compensation Interpretation in image – space: ... Polygon – linearization ... removal of visual irrelevant vertices q p removed vertex
Curve Evolution: Step Compensation next: Iterative SC Interpretation in image – space: ... Polygon – linearization ... removal of visual irrelevant vertices
Curve Evolution: Iterative Step Compensation Keep it simple: repeated step compensation ! Remark: there are of course some traps ...
Curve Evolution: Properties The evolution... ... reduces the shape-complexity ... is robust to noise ... is invariant to translation, scaling and rotation ... preserves the position of important vertices ... extracts line segments ... is in accord with visual perception ... offers noise-reduction and shape abstraction ... is parameter free ... is translatable to higher dimensions
Curve Evolution: Properties back Robustness (demo: noiseApplet)
Curve Evolution: Properties back Preservation of position, no blurring !
Curve Evolution: Properties back Strong relation to digital lines and segments
Curve Evolution: Properties back Noise reduction as well as shape abstraction
Curve Evolution: Properties back Parameter free
Curve Evolution: Properties back Extendable to higher dimensions
Curve Evolution: Properties Extendable to higher dimensions
Curve Evolution: Properties Extendable to higher dimensions
Curve Evolution: Properties Extendable to higher dimensions
Shape Comparison: Measure Tangent space offers an intuitive measure:
Shape Comparison: Measure Drawback: not adaptive to unequally distributed noise Solution: partition bounding curve
Shape Comparison: Contour Segmentation Solution: partition bounding curve
Shape Comparison: Contour Segmentation Motivated by psychological experiments (Hoffmann/Richards): split bounding-curve into convex / concave arcs
Shape Comparison: Correspondence next: Corr. -example Optimal arc-correspondence: find one to many (many to one) correspondence, that minimizes the arc-measure !
Graph of Correspondence next: Corr. - Results arc a0 a3 a2 a0 a1 a2 a3 a1 b0 b0 b1 b2 b3 b3 b2 correspondence b1 Graph: ... edge represents correspondence ... node represents matched arcs
Shape Comparison: Correspondence next: Corr. - Results Example: a0 a1 a2 a3 a0 a3 a2 a1 b0 b1 b2 b3 b0 b3 b2 b1
Shape Comparison: Correspondence next: Corr. - Results Result: Optimal correspondence is given by cheapest way
Correspondence: Results Correspondence and arc-measure allow... ... the identification of visual parts as well as ... the identification of the entire object ... a robust recognition of defective parts ... a shape matching which is in accord with human perception
ASR: Applications in Computer Vision • Robotics: Shape Screening • (Movie: Robot2.avi) • Straightforward Training Phase • Recognition of Rough Differences • Recognition of Differences in Detail • Recognition of Parts