KIPS Transactions on Software and Data Engineering (정보처리학회논문지:소프트웨어 및 데이터공학)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

The Alignment of Triangular Meshes Based on the Distance Feature Between the Centroid and Vertices

무게중심과 정점 간의 거리 특성을 이용한 삼각형 메쉬의 정렬

  • Minjeong, Koo ;
  • Sanghun, Jeong ;
  • Ku-Jin, Kim
  • 구민정 (경북대학교 컴퓨터학부) ;
  • 정상훈 (경북대학교 소프트웨어기술연구소) ;
  • 김구진 (경북대학교 컴퓨터학부)
  • Received : 2022.07.29
  • Accepted : 2022.08.24
  • Published : 2022.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

Although the iterative closest point (ICP) algorithm has been widely used to align two point clouds, ICP tends to fail when the initial orientation of the two point clouds are significantly different. In this paper, when two triangular meshes A and B have significantly different initial orientations, we present an algorithm to align them. After obtaining weighted centroids for meshes A and B, respectively, vertices that are likely to correspond to each other between meshes are set as feature points using the distance from the centroid to the vertices. After rotating mesh B so that the feature points of A and B to be close each other, RMSD (root mean square deviation) is measured for the vertices of A and B. Aligned meshes are obtained by repeating the same process while changing the feature points until the RMSD is less than the reference value. Through experiments, we show that the proposed algorithm aligns the mesh even when the ICP and Go-ICP algorithms fail.

두 개의 점군(point cloud)을 정렬(alignment)하기 위해 현재까지 ICP(iterative closest point) 알고리즘이 널리 사용되고 있지만, ICP는 두 점군의 초기 방향이 크게 다를 경우 정렬에 실패하는 경우가 많다. 본 논문에서는 두 개의 삼각형 메쉬 A, B가 서로 크게 다른 초기 방향을 가질 때, 이들을 정렬하는 알고리즘을 제안한다. 메쉬 A, B에 대해 각각 가중치 무게중심(weighted centroid)을 구한 뒤, 무게중심으로부터 정점까지의 거리를 이용하여 메쉬 간에 서로 대응될 가능성이 있는 정점들을 특징점으로 설정한다. 설정된 특징점들이 대응될 수 있도록 메쉬 B를 회전한 뒤, A와 B의 정점들에 대해 RMSD(root mean square deviation)를 측정한다. RMSD가 기준치보다 작은 값을 가질 때까지 특징점을 변경하며 같은 과정을 되풀이하여 정렬된 결과를 얻는다. 실험을 통해 ICP 및 Go-ICP 알고리즘으로 정렬이 실패할 경우에도 제안된 알고리즘으로 정렬이 가능함을 보인다.

Keywords

Acknowledgement

이 논문은 정부(과학기술정보통신부)의 재원으로 한국연구재단의 지원을 받아 수행된 연구(NRF-2020R1A2C1008912)임.

References

  1. P. B. Rosenthal, "Interpreting the cryo-EM map," IUCrj, Vol.6, pp.3-4, 2019. https://doi.org/10.1107/S2052252518018304
  2. P. V. Afonine, et al., "New tools for the analysis and validation of cryo-EM maps and atomic models," Acta Crystallographica Section D: Struct Biology, Vol.74, No.9, pp.814-840, 2018. https://doi.org/10.1107/S2059798318009324
  3. W. Lorensen and H. E. Cline, "Marching cubes: A high resolution 3d surface construction algorithm," Computer Graphics (SIGGRAPH 87 Proceedings), Vol.21, No.4, pp.163-170, 1987. https://doi.org/10.1145/37402.37422
  4. T. S. Newman and H. Yi, "A survey of the marching cubes algorithm," Computers & Graphics, Vol.30, No.5, pp.854-879, 2006. https://doi.org/10.1016/j.cag.2006.07.021
  5. T. Ju, F. Losasso, S. Schaefer, and J. Warren, "Dual contouring of hermite data," ACM Transactions on Graphics, Vol.21, No.3, pp.339-346, 2002. https://doi.org/10.1145/566654.566586
  6. P. J. Besl and N. D. McKay, "A method for registration of 3-D shapes," IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol.14, No.2, pp.239-256, 1992. https://doi.org/10.1109/34.121791
  7. Y. Chen and G. Medioni, "Object modelling by registration of multiple range images," Image and Vision Computing, Vol.10, No.3, pp.145-155, 1992. https://doi.org/10.1016/0262-8856(92)90066-C
  8. L. Cheng, S. Chen, X. Liu, H. Xu, Y. Wu, M. Li, and Y. Chen, "Registration of laser scanning point clouds: A review," Sensors, Vol.18, No.5, pp.1641, 2018.
  9. S. Du, Y. Xu, T. Wan, H. Hu, S. Zhang, G. Xu, and Z. Zhang, "Robust iterative closest point algorithm based on global reference point for rotation invariant registration," PLoS ONE, Vol.12, No.11, pp.e0188039, 2017.
  10. J. Yang, H. Li, D. Campbell, and Y. Jia. "Go-ICP: A globally optimal solution to 3D ICP point-set registration," IEEE transactions on pattern analysis and machine intelligence, Vol.38, No.11, pp.2241-2254, 2015. https://doi.org/10.1109/TPAMI.2015.2513405
  11. Q. -Y. Zhou, J. Park, and V. Koltun, "Fast global registration," in European Conference on Computer Vision, pp.766-782, 2016.
  12. H. Zhu, B. Guo, K. Zou, Y. Li, K.-V. Yuen, L. Mihaylova, and H. Leung, "A review of point set registration: From pairwise registration to groupwise registration," Sensors, Vol.19, No.5, pp.1191, 2019.
  13. L. Li, R. Wang, and X. Zhang, "A tutorial review on point cloud registrations: principle, classification, comparison, and technology challenges," Mathematical Problems in Engineering, Vol.2021, Article ID. 9953910, 2021.
  14. M. Koo, S. Jeong, and K.-J. Kim, "Alignment of Polyhedra Based on Distance Feature," in Proceedings of the Annual Spring Conference of Korea Information Processing Society Conference (KIPS) 2022, Vol.29, No.1, pp.32, 2022.
  15. O. Carugo and S. Pongor, "A normalized root-mean-square distance for comparing protein three-dimensional structures," Protein Science, Vol.10, No.7, pp.1470-1473, 2001. https://doi.org/10.1110/ps.690101
  16. M. Meyer, M. Desbrun, P. Schroder, and A. H. Barr, "Discrete differential-geometry operators for triangulated 2-manifolds," in Visualization and Mathematics III, pp.35-57. Springer, Berlin, Heidelberg, 2003.
  17. Point Cloud Library, PCL 1.11.1 [Internet], https://pointclouds.org
  18. Go-ICP Source Code [Internet], http://jlyang.org/go-icp/