US7590272B2 - Colon characteristic path registration - Google Patents
Colon characteristic path registration Download PDFInfo
- Publication number
- US7590272B2 US7590272B2 US11/287,161 US28716105A US7590272B2 US 7590272 B2 US7590272 B2 US 7590272B2 US 28716105 A US28716105 A US 28716105A US 7590272 B2 US7590272 B2 US 7590272B2
- Authority
- US
- United States
- Prior art keywords
- paths
- path
- function
- correspondence
- energy function
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active, expires
Links
- 210000001072 colon Anatomy 0.000 title description 18
- 238000000034 method Methods 0.000 claims abstract description 56
- 230000006870 function Effects 0.000 claims description 81
- 230000015654 memory Effects 0.000 claims description 11
- 238000009499 grossing Methods 0.000 claims description 5
- 238000000638 solvent extraction Methods 0.000 claims description 5
- 230000002440 hepatic effect Effects 0.000 claims description 2
- 210000003384 transverse colon Anatomy 0.000 claims description 2
- 238000005192 partition Methods 0.000 description 10
- 238000012545 processing Methods 0.000 description 10
- 208000037062 Polyps Diseases 0.000 description 7
- 238000013459 approach Methods 0.000 description 7
- 239000000463 material Substances 0.000 description 7
- 230000008569 process Effects 0.000 description 6
- 230000008859 change Effects 0.000 description 5
- 238000002609 virtual colonoscopy Methods 0.000 description 5
- 230000015572 biosynthetic process Effects 0.000 description 3
- 230000003247 decreasing effect Effects 0.000 description 3
- 230000000877 morphologic effect Effects 0.000 description 3
- 230000037361 pathway Effects 0.000 description 3
- 230000011218 segmentation Effects 0.000 description 3
- 206010009944 Colon cancer Diseases 0.000 description 2
- 206010056626 Pseudopolyp Diseases 0.000 description 2
- 230000006399 behavior Effects 0.000 description 2
- 208000029742 colonic neoplasm Diseases 0.000 description 2
- 238000002052 colonoscopy Methods 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 238000002059 diagnostic imaging Methods 0.000 description 2
- 238000013507 mapping Methods 0.000 description 2
- 210000000664 rectum Anatomy 0.000 description 2
- 230000009466 transformation Effects 0.000 description 2
- 206010028980 Neoplasm Diseases 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 210000003484 anatomy Anatomy 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 201000011510 cancer Diseases 0.000 description 1
- 210000004534 cecum Anatomy 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000003384 imaging method Methods 0.000 description 1
- 238000002595 magnetic resonance imaging Methods 0.000 description 1
- 238000007620 mathematical function Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000012806 monitoring device Methods 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 210000000056 organ Anatomy 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 239000002243 precursor Substances 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
- 230000004083 survival effect Effects 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Classifications
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B5/00—Measuring for diagnostic purposes; Identification of persons
- A61B5/42—Detecting, measuring or recording for evaluating the gastrointestinal, the endocrine or the exocrine systems
- A61B5/4222—Evaluating particular parts, e.g. particular organs
- A61B5/4255—Intestines, colon or appendix
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B5/00—Measuring for diagnostic purposes; Identification of persons
- A61B5/41—Detecting, measuring or recording for evaluating the immune or lymphatic systems
- A61B5/414—Evaluating particular organs or parts of the immune or lymphatic systems
- A61B5/415—Evaluating particular organs or parts of the immune or lymphatic systems the glands, e.g. tonsils, adenoids or thymus
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B5/00—Measuring for diagnostic purposes; Identification of persons
- A61B5/41—Detecting, measuring or recording for evaluating the immune or lymphatic systems
- A61B5/414—Evaluating particular organs or parts of the immune or lymphatic systems
- A61B5/416—Evaluating particular organs or parts of the immune or lymphatic systems the spleen
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/30—Determination of transform parameters for the alignment of images, i.e. image registration
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B5/00—Measuring for diagnostic purposes; Identification of persons
- A61B5/05—Detecting, measuring or recording for diagnosis by means of electric currents or magnetic fields; Measuring using microwaves or radio waves
- A61B5/055—Detecting, measuring or recording for diagnosis by means of electric currents or magnetic fields; Measuring using microwaves or radio waves involving electronic [EMR] or nuclear [NMR] magnetic resonance, e.g. magnetic resonance imaging
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B6/00—Apparatus or devices for radiation diagnosis; Apparatus or devices for radiation diagnosis combined with radiation therapy equipment
- A61B6/02—Arrangements for diagnosis sequentially in different planes; Stereoscopic radiation diagnosis
- A61B6/03—Computed tomography [CT]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/30—Subject of image; Context of image processing
- G06T2207/30004—Biomedical image processing
- G06T2207/30028—Colon; Small intestine
Definitions
- This document relates generally to volumetric imaging of biological or like objects, and particularly, but not by way of limitation to systems and methods to accurately register multiple paths through a three-dimensional virtual object.
- a “virtual endoscopy” is performed with a “flythrough” of a computer generated three-dimensional image of an anatomical structure.
- CT computed tomographic
- Three-dimensional modeling has been used in a variety of clinical applications including virtual colonoscopies, virtual bronchoscopies, and virtual angioscopies.
- a user can move a viewpoint through the reconstructed volumetric object, stopping at certain points to further analyze a suspicious formation on the inner wall of the anatomical model.
- Virtual colonoscopies have been shown to be effective at detecting small polyps. However, when only one scan is used, extraneous material may be present and cause interference.
- Extraneous material such as stool and water can cause both false positives and false negatives. Because the texture and color of a 3D colon model are not represented, the presence of extraneous material makes identification of a polyp-shaped formation more difficult. These types of extraneous materials can obscure a true polyp, causing a false negative. Alternatively, the extraneous material could be mistaken for a polyp, in which case a practitioner may identify a pseudo-polyp and declare a false positive. Using two scans, for example a prone and supine scan, can avoid these problems.
- a practitioner can use both scans to detect and differentiate between a true polyp and a pseudo-polyp. The practitioner may also be able to detect polyps that were previously obscured by material in one scan.
- a practitioner may choose to change views from one scan to the other to further analyze a portion of the interior of the virtual colon. After the view change, for the sake of efficiency, it would be ideal to place the practitioner's viewpoint at the same position in the colon.
- the difference in shape and size of the colon between the prone and supine scans can be relatively large. This makes it difficult to manually determine the corresponding position between the scans.
- registration is a method of determining a set of corresponding points between two or more scans.
- One method of registration is manual registration performed by the practitioner.
- the practitioner views the scans together and attempts to pick out characteristic anatomical landmarks to create a baseline correspondence.
- the baseline correspondence After this initial orientation, when a practitioner finds a suspicious formation, he can then orient himself in a corresponding scan using the baseline correspondence and page through adjacent images until he is near the same location. This method is tedious, inaccurate, and costly.
- Automated registration of prone and supine colon scans is desirable.
- One approach would be to first determine similar features in the prone and supine data set.
- a feature is a local maximum or minimum value in any of the coordinate axes.
- This approach would use relatively stationary points along the medial axis path of the colon for both data sets as reference points. It then matches these points by stretching and/or shrinking of either the supine or prone path.
- this approach relies on the fact that the hepatic and splenic flexures are relatively fixed in location. Therefore, the data points that represent these flexures present features that can be used as reference points in the registration. After correlating the reference points between the supine and prone paths, a linear transformation is used to approximate the points on the paths.
- Another approach uses geometrical or morphological information to register multiple paths.
- geometric information such as radius, circumference, or surface curvature related to the shape of the scanned object are used as factors when measuring the relative correspondence between paths.
- a function that uses an average radius about a centerline point is used with dynamic programming to correlate paths.
- the process must consider volumetric data. In general, processing volumetric data is highly computational. By not requiring the use of volumetric data, the present method achieves higher computational efficiency.
- a first and second path are received as input.
- Each path of discrete points is transformed into a piecewise linear parameterization as a function of path length.
- the paths are smoothed and normalized.
- the shorter path is partitioned into a number of discrete subintervals. As an initial configuration, the shorter path is mapped directly to a portion of the longer path.
- a cost function is defined, where the cost function contains an error term and a spring term.
- the error term is a function of a position difference and a slope difference in the x, y, and z planes between corresponding subintervals.
- the spring term is a function of the ration of lengths between the corresponding subintervals.
- the subintervals of the shorter path are mapped to corresponding warped intervals along the longer path using a minimization function that minimizes the cost function resulting in a locally optimal registration.
- the shorter path is incrementally positioned along the longer path and the minimization is attempted at each position. When the shorter path cannot be shifted any farther, the globally optimal registration is returned.
- FIG. 1 is a schematic view of a medical scanner, an image storage device, and one or more image processing stations.
- FIG. 2 is a schematic view of an exemplary image processing station.
- FIG. 3 is a detailed view of a display screen.
- FIG. 4 is a schematic view of a system used to register multiple characteristic paths.
- FIG. 5 is a flowchart illustrating generally the process of determining the registration between two characteristic paths.
- FIG. 6 is a schematic view of several exemplary paths represented by endpoints.
- FIG. 7 is a schematic view of several exemplary paths represented by endpoints and lengths.
- FIG. 8 is a graph of a fixed path and a warped path in an initial position.
- FIG. 9 is a graph of a fixed path and a reduced warped path in a sub-optimal position.
- FIG. 10 is a graph of a fixed path and a stretched warped path in a sub-optimal position.
- FIG. 11 is a graph of a fixed path and a reduced warped path in an optimal position.
- a path examples include, without limitation, centerline paths or characteristic paths.
- a characteristic path may not provide complete centricity of the object and, therefore, does not necessarily constitute a centerline. Nevertheless, a characteristic path will typically be sufficiently representative of the object to permit registering a prone scan of the object to a supine scan of the object.
- FIG. 1 illustrates an example of a system that may use this characteristic path data.
- a patient 100 is scanned by a typical medical imaging scanner 102 .
- a medical imaging scanner 102 include, without limitation, a CT scanner and a magnetic resonance imaging (MRI) scanner.
- the scanner 102 is typically connected to a storage system 106 , such as by a data pathway 104 .
- the data pathway 104 is typically a local area network (LAN) and the storage system 106 is typically an image server.
- the storage system 106 is connected to one or more image processing stations 110 A, 110 B, 110 C, . . . , 110 N, by a second data pathway 108 , which is typically a LAN.
- LAN local area network
- FIG. 2 illustrates a typical image processing station 110 .
- the image processing station 110 includes one or more input devices 410 , such as a mouse 200 and a keyboard 202 , one or more output devices 412 , such as a display 204 and a printer 206 , and a control unit 208 , which may include a processor, a local memory, and additional hardware to control communication between internal and external devices.
- the image processing station computes a segmentation using the images stored at the storage system 106 .
- the segmentation separates the data representing an object of interest (e.g., a colon) from other nearby objects represented in the data, such as by using image intensity or other information to make such distinctions.
- an object of interest e.g., a colon
- a user can use an image processing station 110 to perform a method that includes generating a characteristic path using the segmentation.
- Multiple characteristic paths can be generated, such as a characteristic path of a colon for a prone patient, and a characteristic path of a colon for a supine patient. Automatic registration between multiple characteristic paths is described below.
- FIG. 3 illustrates a monitor 204 displaying two virtual 3D objects concurrently.
- each 3D virtual object is a representation of a different scan, such as a supine scan and a prone scan.
- a supine scan and a prone scan For example, in a virtual colonoscopy, it is often desirable to take prone and supine scans of the colon, since residual stool content may shift between prone and supine scans making one or the other of the scans more desirable to the diagnostician. However, registering the prone and supine scans is helpful in order to translate between the same location in the prone scan to the same location in the supine scan.
- the diagnostician may desire to switch between prone and supine scans, such as during virtual flythrough of a colon.
- the other view 302 e.g., supine
- the point of view through the object's virtual interior in one view 300 e.g., prone
- the other view 302 e.g., supine
- FIG. 4 illustrates portions of a system 110 that is capable of efficient registration of multiple paths independent of features.
- a processor 400 is connected to interact with a memory 402 .
- processors 400 may include commercial units (e.g. Pentium, Motorola 68000 series, PowerPC) or specialized units made for use in specific applications.
- the memory 402 can include any memory, such as solid-state, magnetic, or optical media.
- a user-interface 408 is typically connected to the processor-memory combination 406 .
- This user-interface 408 typically includes an input device 410 an output device 412 .
- the input device 410 can be one or more of a keyboard, a mouse, a touchpad, a microphone, a sensing device, a monitoring device, or any other type of device that allows a computer to receive commands and input data from a user.
- the output device 412 can include such things as a monitor, a printer, a speaker, or any other type of device that allows a system to represent resultant data to the user.
- a user can input a command with an input device 410 that includes two characteristic paths, typically indicative of a prone scan and a supine scan, respectively.
- the paths are then used by the processor-memory combination 406 to determine a mapping (i.e., registration) between like points on the multiple paths.
- the paths are parameterized, smoothed, and partitioned by the Path Preparation module 414 .
- the input parameters for the error minimization function are configured in the Prep Input module 416 .
- the Registration module 418 determines an optimal solution by minimizing a cost (e.g., energy) function. Then, in one example, the results are displayed on the output device 412 for the user.
- a cost e.g., energy
- FIG. 5 is a flowchart illustrating an example of a method 500 for registering two characteristic paths.
- the first step is to read the input.
- the input will include two characteristic paths, representing a prone and supine path. Each path is described by a sequence of points in 3D space defining a piece-wise linear space curve.
- C an (C b0 , C b1 , . . . , C bm ) (e.g., prone and supine characteristic paths) with ⁇ C a ⁇ C b ⁇ (where ⁇ C ⁇ is the length of C), since one path can be shorter or longer than the other due to stretching or shrinking of a colon as the patient changes from prone to supine position or vice-versa.
- the system 110 is initialized to recognize the paths as representing colon scans, and the only input is the paths.
- additional or other parameters may be available to control the operation of the method.
- the paths are not smoothed and are generally aligned with each other (e.g., both paths represent the rectum and cecum in the same orientation). If the paths are not generally aligned, then a pre-processing routine can be used to orient the paths to each other.
- C a ⁇ tilde over ( ⁇ ) ⁇ C b the domain of C a is approximately a subset of the domain of C b ).
- significant portions of C a may not map onto C b , in which case, techniques that truncate either the head or tail of C a in an attempt to get a best fit at either the head or the tail of C b may be used.
- the sequence of characteristic path points are parameterized.
- each characteristic path is defined by a set of points in 3D space.
- Parameterization is the process to convert this discrete representation to a representative mathematical function.
- the function c(t) (the piecewise linear parameterization of C as a function of characteristic path length) can be defined as the points
- the noise is filtered out and the parameterized signal is smoothed.
- smoothed paths are preferred in this example to produce more meaningful slope values, which are used as a factor when determining correspondence during the registration.
- Applying the smoothing function results in the smoothed signals ⁇ tilde over (c) ⁇ a (t) and ⁇ tilde over (c) ⁇ b (t).
- the paths are normalized.
- the shorter of the two paths, C a is scaled to a unit measure and defined over the interval [0,1] such that
- c _ a ⁇ ( t ) c a ⁇ ( t ⁇ ⁇ C a ⁇ ) ⁇ C a ⁇ .
- the longer path, C b is scaled and defined over the interval
- c _ b ⁇ ( t ) c b ⁇ ( t ⁇ ⁇ C a ⁇ ) ⁇ C a ⁇ . Then, because it is possible for the signals to be slightly offset in position at their start and/or end, the domain of c b is extended to be the entire real line by defining
- c a (t) and c b (t) are smoothed, normalized representations of the paths C a and C b .
- c a (t) will hereafter represent the smoothed
- normalized signal c a (t) and c b (t) will hereafter represent the smoothed signal c b (t). Partitioning the Paths
- the shorter path is partitioned into a number of samples, which will be individually compared to portions of the longer path in an attempt to find a correspondence.
- an arbitrary number of fifteen discrete subintervals of equal size is used.
- Other examples may use more or fewer subintervals to provide for a registration.
- Still other examples may use individual x, y, and z relative maxima and minima along the paths to define the partition.
- points of maximum and/or minimum curvature along the centerline are used to choose the endpoints of the initial partition.
- One advantage of using equally sized subintervals is that registration can be performed independent of specific path behaviors or features.
- ⁇ is the ratio of the length of the warped sub-interval to the original sub-interval.
- any change to a value of t′ i should not affect the length of any segment that occurs later in the sequence.
- FIG. 6 is an illustration of an initial set of endpoints that define a portion of a path 600 , a second set of endpoints 610 , where the value t 2 has been reduced from its initial value, and a third set of endpoints 620 , where the value t 2 has been increased from its initial value.
- 610 by decreasing t 2 , the interval [t 1 ,t 2 ] has been properly reduced, however, the interval [t 2 ,t 3 ] has been improperly increased as a result.
- the interval [t 1 ,t 2 ] has been properly increased, however, the interval [t 2 ,t 3 ] has been improperly decreased.
- FIG. 7 is an illustration of a set of endpoints that define a portion of a path 700 , the same portion of the path composed of a corresponding initial set of length values 710 , an adjusted path 720 , where the value l′ 2 has been reduced from its initial value, and another adjusted path 730 , where the value of l′ 2 has been increased from its initial value.
- the initial solution for the error minimization function is configured.
- an optimal correspondence between the fixed partition P and the warped partition P′ is found.
- the correspondence is measured using an energy function, E, which represents the cost associated with any error in a proposed correspondence between two subintervals.
- the energy function has two parts: an error term, e, and a spring term, s, and is computed over all subintervals across the two paths.
- the energy function of the 0 th location does not include the spring term, s( ⁇ j ).
- the spring term characterizes a penalty for any stretching or shrinking of the path and generally helps ensure that the path is well-formed.
- the term (1 ⁇ t j ⁇ 1 ) scales the spring term to the same magnitude as the sum of the error terms.
- the spring term is defined as a function of ⁇ , the ratio of the length of the warped sub-interval to the original sub-interval.
- s ⁇ ( ⁇ ) ⁇ ⁇ 3 ⁇ [ csc ⁇ ( max ⁇ ( ⁇ , ⁇ 2 ) ) - 1 ] ⁇ ⁇ 1 ⁇ 3 ⁇ [ csc ⁇ ( max ⁇ ( ⁇ , ⁇ 2 ⁇ ⁇ ) ) - 1 ] ⁇ ⁇ 1
- the error term, e is composed of two primary components: the difference in x, y, and z positions and the difference in the x, y, and z slopes of each corresponding subinterval.
- the error term, e i is thus defined as:
- e i ⁇ 1 ⁇ ( ⁇ ix + ⁇ iy + ⁇ iz ) + t 1 ⁇ max ⁇ ( 0 , - t 0 ′ ) + ( 1 - t k - 1 ) ⁇ max ⁇ ( 0 , t k ′ - ⁇ c b ⁇ ⁇ c a ⁇ ) + ⁇ 2 ⁇ ( ⁇ ix ′ + ⁇ iy ′ + ⁇ iz ′ )
- the first term in the error represents the position difference between the values of the two path components. It is computed by integrating the difference between c a (t) and c b (w(t)) (c b after the warping) within each subinterval of the partitions with respect to each component:
- ⁇ ix ⁇ t i - 1 t i ⁇ ⁇ c a ⁇ ( t ) x - c b ⁇ ( w ⁇ ( t ) ) x ⁇ ⁇ d t ( ⁇ iy and ⁇ iz are similar)
- the warping function, w(t), defines a piecewise linear transformation between c a (t) and c b (t).
- the last term measures the differences between the shapes of the two path components by comparing their derivatives after the warp. It is computed by integrating the difference between d/dt(C a (t)) and d/dt(C b (w(t))) (derivative of c b after the warping) within each subinterval of the paths with respect to each component:
- the terms in the energy function are weighted using the variables ⁇ 1 , ⁇ 2 , and ⁇ 3 .
- different weights may be necessary to obtain the best results.
- FIG. 8 illustrates an initial alignment of a subinterval of a fixed path 800 and a warped path 802 over the interval [t′ i ⁇ 1 ,t′ i ] with length l′ i .
- the Levenberg-Marquardt technique attempts various solutions that shrink the warped path 900 , as illustrated in FIG. 9 , and stretch the warped path 1000 , as illustrated in FIG. 10 , in an effort to find an optimal solution.
- the shrunken warped path 900 is dramatically misaligned with the fixed path 800 . In this example, this is not an optimal solution.
- the stretched warped path 1000 is similarly misaligned with the fixed path 800 and does not provide an optimal solution.
- FIG. 11 illustrates a possible optimal solution, where the warped path 1100 is appropriately aligned with the fixed path 800 .
- the Levenberg-Marquardt technique attempts to optimize every subinterval concurrently as generally illustrated in FIGS. 8-11 .
- the current set of optimal error values is compared to any previously stored set of error values. If it is determined that the current set is more optimal, then it is stored and any previous results are discarded.
- the best overall solution is the most likely match.
- the minimization function is run again with a shifted start value t′ 0 .
- the shifting can be done using the length of the shorter path as a factor, using the length of the longer path as a factor, using an arbitrary value or percentage, or by other methods.
- c a is shifted along c b a distance of 1 ⁇ 4the length of c a by setting
- t 0 ′ t 0 ′ + ⁇ c a ⁇ 4 . If c a cannot be shifted without extending past the end of c b , then the set of values corresponding to the lowest error is returned as the best registration. Otherwise, the correspondence measurement 507 is performed again with the new start value t′ 0 . If the newly computed error values are better than those stored, then they will replace the stored values. To find the best solution, shifting and recalculation is performed as long as c a can be shifted along c b .
- the optimal match is returned from the method.
- a start point t′ 0 and a sequence of length values (l′ 1 , l′ 2 , . . . , l′ k ) are returned representing the best match, or registration, between c a and c b .
Landscapes
- Health & Medical Sciences (AREA)
- Life Sciences & Earth Sciences (AREA)
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Health & Medical Sciences (AREA)
- Molecular Biology (AREA)
- Veterinary Medicine (AREA)
- Public Health (AREA)
- Animal Behavior & Ethology (AREA)
- Surgery (AREA)
- Biophysics (AREA)
- Pathology (AREA)
- Biomedical Technology (AREA)
- Heart & Thoracic Surgery (AREA)
- Medical Informatics (AREA)
- Vascular Medicine (AREA)
- Immunology (AREA)
- Endocrinology (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Gastroenterology & Hepatology (AREA)
- Physiology (AREA)
- Apparatus For Radiation Diagnosis (AREA)
- Image Processing (AREA)
- Image Analysis (AREA)
- Measuring And Recording Apparatus For Diagnosis (AREA)
Abstract
Description
and linearly interpolating at all values in between. Applying this to the input sequences Ca and Cb results in the parameterized signals ca(t) and Cb (t).
Smoothing the Paths
The longer path, Cb, is scaled and defined over the interval
such that
Then, because it is possible for the signals to be slightly offset in position at their start and/or end, the domain of
At this point in the process,
Partitioning the Paths
and
Here,
representing the ratio of the length of the warped sub-interval to that of the original sub-interval. The energy function of the 0th location does not include the spring term, s(φj). The spring term characterizes a penalty for any stretching or shrinking of the path and generally helps ensure that the path is well-formed. In the energy function, the term (1−tj−1) scales the spring term to the same magnitude as the sum of the error terms.
Also, the function is reciprocally symmetric such that
In other words, the spring energy resulting from shrinking an interval by a factor of 1/φ is equivalent to the spring energy resulting from stretching an interval by a factor of φ.
(Δiy and Δiz are similar)
are penalty terms for attempted matches that “run off” either end.
(Δ′iy and Δ′iz are similar)
the best overall solution is the most likely match. At 509, if possible, the minimization function is run again with a shifted start value t′0. The shifting can be done using the length of the shorter path as a factor, using the length of the longer path as a factor, using an arbitrary value or percentage, or by other methods. In this example, ca is shifted along cb a distance of ¼the length of ca by setting
If ca cannot be shifted without extending past the end of cb, then the set of values corresponding to the lowest error is returned as the best registration. Otherwise, the
Claims (38)
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/287,161 US7590272B2 (en) | 2005-11-23 | 2005-11-23 | Colon characteristic path registration |
DE102006054822A DE102006054822A1 (en) | 2005-11-23 | 2006-11-21 | Virtual biological object`s e.g. colon, characteristics paths e.g. prone position, regulating method for e.g. angioscopy, involves measuring correlation between object paths by minimizing energy function that includes error and switch terms |
JP2006314315A JP5497977B2 (en) | 2005-11-23 | 2006-11-21 | Alignment of colonic feature pathways |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/287,161 US7590272B2 (en) | 2005-11-23 | 2005-11-23 | Colon characteristic path registration |
Publications (2)
Publication Number | Publication Date |
---|---|
US20070122016A1 US20070122016A1 (en) | 2007-05-31 |
US7590272B2 true US7590272B2 (en) | 2009-09-15 |
Family
ID=37989750
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/287,161 Active 2028-01-17 US7590272B2 (en) | 2005-11-23 | 2005-11-23 | Colon characteristic path registration |
Country Status (3)
Country | Link |
---|---|
US (1) | US7590272B2 (en) |
JP (1) | JP5497977B2 (en) |
DE (1) | DE102006054822A1 (en) |
Cited By (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060276708A1 (en) * | 2005-06-02 | 2006-12-07 | Peterson Samuel W | Systems and methods for virtual identification of polyps |
US9495604B1 (en) | 2013-01-09 | 2016-11-15 | D.R. Systems, Inc. | Intelligent management of computerized advanced processing |
US9672477B1 (en) | 2006-11-22 | 2017-06-06 | D.R. Systems, Inc. | Exam scheduling with customer configured notifications |
US9684762B2 (en) | 2009-09-28 | 2017-06-20 | D.R. Systems, Inc. | Rules-based approach to rendering medical imaging data |
US9727938B1 (en) | 2004-11-04 | 2017-08-08 | D.R. Systems, Inc. | Systems and methods for retrieval of medical data |
US9734576B2 (en) | 2004-11-04 | 2017-08-15 | D.R. Systems, Inc. | Systems and methods for interleaving series of medical images |
US9836202B1 (en) | 2004-11-04 | 2017-12-05 | D.R. Systems, Inc. | Systems and methods for viewing medical images |
US10540763B2 (en) | 2004-11-04 | 2020-01-21 | Merge Healthcare Solutions Inc. | Systems and methods for matching, naming, and displaying medical images |
US10579903B1 (en) | 2011-08-11 | 2020-03-03 | Merge Healthcare Solutions Inc. | Dynamic montage reconstruction |
US10592688B2 (en) | 2008-11-19 | 2020-03-17 | Merge Healthcare Solutions Inc. | System and method of providing dynamic and customizable medical examination forms |
US10614615B2 (en) | 2004-11-04 | 2020-04-07 | Merge Healthcare Solutions Inc. | Systems and methods for viewing medical 3D imaging volumes |
US10909168B2 (en) | 2015-04-30 | 2021-02-02 | Merge Healthcare Solutions Inc. | Database systems and interactive user interfaces for dynamic interaction with, and review of, digital medical image data |
Families Citing this family (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2007023450A2 (en) * | 2005-08-24 | 2007-03-01 | Koninklijke Philips Electronics N.V. | Apparatus and method for identifying sections of an anatomical object |
WO2007023423A2 (en) * | 2005-08-24 | 2007-03-01 | Koninklijke Philips Electronics N.V. | Apparatus and method for labeling anatomical image data |
US8749543B2 (en) * | 2006-08-15 | 2014-06-10 | Microsoft Corporation | Three dimensional polygon mesh deformation using subspace energy projection |
US8160395B2 (en) * | 2006-11-22 | 2012-04-17 | General Electric Company | Method and apparatus for synchronizing corresponding landmarks among a plurality of images |
DE102007046452A1 (en) * | 2007-09-28 | 2009-04-23 | Siemens Ag | Tissue characteristic e.g. tumor/object's position classification method for e.g. large intestine of patient, involves dividing organ into sections based on characteristics of line, and assigning tissue characteristic and object to sections |
DE102008025678A1 (en) * | 2008-05-29 | 2009-12-10 | Siemens Aktiengesellschaft | Method for automatic combination of image data of large intestine of patient, involves continuing change of navigation till to point, at which form lines are not identified and/or passive tracing is not implemented, and processing data |
DE102008049467B4 (en) * | 2008-09-29 | 2016-12-29 | Siemens Healthcare Gmbh | Method and device for registration of tomographic volume data sets of the intestine |
JP5554028B2 (en) * | 2009-07-28 | 2014-07-23 | 株式会社東芝 | Medical image processing apparatus, medical image processing program, and X-ray CT apparatus |
JP5443238B2 (en) * | 2010-03-30 | 2014-03-19 | 富士フイルム株式会社 | Virtual endoscopic image processing apparatus, method, and program |
US8655036B2 (en) * | 2011-02-14 | 2014-02-18 | Siemens Medical Solutions Usa, Inc. | Presentation of locations in medical diagnosis |
US8948487B2 (en) * | 2011-09-28 | 2015-02-03 | Siemens Aktiengesellschaft | Non-rigid 2D/3D registration of coronary artery models with live fluoroscopy images |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7194117B2 (en) * | 1999-06-29 | 2007-03-20 | The Research Foundation Of State University Of New York | System and method for performing a three-dimensional virtual examination of objects, such as internal organs |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5891030A (en) * | 1997-01-24 | 1999-04-06 | Mayo Foundation For Medical Education And Research | System for two dimensional and three dimensional imaging of tubular structures in the human body |
US6996205B2 (en) * | 2003-06-24 | 2006-02-07 | Ge Medical Ssytems Global Technology Company, Llc | Methods and apparatus to facilitate review of CT colonography exams |
US7300398B2 (en) * | 2003-08-14 | 2007-11-27 | Siemens Medical Solutions Usa, Inc. | Method and apparatus for registration of virtual endoscopic images |
-
2005
- 2005-11-23 US US11/287,161 patent/US7590272B2/en active Active
-
2006
- 2006-11-21 JP JP2006314315A patent/JP5497977B2/en active Active
- 2006-11-21 DE DE102006054822A patent/DE102006054822A1/en not_active Withdrawn
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7194117B2 (en) * | 1999-06-29 | 2007-03-20 | The Research Foundation Of State University Of New York | System and method for performing a three-dimensional virtual examination of objects, such as internal organs |
Non-Patent Citations (3)
Title |
---|
Acar, B., et al., "Medial axis registration of supine and prone CT colonography data", Proceedings of the 23rd Annual International Conference of the IEEE, Engineering in Medicine and Biology Society, vol. 3, (2001), 2433-2436. |
Nain, D., et al., "Intra-patient Prone to Supine Colon Registration for Synchronized Virtual Colonoscopy", Proceedings of the 5th International Conference on Medical Image Computing and Computer-Assisted Intervention-Part II, (2002), 573-580. |
Sethian, J. A., Level Set Methods and Fast Marching Methods, Evolving Interfaces in Computional Geometry, Fluid Mechanics, Computer Vision, and Materials Science, 2nd Edition, (Series: Cambridge University's Monographs on Applied and Computational Mathematics (No. 3)), (1999), 202 pgs. |
Cited By (26)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10437444B2 (en) | 2004-11-04 | 2019-10-08 | Merge Healthcare Soltuions Inc. | Systems and methods for viewing medical images |
US10096111B2 (en) | 2004-11-04 | 2018-10-09 | D.R. Systems, Inc. | Systems and methods for interleaving series of medical images |
US10540763B2 (en) | 2004-11-04 | 2020-01-21 | Merge Healthcare Solutions Inc. | Systems and methods for matching, naming, and displaying medical images |
US10614615B2 (en) | 2004-11-04 | 2020-04-07 | Merge Healthcare Solutions Inc. | Systems and methods for viewing medical 3D imaging volumes |
US10790057B2 (en) | 2004-11-04 | 2020-09-29 | Merge Healthcare Solutions Inc. | Systems and methods for retrieval of medical data |
US9727938B1 (en) | 2004-11-04 | 2017-08-08 | D.R. Systems, Inc. | Systems and methods for retrieval of medical data |
US9734576B2 (en) | 2004-11-04 | 2017-08-15 | D.R. Systems, Inc. | Systems and methods for interleaving series of medical images |
US11177035B2 (en) | 2004-11-04 | 2021-11-16 | International Business Machines Corporation | Systems and methods for matching, naming, and displaying medical images |
US9836202B1 (en) | 2004-11-04 | 2017-12-05 | D.R. Systems, Inc. | Systems and methods for viewing medical images |
US8249687B2 (en) | 2005-06-02 | 2012-08-21 | Vital Images, Inc. | Systems and methods for virtual identification of polyps |
US20060276708A1 (en) * | 2005-06-02 | 2006-12-07 | Peterson Samuel W | Systems and methods for virtual identification of polyps |
US9754074B1 (en) | 2006-11-22 | 2017-09-05 | D.R. Systems, Inc. | Smart placement rules |
US9672477B1 (en) | 2006-11-22 | 2017-06-06 | D.R. Systems, Inc. | Exam scheduling with customer configured notifications |
US10896745B2 (en) | 2006-11-22 | 2021-01-19 | Merge Healthcare Solutions Inc. | Smart placement rules |
US10592688B2 (en) | 2008-11-19 | 2020-03-17 | Merge Healthcare Solutions Inc. | System and method of providing dynamic and customizable medical examination forms |
US9934568B2 (en) | 2009-09-28 | 2018-04-03 | D.R. Systems, Inc. | Computer-aided analysis and rendering of medical images using user-defined rules |
US9892341B2 (en) | 2009-09-28 | 2018-02-13 | D.R. Systems, Inc. | Rendering of medical images using user-defined rules |
US9684762B2 (en) | 2009-09-28 | 2017-06-20 | D.R. Systems, Inc. | Rules-based approach to rendering medical imaging data |
US10607341B2 (en) | 2009-09-28 | 2020-03-31 | Merge Healthcare Solutions Inc. | Rules-based processing and presentation of medical images based on image plane |
US10579903B1 (en) | 2011-08-11 | 2020-03-03 | Merge Healthcare Solutions Inc. | Dynamic montage reconstruction |
US9495604B1 (en) | 2013-01-09 | 2016-11-15 | D.R. Systems, Inc. | Intelligent management of computerized advanced processing |
US10672512B2 (en) | 2013-01-09 | 2020-06-02 | Merge Healthcare Solutions Inc. | Intelligent management of computerized advanced processing |
US11094416B2 (en) | 2013-01-09 | 2021-08-17 | International Business Machines Corporation | Intelligent management of computerized advanced processing |
US10665342B2 (en) | 2013-01-09 | 2020-05-26 | Merge Healthcare Solutions Inc. | Intelligent management of computerized advanced processing |
US10909168B2 (en) | 2015-04-30 | 2021-02-02 | Merge Healthcare Solutions Inc. | Database systems and interactive user interfaces for dynamic interaction with, and review of, digital medical image data |
US10929508B2 (en) | 2015-04-30 | 2021-02-23 | Merge Healthcare Solutions Inc. | Database systems and interactive user interfaces for dynamic interaction with, and indications of, digital medical image data |
Also Published As
Publication number | Publication date |
---|---|
DE102006054822A1 (en) | 2007-05-24 |
JP5497977B2 (en) | 2014-05-21 |
US20070122016A1 (en) | 2007-05-31 |
JP2007167629A (en) | 2007-07-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7590272B2 (en) | Colon characteristic path registration | |
US8023708B2 (en) | Method of segmenting anatomic entities in digital medical images | |
US7043064B2 (en) | Method for characterizing shapes in medical images | |
Khalifa et al. | 3D Kidney Segmentation from Abdominal Images Using Spatial‐Appearance Models | |
US7916919B2 (en) | System and method for segmenting chambers of a heart in a three dimensional image | |
Mitchell et al. | Multistage hybrid active appearance model matching: segmentation of left and right ventricles in cardiac MR images | |
Chupin et al. | Anatomically constrained region deformation for the automated segmentation of the hippocampus and the amygdala: Method and validation on controls and patients with Alzheimer’s disease | |
US7015907B2 (en) | Segmentation of 3D medical structures using robust ray propagation | |
US7787683B2 (en) | Tree structure based 2D to 3D registration | |
JP5864542B2 (en) | Image data processing method, system, and program for detecting image abnormality | |
US7529395B2 (en) | Shape index weighted voting for detection of objects | |
US8170642B2 (en) | Method and system for lymph node detection using multiple MR sequences | |
US20130343628A1 (en) | Methods and devices for labeling and/or matching | |
US8139838B2 (en) | System and method for generating MR myocardial perfusion maps without user interaction | |
US20060023927A1 (en) | GGN segmentation in pulmonary images for accuracy and consistency | |
US20230070200A1 (en) | Gabor wavelet-fused multi-scale local level set ultrasonic image segmentation method | |
US20070047789A1 (en) | Method of Constructing Gray Value or Geometric Models of Anatomic Entity in Medical Image | |
JP2005517249A (en) | Correspondence identification of objects that do not use the entire volume | |
JP2013051988A (en) | Device, method and program for image processing | |
Fenster et al. | Sectored snakes: Evaluating learned-energy segmentations | |
US7729739B2 (en) | Heat diffusion based detection of structures of interest in medical images | |
Roth et al. | Registration of the endoluminal surfaces of the colon derived from prone and supine CT colonography | |
US7020316B2 (en) | Vessel-feeding pulmonary nodule detection by volume projection analysis | |
US20080205749A1 (en) | Polyp detection using smoothed shape operators | |
WO2008097630A2 (en) | 3d segmentation of the colon in mr colonography |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: VITAL IMAGES, INC., MINNESOTA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BREJL, MAREK;PETERSON, SAMUEL W.;CAO, ZHUJIANG;REEL/FRAME:017296/0737;SIGNING DATES FROM 20060123 TO 20060203 |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
CC | Certificate of correction | ||
CC | Certificate of correction | ||
FPAY | Fee payment |
Year of fee payment: 4 |
|
FEPP | Fee payment procedure |
Free format text: PAT HOLDER NO LONGER CLAIMS SMALL ENTITY STATUS, ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: STOL); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
SULP | Surcharge for late payment | ||
FPAY | Fee payment |
Year of fee payment: 8 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 12 |
|
AS | Assignment |
Owner name: CANON MEDICAL INFORMATICS, INC., MINNESOTA Free format text: CHANGE OF NAME;ASSIGNOR:VITAL IMAGES, INC.;REEL/FRAME:058316/0073 Effective date: 20210709 |
|
AS | Assignment |
Owner name: CANON MEDICAL SYSTEMS CORPORATION, JAPAN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CANON MEDICAL INFORMATICS, INC.;REEL/FRAME:058330/0287 Effective date: 20211202 |