22,416 Hits in 2.5 sec

Skeleton Pruning by Contour Partitioning with Discrete Curve Evolution

Xiang Bai, Longin Latecki, Wen-yu Liu
2007 IEEE Transactions on Pattern Analysis and Machine Intelligence  
Any contour partition can be used, but the partitions obtained by Discrete Curve Evolution (DCE) yield excellent results.  ...  Again, many existing methods displace skeleton points in order to produces pruned skeletons.  ...  Discrete Curve Evolution The Discrete Curve Evolution (DCE) method was introduced in [16] , [17] , [18] .  ... 
doi:10.1109/tpami.2007.59 pmid:17224615 fatcat:wkwlb23cezbkhga6xyqnkfo2uy

Discrete Skeleton Evolution [chapter]

Xiang Bai, Longin Jan Latecki
Lecture Notes in Computer Science  
Skeleton can be viewed as a compact shape representation in that the shape can be completely reconstructed form the skeleton.  ...  We present a novel method for skeleton pruning that is based on this fundamental skeleton property. We iteratively remove skeleton end braches with smallest relevance for shape reconstruction.  ...  The goal of this paper is to introduce a novel method for skeleton pruning, called Discrete Skeleton Evolution (DSE).  ... 
doi:10.1007/978-3-540-74198-5_28 fatcat:njlw55cikrcqhpa7ohigqmtxb4

A Stable Skeletonization for Tabletop Gesture Recognition [chapter]

Andoni Beristain, Manuel Graña
2010 Lecture Notes in Computer Science  
(DCE) on the boundary - Pruning • Voronoi tesselation & skeleton • Voronoi skeleton ICCSA 2010, Fukuoka, Japan 7 Skeletonization algorithm • Discrete Curve Evolution - The contour is iteratively  ...  Introduccion • Skeletonization procedure - Voronoi skeleton - Two Pruning steps • Removing edges crossing the object boundary • Discrete Curve Evolution based approach • Starting from the boundary  ... 
doi:10.1007/978-3-642-12156-2_46 fatcat:dfy2jeq6dbh4zob7w2lahtz7hu

Discrete Curve Evolution on Arbitrary Triangulated 3D Mesh [chapter]

Sergii Poltaretskyi, Jean Chaoui, Chafiaa Hamitouche-Djabou
2014 Lecture Notes in Computer Science  
Discrete Curve Evolution (DCE) algorithm is used to eliminate objects' contour distortions while at the same time preserve the perceptual appearance at a level sufficient for object recognition.  ...  This method is widely used for shape similarity measure, skeleton pruning and salient point detection of binary objects on a regular 2D grid.  ...  Discrete Curve Evolution Discrete Curve Evolution (DCE) algorithm introduced in [5, 6, 7] , was developed to neglect the distortions of objects' contours in digital images while at the same time preserve  ... 
doi:10.1007/978-3-319-09955-2_34 fatcat:4hajr5zwvrct5dm7ytel77ao2e

An Efficient Quick Algorithm for Computing Stable Skeletons

Xiaojun Yang, Xiang Bai, Xingwei Yang, Luan Zeng
2009 2009 2nd International Congress on Image and Signal Processing  
A new method to obtain high quality skeletons of binary shapes is proposed in this paper. First, a small set of salient contour points is computed by Discrete Curve Evolution (DCE).  ...  The skeleton path continues growing in this way until it reaches the other endpoint or another skeleton branch.  ...  CONCLUSION In this paper, we generate skeletons from the salient contour points computed by Discrete Curve Evolution.  ... 
doi:10.1109/cisp.2009.5303734 fatcat:lfzbo2fcjvgmtddiij43y3tjxm

A continuous clustering method for vector fields

H. Garcke, T. Preusser, M. Rumpf, A. Telea, U. Weikard, J. Van Wijk
2000 Proceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145)  
A skeletonization algorithm is used to find suitable positions for the icons.  ...  An evolution equation for this function is obtained as a suitable gradient flow of an underlying anisotropic energy functional. Here, time serves as the scale parameter.  ...  In each step of the discrete evolution we have to solve this system of nonlinear equations.  ... 
doi:10.1109/visual.2000.885715 dblp:conf/visualization/GarckePRTWW00 fatcat:zy572uzkavdwhnsbv5s36mqic4

Skeleton-based Variational Mesh Deformations

Shin Yoshizawa, Alexander Belyaev, Hans-Peter Seidel
2007 Computer graphics forum (Print)  
We combine a skeleton-based mesh deformation technique with discrete differential coordinates in order to create natural-looking global shape deformations.  ...  Our method preserves fine geometric details and original shape thickness because of using discrete differential coordinates and skeleton-based deformations.  ...  In order to accelerate discrete evolution (9) we simplify (6) by considering a proper subset of the medial balls centered at the vertices of S d .  ... 
doi:10.1111/j.1467-8659.2007.01047.x fatcat:i6vfpnfiljbmrldrksqbvtskie

Correcting Curvature-Density Effects in the Hamilton–Jacobi Skeleton

A. Torsello, E.R. Hancock
2006 IEEE Transactions on Image Processing  
The approach is based on the observation that the normalized flux associated with the inward evolution of the object boundary at nonskeletal points tends to zero as the size of the integration area tends  ...  Nonetheless, the error in calculating the flux on the image lattice is both limited by the pixel resolution and also proportional to the curvature of the boundary evolution front and, hence, unbounded  ...  Singularities in the simulated evolution of the front indicate the locations of the skeleton.  ... 
doi:10.1109/tip.2005.863951 pmid:16579375 fatcat:e66fxlhz5nghzj6dyymvpkei4i

Mean Curvature Skeletons

Andrea Tagliasacchi, Ibraheem Alhashim, Matt Olson, Hao Zhang
2012 Computer graphics forum (Print)  
To obtain a stable and efficient discretization, we regularize the surface mesh by performing local remeshing via edge splits and collapses.  ...  Our skeletonization algorithm can produce intermediate meso-skeletons (c), which contain medial sheets where needed and curves where appropriate, while converging to a medially centered curve skeleton  ...  Discrete skeletonization flow As we maintain the manifold properties of the surface during evolution, it is important to note that solving Eq. (5) as presented would result in a straightening of already  ... 
doi:10.1111/j.1467-8659.2012.03178.x fatcat:6i5wmpqh65gbhcprqnndto2dwi

Enhancing 3D mesh topological skeletons with discrete contour constrictions

Julien Tierny, Jean-Philippe Vandeborre, Mohamed Daoudi
2007 The Visual Computer  
Therefore, a new concise shape representation, enhanced topological skeletons, is proposed, encoding contours' topological and geometrical evolution. Firstly, mesh feature points are computed.  ...  Secondly, for each vertex in the mesh, its discrete contour is computed.  ...  Conclusion and future work In this paper, we presented a new concise shape abstraction, enhanced topological skeleton, that encodes both topological and geometrical evolutions of some mapping function  ... 
doi:10.1007/s00371-007-0181-0 fatcat:vcbzgnxrzjbkxfqn4y5mjpfvua

Thickness Estimation of Discrete Tree-Like Tubular Objects: Application to Vessel Quantification [chapter]

D. Chillet, N. Passat, M. -A. Jacob-Da Col, J. Baruthio
2005 Lecture Notes in Computer Science  
The method is essentially based on discrete geometry concepts (skeleton, discrete planes, and discrete area).  ...  The estimation is performed by an iterative process involving skeletonization, skeleton simplification, discrete cross-section plane evaluation and finally area estimation.  ...  Further work could now consist in modifying and improving the skeleton smoothing step, currently using Bézier curves, in order to obtain a method entirely based on discrete structures.  ... 
doi:10.1007/11499145_28 fatcat:7rttnbkbd5f7nklrqnpv66khaq

A phase field model for continuous clustering on vector fields

H. Garcke, T. Preusser, M. Rumpf, A.C. Telea, U. Weikard, J.J. van Wijk
2001 IEEE Transactions on Visualization and Computer Graphics  
Alternatively, the clusters can be visualized by iconic representations, which are positioned by using a skeletonization algorithm.  ...  An evolution equation for this function is obtained as a suitable gradient flow of an underlying anisotropic energy functional. Here, time serves as the scale parameter.  ...  In each step of the discrete evolution, we have to solve this system of nonlinear equations.  ... 
doi:10.1109/2945.942691 fatcat:eo5nmprzzjgorbv6fubnfqimly

Segmentation and Skeletonization on Arbitrary Graphs Using Multiscale Morphology and Active Contours [chapter]

Petros Maragos, Kimon Drakopoulos
2012 Mathematics and Visualization  
Finally, using these novel ideas, we propose a method for multiscale shape skeletonization on arbitrary graphs. 1 Book Chapter in Innovations for Shape Analysis: Models and Algotithms, edited by M.  ...  In this chapter we focus on the discrete skeleton transform obtained via multiscale morphology.  ...  Recent extensions of discrete distance transforms in 3D for skeletonization can be found in [2, 6] . One main disadvantage of the skeleton is its sensitivity on perturbations of the boundary.  ... 
doi:10.1007/978-3-642-34141-0_3 fatcat:pgaq7qrpnzaupjqpftbkji5tmy

On-the-fly Curve-skeleton Computation for 3D Shapes

Andrei Sharf, Thomas Lewiner, Ariel Shamir, Leif Kobbelt
2007 Computer graphics forum (Print)  
The algorithm is based on a deformable model evolution that captures the object's volumetric shape.  ...  We present an algorithm to extract such a skeleton on-the-fly, both from point clouds and polygonal meshes.  ...  We filter this set during the evolution to generate a clean skeleton, while maintaining a full mapping between the model and the skeleton.  ... 
doi:10.1111/j.1467-8659.2007.01054.x fatcat:2oex7ul3jvdlbd5jvhltr23lqy

Evolution of Calcium-carbonate Skeletons in the Hydractiniidae

M. P. Miglietta, L. McNally, C. W. Cunningham
2010 Integrative and Comparative Biology  
The evolution of the calcified skeleton is here investigated in the hydrozoan family Hydractiniidae.  ...  of parallel evolution, as suspected in the Anthozoa.  ...  a necessary step toward the evolution of a true skeleton.  ... 
doi:10.1093/icb/icq102 pmid:21558213 fatcat:6lzzy7o4ubfy3eb6caggqgn2vu
« Previous Showing results 1 — 15 out of 22,416 results