An efficient approach to directly compute the exact Hausdorff distance for 3D point sets

Hausdorff distance measure is very important in CAD/CAE/CAM related applications. This manuscript presents an efficient framework and two complementary subalgorithms to directly compute the exact Hausdorff distance for general 3D point sets. The first algorithm of Nonoverlap Hausdorff Distance (NOHD) combines branch-and-bound with early breaking to cut down the Octree traversal time in case of spatial nonoverlap. The second algorithm of Overlap Hausdorff Distance (OHD) integrates a point culling strategy and nearest neighbor search to reduce the number of points traversed in case of spatial overlap. The two complementary subalgorithms can achieve a highly efficient and balanced result. Both NOHD and OHD compute the exact Hausdorff distance directly for arbitrary 3D point sets. We conduct a number of experiments on benchmark models and CAD application models, and compare the proposed approach with other state-of-the-art algorithms. The results demonstrate the effectiveness of our method.

[1]  Yi Zhou,et al.  Dynamic strategy based parallel ant colony optimization on GPUs for TSPs , 2017, Science China Information Sciences.

[2]  Weiyin Ma,et al.  Computing the Hausdorff distance between two B-spline curves , 2010, Comput. Aided Des..

[3]  Adarsh Krishnamurthy,et al.  Accelerating geometric queries using the GPU , 2009, Symposium on Solid and Physical Modeling.

[4]  Fazhi He,et al.  A method for topological entity matching in the integration of heterogeneous CAD systems , 2013, Integr. Comput. Aided Eng..

[5]  Jun Sun,et al.  A multiple template approach for robust tracking of fast motion target , 2016, Applied Mathematics-A Journal of Chinese Universities.

[6]  Yusheng Liu,et al.  Design reuse oriented partial retrieval of CAD models , 2010, Comput. Aided Des..

[7]  Yoke San Wong,et al.  Collaborative computer-aided design - research and development status , 2005, Comput. Aided Des..

[8]  Dinesh Manocha,et al.  Generalized penetration depth computation , 2006, SPM '06.

[9]  Soonhung Han,et al.  Parametric exchange of round shapes between a mechanical CAD system and a ship CAD system , 2012, Comput. Aided Des..

[10]  Kin-Man Lam,et al.  Human face recognition based on spatially weighted Hausdorff distance , 2003, Pattern Recognit. Lett..

[11]  Gershon Elber,et al.  Precise Hausdorff distance computation for planar freeform curves using biarcs and depth buffer , 2010, The Visual Computer.

[12]  Gershon Elber,et al.  Coons BVH for freeform geometric models , 2011, SA '11.

[13]  Gershon Elber,et al.  Efficient Hausdorff Distance computation for freeform geometric models in close proximity , 2013, Comput. Aided Des..

[14]  Yuan Cheng,et al.  A string-wise CRDT algorithm for smart and large-scale collaborative editing systems , 2017, Adv. Eng. Informatics.

[15]  Anil K. Jain,et al.  A modified Hausdorff distance for object matching , 1994, Proceedings of 12th International Conference on Pattern Recognition.

[16]  Gershon Elber,et al.  Precise Hausdorff distance computation between polygonal meshes , 2010, Comput. Aided Geom. Des..

[17]  Hojjat Adeli,et al.  Object-oriented blackboard models for integrated design of steel structures , 1996 .

[18]  Yan Wang,et al.  Ontology-based feature mapping and verification between CAD systems , 2013, Adv. Eng. Informatics.

[19]  Bertrand Zavidovique,et al.  Enhancing a disparity map by color segmentation , 2012, Integr. Comput. Aided Eng..

[20]  Iddo Hanniel,et al.  GPU-accelerated Hausdorff distance computation between dynamic deformable NURBS surfaces , 2011, Comput. Aided Des..

[21]  Soonhung Han,et al.  Collaborative CAD Synchronization Based on a Symmetric and Consistent Modeling Procedure , 2017, Symmetry.

[22]  Jose A. Belloch,et al.  Multichannel massive audio processing for a generalized crosstalk cancellation and equalization application using GPUs , 2013 .

[23]  Yuan Cheng,et al.  A group Undo/Redo method in 3D collaborative modeling systems with performance evaluation , 2013, J. Netw. Comput. Appl..

[24]  Lihui Wang,et al.  Review: Advances in 3D data acquisition and processing for industrial applications , 2010 .

[25]  Xiao Chen,et al.  Real-time object tracking via compressive feature selection , 2016, Frontiers of Computer Science.

[26]  William Rucklidge,et al.  Efficient Visual Recognition Using the Hausdorff Distance , 1996, Lecture Notes in Computer Science.

[27]  N. Sudha,et al.  Robust Hausdorff distance measure for face recognition , 2007, Pattern Recognit..

[28]  Wolfgang Effelsberg,et al.  Parallel implementation of a real-time high dynamic range video system , 2014, Integr. Comput. Aided Eng..

[29]  William C. Regli,et al.  A Case Study in System-Level Physics-Based Simulation of a Biomimetic Robot , 2011, IEEE Transactions on Automation Science and Engineering.

[30]  Yu Meng,et al.  Polyline approach for approximating Hausdorff distance between planar free-form curves , 2011, Comput. Aided Des..

[31]  Chih-Hsing Chu,et al.  Shape similarity measurement for 3D mechanical part using D2 shape distribution and negative feature decomposition , 2011, Comput. Ind..

[32]  Satyandra K. Gupta,et al.  Machining feature-based similarity assessment algorithms for prismatic machined parts , 2006, Comput. Aided Des..

[33]  Imre Horváth,et al.  Fundamentals of next generation CAD/E systems , 2012, Comput. Aided Des..

[34]  Vadim Shapiro,et al.  Geometric Interoperability With Epsilon Solidity , 2006, J. Comput. Inf. Sci. Eng..

[35]  Fazhi He,et al.  Quantitative optimization of interoperability during feature-based data exchange , 2015, Integr. Comput. Aided Eng..

[36]  Radu Bogdan Rusu,et al.  3D is here: Point Cloud Library (PCL) , 2011, 2011 IEEE International Conference on Robotics and Automation.

[37]  Vadim Shapiro,et al.  Geometric interoperability via queries , 2014, Comput. Aided Des..

[38]  Kin-Man Lam,et al.  Spatially eigen-weighted Hausdorff distances for human face recognition , 2003, Pattern Recognit..

[39]  Bernardo Llanas,et al.  Efficient Computation of the Hausdorff Distance Between Polytopes by Exterior Random Covering , 2005, Comput. Optim. Appl..

[40]  Zhiyong Yuan,et al.  An efficient improved particle swarm optimization based on prey behavior of fish schooling , 2015 .

[41]  Touradj Ebrahimi,et al.  MESH: measuring errors between surfaces using the Hausdorff distance , 2002, Proceedings. IEEE International Conference on Multimedia and Expo.

[42]  Fazhi He,et al.  An Efficient Particle Swarm Optimization for Large-Scale Hardware/Software Co-Design System , 2017, Int. J. Cooperative Inf. Syst..

[43]  Keinosuke Fukunaga,et al.  A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.

[44]  Hojjat Adeli,et al.  An integrated computing environment for solution of complex engineering problems using the object-oriented programming paradigm and a blackboard architecture , 1995 .

[45]  Michael Bartoň.  Solving polynomial systems using no-root elimination blending schemes , 2011, Comput. Aided Des..

[46]  Fazhi He,et al.  Segmentation of uterine fibroid ultrasound images using a dynamic statistical shape model in HIFU therapy , 2015, Comput. Medical Imaging Graph..

[47]  Allan Hanbury,et al.  An Efficient Algorithm for Calculating the Exact Hausdorff Distance , 2015, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[48]  Miin-Shen Yang,et al.  A similarity measure of intuitionistic fuzzy sets based on the Sugeno integral with its application to pattern recognition , 2012, Inf. Sci..

[49]  Yuan Cheng,et al.  Meta-operation conflict resolution for human–human interaction in collaborative feature-based CAD systems , 2016, Cluster Computing.

[50]  Ram D. Sriram,et al.  Standardized data exchange of CAD models with design intent , 2007, Comput. Aided Des..

[51]  Iddo Hanniel,et al.  Computing the Hausdorff distance between NURBS surfaces using numerical iteration on the GPU , 2012, Graph. Model..

[52]  Yiteng Pan,et al.  An efficient similarity-based level set model for medical image segmentation , 2016 .

[53]  Joseph K. Davidson,et al.  Toward Automatic Tolerancing of Mechanical Assemblies: Assembly Analyses , 2014, J. Comput. Inf. Sci. Eng..

[54]  Ari Rappoport,et al.  An architecture for universal CAD data exchange , 2003, SM '03.

[55]  Hojjat Adeli,et al.  A MICROCAD system for design of steel connections—II. Applications , 1986 .

[56]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[57]  Fazhi He,et al.  A Novel Hardware/Software Partitioning Method Based on Position Disturbed Particle Swarm Optimization with Invasive Weed Optimization , 2017, Journal of Computer Science and Technology.

[58]  H. Alt,et al.  Computing the Hausdorff Distance of Geometric Patterns and Shapes , 2003 .

[59]  Dong-Gyu Sim,et al.  Object matching algorithms using robust Hausdorff distance measures , 1999, IEEE Trans. Image Process..

[60]  Soonhung Han,et al.  A set of standard modeling commands for the history-based parametric approach , 2003, Comput. Aided Des..

[61]  Helmut Alt,et al.  Computing the Hausdorff Distance between Curved Objects * , 2006 .

[62]  Soonhung Han,et al.  A method for topological entity correspondence in a replicated collaborative CAD system , 2009, Comput. Ind..

[63]  Yi Zhou,et al.  Optimization of parallel iterated local search algorithms on graphics processing unit , 2016, The Journal of Supercomputing.

[64]  Daniel P. Huttenlocher,et al.  Comparing Images Using the Hausdorff Distance , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[65]  Hojjat Adeli,et al.  A MICROCAD system for design of steel connections—I. Program structure and graphic algorithms , 1986 .

[66]  Young J. Kim,et al.  Interactive Hausdorff distance computation for general polygonal models , 2009, ACM Trans. Graph..

[67]  Mikhail J. Atallah,et al.  A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons , 1983, Inf. Process. Lett..

[68]  Fazhi He,et al.  Using shapes correlation for active contour segmentation of uterine fibroid ultrasound images in computer-aided therapy , 2016 .

[69]  Hanan Samet,et al.  An Incremental Hausdorff Distance Calculation Algorithm , 2011, Proc. VLDB Endow..

[70]  Helmut Alt,et al.  Approximate matching of polygonal shapes , 1995, SCG '91.

[71]  Bertrand Zavidovique,et al.  Mixed color/level lines and their stereo- matching with a modified Hausdorff distance , 2011, Integr. Comput. Aided Eng..

[72]  Xiang Chen,et al.  A flexible assembly retrieval approach for model reuse , 2012, Comput. Aided Des..

[73]  Enver Sangineto,et al.  Pose and Expression Independent Facial Landmark Localization Using Dense-SURF and the Hausdorff Distance , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[74]  Fazhi He,et al.  Service-Oriented Feature-Based Data Exchange for Cloud-Based Design and Manufacturing , 2018, IEEE Transactions on Services Computing.

[75]  Jon M. Kleinberg,et al.  On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane , 1992, SCG '92.

[76]  Kyriakos Mouratidis,et al.  Aggregate nearest neighbor queries in spatial databases , 2005, TODS.

[77]  Marin D. Guenov,et al.  Similarity measures for mid-surface quality evaluation , 2008, Comput. Aided Des..