[1] Jiang Xiaotong,. Surface reconstruction of complex contour linesbased on chain code matching technique [J]. Journal of Southeast University (English Edition), 2005, 21 (4): 432-435. [doi:10.3969/j.issn.1003-7985.2005.04.011]
Copy
Surface reconstruction of complex contour linesbased on chain code matching technique(
)
基于链码匹配技术的断层间复杂轮廓线三角曲面重建方法
)Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]
- Volumn:
- 21
- Issue:
- 2005 4
- Page:
- 432-435
- Research Field:
- Computer Science and Engineering
- Publishing date:
- 2005-12-30
Info
- Title:
- Surface reconstruction of complex contour linesbased on chain code matching technique
- 基于链码匹配技术的断层间复杂轮廓线三角曲面重建方法
- Author(s):
- Jiang Xiaotong
- Department of Instrument Science and Technology, Southeast University, Nanjing 210096, China
- 姜晓彤
- 东南大学仪器科学与工程系, 南京 210096
- PACS:
- TP391.41
- DOI:
- 10.3969/j.issn.1003-7985.2005.04.011
- Abstract:
- A new method for solving the tiling problem of surface reconstruction is proposed.The proposed method uses a snake algorithm to segment the original images, the contours are then transformed into strings by Freeman’s code.Symbolic string matching technique is applied to establish a correspondence between the two consecutive contours.The surface is composed of the pieces reconstructed from the correspondence points.Experimental results show that the proposed method exhibits a good behavior for the quality of surface reconstruction and its time complexity is proportional to mn where m and n are the numbers of vertices of the two consecutive slices, respectively.
- 利用链码理论对已获取的层间轮廓线进行编码, 将二维的轮廓曲线转化为包含轮廓形状信息的一维链码;以包含轮廓形状相似信息的“链间距离”为目标函数, 采用链码匹配技术完成相邻层轮廓特征点的匹配, 将复杂轮廓线分割为若干简单的曲线段, 重构的曲面由这些分片构造的三角片曲面拼接而成.实验表明该算法能够找出复杂轮廓线上恰当的对应特征点, 从而构造出较真实的曲面.
References:
[1] Meyers D.Reconstruction of surfaces from planar contours [D].Seattle, WA, USA:Department of Computer Science and Engineering of University of Washington, 1994.
[2] Keppel E.Approximating complex surfaces by triangula-tion of contour lines [J].IBM Journal of Research and Development, 1975, 19:2-11.
[3] Fushes H, Kedem Z, Uselton S P.Optimal surface reconstruction from planar contours [J].Communication of the ACM, 1977, 20(10):693-702.
[4]Christiansen H N, Sederberg T W.Conversion of complex contour line definitions into polygonal element mosaics[A].In:Proceedings of SIGGRAPH’78, Computer Graphics[C].New York, 1978, 12:187-192.
[5] Ganapathy S, Dennehy T G.A new general triangulation method for planar contours [A].In:Proceedings of SIG-GRAPH’82, Computer Graphics [C].Boston, Massachusetts, 1982, 16:69-75.
[6] Wagner R A, Fisher M J.The string to string correction problem[J]. Journal of the ACM, 1974, 21(1):168-173.
[7] Marzal A, Vidal E, Airbar P.Fast computation of normalized edit distances[J].IEEE Trans Pat Anal Machin Intel, 1995, 17:899-902.
[8] Bunke H, Bühler U.Application of approximate string matching to 2D shape recognition[J].Pattern Recognition, 1993, 26(12):1797-1811.
[9] Maes M.Polygonal shape recognition using string matching techniques [J].Pattern Recognition, 1991, 24(5):433-440.
[10] Brieva J, Toumoulin C, Wendling F.Extraction of vascular segments in coronarographic image by means of string matching [A].In:19th Annual Conference of the IEEE Engineering in Medecine and Biology Society (EMBS)[C].Chicago, 1997.814-817.
[11] Toumoulin C, Brieva J, Bellanger J, et al.String matching techniques for high level primitive formation in 2-D vascular imaging[J].IEEE Trans Information Technology in Biomedicine, 2003, 7(4):291-301.
[12] McInerney T, Terzopoulos D. Medical image segmentation using topologically adaptable snakes [A].In:Proc of the First International Conference on Computer Vision, Virtual Reality, and Robotics in Medicine (CVRMed’95)[C]. Nice France, 1995, 905:92-101.
[13] Barequet G, Shapiro A. History consideration in reconstructing polyhedral surface from parallel slices[A].In:Proceeding of Visualization [C].San Francisco, California, 1996.149-156.
Memo
- Memo:
- Biography: Jiang Xiaotong(1975—), male, doctor, jxtong@seu.edu.cn.