Laboratoire d'InfoRmatique en Image et Systèmes d'information FRE 2672 CNRS/INSA de Lyon/Université Claude Bernard Lyon 1/Université Lumière Lyon 2/Ecole.

Slides:



Advertisements
Similar presentations
- Laboratoire d'InfoRmatique en Image et Systèmes d'information LIRIS UMR 5205 CNRS/INSA de Lyon/Université
Advertisements

Surface Simplification using Quadric Error Metrics Guowei Wu.
Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.
Developer’s Survey of Polygonal Simplification Algorithms Based on David Luebke’s IEEE CG&A survey paper.
Image Segmentation Image segmentation (segmentace obrazu) –division or separation of the image into segments (connected regions) of similar properties.
Lecture 07 Segmentation Lecture 07 Segmentation Mata kuliah: T Computer Vision Tahun: 2010.
Fast and Extensible Building Modeling from Airborne LiDAR Data Qian-Yi Zhou Ulrich Neumann University of Southern California.
Atomic Volumes for Mesh Completion Joshua Podolak Szymon Rusinkiewicz Princeton University.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
Segmentation and Region Detection Defining regions in an image.
High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.
Segmentation into Planar Patches for Recovery of Unmodeled Objects Kok-Lim Low COMP Computer Vision 4/26/2000.
- Laboratoire d'InfoRmatique en Image et Systèmes d'information LIRIS UMR 5205 CNRS/INSA de Lyon/Université Claude.
lecture 4 : Isosurface Extraction
EE 7730 Image Segmentation.
Thresholding Otsu’s Thresholding Method Threshold Detection Methods Optimal Thresholding Multi-Spectral Thresholding 6.2. Edge-based.
Hierarchical Region-Based Segmentation by Ratio-Contour Jun Wang April 28, 2004 Course Project of CSCE 790.
1 Learning to Detect Objects in Images via a Sparse, Part-Based Representation S. Agarwal, A. Awan and D. Roth IEEE Transactions on Pattern Analysis and.
University of CreteCS4831 The use of Minimum Spanning Trees in microarray expression data Gkirtzou Ekaterini.
Segmentation Divide the image into segments. Each segment:
Filling Arbitrary Holes in Finite Element Models 17 th International Meshing Roundtable 2008 Schilling, Bidmon, Sommer, and Ertl.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Part Two Multiresolution Analysis of Arbitrary Meshes M. Eck, T. DeRose, T. Duchamp, H. Hoppe, M. Lounsbery, W. Stuetzle SIGGRAPH 95.
CS CS 175 – Week 4 Triangle Mesh Smoothing Discrete Differential Geometry.
Robust Statistical Estimation of Curvature on Discretized Surfaces Evangelos Kalogerakis Patricio Simari Derek Nowrouzezahrai Karan Singh Symposium on.
Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’04) /04 $20.00 c 2004 IEEE 1 Li Hong.
Chapter 10: Image Segmentation
Hubert CARDOTJY- RAMELRashid-Jalal QURESHI Université François Rabelais de Tours, Laboratoire d'Informatique 64, Avenue Jean Portalis, TOURS – France.
Computer Vision James Hays, Brown
Laboratoire d'InfoRmatique en Image et Systèmes d'information LIRIS UMR 5205 CNRS/INSA de Lyon/Université Claude Bernard Lyon 1/Université Lumière Lyon.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Graph-based Segmentation. Main Ideas Convert image into a graph Vertices for the pixels Vertices for the pixels Edges between the pixels Edges between.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Computer Vision Lecture 5. Clustering: Why and How.
S EGMENTATION FOR H ANDWRITTEN D OCUMENTS Omar Alaql Fab. 20, 2014.
ENT 273 Object Recognition and Feature Detection Hema C.R.
Interactive surface reconstruction on triangle meshes with subdivision surfaces Matthias Bein Fraunhofer-Institut für Graphische Datenverarbeitung IGD.
DPL10/16/2015 CS 551/651: Simplification Continued David Luebke
CSE 185 Introduction to Computer Vision Pattern Recognition 2.
- Laboratoire d'InfoRmatique en Image et Systèmes d'information LIRIS UMR 5205 CNRS/INSA de Lyon/Université.
3D polygonal meshes watermarking using normal vector distributions Suk-Hawn Lee, Tae-su Kim, Byung-Ju Kim, Seong-Geun Kwon.
Semi-regular 3D mesh progressive compression and transmission based on an adaptive wavelet decomposition 21 st January 2009 Wavelet Applications in Industrial.
Data Extraction using Image Similarity CIS 601 Image Processing Ajay Kumar Yadav.
Neighborhood-Based Topology Recognition in Sensor Networks S.P. Fekete, A. Kröller, D. Pfisterer, S. Fischer, and C. Buschmann Corby Ziesman.
Image Segmentation and Edge Detection Digital Image Processing Instructor: Dr. Cheng-Chien LiuCheng-Chien Liu Department of Earth Sciences National Cheng.
1 Shape Segmentation and Applications in Sensor Networks Xianjin Xhu, Rik Sarkar, Jie Gao Department of CS, Stony Brook University INFOCOM 2007.
UMR 5205 C. ROUDETF. DUPONTA. BASKURT Laboratoire d'InfoRmatique en Image et Systèmes d'information UMR5205 CNRS/INSA de Lyon/Université Claude Bernard.
Scene Completion Using Millions of Photographs James Hays, Alexei A. Efros Carnegie Mellon University ACM SIGGRAPH 2007.
Extraction and remeshing of ellipsoidal representations from mesh data Patricio Simari Karan Singh.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Levels of Image Data Representation 4.2. Traditional Image Data Structures 4.3. Hierarchical Data Structures Chapter 4 – Data structures for.
Computer Science 1 Using Clustering Information for Sensor Network Localization Haowen Chan, Mark Luk, and Adrian Perrig Carnegie Mellon University
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
EE4328, Section 005 Introduction to Digital Image Processing Image Segmentation Zhou Wang Dept. of Electrical Engineering The Univ. of Texas at Arlington.
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
TOPIC 12 IMAGE SEGMENTATION & MORPHOLOGY. Image segmentation is approached from three different perspectives :. Region detection: each pixel is assigned.
- Laboratoire d'InfoRmatique en Image et Systèmes d'information LIRIS UMR 5205 CNRS/INSA.
Instructor: Mircea Nicolescu Lecture 10 CS 485 / 685 Computer Vision.
1 Review and Summary We have covered a LOT of material, spending more time and more detail on 2D image segmentation and analysis, but hopefully giving.
Color Image Segmentation Mentor : Dr. Rajeev Srivastava Students: Achit Kumar Ojha Aseem Kumar Akshay Tyagi.
Real-Time Hierarchical Scene Segmentation and Classification Andre Uckermann, Christof Elbrechter, Robert Haschke and Helge Ritter John Grossmann.
Course : T Computer Vision
Domain-Modeling Techniques
Graph Cut Weizhen Jing
Scale-Space Representation of 3D Models and Topological Matching
Quasi-linear algorithms for the topological watershed
Presentation transcript:

Laboratoire d'InfoRmatique en Image et Systèmes d'information FRE 2672 CNRS/INSA de Lyon/Université Claude Bernard Lyon 1/Université Lumière Lyon 2/Ecole Centrale de Lyon, Université Claude Bernard Lyon1 - Bâtiment Nautibus 43, boulevard du 11 Novembre 1918 – F Villeurbanne Cedex FRE 2672 – WorkShop Télégéo 6/11/03 Curvature Based Triangle Mesh Segmentation with Boundary Rectification Guillaume Lavoué, Florent Dupont, Atilla Baskurt

WorkShop Télégéo 6/11/03 2 Plan Context. Method overview. The region segmentation process.  Vertex classification.  Region growing.  Region merging. The boundary rectification process.  Why ?  The Boundary Score definition.  General algorithm.  Correct boundary marking.  Contour tracking. Perspectives.

WorkShop Télégéo 6/11/03 3 Context Semantic-3D RNRT national project.  Request and transmission of 3D CAD objects, multi- bandwidths, multi- platforms. Topics are Indexing, Watermarking and Compression.  Research of an adaptive, multi-resolution compression method. Chosen approach.  Subdivision surface fitting.  Arbitrary topology.  Intrinsically Multi-resolution.  Represented by a mesh.  Prior segmentation of the mesh into patches.  To simplify the fitting algorithm.  To permit adaptiveness. Context - Method Overview - Region segmentation - boundary rectification -Perspectives

Complete process diagram Compressed model Manifold CAD mesh Segmentation Patch Subdivision Surface fitting Assembling Patch Subdivision Surface fitting Adaptive precision Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 5 Plan Context. Method overview. The region segmentation process.  Vertex classification.  Region growing.  Region merging. The boundary rectification process.  Why ?  The Boundary Score definition.  General algorithm.  Correct boundary marking.  Contour tracking. Perspectives. Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 6 Method overview Boundary edges extraction 3D Triangle mesh Vertex curvature classification Classified vertices Region growing Region merging Segmented regions Constant curvature region segmentation Boundary edges Boundary Score processing Correct boundary edges Contour tracking Rectified boundaries boundary rectification We need known curvature surface patches with regular boundaries for the fitting process. Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 7 Plan Context. Method overview. The region segmentation process.  Vertex classification.  Region growing.  Region merging. The boundary rectification process.  Why ?  The Boundary Score definition.  General algorithm.  Correct boundary marking.  Contour tracking. Perspectives.

WorkShop Télégéo 6/11/03 8 Vertex classification Extraction of discrete curvature. [ Meyer, Discrete Differential- Geometry Operators for Triangulated 2-Manifolds (VisMath 2002)]  Mean Curvature:  Gauss Curvature:  Principal Curvatures: avec Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 9 Vertex classification  Principal curvature directions dmax et dmin. Eigenvectors of the curvature tensor, found by least square fitting.. 0,25 2,5 -7,0 4,5 0,0 2,3 2,7 4,5 Mean Gauss abs(Min) Max dmin dmax Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 10 Vertex classification Curvature classification.  K-Means clustering applied to Kmin and Kmax.  Cluster regularization. kmax kmin Classification 5 clusters kmax kmin Classification 5 clusters Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 11 Region growing Region growing.  Triangle growing and labeling operation. triangle regions with holes between them.  Crack filling process. Not-labeled triangles are assigned to regions according to:  Their neighbor triangles labels.  Boundary criteria. Triangle growingCrack filling Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 12 Purpose:  Reduce the over-segmentation resulting from region growing.  Suppress results dependency to K-Means clusters number. General algorithm:  Region adjacency graph construction.  Nodes: connected regions.  Edges: adjacency between two regions.  Calculation of similarity distances between regions.  Valuation of the graph edges.  Graph reduction.  At each iteration the smallest adjacency edge is eliminated.  Stopping criteria.  A number of queried final regions.  A maximum distance threshold. Region merging Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 13 Region merging Region distance measurement.  The distance D ij between i th and j th regions is:  The curvature distance DC ij :  Two situations between two regions: RiRi RjRj RiRi RjRj No curvature difference but a significant boundary No significant boundary but a curvature difference Chosen curvature distance With:C i, C j, the curvature values of the i th and j th regions. C ij, the curvature value of their boundary. Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 14 Region merging  The nesting coefficient N ij : Introduced in image processing by Schettini in Segmentation Algorithm For Color Images (Pattern Recognition Letters 1993).  The filtering coefficient S ij : The fusion of smallest regions is accelerated. With:P i, P j, the perimeters of the i th and j th regions. P ij, the common perimeter of the i th and j th regions. With:A i, A j, the areas of the i th and j th regions. A ij, a minimum fixed area., a positive number ~ 0. Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 15 Samples Fandisk 6475 vertices Vertex classification Classified vertices 14 clusters Region growing Segmented Fandisk 68 regions Region merging Threshold = 50 Segmented Fandisk 16 regions Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 16 Samples Shark vertices Vertex classification Classified vertices 10 clusters Region growing Segmented Shark 343 regions Region merging Threshold = 50 Segmented Shark 16 regions Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 17 Curvature classification results dependency Tests conducted with different K-Means clusters number. Cluster Nb regularized Region Nb After growing Region Nb After merging Results Threshold =

WorkShop Télégéo 6/11/03 18 Plan Context. Method overview. The region segmentation process.  Vertex classification.  Region growing.  Region merging. The boundary rectification process.  Purpose.  The Boundary Score definition.  General algorithm.  Correct boundary marking.  Contour tracking. Perspectives.

WorkShop Télégéo 6/11/03 19 Purpose ? The subdivision surface fitting needs clean boundaries without discontinuities.  Method:  Extraction of the boundary edges from the segmented object.  Marking of the “correct” boundary edges with a boundary score calculation.  Contour tracking to complete boundaries according to the correct ones. Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 20 The Boundary Score definition. dmin dmax Context - Method Overview - Region segmentation - boundary rectification -Perspectives Principal curvature directions are used.  The curvature varies according to dmax and tend to be constant following dmin. boundaries are parallel to dmin. Boundary Score processing.

WorkShop Télégéo 6/11/03 21 General algorithm.  Boundary edges extraction.  Correct boundary edges marking. A threshold S is fixed to determine Correct Boundary Edges (CBE), among the boundary edges which come from the region segmentation step. Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 22 General algorithm.  Contour tracking.  Correct boundary edges form pieces of boundary contours.  For each not closed boundary, we extract the edges potentially being able to complete it (edges adjacent to one extremity CBE).  Each potential edge e is associated with a weight function P i depending of its score and its angle with its CBE. Sorted list Context - Method Overview - Region segmentation - boundary rectification -Perspectives Potential edge CBE

WorkShop Télégéo 6/11/03 23 Contour tracking End Sorted list construction Lowest weight edge integration List update Only closed boundaries? Yes No Context - Method Overview - Region segmentation - boundary rectification -Perspectives Potential edge CBE Potential edge CBE Potential edge CBE

WorkShop Télégéo 6/11/03 24 Sample Context - Method Overview - Region segmentation - boundary rectification -Perspectives 3D-object Vertex Classification Region growing Region merging Correct boundary edges marking Contour tracking

WorkShop Télégéo 6/11/03 25 Plan Context. Method overview. The region segmentation process.  Vertex classification.  Region growing.  Region merging. The boundary rectification process.  Purpose.  The Boundary Score definition.  General algorithm.  Correct boundary marking.  Contour tracking. Perspectives. Context - Method Overview - Region segmentation - boundary rectification -Perspectives

WorkShop Télégéo 6/11/03 26 Conclusion and perspectives Our method:  The segmentation algorithm.  Curvature classification. Curvature transition detection, not only hard edges cutting. Constant curvature region extraction.  Mixed Vertex-Triangle approach. Regions boundaries are clearly distinguishable edges.  The boundary rectification method:  Original method based on principal curvature directions. Perspectives:  Considering curvature variance or distribution histogram analysis. Improve classification. Automatically process the merging threshold.  Subdivision surface fitting in our adaptive multi-resolution compression objective. Context - Method Overview - Region segmentation - boundary rectification -Perspectives