A Volumetric Shape Registration Based on Locally Affine-Invariant Constraint

被引:1
|
作者
Kang, Dan [1 ,2 ]
Zhao, Xiuyang [1 ,2 ]
Niu, Dongmei [1 ,2 ]
Liu, Mingjun [1 ,2 ]
机构
[1] Univ Jinan, Sch Informat Sci & Engn, Jinan 250022, Shandong, Peoples R China
[2] Shandong Prov Key Lab Network Based Intelligent C, Jinan 250022, Shandong, Peoples R China
基金
中国国家自然科学基金;
关键词
volumetric shape registration; affine-invariant constraint; the generic template tetrahedral mesh; voxel cells;
D O I
10.1109/CSE-EUC.2017.95
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
we present a method based on a locally affineinvariant constraint for volumetric registration of 3D solid shapes. The core idea of this method is that an affine combination of the given point in 3D solid shapes that are directly connected to the given point, and the corresponding weight of each neighboring point can be obtained by the method of generalized least square. The input of our method is a pair of 3D solid shapes that are represented by a tetrahedral mesh and a voxelized object consisting of a set of voxel cells segmented from Digital Imaging and Communications in Medicine(DICOM) scans. To achieve the registration between the two input DICOM images, we firstly need to do some preprocessing to segment the bones out from the DICOM images and represent the segmented healthy bone and lesion bone using a generic template tetrahedral mesh and a set of voxel cells, respectively. Secondly we apply the standard Iterative Closest Point (ICP) method to briefly align the tetrahedral mesh and the voxelized object. Thirdly we execute a novel registration process that uses as much volumetric information and local geometry information as possible while deforming the generic template tetrahedral mesh of a healthy human bone towards the undelying geometry of the voxel cells. Compared with the previous methods that are based on point or surface, our method requires less auxiliary variables and can better capture the volumetric information of the 3D solid shapes, such as the thickness of the bones. Besides that, using a tetrahedral mesh to represent a solid shape can make the precision of registration greatly improved. Our experimental results demonstrate that the proposed method is robust and is of high registration accuracy.
引用
收藏
页码:504 / 511
页数:8
相关论文
共 50 条
  • [1] Object Matching with a Locally Affine-Invariant Constraint
    Li, Hongsheng
    Kim, Edward
    Huang, Xiaolei
    He, Lei
    2010 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2010, : 1641 - 1648
  • [2] Adaptive locally affine-invariant shape matching
    Smit Marvaniya
    Raj Gupta
    Anurag Mittal
    Machine Vision and Applications, 2018, 29 : 553 - 572
  • [3] Adaptive locally affine-invariant shape matching
    Marvaniya, Smit
    Gupta, Raj
    Mittal, Anurag
    MACHINE VISION AND APPLICATIONS, 2018, 29 (04) : 553 - 572
  • [4] A fast and robust affine-invariant method for shape registration under partial occlusion
    Elghoul, Sinda
    Ghorbel, Faouzi
    INTERNATIONAL JOURNAL OF MULTIMEDIA INFORMATION RETRIEVAL, 2022, 11 (01) : 39 - 59
  • [5] A fast and robust affine-invariant method for shape registration under partial occlusion
    Sinda Elghoul
    Faouzi Ghorbel
    International Journal of Multimedia Information Retrieval, 2022, 11 : 39 - 59
  • [6] Affine-invariant curve normalization for shape-based retrieval
    Avrithis, Y
    Xirouhakis, Y
    Kollias, S
    15TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 1, PROCEEDINGS: COMPUTER VISION AND IMAGE ANALYSIS, 2000, : 1015 - 1018
  • [7] New features for affine-invariant shape classification
    Dionisio, CRP
    Kim, HY
    ICIP: 2004 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOLS 1- 5, 2004, : 2135 - 2138
  • [8] Sparse affine-invariant linear codes are locally testable
    Ben-Sasson, Eli
    Ron-Zewi, Noga
    Sudan, Madhu
    2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2012, : 561 - 570
  • [9] Sparse affine-invariant linear codes are locally testable
    Eli Ben-Sasson
    Noga Ron-Zewi
    Madhu Sudan
    computational complexity, 2017, 26 : 37 - 77
  • [10] SPARSE AFFINE-INVARIANT LINEAR CODES ARE LOCALLY TESTABLE
    Ben-Sasson, Eli
    Ron-Zewi, Noga
    Sudan, Madhu
    COMPUTATIONAL COMPLEXITY, 2017, 26 (01) : 37 - 77