Arbitrary topology shape reconstruction from planar cross sections

被引:133
作者
Bajaj, CL [1 ]
Coyle, EJ [1 ]
Lin, KN [1 ]
机构
[1] PURDUE UNIV, SCH ELECT ENGN, W LAFAYETTE, IN 47907 USA
来源
GRAPHICAL MODELS AND IMAGE PROCESSING | 1996年 / 58卷 / 06期
基金
美国国家科学基金会;
关键词
D O I
10.1006/gmip.1996.0044
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In computed tomography, magnetic resonance imaging and ultrasound imaging, reconstruction of the 3D object from the 2D scalar-valued slices obtained by the imaging system is difficult because of the large spacings between the 2D slices. The aliasing that results from this undersampling in the direction orthogonal to the slices leads to two problems, known as the correspondence problem and the thing problem. A third problem, known as the branching problem, arises because of the structure of the objects being imaged in these applications. Existing reconstruction algorithms typically address only one or two of these problems. In this paper, we approach all three of these problems simultaneously. This is accomplished by imposing a set of three constraints on the reconstructed surface and then deriving precise correspondence and thing rules from these constraints. The constraints ensure that the regions tiled by these rules obey physical constructs and have a natural appearance. Regions which cannot be tiled by these rules without breaking one or more constraints are tiled with their medial axis (edge Voronoi diagram). Our implementation of the above approach generates triangles of 3D isosurfaces from input which is either a set of contour data or a volume of image slices. Results obtained with synthetic and actual medical data are presented. There are still specific cases in which our new approach can generate distorted results, but these cases are much less likely to occur than those which cause distortions in other thing approaches. (C) 1996 Academic Press, Inc.
引用
收藏
页码:524 / 543
页数:20
相关论文
共 28 条
[1]  
BAREQUET G, 1994, 10 CONPUTATIONAL GEO, P93
[2]   SHAPE RECONSTRUCTION FROM PLANAR CROSS-SECTIONS [J].
BOISSONNAT, JD .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1988, 44 (01) :1-29
[3]   A BAYESIAN-APPROACH TO RECONSTRUCTION FROM INCOMPLETE PROJECTIONS OF A MULTIPLE OBJECT 3D DOMAIN [J].
BRESLER, Y ;
FESSLER, JA ;
MACOVSKI, A .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1989, 11 (08) :840-858
[4]  
CHRISTIANSEN HN, 1978, COMPUT GRAPH, V12, P187
[5]   A RANDOMIZED ALGORITHM FOR CLOSEST-POINT QUERIES [J].
CLARKSON, KL .
SIAM JOURNAL ON COMPUTING, 1988, 17 (04) :830-847
[6]   AN ALGORITHM FOR VOLUME ESTIMATION BASED ON POLYHEDRAL APPROXIMATION [J].
COOK, LT ;
COOK, PN ;
LEE, KR ;
BATNITZKY, S ;
WONG, BYS ;
FRITZ, SL ;
OPHIR, J ;
DWYER, SJ ;
BIGONGIARI, LR ;
TEMPLETON, AW .
IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, 1980, 27 (09) :493-500
[7]   A TRIANGULATION ALGORITHM FROM ARBITRARY SHAPED MULTIPLE PLANAR CONTOURS [J].
EKOULE, AB ;
PEYRIN, FC ;
ODET, CL .
ACM TRANSACTIONS ON GRAPHICS, 1991, 10 (02) :182-199
[8]  
Elvins T. T., 1992, Computer Graphics, V26, P194, DOI 10.1145/142413.142427
[9]  
EU D, 1994, CVGIP-GRAPH MODEL IM, V56, P231, DOI 10.1006/cgip.1994.1021
[10]   OPTIMAL SURFACE RECONSTRUCTION FROM PLANAR CONTOURS [J].
FUCHS, H ;
KEDEM, ZM ;
USELTON, SP .
COMMUNICATIONS OF THE ACM, 1977, 20 (10) :693-702