Patent EP0265334B1 successfully refreshed from Google Patents.
EP0265334B1
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Process and system for constructing three-dimensional images
Assignee: Elscint Ltd
•
Filing: 1987-10-19
•
Granted: 1993-07-28
•
Expires: 2007-10-19
Abstract
No abstract record available.
Inventors
- 👤 Doron Dekel
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-31 18:49
CPC Classifications
G; G06; G06F; G06F17/00; G06F17/10; G06F17/17; G06F17/175; G06T; G06T12/00; G06T12/30
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
216 words
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.
Claim 2
Dependent Claim
64 words
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.
Claim 3
Dependent Claim
75 words
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.
Claim 4
Dependent Claim
62 words
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.
Claim 5
Dependent Claim
123 words
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.
Claim 6
Dependent Claim
60 words
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.
Claim 7
Independent Claim
243 words
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.
Claim 8
Dependent Claim
67 words
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.
Claim 9
Dependent Claim
75 words
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.
Claim 10
Dependent Claim
63 words
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.
Claim 11
Dependent Claim
109 words
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.
Claim 12
Dependent Claim
60 words
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.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.