Disks having the maximum radius of a large intestine are created and the contours of the disks are connected by virtual springs. Next, the directions of the disks are adjusted so that virtual spring energy becomes the minimum, so that the adjacent disks are prevented from crossing each other. Virtual rays are projected along the disks for generating an image of inside the large intestine. Accordingly, quivering of the virtual rays along a central path lessens and effect of the scale on the image along the central path can be prevented and in the portion where the central path largely bends, duplicate display of the same observation object can also be prevented.
|
1. An image processing method for visualizing information of an observation object, the image processing method comprising:
setting a path which is a center line of the observation object;
determining a region that includes the information to be visualized;
setting a plurality of planes crossing the path, each of said planes does not cross each other in the region, wherein at least one of the planes forms an acute angle or an obtuse angle with the path; and
projecting virtual rays onto the observation object from points on the path so as to visualize the information near the path, thereby to generate a single projected image, wherein each of the virtual rays are projected while rotating from the points on the path and projected along the planes crossing the path.
11. A non-transitory computer readable medium having a program including instructions for permitting a computer to perform image processing for visualizing information of an observation object, the instructions comprising:
setting a path which is a center line of the observation object;
determining a region that includes the information to be visualized;
setting a plurality of planes crossing the path, each of said planes does not cross each other in the region, wherein at least one of the planes forms an acute angle or an obtuse angle with the path; and
projecting virtual rays onto the observation object from points on the path so as to visualize the information near the path, thereby to generate a single projected image, wherein each of the virtual rays are projected while rotating from the points on the path and projected along the planes crossing the path.
2. The image processing method as claimed in
3. The image processing method as claimed in
4. The image processing method as claimed in
obtaining a normal vector of each of the planes,
wherein the direction of each of the planes is changed so that an angle between the normal vectors of the adjacent planes becomes small.
5. The image processing method as claimed in
setting a virtual spring that connects the adjacent planes,
wherein the direction of each of the planes is changed so that energy of the virtual spring becomes small.
6. The image processing method as claimed in
generating the single projected image by volume rendering by the projected virtual rays.
7. The image processing method as claimed in
generating the single projected image by surface rendering by the projected virtual rays.
8. The image processing method as claimed in
generating the single projected image by network distributed processing by the projected virtual rays.
9. The image processing method as claimed in
generating the single projected image using a GPU (Graphic processing Unit) by the projected virtual rays.
10. The image processing method as claimed in
generating a medical image by the virtual rays being projected onto a tubular tissue in a human body.
|
This application claims foreign priority based on Japanese Patent application No. 2005-340949, filed Nov. 25, 2005, the content of which is incorporated herein by reference in its entirety.
1. Field of the Invention
This invention relates to an image processing method and a computer readable medium for image processing for visualizing a tubular tissue.
2. Description of the Related Art
A technique for visualizing the inside of a three-dimensional object has attracted public attention with the advance of image processing technology using a computer in recent years. Particularly in the medical field, medical diagnosis using a CT (Computed Tomography) apparatus or MRI (Magnetic Resonance Imaging) apparatus has been performed widely because a lesion can be detected early by visualizing the inside of a living body.
On the other hand, volume rendering is known as a method for obtaining a three-dimensional image of the inside of an object. In volume rendering, ray is emitted onto a three-dimensional voxel (micro volume element) space to there by project an image on a projection plane. This operation is referred to as ray casing. In ray casting, a voxel value is acquired from a voxel at each sampling point which is sampled at a regular interval along the path of the ray.
The voxel is a unit for constituting a three-dimensional region of an object. The voxel value is a specific data expressing characteristic such as a density value of the voxel. The whole object is expressed by voxel data which is a three-dimensional arrangement of the voxel value. Generally, two-dimensional tomogram data obtained by CT is collected along a direction perpendicular to each sectional layer, and voxel data which is the three-dimensional arrangement of voxel value is obtained by performing necessary interpolation.
In ray casting, reflected light of a virtual ray emitted onto an object from a viewpoint is generated according to an opacity value artificially set for each voxel value. Then, the gradient of voxel data, that is, a normal vector is obtained to obtain a virtual surface, and a shading coefficient for shading is calculated from the cosine of an angle between the virtual ray and the normal vector. Reflected light is calculated by multiplying the intensity of the virtual ray emitted on each voxel, the opacity value of the voxel and the shading coefficient.
Therefore, as shown in
Next, coordinates P (x, y, z) of the position t on the central path and a direction vector D (x, y, z) of the center path of the position t on the central path are acquired (step S13) Virtual rays are projected 360° on a plane, which is perpendicular to D (x, y, z) from P (x, y, z) (step S14).
Next, t is incremented (step S15), and to determine whether or not the end point position is reached, a comparison is made between the values of t and t_max. If t is smaller than t_max (YES), the process returns to step S12; if t is equal to or greater than t_max (NO), the processing is completed.
Thus, the curved cylindrical projection method in the related art becomes the same as the cylindrical projection method in the related art wherein every ray projected from a point on one central path lies along a plane having D (x, y, z) as a normal vector.
A method of projecting virtual rays so as to follow a virtual magnetic curve created from a path (for example, refer to U.S. Pat. No. 6,212,420), and a method of expanding an observation object using a finite element method before conducting cylindrical projection (for example, refer to “Virtual Colon Unfolding,” A. Vilanova Bartroli, R. Wegenkittl, A. Konig, E. Groller, IEEE Visualization, USA, 2001, p 411-420) are known as related arts.
If virtual rays 118, 119, 120, 121, etc., quiver in subordination to a meandering of the central path 112, then this results in an image difficult to grasp the state of a large intestine 111. That is, in a straight portion A of the large intestine 111, the virtual rays faithfully quiver in subordination to a meandering of the central path 112 and scales 128 and 129 of the image effected and thus the representation of a physical length changes according to the position on the image along the central path 112. Since the virtual rays cross each other in the large bend portion B of the central path 112, the same observation object 130 is duplicately displayed in the crossing part.
In “Virtual Colon Unfolding”, A. Vilanova Bartroli, R. Wegenkittl, A. Konig, E. Groller, IEEE Visualization, USA, 2001, p 411-420, above problem is tried to be solved by a method in which a folded structure of a surface of the target internal organ is unfolded by an approach of finite-element deformation after obtaining the shape of the surface of the target internal organ. However, it is difficult to say that this method is practical, because this method has disadvantages such as that subjective and complex condition setting is necessary in the extraction of the surface of the internal organ, and in the process of unfolding, lesion can not be detected because polyp is also unfolded, and calculation for extracting and unfolding the surface of the internal organ is enormous. Further, in U.S. Pat. No. 6,212,420 using the virtual magnetic curve, there exists an enormous load for calculating the magnetic curve.
The present invention has been made in view of the above circumstances, and provides an image processing method and a computer readable medium for image processing capable of preventing the scale on an image effected according to the meandering of central path without increasing calculation load, and preventing duplicate display of the same observation object in a portion where the central path largely bends.
In some implementations, an image processing method of the invention for visualizing information of an observation object, the image processing method comprising:
setting a path which is a center line of the observation object;
determining a region that includes the information to be visualized;
setting a plurality of planes crossing the path, each of said planes does not cross each other in the region; and
projecting virtual rays onto the observation object from points on the path so as to visualize the information near the path.
According to the configuration, to project a virtual ray from a point along the path, the direction of each plane along which the virtual ray lies is changed so that the planes do not cross each other in the determined region, and thus duplicate display of the same observation object is not produced even in the portion where the path largely bends, and the lesion part can be grasped precisely. According to the configuration, the virtual rays are prevented from crossing each other in the determined region, whereby the calculation load can be decreased as compared with the related art technique using a curve to prevent the virtual rays from crossing each other in the whole image.
In the image processing method of the invention, the region is a region within a predetermined distance from the path.
In the image processing method of the invention, the region is a region of a tubular tissue as the observation object.
In the image processing method of the invention, the region is an expanded region of a tubular tissue as the observation object.
According to the configuration, the directions of the planes are adjusted so that the planes do not cross each other in a region within a predetermined distance from the path, a region of the tubular tissue to be observed, or an expanded region of the tubular tissue to be observed, whereby the processing time can be shortened and a precise projection image can be displayed at high speed.
The image processing method of the invention comprising
obtaining a normal vector of each of the planes,
wherein the direction of each of the planes is changed so that an angle between the normal vectors of the adjacent planes becomes small.
The image processing method of the invention comprising:
setting a virtual spring that connects the adjacent planes,
wherein the direction of each of the planes is changed so that energy of the virtual spring becomes small.
According to the configuration, the direction of the plane is changed so that the angle between the normal vectors of the adjacent planes lessens or that the virtual spring energy between the adjacent planes lessens. Accordingly, quiver of the virtual rays along the path lessens and effect of the scale on the image along the path can be prevented and in the portion where the path largely bends, duplicate display of the same observation object can also be prevented.
The image processing method of the invention comprising:
generating a projection image by volume rendering by the projected virtual rays.
The image processing method of the invention comprising:
generating a projection image by surface rendering by the projected virtual rays.
The image processing method of the invention comprising:
generating a projection image by network distributed processing by the projected virtual rays.
The image processing method of the invention comprising:
generating a projection image using a GPU (Graphic Processing Unit) by the projected virtual rays.
The image processing method of the invention comprising:
generating a medical image by the virtual rays being projected onto a tubular tissue in a human body.
In some implementations, a computer readable medium of the invention having a program including instructions for permitting a computer to perform image processing for visualizing information of a observation object, the instructions comprising:
setting a path which is a center line of the observation object;
determining a region that includes the information to be visualized;
setting a plurality of planes crossing the path, each of said planes does not cross each other in the region; and
projecting virtual rays onto the observation object from points on the path so as to visualize the information near the path.
In the accompanying drawings:
The patient 403 is lying on a table 407 through which the X-rays are transmitted. The table 407 is supported by a retainer which is not shown in
Thus a measuring system is configured so that the X-ray source 401 and the X-ray detector 404 are rotatable about the system axis 406 and movable along the system axis 406 relatively to the patient 403. Accordingly, X-rays can be cast on the patient 403 at various projection angles and in various positions with respect to the system axis 406. An output signal from the X-ray detector 404 when the X-rays are cast on the patient 403 are supplied to a volume data generating section 411 and converted into a volume data.
In sequence scanning, the patient 403 is scanned in accordance with each sectional layer of the patient 403. When the patient 403 is scanned, while the X-ray source 401 and the X-ray detector 404 rotate around the patient 403 about the system axis 406 as its center, the measuring system including the X-ray source 401 and the X-ray detector 404 captures a large number of projections to scan each two-dimensional sectional layer of the patient 403. A tomogram displaying the scanned sectional layer is reconstructed from the measured values acquired at that time. While the sectional layers are scanned continuously, the patient 403 is moved along the system axis 406 every time the scanning of one sectional layer is completed, This process is repeated until all sectional layers of interest are captured.
On the other hand, during spiral scanning, the table 407 moves along the direction of the arrow “b” continuously while the measuring system including the X-ray source 401 and the X-ray detector 404 rotates about the system axis 406. That is, the measuring system including the X-ray source 401 and the X-ray detector 404 moves on a spiral track continuously and relatively to the patient 403 until the region of interest of the patient 403 is captured completely. In this embodiment, signals of a large number of successive sectional layers in a diagnosing area of the patient 403 are supplied to a volume data generating section 411 by the computed tomography apparatus shown in
Volume data generated by the volume data generating section 411 is introduced into a central path setup section 412 in an image processing section 417. The central path setup section 412 sets the central path of the tubular tissue contained in the volume data. A plane generating section 414, which is described later in detail, determines the plane along which a virtual ray used for cylindrical projection is projected from the set central path and volume data. The plane generated in the plane generating section 414 is supplied to a cylindrical projection section 415.
The cylindrical projection section 415 performs cylindrical projection using volume data in accordance with the plane generated in the plane generating section 414 to generate a cylindrical projection image. The cylindrical projection image provided by the cylindrical projection section 415 is supplied to a display 416 for displaying the image. In addition to a display of the cylindrical projection image, combined display of a histogram, parallel display of a plurality of images, animation display of displaying a plurality of images in sequence, simultaneous display with a virtual endoscope (VE) image, etc., is produced on the display 416.
An operating section 413 performs the setting of the central path, plane generation, and the display angle in spherical cylindrical projection in response to an operation signal from a keyboard, a mouse, etc., generates a control signal of each set value, and supplies the control signal to the central path setup section 412, the plane generating section 414, and the cylindrical projection section 415. Accordingly, while viewing the image displayed on the display 416, the user can change the image interactively and can observe a lesion in detail.
For example, in a straight portion A where the central path 11 meandering, the projection direction is adjusted so that the virtual rays 13, 14, 15, and 16 become almost parallel. In a bend portion B where the central path 11 largely bends, the projection direction is adjusted so that the virtual rays 18, 19, 20, and 21 gradually bend.
Accordingly, in the straight portion A, quivering of the virtual rays along the central path 11 lessens and effect of the scale on the image along the central path 11 can be prevented. In the bend portion B where the central path 11 largely bends, duplicate display of the same observation object can be prevented.
Accordingly, quiver of the virtual rays along the path lessens and effect of the scale on the image along the path can be prevented and in the portion where the path largely bends, duplicate display of the same observation object can also be prevented.
Brief processing steps of the corrected cylindrical projection method in the image processing method of the embodiment will be discussed with reference to
Next, a virtual spring for connecting the contours of the disks is created (step S3) and the disk is moved so that virtual spring energy E becomes the minimum (step S4). A virtual ray is projected along the disk (step S5). In this case, the condition that the virtual rays (disks) do not cross each other is obtained in a state in which the virtual spring energy E becomes the minimum. In so doing, the virtual rays do not cross each other until they reach the projection plane.
Thus, the contours of the adjacent disks are connected by the virtual springs and the directions of the disks are adjusted so that the virtual spring energy E becomes the minimum, so that the adjacent disks are prevented from crossing each other. Virtual rays are projected along the disks for generating an image of the inside of the large intestine 12.
Accordingly, quiver of the virtual rays along the central path 11 lessens and effect of the scale on the image along the central path 11 can be prevented and in the portion where the central path 11 largely bends, duplicate display of the same observation object can also be prevented.
Next, the corrected cylindrical projection method in the image processing method of the embodiment will be discussed in detail according to flowcharts.
Next, memory areas for following arrays are allocated. Plane reference position P (x, y, z) [t] of a disk at a position t on a central path, normal vector D (x, y, z) [t] of the disk, an ideal spring displacement vector IS (x, y, z) [t−1], and a spring vector S (x, y, z) [t−1, i] (step S104) (
Next, the connection position of the spring (spring contact) relative to the position P is obtained according to a function SP [t, i, P] (step S105) Position t on the central path is initialized to t=0 (step 5106) and the coordinates P (x, y, z) [t] of the position t on the central path and the normal vector D (x, y, z) of the disk at the position t on the central path are acquired (step S107).
Next, t is incremented (step 5108) and a comparison is made between t and t_max (step S109). If t is smaller than t_max (YES), the process returns to step S107; if t is equal to or greater than t_max (NO), t is set to 0 (step S110) and ideal displacement IS (x, y, z) [t]=P (x, y, z) [t+1]−P (x, y, z) [t] is calculated (step S111).
Next, t is incremented (step S112) and a comparison is made between t and t_max−1 (step S113). If t is smaller than t_max−1 (YES), the process returns to step S111; if t is equal to or greater than t_max−1 (NO), the initialization is completed.
Next, S (x, y, z) [t, i]=SP [t+1, i, R]−SP [t, i, R] is acquired (step S204) and using spring displacement dS (x, y, z) [t, i]=S (x, y, z) [t, i]−IS (x, y, z) [t], differential virtual spring energy dE [t, i]=−f*length (dS [t, i])^2 (^2 represents a square) is calculated (f: Virtual spring constant) (step S205).
Next, i is incremented (step S206) and a comparison is made between i and i_max−1 (step S207). If i is smaller than i_max−1 (YES), the process returns to step S204; if i is equal to or greater than i_max−1 (NO), one is added to t (step S208).
Next, a comparison is made between t and t_max−1 (step S209). If t is smaller than t_max−1 (YES), the process returns to step S203; if t is equal to or greater than t_max−1 (NO), a comparison is made between |E−ΣdE| and ε (step S210). If |E−ΣdE| is smaller than ε (YES), it is assumed that the calculation sufficiently converges, and the calculation is completed. If |E−ΣdE| is equal to or greater than ε (NO), E=ΣdE (step S211).
Next, t is set to t0 (step S212), i is set to i0 (step S213), and the spring contact is moved by (a*dS (x, y, z) [t, i] for rotating the disk (a: Displacement amount coefficient per iteration) (step S214: See
Next, i is incremented (step S215) and a comparison is made between i and i_max−1 (step S216). If i is smaller than i_max−1 (YES), the process returns to step S214; if i is equal to or greater than i_max−1 (NO), t is incremented (step S217). A comparison is made between t and t_max−1 (step S218). If t is smaller than t_max−1 (YES), the process returns to step 5213; if t is equal to or greater than t_max−1 (NO), the process returns to step S202.
Next, t is incremented (step S303) and a comparison is made between t and t_max−1 (step S304). If t is smaller than t_max−1 (YES), the process returns to step S302; if t is equal to or greater than t_max−1 (NO), the rendering is completed.
Thus, according to the image processing method of the embodiment, the direction of the disk is changed so that the angle between the normal vectors of the adjacent disks lessens or that the virtual spring energy between the adjacent disks lessens. Accordingly, quiver of the virtual rays along the path lessens and effect of the scale on the image along the path can be prevented and in the portion where the path largely bends, duplicate display of the same observation object can also be prevented.
Virtual springs 51a to 59b connecting the disks 41A to 50A are connected according to the contours of the disk having the smaller radius. The disk is moved so that virtual spring energy E becomes the minimum, and a virtual ray is projected along the disk.
Thus, the radiuses of the disks 41A to 50A are optimized for each place of the large intestine 12, the adjacent disks are connected by the virtual springs, and the directions of the disks are adjusted so that the virtual spring energy E becomes the minimum, whereby the adjacent disks are prevented from crossing each other.
Accordingly, quiver of the virtual rays along a central path 11 lessens and effect of the scale on the image along the central path 11 can be prevented and in the portion where the central path 11 largely bends, duplicate display of the same observation object can also be prevented.
Also in the embodiment, an image is created according to the initialization phase (step S100), the calculation phase (step S200), and the rendering phase (step S300) shown in
Next, t is incremented (step S223) and a comparison is made between t and t_max−1 (step S224). If t is smaller than t_max−1 (YES), the process returns to step S222; if t is equal to or greater than t_max−1 (NO), E is set to 0 (step S225), t is set to t0 (step S226), and i is set to i0 (step S227).
Next, radius R=min [PR [t], PR [t+1], S (x, y, z) [t, i]=SP [t+1], i, R]−SP [t, i, R] is acquired (step S228) and using spring displacement dS (x, y, z) [t, i]=S (x, y, z) [t, i]−IS (x, y, z) [t], differential virtual spring energy dE [t, i]=−f*length (dS [t, i])^2 (^2 represents a square) is calculated (f: Virtual spring constant) (step S229).
Next, i is incremented (step S230) and a comparison is made between i and i_max−1 (step S231). If i is smaller than i_max−1 (YES), the process returns to step S228; if i is equal to or greater than i_max−1 (NO), one is added to t (step 5232). A comparison is made between t and t_max−1 (step S233) If t is smaller than t_max−1 (YES), the process returns to step S227; if t is equal to or greater than t_max−1 (NO), a comparison is made between |E−ΣdE| and ε (step S234). If |E−ΣdE| is smaller than ε (YES), it is assumed that the calculation sufficiently converges, and the calculation is completed.
On the other hand, if |E−ΣdE| is equal to or greater than ε (NO), E=ΣdE (step S235), t is set to t0 (step S236), i is set to i0 (step S237), and the spring contact is moved by (a*dS (x, y, z) [t, i] for rotating the plane (a: Displacement amount coefficient per iteration) (step S238)
Next, i is incremented (step S239) and a comparison is made between i and i_max−1 (step S240). If i is smaller than i_max−1 (YES), the process returns to step S238; if i is equal to or greater than i_max−1 (NO), t is incremented (step S241) A comparison is made between t and t_max−1 (step S242). If t is smaller than t_max−1 (YES), the process returns to step S237; if t is equal to or greater than t_max−1 (NO), the process returns to step S226.
Thus, according to the image processing method of the embodiment, the direction of the plane is changed so that the angle between the normal vectors of the adjacent planes lessens or that the virtual spring energy between the adjacent planes lessens. Accordingly, quiver of the virtual rays along the path lessens and effect of the scale on the image along the path can be prevented and in the portion where the path largely bends, duplicate display of the same observation object can also be prevented. Particularly, with an actual tubular tissue, when the tubular tissue largely bends, the tubular tissue becomes flat as when a rubber hose bends. In the embodiment, a larger bend can be allowed in the short radius direction of the flat two-dimensional region, so that more highly flexible bending is made possible.
In the embodiment, to prevent the adjacent cross sections from crossing each other, the cross section is rotated so that the inner product of the direction vector of the central path 11 of the large intestine 12 and the vector connecting the boundaries of the cross sections becomes positive, rather than using the virtual spring model. Accordingly, the direction vector of the central path 11 of the large intestine 12 and the vector connecting the boundaries can be prevented from being in opposite directions, and calculation to obtain a condition that the adjacent cross sections do not cross each other can be simplified.
Also in the embodiment, an image is created according to the initialization phase (step S100), the calculation phase (step S200), and the rendering phase (step S300) shown in
Next, ROI0 is obtained as an area (cross section) in which PL0 and VOI overlap (step S254). Likewise, a plane PLI is defined by a plane reference position P (x, y, z) [t+1] and normal vector D (x, y, z) [t+1] (step S255), and ROI1 is obtained as an area in which PL1 and VOI overlap (step S256). Then, i is set to i0 (step S257), a search is made in SV [t, i] direction from PLO to obtain the cross position S0 (x, y, z) with the ROI0 boundary and SV, and a search is made in SV [t, i] direction from PL1 to obtain the cross position S1 (x, y, z) with the ROI1 boundary (step S258). Where, SV is a direction perpendicular to the central path. Argument i stands for indexed angle (0−i_max) around center path.
Next, direction vector between each cross position is obtained as dS (x, y, z) [t, i]=S1 (x, y, z)−S0 (x, y, z) (step S269). The direction of the direction vector relative to a vector IS(x, y, z) [t] is calculated as G [i]=dS (x, y, z) [t, i]*IS (x, y, z) [t] (* is vector inner product) (step S270), where IS represents direction vector of the central path P(x, y, z) [t]−P(x, y, z) [t+1].
Next, i is incremented (step S271) and a comparison is made between i and i_max−1 (step S272). If i is smaller than i_max−1 (YES), the process returns to step S258; if i is equal to or greater than i_max−1 (NO), whether or not G [i] is all zero or more is determined (step S273). If G [i] is all zero or more (YES), the adjacent cross sections do not cross each other and thus the process goes to step S276.
On the other hand, if G [i] is not all zero or more (NO), the adjacent cross sections cross each other and thus D (x, y, z) [t] is changed so that G [i] becomes all zero or more, This is accomplished by giving two degrees of freedom to each cross section and moving the cross section with the plane reference position P as a fixed point (step S274: See
Next, a comparison is made between t and t_max−1 (step S277). If t is smaller than t_max−1 (YES), the process returns to step S253; if t is equal to or greater than t_max−1 (NO), it is determined if end flag is false (step S278). If end_flag is false (YES), the process returns to step S251; if end_flag is not false (NO), the calculation is completed.
Thus, according to the image processing method of the embodiment, the cross section is rotated so that the inner product of the direction vector of the central path 11 of the large intestine 12 and the vector connecting boundaries of adjacent cross sections becomes positive. Accordingly, the direction vector of the central path 11 of the large intestine 12 and the vector connecting the boundaries can be prevented from being in opposite directions, and the calculation to obtain the condition that the adjacent cross sections do not cross each other can be simplified.
In the image processing method of the embodiments described above, the projection image can also be calculated by surface rendering. The surface rendering is a method of composing surface data using elements having a surface of a polygon, etc., as units and visualizing a three-dimensional object, and is the same as the volume rendering in creating an image using virtual rays. To create surface data from volume data, for example, an appropriate threshold value is set, a volumetric region is extracted, and the region boundary face is obtained. Further, the invention can also be applied to MIP (maximum intensity projection) method, MiNIP (minimum intensity projection) method, Raysum method, and Average method in addition to the ray casting method and can also be applied to ray tracing in addition to the volume rendering.
The calculation processing to generate a projection image can be performed by a GPU (Graphic Processing Unit) The GPU is an arithmetic processing unit specialized for image processing as compared with a general-purpose CPU, and usually is installed in a computer separately from a CPU.
In the image processing method of the embodiments, the volume rendering calculation can be divided in predetermined angle units, image regions, volume regions, etc., and can be later superposed, so that the image processing method can be executed in parallel processing, network distributed processing, a dedicated processor, or a combination thereof.
In the image processing method of the embodiments, the region of the organ to be observed is set to a region where the virtual rays do not cross each other for performing image processing, but the region where the virtual rays do not cross each other may be an expanded region of the region of the organ to be observed. In so doing, the angle between the adjacent planes onto which the virtual rays are projected becomes smaller and the stable result can be provided.
The embodiments of the invention can be also achieved by a computer readable medium in which a program code (an executable program, an intermediate code program, and a source program) according to the above described image processing method is store so that a computer can read it, and by allowing the computer (or a CPU or an MCU) to read out the program (software) stored in the storage medium and to execute it.
The computer readable medium includes, for example, a tape-type medium, such as a magnetic tape or a cassette tape, a disc-type medium including a magnetic disc, such as a floppy (a registered trademark) disc or a hard disc, and an optical disc, such as CD-ROM/MO/MD/DVD/CD-R, a card-type medium, such as an IC card (including a memory card) or an optical card, and a semiconductor memory, such as a mask ROM, an EPROM, an EEPROM, or a flash ROM.
Further, the computer may be constituted such that it can be connected to a communication network, and the program may be supplied thereto through the communication network. The communication network includes, for example, the Internet, the Intranet, an intranet, an extranet, a LAN, an ISDN, a VAN, a CATV communication network, a virtual private network, telephone lines, a mobile communication network, and a satellite communication network. A transmission medium for constituting the communication network includes, for example, wire lines, such as IEEE1394, USB, power lines, cable TV lines, telephone lines, and ADSL lines, infrared rays, such as IrDA or a remote controller, and wireless lines, such as Bluetooth (a registered trademark), 802.11 Wireless, HDR, a mobile communication network, satellite lines, and a terrestrial digital broadcasting network. In addition, the program may be incorporated into carrier waves and then transmitted in the form of computer data signals.
According to the invention, to project a virtual ray from a point along the path, the direction of each plane along which the virtual ray lies is changed so that the planes do not cross each other in the determined region, and thus without increasing the calculation load, duplicate display of the same observation object is not produced even in the portion where the path largely bends, and the lesion part can be grasped precisely.
The direction of the plane is changed so that the angle between the normal vectors of the adjacent planes lessens or that the virtual spring energy between the adjacent planes lessens. Accordingly, quivering of the virtual rays along the path lessens and effect of the scale on the image along the path can be prevented and in the portion where the path largely bends, duplicate display of the same observation object can also be prevented.
It will be apparent to those skilled in the art that various modifications and variations can be made to the described preferred embodiments of the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention cover all modifications and variations of this invention consistent with the scope of the appended claims and their equivalents.
Patent | Priority | Assignee | Title |
10398286, | Mar 22 2013 | FUJIFILM Corporation | Medical image display control apparatus, method, and program |
8059877, | May 14 2003 | Siemens Medical Solutions USA, Inc | Method and apparatus for fast automatic centerline extraction for virtual endoscopy |
8165378, | May 28 2008 | Siemens Healthcare GmbH | Method and apparatus for visualizing tubular anatomical structures, in particular vessel structures, in medical 3D image records |
8564617, | Jan 12 2010 | International Business Machines Corporation | Accelerated volume rendering |
9892506, | May 28 2015 | THE FLORIDA INTERNATIONAL UNIVERSITY BOARD OF TRUSTEES | Systems and methods for shape analysis using landmark-driven quasiconformal mapping |
Patent | Priority | Assignee | Title |
4674046, | Jan 23 1984 | Kabushiki Kaisha Toshiba | Method and apparatus for obtaining three dimensional tomographic images by interpolation of a plurality of projection slice data bind for obtaining projection data for a chosen slice |
4920573, | May 09 1988 | General Electric Company | Method for generating perpendicular synthesized cross-sectional images |
5226113, | Oct 30 1989 | General Electric Company | Method and apparatus for volumetric projection rendering using reverse ray casting |
5699799, | Mar 26 1996 | Siemens Medical Solutions USA, Inc | Automatic determination of the curved axis of a 3-D tube-shaped object in image volume |
5891030, | Jan 24 1997 | Mayo Foundation for Medical Education and Research | System for two dimensional and three dimensional imaging of tubular structures in the human body |
5920319, | Oct 27 1994 | WAKE FOREST UNIVERSITY HEALTH SCIENCES | Automatic analysis in virtual endoscopy |
6201543, | Dec 17 1997 | Siemens Medical Solutions USA, Inc | Framework for segmentation of cylindrical structures using two dimensional hybrid models |
6212420, | Mar 13 1998 | University of Iowa Research Foundation | Curved cross-section based system and method for gastrointestinal tract unraveling |
6331116, | Sep 16 1996 | Research Foundation of State University of New York, The | System and method for performing a three-dimensional virtual segmentation and examination |
6343936, | Sep 16 1996 | The Research Foundation of State University of New York | System and method for performing a three-dimensional virtual examination, navigation and visualization |
6643533, | Nov 28 2000 | GE Medical Systems Global Technology Company, LLC | Method and apparatus for displaying images of tubular structures |
6674430, | Jul 16 1998 | RESEARCH FOUNDATION OF STATE UNIVERSITY OF NY, THE | Apparatus and method for real-time volume processing and universal 3D rendering |
6753878, | Mar 08 1999 | HTC Corporation | Parallel pipelined merge engines |
6842638, | Nov 13 2001 | Koninklijke Philips Electronics N V | Angiography method and apparatus |
20010055016, | |||
20020118869, | |||
20020136440, | |||
20030223627, | |||
20040064029, | |||
20060098007, | |||
20070003131, | |||
20070274579, |
Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
Nov 16 2006 | MATSUMOTO, KAZUHIKO | ZIOSOFT, INC | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 018540 | /0657 | |
Nov 21 2006 | Ziosoft, Inc. | (assignment on the face of the patent) | / |
Date | Maintenance Fee Events |
Jun 09 2011 | ASPN: Payor Number Assigned. |
Apr 02 2014 | M1551: Payment of Maintenance Fee, 4th Year, Large Entity. |
Apr 19 2018 | M1552: Payment of Maintenance Fee, 8th Year, Large Entity. |
Apr 20 2022 | M1553: Payment of Maintenance Fee, 12th Year, Large Entity. |
Date | Maintenance Schedule |
Nov 02 2013 | 4 years fee payment window open |
May 02 2014 | 6 months grace period start (w surcharge) |
Nov 02 2014 | patent expiry (for year 4) |
Nov 02 2016 | 2 years to revive unintentionally abandoned end. (for year 4) |
Nov 02 2017 | 8 years fee payment window open |
May 02 2018 | 6 months grace period start (w surcharge) |
Nov 02 2018 | patent expiry (for year 8) |
Nov 02 2020 | 2 years to revive unintentionally abandoned end. (for year 8) |
Nov 02 2021 | 12 years fee payment window open |
May 02 2022 | 6 months grace period start (w surcharge) |
Nov 02 2022 | patent expiry (for year 12) |
Nov 02 2024 | 2 years to revive unintentionally abandoned end. (for year 12) |