Hierarchical Shape Decomposition via Level Sets

2009-08-27
A new tool for shape decomposition is presented. It is a function defined on the shape domain and computed using a linear system of equations. It is demonstrated that the level curves of the new function provide a hierarchical partitioning of the shape domain into visual parts, without requiring any features to be estimated. The new tool is an unconventional distance transform where the minimum distance to the union of the shape boundary and an unknown critical curve is computed. This curve divides the shape domain into two parts, one corresponding to the coarse scale structure and the other one corresponding to the fine scale structure.
9th International Symposium on Mathematical Morphology

Suggestions

Coarse-to-fine surface reconstruction from silhouettes and range data using mesh deformation
Sahillioğlu, Yusuf; Yemez, Y. (2010-03-01)
We present a coarse-to-fine surface reconstruction method based on mesh deformation to build watertight surface models of complex objects from their silhouettes and range data. The deformable mesh, which initially represents the object visual hull, is iteratively displaced towards the triangulated range surface using the line-of-sight information. Each iteration of the deformation algorithm involves smoothing and restructuring operations to regularize the surface evolution process. We define a non-shrinking...
Simultaneous segmentation of images and shapes
Tarı, Zehra Sibel (1997-01-01)
A novel method for simultaneous image segmentation and shape decomposition is presented. The method may be applied directly to grayscale images. The method is based on the analysis of the level curves of an ''edge-strength'' function which is a measure of boundaryness of the image at each point.
3D Correspondence by Breadth First Search Frontiers
Sahillioğlu, Yusuf (null; 2009-06-01)
This paper presents a novel, robust, and fast 3D shape correspondence algorithm applicable to the two snapshots of the same object in arbitrary deformation. Given two such frames as triangle meshes with fixed connectivity, our algorithm first classifies vertices into Breadth-First Search (BFS) frontiers according to their unweighted shortest path distance from a source vertex. This is followed by the rigid or non-rigid alignment of the corresponding frontiers of two meshes as the second and final step. This...
Modeling spreading of oil slicks based on random walk methods and Voronoi diagrams
Durgut, İsmail (Elsevier BV, 2017-05-15)
We introduce a methodology for representation of a surface oil slick using a Voronoi diagram updated at each time step. The Voronoi cells scale the Gaussian random walk procedure representing the spreading process by individual particle stepping. The step length of stochastically moving particles is based on a theoretical model of the spreading process, establishing a relationship between the step length of diffusive spreading and the thickness of the slick at the particle locations. The Voronoi tessellatio...
Domain-boundary element method for elastodynamics of functionally graded Timoshenko beams
Eshraghi, Iman; Dağ, Serkan (2018-01-15)
A new domain-boundary element method is developed for elastodynamic analysis of functionally graded Timoshenko beams. Three governing partial differential equations of motion are derived by considering through-the-thickness variations of the physical properties. Weighted-residual forms are imposed utilizing the static fundamental solutions. These forms are then reduced to three integral equations containing domain integrals with time derivatives of unknown functions. Through domain discretization and shape ...
Citation Formats
Z. S. Tarı, “Hierarchical Shape Decomposition via Level Sets,” Univ Groningen, Inst Math & Comp Sci, Groningen, NETHERLANDS, 2009, vol. 5720, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/52831.