Filters








111,259 Hits in 6.2 sec

Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering

Linda G. Shapiro, Robert M. Haralick
1979 IEEE Transactions on Pattern Analysis and Machine Intelligence  
Using this procedure on handdrawn colon shapes copied from an X-ray and on handprinted characters, the parts determined by the clustering often correspond well to decompositions that a human might make  ...  The graph-theoretic clustering method first determines dense regions, which are local regions of high compactness, and then forms clusters by merging together those dense regions having high enough overlap  ...  A later approach was the syntactic analysis of shapes and structural description by -regular expressions (Pavlidis and Ali [17] ).  ... 
doi:10.1109/tpami.1979.4766871 fatcat:zzpjdokfeje73punqajkb62odm

Shape Analysis by Graph Decomposition [chapter]

R. Manevich, J. Berdine, B. Cook, G. Ramalingam, M. Sagiv
Tools and Algorithms for the Construction and Analysis of Systems  
In this paper, we show how this independence between different (singly-linked) data structures can be utilized to perform shape analysis and verification more efficiently.  ...  We present a new abstraction based on decomposing graphs into sets of subgraphs, and show that, in practice, this new abstraction leads to very little loss of precision, while yielding substantial improvements  ...  The Abstract Domain of Shape Subgraphs Intuitively, the graph decomposition abstraction works by decomposing a shape graph into a set of shape subgraphs.  ... 
doi:10.1007/978-3-540-71209-1_3 dblp:conf/tacas/ManevichBCRS07 fatcat:q4t7n2s6rzej7pttgwmzirmw2a

Computing and Visualizing a Graph-Based Decomposition for Non-manifold Shapes [chapter]

Leila De Floriani, Daniele Panozzo, Annie Hui
2009 Lecture Notes in Computer Science  
Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval.  ...  We present a new tool for visualizing the shape decomposition and its graph as an effective support to modeling, analyzing and understanding non-manifold shapes.  ...  Acknowledgements This work has been partially supported by the MIUR-FIRB project SHALOM under contract number RBIN04HWR8.  ... 
doi:10.1007/978-3-642-02124-4_7 fatcat:2khqhahby5h3xnaegp6l2gqwaq

Local Structural Analysis: A Primer [chapter]

Mathieu Delalandre, Eric Trupin, Jean-Marc Ogier
2004 Lecture Notes in Computer Science  
First, we propose a general decomposition of the local structural analysis into four steps: object graph extraction, mathematical approximation, high-level object construction, and object graph correction  ...  The structural analysis is a processing step during which graphs are extracted from binary images. We can decompose the structural analysis into local and global approaches.  ...  In [13] we simplify our global analysis by the use of a local analysis. The comparative and hybrid combinations permit the multi-models representations of shapes (or adopted graph model).  ... 
doi:10.1007/978-3-540-25977-0_21 fatcat:ohytq2rjn5crtmqnsghstzd2ly

A Topological Nomenclature for 3D Shape Analysis in Connectomics [article]

Abhimanyu Talwar, Zudi Lin, Donglai Wei, Yuesong Wu, Bowen Zheng, Jinglin Zhao, Won-Dong Jang, Xueying Wang, Jeff W. Lichtman, Hanspeter Pfister
2020 arXiv   pre-print
On 3D shape retrieval and decomposition tasks, we qualitatively demonstrate that the encoded topological nomenclature features achieve better results than state-of-the-art shape descriptors.  ...  In ablation studies, we quantitatively show that graphs generated by our proposed method align with the perception of experts.  ...  Since the spectral embedding encodes the entire graph, it fails to find relevant shapes. Shape Decomposition Results Experimental Setup.  ... 
arXiv:1909.12887v2 fatcat:dnrwigg5jbcq5l4vumrmz3cbra

A Decomposition-based Approach to Modeling and Understanding Arbitrary Shapes [article]

David Canino, Leila De Floriani
2011 Smart Tools and Applications in Graphics  
Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval.  ...  Here, we consider a representation for arbitrary shapes, that we call Manifold-Connected Decomposition (MC-decomposition), which is based on a unique decomposition of the shape into nearly manifold parts  ...  Acknowledgements This work has been partially supported by the Italian Ministry of Education and Research under the PRIN 2009 program, and by the National Science Foundation under contract number IIS-1116747  ... 
doi:10.2312/localchapterevents/italchap/italianchapconf2011/053-060 dblp:conf/egItaly/CaninoF11 fatcat:aaj6jk7uevc4pdfravrgntbm2i

A Topological Nomenclature for 3D Shape Analysis in Connectomics

Abhimanyu Talwar, Zudi Lin, Donglai Wei, Yuesong Wu, Bowen Zheng, Jinglin Zhao, Won-Dong Jang, Xueying Wang, Jeff Lichtman, Hanspeter Pfister
2020 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)  
On 3D shape retrieval and decomposition tasks, we qualitatively demonstrate that the encoded topological nomenclature features achieve better results than state-of-the-art shape descriptors.  ...  In ablation studies, we quantitatively show that graphs generated by our proposed method align with the perception of experts.  ...  This work has been partially supported by NSF award IIS-1835231 and NIH award 5U54CA225088-03.  ... 
doi:10.1109/cvprw50498.2020.00501 dblp:conf/cvpr/TalwarLWWZZJWLP20 fatcat:bmuqkk3tajdofcrowu3gyl3wxm

Simplified Reeb Graph as Effective Shape Descriptor for the Striatum [chapter]

Antonietta Pepe, Laura Brandolini, Marco Piastra, Juha Koikkalainen, Jarmo Hietala, Jussi Tohka
2012 Lecture Notes in Computer Science  
mesh registration, mesh decomposition, and striatal shapes comparison.  ...  Experimental results showed that simplified Reeb graphs, as obtained by our pipeline, provide an intrinsic, effective, and stable descriptor of striatal shapes to be used as an automatic tool for inter-subject  ...  This work was supported by the Academy of Finland grant number 130275 and 129657.  ... 
doi:10.1007/978-3-642-33463-4_14 fatcat:ywknxpllirexfggs2chfdmouby

AUTOMATED PART DECOMPOSITION FOR PRODUCT ARCHITECTURE MODELING

J. Redeker, P. Gebhardt, A.-K. Reichler, E. Türck, K. Dröder, T. Vietor
2020 Proceedings of the Design Society: DESIGN Conference  
AbstractThis paper presents an algorithm that contributes to an automatic decomposition of a mechanical part based on geometric features and methods of unsupervised machine learning.  ...  For the development of the algorithm, existing techniques of 3D shape segmentation, especially surface-based part segmentation procedures are reviewed and important areas of activities are revealed.  ...  The authors hereby want to thank the financial support by the German Research Foundation (DFG DR 973/4-1, DFG VI 149/9-1).  ... 
doi:10.1017/dsd.2020.144 fatcat:doef2g2ntzhrfpwccxezviroia

Shape decomposition and understanding of point cloud objects based on perceptual information

Xiaojuan Ning, Er Li, Xiaopeng Zhang, Yinghui Wang
2010 Proceedings of the 9th ACM SIGGRAPH Conference on Virtual-Reality Continuum and its Applications in Industry - VRCAI '10  
Skeletal structure infers the topological information from the decomposed shape. Semantic graph shown in the last column is generated with the assistance of decomposed shape and skeletons. *  ...  From a point cloud model, our algorithm extracts some perceptual feature points, according to which the decomposition is implemented.  ...  Abstract Decomposition and segmentation of the objects represented by point cloud data become increasingly important for purposes like shape analysis and object recognition.  ... 
doi:10.1145/1900179.1900221 dblp:conf/vrcai/NingLZW10 fatcat:v7xptgm7cffd5ieapdv4sicsvm

Extraction of generative processes from B-Rep shapes and application to idealization transformations

Flavien Boussuge, Jean-Claude Léon, Stéfanie Hahmann, Lionel Fine
2014 Computer-Aided Design  
This paper proposes to extract generative processes from a given B-rep shape as a high-level shape description.  ...  A construction tree is a set of shape generation processes commonly produced with CAD modelers during a design process of B-Rep objects.  ...  This work is also supported by the ERC Expressive.  ... 
doi:10.1016/j.cad.2013.08.020 fatcat:7yopp4sznrcapiaia4loiwgnce

Convex shape decomposition

Hairong Liu, Wenyu Liu, Longin Jan Latecki
2010 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition  
In this paper, we propose a new shape decomposition method, called convex shape decomposition.  ...  We formalize the convex decomposition problem as an integer linear programming problem, and obtain approximate optimal solution by minimizing the total cost of decomposition under some concavity constraints  ...  Thus, shape decomposition is very useful in shape analysis, shape matching, topology extraction, collision detection and other geometric processing methods employing divide-and-conquer strategies.  ... 
doi:10.1109/cvpr.2010.5540225 dblp:conf/cvpr/LiuLL10 fatcat:hhyc6kus7fhrhco33nrbzobrny

Localization, Decomposition, and Dictionary Learning of Piecewise-Constant Signals on Graphs [article]

Siheng Chen and Yaoqing Yang and José. M. F. Moura and Jelena Kovačević
2017 arXiv   pre-print
Motivated by the need to extract meaning from large amounts of complex structured data, we consider three critical problems on graphs: localization, decomposition, and dictionary learning of piecewise-constant  ...  The analysis validates the effectiveness of the approach and suggests that graph signal processing tools may aid in urban planning and traffic forecasting.  ...  SIGNAL DECOMPOSITION ON GRAPHS We now extend localization discussion by considering multiple activated pieces making it a decomposition problem.  ... 
arXiv:1607.01100v2 fatcat:cjc2yw44uzawdpz5v5a55uwibi

3D Mesh decomposition using Reeb graphs

Stefano Berretti, Alberto Del Bimbo, Pietro Pala
2009 Image and Vision Computing  
In this paper, an approach is proposed for decomposition of 3D objects based on Reeb-graphs.  ...  manual decomposition of 3D objects.  ...  , 3D shape retrieval, skeleton extraction as well as the modeling by a composition paradigm that is based on natural shape decompositions.  ... 
doi:10.1016/j.imavis.2009.02.004 fatcat:vd7dbuablzfjxlw2wf6y32esqm

Accurate Calculation Approach for Auto-Estimation on Anisotropic and Sporadic Small Area

Huang Kai, Qi Zhengwei
2009 2009 First International Workshop on Education Technology and Computer Science  
In this condition, the error brought out by the border of the sporadic and antitropic regions cannot be neglected, or the accumulation of these errors will come to be considerable.  ...  Our approach includes the two parts-shape dividing and area integral. The time cost of the shape dividing algorism is lower than the existing algorism in our condition.  ...  In the phase of convex decomposition, the concave graph is divided into convex shapes, and the time cost is O n N [10] .  ... 
doi:10.1109/etcs.2009.391 fatcat:kmjq3yjn7rb3jljwlsewzrarn4
« Previous Showing results 1 — 15 out of 111,259 results