Work in progress in graphics recognition Mathieu Delalandre DAGMinar, 12th of May 2009, CVC, Barcelone, Spain.

Slides:



Advertisements
Similar presentations
Top-Down & Bottom-Up Segmentation
Advertisements

Employing structural representation for symbol detection, symbol spotting and indexation in line drawing document images Muhammad Muzzamil Luqman
Word Spotting DTW.
Chapter 3 Creating a Business Letter with a Letterhead and Table
Content-Based Image Retrieval
FRE 2645 GREC 2003 : 31 July 2003 Local Structural Analysis: a Primer Mathieu Delalandre¹, Eric Trupin¹, Jean-Marc Ogier² ¹PSI Laboratory, Rouen University,
- Recovering Human Body Configurations: Combining Segmentation and Recognition (CVPR’04) Greg Mori, Xiaofeng Ren, Alexei A. Efros and Jitendra Malik -
Image Processing and Interpretation Group University of Nottingham Eureka Meeting, L3i Laboratory, La Rochelle University Tuesday 20th April 2006 Fast.
Texture Segmentation Based on Voting of Blocks, Bayesian Flooding and Region Merging C. Panagiotakis (1), I. Grinias (2) and G. Tziritas (3)
A Robust Approach for Local Interest Point Detection in Line-Drawing Images 1 The Anh Pham, Mathieu Delalandre, Sabine Barrat and Jean-Yves Ramel RFAI.
Building Synthetic Graphical Documents for Performance Evaluation of Symbol Recognition M. Delalandre 1, E. Valveny 1 and T. Pridmore 2 1 CVC, Barcelona,
ICIP 2000, Vancouver, Canada IVML, ECE, NTUA Face Detection: Is it only for Face Recognition?  A few years earlier  Face Detection Face Recognition 
Tuesday, 13th November 2007 Work Group CALYPOD graphiCs imAge anaLYsis from Printed Old Document Presented by.
Young Deok Chun, Nam Chul Kim, Member, IEEE, and Ick Hoon Jang, Member, IEEE IEEE TRANSACTIONS ON MULTIMEDIA,OCTOBER 2008.
Region-based Voting Exemplar 1 Query 1 Exemplar 2.
CS223B Assignment 1 Recap. Lots of Solutions! 37 Groups Many different approaches Let’s take a peek at all 37 results on one image from the test set.
Navigation Strategies for Exploring Indoor Environments Presented by Mathieu Bredif February 17, 2004 CS326A: Motion Planning.
A Probabilistic Framework For Segmentation And Tracking Of Multiple Non Rigid Objects For Video Surveillance Aleksandar Ivanovic, Tomas S. Huang ICIP 2004.
Information retrieval Finding relevant data using irrelevant keys Example: database of photographic images sorted by number, date. DBMS: Well structured.
Lectures 10&11: Representation and description
1 Accurate Object Detection with Joint Classification- Regression Random Forests Presenter ByungIn Yoo CS688/WST665.
Instructor : Dr. K. R. Rao Presented by: Rajesh Radhakrishnan.
Jacinto C. Nascimento, Member, IEEE, and Jorge S. Marques
From Web Documents to Old Books Works in Progress in Graphics Recognition Mathieu Delalandre Meeting of Document Analysis Group Computer Vision Center.
Vector Graphics Making custom images. Raster vs. Vector Graphics In computer graphics, a raster graphics image, or bitmap, is a dot matrix data structure.
Groundtruthing for Performance Evaluation of Document Image Analysis Systems: a primer Mathieu Delalandre Pattern Recognition.
Madonne Talk (Tours University) 7 th November 2006 A Fast System for Dropcap Image Retrieval Mathieu Delalandre and Jean-Marc Ogier L3i, La Rochelle University,
Hubert CARDOTJY- RAMELRashid-Jalal QURESHI Université François Rabelais de Tours, Laboratoire d'Informatique 64, Avenue Jean Portalis, TOURS – France.
Multi-resolution Arc Segmentation: Algorithms and Performance Evaluation Jiqiang Song Jan. 12 th, 2004.
Vectorial Distortion For Performance Evaluation Current investigations …. Mathieu Delalandre and Ernest Valveny Meeting of Document Analysis Group Computer.
Fast System for the Retrieval of Ornamental Letter Image M. Delalandre 1, J.M. Ogier 2, J. Lladós 1 1 CVC, Barcelona, Spain 2 L3i, La Rochelle, France.
Wednesday 19th of November 2008
Fast Retrieval of Old Dropcap Images Mathieu Delalandre, Jean-Marc Ogier and Josep Llados IDoc Meeting Valencia, Spain 22th February 2007.
Tuesday, 6th November 2007 Work Group CALYPOD graphiCs imAge anaLYsis from Printed Old Document Thierry Brouard,
Mining Discriminative Components With Low-Rank and Sparsity Constraints for Face Recognition Qiang Zhang, Baoxin Li Computer Science and Engineering Arizona.
“Hotspot” algorithm chr5:131,975, ,012,092 Idea: gauge enrichment of tags relative to a local background model based on the number of tags in a 50kb.
Symbol Recognition Contest 2009 current status Philippe Dosch 1, Ernest Valveny 2 and Mathieu Delalandre 2 1 LORIA, QGAR team, Nancy, France 2 CVC, DAG.
Performance Evaluation of Graphics Recognition Systems Current investigations …. Mathieu Delalandre Meeting of Document Analysis Group Computer Vision.
Automated Detection and Classification Models SAR Automatic Target Recognition Proposal J.Bell, Y. Petillot.
Towards real-time camera based logos detection Mathieu Delalandre Laboratory of Computer Science, RFAI group, Tours city, France Osaka Prefecture Partnership.
Efficient algorithms for polygonal approximation
Towards Performance Evaluation of Symbol Recognition & Spotting Systems in a Localization Context Mathieu Delalandre CVC, Barcelona, Spain EuroMed Meeting.
Chapter 4: Pattern Recognition. Classification is a process that assigns a label to an object according to some representation of the object’s properties.
A survey of different shape analysis techniques 1 A Survey of Different Shape Analysis Techniques -- Huang Nan.
1 Embedding and Similarity Search for Point Sets under Translation Minkyoung Cho and David M. Mount University of Maryland SoCG 2008.
1 Computer Graphics Clipping Fall FCC Line Clipping What happens when one or both endpoints of a line segment are not inside the specified drawing.
Total Recall: Automatic Query Expansion with a Generative Feature Model for Object Retrieval O. Chum, et al. Presented by Brandon Smith Computer Vision.
A Performance Characterization Algorithm for Symbol Localization Mathieu Delalandre 1,2, Jean-Yves Ramel 2, Ernest Valveny 1 and Muhammad Muzzamil Luqman.
Representing Moving Images with Layers J. Y. Wang and E. H. Adelson MIT Media Lab.
Course 3 Binary Image Binary Images have only two gray levels: “1” and “0”, i.e., black / white. —— save memory —— fast processing —— many features of.
Building Synthetic Graphical Documents for Performance Evaluation M. Delalandre 1, T. Pridmore 2, E. Valveny 1, H. Locteau 3, E. Trupin 3 1 CVC, Barcelona,
Recognizing specific objects Matching with SIFT Original suggestion Lowe, 1999,2004.
A Performance Characterization Algorithm for Symbol Localization Mathieu Delalandre 1, Jean-Yves Ramel 2, Ernest Valveny 1 and Muhammad Muzzamil Luqman.
Content Based Coding of Face Images
Presented by Mathieu Delalandre CESR Meeting CESR, Tours, France
Decimation Of Triangle Meshes
Image Segmentation – Edge Detection
Mathieu Delalandre1, Ernest Valveny1, Tony Pridmore2
Accounting for the relative importance of objects in image retrieval
Representing Moving Images with Layers
Image Segmentation Techniques
Shape matching and object recognition using shape contexts
Representing Moving Images with Layers
RGB-D Image for Scene Recognition by Jiaqi Guo
Searching Similar Segments over Textual Event Sequences
Knowledge-based event recognition from salient regions of activity
Segmentation of Hand Written Text Document
Presenter: Simon de Leon Date: March 2, 2006 Course: MUMT611
SNR-Invariant PLDA Modeling for Robust Speaker Verification
Presentation transcript:

Work in progress in graphics recognition Mathieu Delalandre DAGMinar, 12th of May 2009, CVC, Barcelone, Spain

Plan  Symbol Recognition  Performance Evaluation  Content Based Image Retrieval

p2p2 p1p1 l1l1 l2l2 Symbol Recognition Vector Template MatchingLine Detection (HT) , ,12 0,41 1, Delta5.1Score 211.4Score 1 detected vectors model vectors **7 *6 *5 **4 *3 *2 *1 * detected vectors 7size0missed0false alarm 2split1merged4simple p1p1 L l1l1 l2l2 p2p2 vecteurs modèles vecteurs détectés dy 1 dx 1 dy 2 dx 2 L p L overlap p if dx 1  dx 2 < 0 or dy 1  dy 2 < 0 d1d1 d2d2 π/2π/2 π/2π/2 Build-up the matrix Detect cases Compute the distances

Symbol Recognition GREC’03 dataset (900 symbols) 0 π 2π2π 0 Π/2 Π θ1θ1 θ2θ2 Invariant to shifting Invariant to merging cases Robust to splitting (holes -> picks) Robust to slightly θ distorsion Context based signature for key primitives detection

Plan  Symbol Recognition  Performance Evaluation  Content Based Image Retrieval

Characterisation Groundtruth Groundtruthing Results Performance evaluation System Performance Evaluation c2c2 c1c1 M1M1 M2M2 M3M3 M4M4 C1C1 C2C2 C3C3 C4C4 L1L1 θ1θ1 p1p1 L2L2 θ2θ2 p2p2 p L  bounding box and control point alignment symbol model loaded symbol no selection on model full ? overflow ? selection on constraint overlap ? continue ? constraint stack empty ? building failure model and constraint symbol and constraint no yes building end yes (1) model and constraint selection (2) symbol loader (5) constraint checking (7) Stopping criterion (6) Space management positioned symbol (3) symbol control document generationsymbol positioning (4) shape positioning yes control shapes symbol loader symbol control shape positioning no new loop cleaning reproduction of domain-rules building use

datasetsimagessymbols models bags# floorplans# diagrams# queries# Symbol Models Building Engine (2) run (3) display (1) edit Background Image Performance Evaluation v0 x s  [0,1] y v max

Performance Evaluation Spotting/Recognition System Groundtruth Mapping Region Of Interest Characterization sofa skin tub door Labels r1 r2 r3 Ranks QBE truth results Learning truth results Single : a model line matches only with one detected line. Split : two model lines match with one detected line. Merge : a model line matches with two detected lines. False alarm : a detected line doesn't match with any model lines. Miss : a model line doesn't match with any detected lines. Mapping cases groundtruth ROI Domain definition of ROI SamplingShiftingSignature f localization point overlayed ROI 1.To put at a same level the systems’ results 2.Complexity of detection algorithm θ(n) with concave polygon 3.To limit the over segmentation results SESYD dataset (6 backgrounds, 100 plans, 2521 symbols) cg p θ L

Plan  Symbol Recognition  Performance Evaluation  Content Based Image Retrieval

Content Based Image Retrieval Wood plug (bottom view) printing 1 printing 2 printing 3 plug 1 plug 2 Vascosan 1555Marnef 1576 Printing house plug exchange duplicate Printings produced by a same plug with a 21 year gap Wood plug duplicate Max Mean Min RLERasterQuery (s) x2x2 x2x2 x2x2 x1x1 x1x1 x1x1 x2x2 x2x2 x1x1 line (y) image 1 line (y) image 2 x stack pointeur while x 2  x 1 handle image 2 while x 1  x 2 handle image 1

Content Based Image Retrieval query selection RLE 11 22 if  1 -  2 < 0 push x, cluster while  1 -  2 < 0 next Step 2 Step 1 Size (height, width) Density (foreground, background) Compression (foreground, background) Lowest picks N points selection numerical approximation cumulative curves derivatives 1 st and 2 sd