Shape Similarity Matching With Octree Representations

Author(s):  
Jingsheng Zhang ◽  
Shana Smith

Shape matching is one of the fundamental problems in content-based 3D shape retrieval. Since there are typically a large number of possible matches in a shape database, there is a crucial need to perform shape matching efficiently. As a result, shapes must be reduced into a simpler shape representation, and computational complexity is one of the most important criteria for evaluating 3D shape representations. To meet the need, the investigators have implemented a new effective and efficient approach for 3D shape matching, which uses a simplified octree representation of 3D mesh models. The simplified octree representation was developed to improve time and space efficiency over prior representations. In addition, octree representations are rapidly becoming the standard file format for delivering 3D content across the Internet. The proposed approach stores octree information in XML files, rather than using a new data file type, to facilitate comparing models over the Internet. New methods for normalizing models, generating octrees, and comparing models were developed. The proposed approach allows users to efficiently exchange shape information and compare models over the Internet, in standardized data and data file formats, without transferring exact model files. The proposed approach is the first step in a project which will build a complete 3D model database and data retrieval system, which can be incorporated with other data mining techniques.

Author(s):  
Jingsheng Zhang ◽  
Shana Smith

To achieve effective 3D shape retrieval, there is a crucial need for efficient shape matching methods. This paper introduces a new method for 3D shape matching, which uses a simplified octree representation of 3D mesh models. The simplified octree representation was developed to improve time and space efficiency over prior representations. The proposed method also stores octree information in extensible markup language format, rather than in a new proprietary data file type, to facilitate comparing models over the Internet.


2016 ◽  
Vol 28 (4) ◽  
pp. 543-555
Author(s):  
Jaewoong Lee ◽  
InHwan Sul

Purpose – As an extended work of the previous paper (Sul, 2010), this paper provides a guideline information for an anonymous garment pattern in sewing process. The purpose of this paper is to first, provide garment pattern database. By simply taking pictures of garment patterns, the shape database is constructed. Once the shape database is prepared, data retrieval can be done by image indexing, i.e., simply inserting garment pattern boundary shape again to the database. Using shock graph methodology, the pattern sets used for database preparation can be exactly retrieved. Second, to find the nearest shape of a given input pattern shape in the database. If the input garment pattern shape does not exist in the database, the shape matching algorithm provides the next similar pattern data. The user, who is assumed to be non-expert in garment sewing process, can easily predict the position and combination information of various patterns. Design/methodology/approach – Image processing is used to construct the garment pattern shape database. The boundary shapes are extracted from the photographs of garment patterns and their shape recognition information, especially shock graph, is also recorded for later pattern data retrieval. Findings – Using the image processing technique, garment patterns can be converted to electronic format easily. Also the prepared pattern database can be used for finding the nearest shape of an additional given input garment pattern. Patterns with irregular shapes were retrieved easily, while those with a simple shape, such as rectangle, showed a little erroneous result. Originality/value – Shape recognition has been adopted in various industrial areas, except for garment sewing process. Using the provided methodology, garment pattern shapes can be easily saved and retrieved only by taking pictures of them.


2014 ◽  
Author(s):  
Ozan Oktay ◽  
Wenzhe Shi ◽  
Kevin Keraudren ◽  
Jose Caballero ◽  
Daniel Rueckert

As part of the CETUS challenge, we present a multi-atlas segmentation framework to delineate the left-ventricle endocardium in echocardiographic images. To increase the robustness of the registration step, we introduce a speckle reduction step and a new shape representation based on sparse coding and manifold approximation in dictionary space. The shape representation, unlike intensity values, provides consistent shape information across different images. The validation results on the test set show that registration based on our shape representation significantly improves the performance of multi-atlas segmentation compared to intensity based registration. To our knowledge it is the first time that multi-atlas segmentation achieves state-of-the-art results for echocardiographic images.


2011 ◽  
Vol 27 (11) ◽  
pp. 991-1004 ◽  
Author(s):  
M. Attene ◽  
S. Marini ◽  
M. Spagnuolo ◽  
B. Falcidieno

Author(s):  
Adrian Ion ◽  
Nicole M. Artner ◽  
Gabriel Peyre ◽  
Salvador B. Lopez Marmol ◽  
Walter G. Kropatsch ◽  
...  

Author(s):  
Manuele Bicego ◽  
Stefano Danese ◽  
Simone Melzi ◽  
Umberto Castellani

Author(s):  
Jiangping Wang ◽  
Kai Ma ◽  
Vivek Kumar Singh ◽  
Thomas Huang ◽  
Terrence Chen

Sign in / Sign up

Export Citation Format

Share Document