Elsevier

Pattern Recognition Letters

Volume 27, Issue 6, 15 April 2006, Pages 643-651
Pattern Recognition Letters

A robust approach for constructing a graph representation of articulated and tubular-like objects from 3D scattered data

https://doi.org/10.1016/j.patrec.2005.10.002Get rights and content

Abstract

This paper describes an approach for constructing a graph representation of 3D objects and more particularly of articulated and tubular-like objects. For objects without cavities, this representation is a tree structure that encodes the object template while being invariant to global and local rigid transformation. The approach described in this paper has some interesting aspects: (1) It operates on raw 3D scattered data points, without any pre-processing stage. (2) It has low computational cost. (3) It is robust against irregular data point distribution and data deficiencies. This graph representation can be used in various applications such as object coding, recognition, and segmentation.

Introduction

3D object shape abstraction and encoding has been receiving an increasing attention in the recent years. It is fuelled by the advances in 3D shape imaging technologies and the proliferation of 3D object model databases, where 3D shape representation plays a fundamental role in model retrieval and shape matching. In the literature (Tangelder and Veltkamp, 2004) shape representation can be broadly categorized in three categories, namely, feature based representations, graph based representations, and other representations. Feature based representations encompass only pure geometry information of the object. In contrast, graph based representations, which use a graph showing how shape components are linked together, embed in addition to some geometric information, topological and structural meanings that are quite suitable for high level processing. Graph based representations include three families, namely, model graph, skeletons, and Reeb-graph. Model graph representations are especially suitable for man-made objects (i.e. CAD/CAM models) and are generally difficult to apply for models of natural shape. Skeletons can be applied to wider shapes including animal and human shapes. Skeleton constructions have been approached using the medial axis model (Chuang et al., 2000, Näf et al., 1996, Siddiqi et al., 2002, Bouix et al., 2005) and the distance transform (Gavani and Silver, 1999, Sanniti di Baja and Svensson, 2002, Svensson and Sanniti di Baja, 2002).

Reeb-graph, introduced by Reeb (1946), is a particular skeleton determined using a continuous scalar function defined on an object surface. The main characteristics of a Reeb-graph are (1) one-dimensional graph structure and (2) invariance to both global and local geometric transformations. These characteristics make it suitable for articulated objects. Reeb-graph has been used in many applications such as shape coding (Tai et al., 1998), shape matching (Hilaga et al., 2001), surface compression (Biasotti et al., 2002), and human-body scan segmentation (Xiao et al., 2003a, Xiao et al., 2003b, Xiao et al., 2004). In this paper we propose a method for constructing and visualizing a Reeb-graph of a 3D object. Compared to previous methods, our method is characterized by the following features: (1) It operates on raw 3D data, i.e. cloud of scattered data points (in contrast to methods that require mesh-model data). (2) It is robust against data deficiencies such as irregular distribution reflected by gaps and holes. (3) It has low computational costs. The approach targets objects having tubular-like shapes or a blending of generalized cylinder shapes and assumes that the surface of the object is topologically continuous.

The rest of the paper is organized as follows: Section 2 gives an overview of the approach. Sections 3 Computation of the level-sets, 4 Construction of a connectivity graph, 5 Extraction of joint nodes and branches, 6 Visualization describe the different stages of the approach. Experimental results are discussed in Section 7. Finally, in Section 8, conclusions are drawn and further research work is suggested.

Section snippets

Overview of the approach

The approach operates on a set of 3D scattered data points representing the object shape. It involves four main stages. These are depicted in Fig. 1.

Computation of the level-sets

Given a set of data points V and a scalar function: F:XR where XR3 is a data point, level-sets in discrete space are formally defined by {X  V, F(X) = Ck} where Ck, k = 1 : m is a set of discrete values ranging from the minimum value to the maximum value of the function F in the domain V. To ensure a stable representation, the scalar function should be invariant with respect to rigid transformations. The curvature function satisfies this condition, however, it is highly sensitive to noise and data

Construction of a connectivity graph

For a perfect data, a level-set would be a compact set of connected points. For real data characterized by a non-uniform distribution and gaps, the level-set is rather fragmented into sets of connected points. These sets, which we call level-set curves, are conceptualized by the following definitions.

Definition 1 connectivity of point sets

Two point sets P = {pi}, i = 1,  , m and Q = {qj}, j = 1,  , n are defined as connected if ∃pi  P and ∃qj  Q such that ∣pi  qj  τ. Where ∣pi  qj∣ denotes the distance between points pi and qj and τ is a given

Extraction of joint nodes and branches

The strategy adopted in this stage is based on the following analysis: in the connectivity graph we identified three primary topological patterns. These patterns are called O-type, λ-type and Y-type. For example, The group of nodes (l7, l4, l2, l1), (l6, l4, l1, l3), and (l6, l5, l3, l1) represent a λ-type, an O-type, and a Y-type, respectively. O-type comprises two joint nodes connected by two branches. This pattern reflects data corruption (gaps, missing data) because we assumed that the object does

Visualization

In this stage, the topological structure embedded in the Reeb-graph of the object is visualized. The tree structure outputted by the previous stage is browsed in a depth first fashion. At each visited node, the associated branch is mapped into a 2D curve where the x-coordinate and the y-coordinate represent a level-set curve and its corresponding level in the connectivity graph. We have to mention here that the orientation of the 2D curve reflects only the evolution of the geodesic distance at

Experiments

We applied our approach to a variety of objects acquired from different sources. Fig. 3 shows results obtained with animal shapes. These models were acquired from Princeton Benchmark.1 We can observe that the resulting graphs reflect correctly the topology of the models. The graphs of the dog and the camel present each a main branch and five ramifications that correspond to the limbs and the tail. The graph of the horse shows only four ramifications as the

Discussion and conclusion

In this paper we proposed an approach for automatically constructing a topological representation of 3D objects. The main features of this approach are: (1) It operates on crude 3D scattered data. (2) It is robust against irregular data point distributions and severe data deficiencies such as gaps. (3) It involves an efficient technique that computes simultaneously the geodesic function and the associated level-sets. This technique demonstrates a novel algorithm characterized by a low

References (18)

  • Biasotti, S., Mortara, M., Spagnuolo, M., 2002. Compression and Reconstruction using Reeb graphs and Shape Analysis....
  • S. Bouix et al.

    Flux driven automatic centerline extraction

    Med. Image Anal.

    (2005)
  • J.H. Chuang et al.

    Skeletonization of three-dimensional object using generalized potential field

    IEEE Trans. Pattern Anal. Mach. Intell.

    (2000)
  • T.H. Cormen et al.

    Introduction to Algorithms

    (1990)
  • N. Gavani et al.

    Parameter controlled volume thinning

    Graph. Models Image Process.

    (1999)
  • Hilaga, M., Shinagawa, Y., Kohmura, T., Kunii, T., 2001. Topology matching for fully automatic similarity estimation of...
  • J.S.B. Mitchell et al.

    The discrete geodesic problem

    SIAM J. Comput.

    (1987)
  • M. Näf et al.

    Characterization and recognition of 3D organ shape in medical image analysis

    IEEE Workshop Math. Meth. Biomed. Image Anal.

    (1996)
  • G. Reeb

    Sur les points singuliers d’une forme de Pfaff completement integrable ou d’une fonction numèrique

    Comptes Rendus Acad. des Sci., Paris, France

    (1946)
There are more references available in the full text version of this article.

Cited by (4)

  • Reeb graph based segmentation of articulated components of 3D digital objects

    2016, Theoretical Computer Science
    Citation Excerpt :

    Graph-theoretic analysis of 3D objects is a well-explored area of shape representation that is characterized by a structural description of the object based on its geometric and topological properties. Topological variation of manifolds, particularly for articulated objects, may be suitably encoded by Reeb graphs as it has a one-dimensional graph structure and is invariant to both global and local transformations [37,38]. In [36], decomposition of 3D objects is proposed that uses Reeb graph to extract structural and topological information of the object surface followed by refinement of part boundaries using curvature information.

  • Segmentation of 3D articulated components by slice-based vertex-weighted reeb graph

    2014, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
  • Heat diffusion approach for feature-based body scans analysis

    2011, Eurographics Workshop on 3D Object Retrieval, EG 3DOR
  • Automatic segmentation of scanned human body using curve skeleton analysis

    2009, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
View full text