0
RESEARCH PAPERS

Scale-Space Representation and Classification of 3D Models

[+] Author and Article Information
Dmitriy Bespalov, Ali Shokoufandeh

Department of Computer Science, College of Engineering, Drexel University, 3141 Chestnut Street, Philadelphia, PA 19104

William C. Regli

Department of Mechanical Engineering and Mechanics and Department of Computer Science, College of Engineering, Drexel University, 3141 Chestnut Street, Philadelphia, PA 19104

Wei Sun

Department of Mechanical Engiineering and Mechancis, College of Engineering, Drexel University, 3141 Chestnut Street, Philadelphia, PA 19104

J. Comput. Inf. Sci. Eng 3(4), 315-324 (Dec 24, 2003) (10 pages) doi:10.1115/1.1633576 History: Received August 01, 2003; Revised October 01, 2003; Online December 24, 2003
Copyright © 2003 by ASME
Your Session has timed out. Please sign back in to continue.

References

Figures

Grahic Jump Location
Distance Metric for two points of a GOOD -COUPLING
Grahic Jump Location
Scale-space bisection of the sample models. Binary trees were obtained by recursively applying FEATURE-DECOMPOSITION(M,k). Red-colored regions of child nodes represent partitions that result in the bisection of the parent.
Grahic Jump Location
Feature trees for the sample models. (a), (b) Models Part 10 and Spring respectively. Views of these models are presented on the left. (c) Illustrates decomposition process for Fork model (view is presented). Pictures of the point sets for three bisections are presented. Note that technique extracted a pin on one side of the Fork (pin is not present on the other side).
Grahic Jump Location
Results of matching between two GOODPARTS (a, b) and two SWIVELS (c, d), with matched regions having similar colors. Most significant features are obtained for each model using F EATURE -D ECOMPOSITION (M,k) and are used to construct binary trees T1 and T2.Match-Models(T1,T2) then generates a set of matched features which have been colored similarly for this figure.
Grahic Jump Location
Sample views from 10 Groups of 3D models in our database.
Grahic Jump Location
Distance matrix of results for the matching process. Darker regions correspond to closer matches. Actual values for matches of a subset of 6 models is shown with pictures of the models. Most of the high-valued matches occur inside the groups, although, there are several cross-group pairs that return high similarity values.
Grahic Jump Location
Various Refinement Settings. (a) Sample view of the model approximated using different number of points (Low—approx 1500 points, Med—approx 2500 points, Hi—approx 6000 points). (b) Feature graphs for polyhedral representations that use various number of points. Overall structure of the graphs is very similar. “Zoomed-in” nodes from different graphs correspond to the same features and are placed on the same levels of the graphs. (c) Similarity values for these models.

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In