PROCESS AND SYSTEM FOR CONSTRUCTING THREE-DIMENSIONAL IMAGES

Abstract: A process and system for constructing three dimensional images by acquiring two dimensional image data maps of two spaced apart planes and using binary interpolation to provide image data on planes between the two spaced apart planes. The acquired image data is first converted to "bit" data maps denoting whether an organ of interest, for example, occupies the elements of the spaced apart planes. The bit maps are used to obtain distance maps denoting where there is transition of values in each element of the bit maps. The distance maps and at least one of the bit maps are used to obtain bit values of interpolated planes between the spaced apart acquired planes for use in constructing three dimensional images.

Description: Field of the Invention This invention is concerned with imaging processes and more particularly with unique interpolation processes used to obtain three-dimensional (3D) images with smooth surfaces in short time periods, with accuracy and fidelity when only partial three dimensional information is available in the form of tomographically acquired data. Background of the Invention Computerized tomography by definition provides two dimensional (2D) images of planes (planar views) in a patient's body. Often times it is important for the viewer (diagnostician and/or doctor) to be able to obtain three-dimensional views rather than planar views of the interior of the patient's body. For example, in surgical prcedures it is extremely helpful if the doctor can see a three-dimensional view of the interior of the body in the area of the operation. Prior to brain surgery which are supplemented by three-dimensional views elaborate measuring methods are used to increase the probability of a successful operation. At present time the three-dimensional views are obtained either by special x-ray equipment such as for example disclosed in the U.S. Patent 4,309,615 or by taking a squence of the tomographic views of the portion of the body of interest and subsequently processing these views to provide the desired three-dimensional view. See the article entitled "Display of 3D Information in Discrete 3D Scenes Produced by Computerized Tomography" by J.K. Udupa, published in The Proceedings of the IEEE , Vol. 71, No 3, March 1983, pp 420-431 (including an extensive bibliography). This article discloses a process and system for constructing three-dimensional images using interpolation techniques and more particularly a process and system for constructing three-dimensional images, wherein two-dimensional maps of image data from each of two spaced apart planes in the interior of a body are acquired and the acquired image data is interpolated to provide image data for a plurality of planes between the spaced apart planes. In the prior art, to acquire and display a 3D image of an organ using the regular 2D tomographic equipment, it is necessary to acquire a series of parallel slices to obtain surface values necessary to construct a 3D image. Thus, in the prior art a great many planar slices are acquired, the values of the pixels in the slices are used to find surfaces pixel values between the slices. The surface pixel values are used to project the 3D image. In the latter example, there is a need to reduce the number of views in order to maximize throughput and to prevent the unnecessary exposure of the patient to radiation. As a result the number of views acquired are minimized and consequently the description of the shape of the organ of interest is not complete. Accordingly, there is a need to interpolate to obtain the organs shape from the acquired partial data of the space apart planar views. The interpolation should ideally reconstruct the actual shape of the organ and pratically reconstruct the actual shape with minimum deviations. Since the shapes of internal body organs are highly irregular, with no simple mathematical description, prior known methods all have serious limitations such as a lack of fidelity and unnecessary artifacts. In addition to the need for an abundance of views, with the prior art the location of the edge of the organ of interest a difficult. In general, thresholding is practiced to convert the originally acquired data into binary maps to determine the edges of the organs. Interpolation is then done between portions of the edges having opposite bit values. However, the functional values (not the binary values) of the given plane image are used for the interpolation between the planes. The interpolation acquired values are converted to binary maps using thresholding. The prior art problem requires using thresholding discriminators to convert the interpolated functional values to bit values. The prior art is also plagued with a "staircase" artifact in the images of the surface of the organ of interest. Thus, it is an object of this invention to provide a reliable method of obtaining an improved, full description of the shape of internal organs including the edge of the organ of interest from a reduced number planar slices of those organs. In accordance with the present invention there is provided a process according to claim 1 and a system according to claim 7 for constructing three-dimensional images. An advantage of applying the process described is a three-dimensional binary bit matrix, in which the regions of bits having "I" values correspond to regions of space occupied by the organs of interest, while regions of bits having "O" values correspond to unoccupied space. This 3-D matrix can then be used to present the structure of the organe to the interested viewer in forms, such as a shaded surface image, well known to those akilled in the art. An advantage of the present invention is that it provides an interpolation process and system for reconstructing three-dimensional images from slices acquired in any manner, for example, through the use of radio-active elements such as those emitting gamma rays, x-ray radiation, magnetic resonance systems. More particularly unique binary interpolation is used to isolate the organ of interest and to minimize the "staircase" artifact. According to a prefered embodiment feature regular 2D front end tomographic systems are used for acquiring the 3D image data. The above mentioned and other features and objects of the present invention will be better understood when considered in light of the following description of the invention made in conjunction with the accompanying drawings ; wherein : Fig. 1 is a combined block and flow diagram showing the inventive binary interpolation system; Fig. 2 is a pictorial showing of a three dimensional object used as example to explain the invention and showing exemplary upper and lower image planes; Fig. 3 shows exemplary upper and lower bit maps; Fig. 4 shows a logic exclusive-OR (XOR) map made from the upper and lower bit maps of Fig. 3; Fig. 5 shows exemplary upper and lower distance maps made from the upper and lower bit maps of Fig. 3 and the XOR map of Fig. 4; Fig. 6 shows a bit value change over fraction map;and Fig. 7 shows three exemplary interpolated bit maps located between the upper and lower bit maps. General Description : The following general description focuses on a system and method for obtaining three-dimensional images particularly adapted for medical diagnostics using computerized tomographic (CT) systems such as x-ray CT systems, emission CT systems or nuclear magnetic resonance systems, for example. It should be understood that the system and method is equally applicable to volume imaging systems in general wherein planar imaging information is available for only some of the planes through the volume of interest. The three-dimensional imaging system 11 of Fig. 1 comprises a front end system 12 for detecting signals from specific locations in a subject being examined. The signals are obtained using an x-ray CT system, for example, when the oppositely disposed radiation source and detectors rotate about the patient and provide radiation intensity values for a multiplicity of radiation paths in a plane through the patient. Well known techniques are used in processing the detected radiation to define elemental area location of radiation absoption values within the patient. The original signal from the front end is normally analog; therefore, an analog to digital converter (ADC) 13 is preferably provided to convert the signals to digital form. An image processor 14 uses the digital signals and determines the absorption values of the elemental area locations in the plane by back-projection methods, for example. An image is provided comprising a matrix of rows and columns in which the values correspond to the values of the elemental area in the plane through the patient and to pixel locations in the actual display image. For the three-dimensional processing described herein at least two images are obtained by moving the subject relative to the radiation source and detector means to obtain image data on more than one plane. In practical usage a plurality of planes are imaged and interpolation is done between successively imaged planes. The planes are spaced apart and it is the volume between the planes that will be imaged in three-dimensional form. The multiplicity of images are shown at 16. A pixel processor 17, which in a preferred embodiment uses a thresehold discriminator and a specific area discriminator, or manual contour tracing, converts the pixels into bits having values of zero and one. The spaced apart planes are thus converted to a lower image bit map 18 and an upper image bit map 19. According to the present invention, an XOR bit map shown at 21 is provided from the bits of the lower and upper image bits maps. Thus, if both of the upper and lower bit maps have the same binary value at a matrix location, that location is given a "0" value in the XOR bit maps, otherwise, that location is give a "1" value. The XOR bit map is then used in combination with the lower image bit map and the upper image bit map to obtain a lower distance map 22 and an upper distance map 23. A distance map shows the length of the shortest path lying entirely within the XOR bit map from the center of a bit to the edge of a bit with the opposite value on the corresponding map (upper or lower). The path goes only through centers of neighboring bits on the corresponding map. There is no limit on the number of interpolated planes that can be obtained by this method.In the simplified explanation presented herein three interpolated planes are obtained. They are the planes located at one quarter of the distance, half the distance and three quarters of the distance between the two spaced apart image planes. In actual practice the number of interpolated planes is such that the distance between planes is equal to the distance between neighboring pixels within the planes. The interpolated planes contain bit values in each of the elemental areas. The collection of sequential planes thus obtained forms a volume defining"description" of the imaged "organ" (organ, bone, tissue, body part etc.). This description is then processed using known techniques to obtain images of outer or inner surfaces of the organs or to measure various spatial (3D) properties such as volumes, angles and distances. The sample solids 41 and 42 of Fig. 2 are shown as being located between lower and upper bit map planes 18a and 19a respectively. The volume 41 is shown as a skewed cylinder while the volume 42 is a cubical volume intersected only by the lower bit map plane 18a. In Fig. 3 the lower bit map 18 and the upper bit map 19 are shown by way of example only, as matrices of fifteen columns and fourteen rows having bit values thereon. The bit values "0" indicate no contact by the transverse planes Pu and PL with volumes 41 or 42. The bit values '1' indicate contact with volumes 41 or 42. Corresponding bit values are used to create the XOR map 21 of Fig. 4. For example, in column 6, row 2 the bit value of the lower bit map is "0" while the bit value in the upper bit map is "1". Thus, the XOR bit map value for that location is "1". Similarly, in column 8, row 2 of both the upper and lower bit maps, the bit value is "0"; therefore, the corresponding row and column in the XOR bit map is "0". Similarily in column 10, row 2 the bit values of the lower bit map is "1" while the value of the upper bit map is "0"; accordingly,the bit value of the XOR bit map for that location is "1". As a final example, in column 8 line 3 the bit value of both maps is 1; therefore the bit values of the XOR bit map is "0". With the XOR bit map and each of the lower and the upper image bit maps a lower distance map and a upper distance map, respectively, are derived. For example the bit value of the fourth row, fourth column of the XOR bit map 21 is one. The bit value of the corresponding location in the lower bit map is zero. The closest bit value on the lower bit map corresponding to the bit value of the XOR map is at a distance of 1 1/2. More particularly the distances are measured from the center of the matrix area to the border of the closest matrix area having the opposite bit value in the corresponding (upper or lower) bit map. The shortest distance across each matrix area is one. The diagonal distance from the center of the matrix to a corner of the matrix is √ 2 /2. The distance is measured along a path that goes only through the centers of matrix areas that have a "1" value on the XOR bit map. Looking at the lower bit map, it is easy to see that the distance from the center of the matrix area of the second row, seventh column to a matrix area having the value "1" is the distance to the matrix area located at the second row in column eight. That distance is 1/2. Similarily the shortest distance from the fifth row of the eleventh column in the lower bit map 18 area having an opposite value "0" is √ 2 plus √ 2 /2 or (3/2)√ 2 . In a similar manner every area of the XOR bit map that has a value "1' is applied to the lower and upper bit maps 18 and 19 to determine lower and upper distance maps 22 and 23. Thus, the search looks at the area on the upper and lower bit maps that correspond to areas in the XOR map that have a "1" value. Then, the length of the shortest path, lying entirely within the XOR map 21 from the center of a bit area to the edge of a bit area with the opposite value in the corresponding map, is entered for each such area in the appropriate distance map 22 or 23. In case no such path exists as in the 13th row of the second column in the upper distance map 23 some reasonable constant value is entered. It has been found that the distance between the upper and lower planes in matrix units gives good results. The distance values are used to obtain the interpolated bit maps. Thus, for example to obtain the bit values for the interpolated bit map 26b that is half way between the upper and lower bit maps, the lower distance and the upper distance maps are used as determinative of the change-over or transition point between the lower bit map value and the upper bit map values according to the following equation: Dco = [DL / (Du + DL)] Dt where: Dco is the change over or transition distance from the lower plane, Du is the distance indicated on the upper distance maps, DL is the distance inidcated on the lower distance map, and DT is the distance between the upper plane and the lower plane. For example the fourth row, fourth column of the lower bit map has a bit value of "0". The corresponding area; that is the fourth row, fourth column of the upper bit map has a bit value of "1". The lower distance map corresponding matrix area has a value 3/2. The upper distance map at that matrix area has a value of √ 2 /2. The change over point from "1" to "0" is [1.5/(1.5+0.70)]Dt or 0.68 Dt. Anything within 0.68 of the distance between the lower bit map and the upper bit has the bit value of "0" and anything at a greater distance has the value "1". At locations where the corresponding bit valve in the XOR map is "0", the value generated for all the interpolated planes is the same as in either the upper or the lower bit map (which should be equal). The change over fraction map 25 of Fig. 6 gives the change over fraction DL/(DL+Du) as for the example described. In this manner any number of interpolated planes or maps can be derived from each two spaced apart sequential plane images. Once all the interpolated planes are derived, the three-dimensional binary matrix holds a full description of the body, or bodies, of interest. Methods well known to those skilled in the art are used to produce 3D shaded images from the acquired and interpolated data. For example the locations of the occupied ("1") bit areas in the matrix can be multipled by a rotation matrix and projected onto a two-dimensional plane, to create a surface image 28 of the body in a given rotational angle. That image can then be displayed on the display unit 29. It should be mentioned also, that since the process described transforms a given group of edge contours to another in any number of intermediary steps, it can also be used in computerized animation sequencs. The animator does not have to create all the necessary images in a sequence directly. Using this process, the computer can interpolate missing images in the animation sequence.

Claims: Process for constructing three-dimensional images, said process wherein two-dimensional maps of image data from each of two spaced apart planes in the interior of a body are acquired and the acquired image data is interpolated to provide image data for a plurality of planes between the spaced apart planes, characterized in that interpolating step comprises: converting said maps of image data (16) from said spaced apart planes to spaced apart bit maps (18, 19), said image data comprising intersecting rows and columns of image values, each intersecting row and column representing a corresponding element of said planes and a corresponding pixel of said image, determining corresponding elements of each of said spaced apart planes with different bit values by processing the bits in said spaced apart bit maps to obtain an Exclusive-OR(XOR) bit map (21), determining the distance from one of said spaced apart planes to where there is a transition of values between said different bit values in corresponding elements, using said distance to provide interpolated bit data for the planes between said spaced apart planes, converting said interpolated bit data (22, 23) to interpolated image data, and using said acquired image data of said spaced apart planes and said interpolated image data on said planes between said spaced apart planes to provide three-dimensional images. Process according to claim 1 wherein the step of determining the distance to a transition of values comprises determining the shortest distance from elements on each of said bit maps (18, 19), where there is a different bit value in the corresponding element of the spaced apart bit maps to an element where there is a different bit value on the same bit map. Process according to any of claims 1 or 2 wherein the step of determining the distance to a transition value comprises constructing a first distance map (22) and a second distance map (23), where each of said distance maps comprises the distance from each element therein having a different bit value in a corresponding element of the other of said spaced apart bit maps to the closest opposite bit value on the same bit map. Process according to claim 3 wherein the distance to a transition value (Dco) is determined by the ratio between a local distance (DL) in the one bit map (e.g. 18) and the sum of local distances (Du + DL) of the other bit map (e.g. 19) and the one bit map multiplied by the total distance (Dt) between the spaced apart planes. Process according to claim 3 wherein the step of determining the distance to a transition of values further includes: constructing a distance map (22, 23) of distances determined on each of said spaced apart bit maps (18, 19), finding the transition distance according to the equation: Dco=[DL/(Du+DL)Dt where : Dco is the transition distance from one of said spaced apart planes; Du is the distance indicated on the distance map associated with the other of said spaced apart planes, such as an upper plane, for example, DL is the distance indicated on the distance map associated with the said one of the spaced apart planes, such as a lower plane, for example, and Dt is the distance between the two spaced apart planes. Process according to any of claims 4 or 5 wherein the local distances are measured from the center of each corresponding element having a different bit value to the border of the closest element on the same bit map having a different bit value along lines extending from the center of each element to the center of an adjoining element. A system for constructing three-dimensional images comprising, means for acquiring two-dimensional image date maps of two spaced apart planes in the interior of a body, and means for interpolating the acquired image date to provide image data for a plurality of planes between said spaced apart planes, characterized in that said means for interpolating the acquired image data comprises means for converting said image data maps (16) of said spaced apart planes to spaced apart bit maps (18, 19), said image data comprising intersecting rows and column of image values, each intersecting row and column representing a corresponding element of said planes and a corresponding pixel of said image, means for determining corresponding elements of each of said spaced apart planes with different bit values, said means for determining corresponding elements with different bit values comprising means for processing the bits in said spaced apart bit maps to obtain a logic Exclusive-OR(XOR) bit map (21), means for determining the distance from one of said spaced apart planes to where there is a transition of values between bit values in said corresponding elements, means for using said distances to provide interpolated bit data (22, 23) for said planes between said spaced apart planes, means for converting said interpolated bit data to interpolated image data, and means for using said acquired image data of said spaced apart planes and said interpolated image data on said planes between said spaced apart planes to provide three-dimensional images. System according to claim 7 wherein said means for determining the distance to a transition of values comprises means for determining the shortest local distances from elements on each of said bit maps (18, 19) where there is a different bit value in the corresponding element of the spaced apart bit map to an element where there is a different bit value on the same bit map. System according to claim 8 wherein the means of determining the distance to a transition value comprises means for constructing a first distance map (22) and a second distance map (23), where each distance map comprises the distance from each element having a different bit value in a corresponding element of the other of said spaced apart bit maps to the opposite bit value on the same bit map where said each element is located. System according to claim 9 wherein the transition distance to a transition value (Dco) is determined by the ratio between a local distance (DL) in the one bit map (e.g. 18) and the sum of local distances (Du + DL) of the other bit map and the one bit map (e.g. 19) multiplied by the total distance (Dt) between the spaced apart planes. System according to claim 9 wherein the means for determining the distance to a transition value further includes means for constructing a distance map of the distance determined on each of said spaced apart bit maps, and means for finding the transition distance according to the equation: Dco=[DL/(DU+DL)]Dt where: Dco is the transition distance from one of said spaced apart planes; Du is the distance indicated on the distance map associated with the other of said spaced apart planes, DL is the distance indicated on the distance map associated with the said one of the spaced apart planes, and Dt is the distance between the two spaced apart planes. System according to any of claims 10 or 11 wherein the local distances are measured from the center of each corresponding element having a different bit value to the border of the closest element on the same bit map having a different bit value along lines extending from the center of each element to the center of an adjoining element.

Inventors: DEKEL, DORON
Applicants: ELSCINT LTD.
Application year: 1987
Main classification: G06F15
IPC codes: G06T11, G06F17