A technique for automatically generating a virtual model of a branched structure using as an input a plurality of images taken of the branched structure. The technique employs an algorithm that avoids inaccuracies associated with sub-optimal threshold settings by “patching” holes or leaks created due to the inherent inconsistencies with imaging technology. By “patching” the holes, the algorithm may continue to run using a more sensitive threshold value than was previously possible.

Patent
   9595111
Priority
Feb 01 2010
Filed
May 12 2015
Issued
Mar 14 2017
Expiry
Feb 01 2031
Assg.orig
Entity
Large
0
158
currently ok
1. A method for performing a region growing process via a region growing algorithm, the method comprising:
comparing voxels adjacent to a first seed voxel with a predetermined threshold level for air;
identifying the adjacent voxels representing interior cavities or lumens of an anatomical structure, as seed voxels, when each of the adjacent voxels meets the predetermined threshold level;
iterating the identification of seed voxels a plurality of times with the predetermined threshold level;
analyzing each of the plurality of iterations for an increase in a number of voxels;
determining whether the increase in the number of voxels exceeds a predefined rate; and
isolating one or more voxels of the plurality of voxels when it is determined that the increase in the number of voxels exceeds the predefined rate without terminating the region growing process.
11. A method for creating a virtual model of an anatomical structure, the method comprising a region growing algorithm for:
comparing voxels adjacent to a first seed voxel with a predetermined threshold level for air;
identifying the adjacent voxels representing interior cavities or lumens of an anatomical structure, as seed voxels, when each of the adjacent voxels meets the predetermined threshold level;
iterating the identification of seed voxels a plurality of times with the predetermined threshold level;
analyzing each of the plurality of iterations to determine a rate of change in a number of voxels;
determining whether an increase in the number of voxels exceeds at a predefined rate; and
isolating one or more voxels of the plurality of voxels when it is determined that the increase in the number of voxels exceeds the predefined rate without terminating the region growing process.
2. The method of claim 1, wherein each of the plurality of iterations includes segmenting voxels.
3. The method of claim 2, wherein the segmenting of the voxels is commenced at the first seed voxel.
4. The method of claim 3, wherein the first seed voxel is a point in a trachea.
5. The method of claim 4, wherein the first seed voxel in the trachea meets a high threshold value.
6. The method of claim 1, further comprising:
identifying leakage, wherein leakage is identified when it is determined that the increase in the number of voxels exceeds the predefined rate.
7. The method of claim 6, wherein the number of the segmented voxels is counted and analyzed to determine leakage levels.
8. The method of claim 7, wherein the segmented voxels are identified and recorded.
9. The method of claim 8, wherein the segmented voxels from each of the plurality of iterations are used to create a voxel list.
10. The method of claim 9, wherein the voxel list is used to create a virtual model of the anatomical structure.
12. The method of claim 11, further comprising segmenting voxels.
13. The method of claim 12, further comprising commencing the segmenting of the voxels at first seed voxel.
14. The method of claim 13, wherein the first seed voxel is a point in a trachea.
15. The method of claim 14, wherein the first seed voxel in the trachea meets a high threshold value.
16. The method of claim 15, further comprising identifying leakage when it is determined that the increase in the number of voxels exceeds the predefined rate.
17. The method of claim 16, further comprising counting and analyzing the number of the segmented voxels to determine leakage levels.
18. The method of claim 17, further comprising identifying and recording the number of the segmented voxels.
19. The method of claim 18, further comprising creating a voxel list from the segmented voxels.
20. The method of claim 19, further comprising using the voxel list to create the virtual model of the anatomical structure.

This present application is a continuation application of U.S. application Ser. No. 14/492,561 filed Sep. 22, 2014, which is a continuation application of U.S. application Ser. No. 13/867,217 filed Apr. 22, 2013, now U.S. Pat. No. 8,842,898, which is a continuation application of U.S. application Ser. No. 13/019,261 filed Feb. 1, 2011, now U.S. Pat. No. 8,428,328, which claims priority to U.S. Provisional Application Ser. No. 61/300,423 filed Feb. 1, 2010, which are hereby incorporated herein by reference in their entirety.

Navigating the airways of the lungs has always presented challenges to physicians attempting to diagnose and treat lesions transluminally. As such, numerous navigational aids and imaging tools have been developed and/or utilized to provide physicians a “map” of the lungs.

One such tool is a CT scanner. CT scanners use X-ray technology to take multiple scans or “slices” of the lungs. These scans each represent a cross-section of the lungs and can be viewed individually or assembled, via computer programs, to form a three-dimensional CT model. However, CT scans, like most images using X-ray technology, are somewhat cloudy and translucent in nature and difficult to view. As such, computer graphics techniques are employed to interpret the information provided by the CT model and “grow” a virtual model of the airways which mimics what might be seen by a bronchoscope navigating the airways. An example of this process is shown and described in U.S. patent application Ser. No. 11/939,537, entitled Adaptive Navigation Technique For Navigating A Catheter Through A Body Channel Or Cavity, the entirety of which is incorporated by reference herein.

This graphical technique is sometimes referred to as “region growing or 3D map generation,” and presents its own challenges. For example, region growing typically involves a processing of the CT data by analyzing each two-dimensional pixel, or, more pertinently, three-dimensional voxel, for brightness or “density” and assigning the voxel a value that indicates either tissue or air based on whether the density meets a certain threshold value. CT scans are grayscale images composed of a plurality of pixels (2D) or voxels (3D—if the scans have been assembled into a volume), each pixel or voxel varying in intensity from white (most intense) to black (least intense). Each intensity level between white and black appears as a shade of gray. By designating the various shades of gray from the CT scans either “tissue” or “air” the resulting image of the lungs becomes much more clear. However, if the voxels are designated incorrectly, the model of the lungs becomes inaccurate. Incorrect voxel designation results from setting the threshold level at an incorrect value, which is an inherent problem when attempting to assign discreet values (air or tissue) to voxels which are actually various shades of gray.

A presently-used technique for optimal threshold setting is beginning with a conservative threshold and performing a region-growing iteration. A conservative threshold is one that is not likely to result in leakage, which occurs when tissue is designated as air and creates a virtual image of the airways that looks like air (color) is spilling out of the airways. However, even with a conservative threshold, inaccuracies in the CT scans can result in “holes” after the segmentation process. These holes result in false branches.

Moreover, a conservative threshold results in airways that end prematurely. Therefore, after a conservative iteration is performed, resulting in a stunted branched structure, the threshold is incrementally increased and a second iteration is performed. These steps are repeated until leakage occurs. Thus, the maximum threshold that does not result in leakage is determined and used. This approach, however, naturally results in the least-dense portion of the CT image dictating the threshold level. There are other problems that arise from this method as well.

For example, during a full inhalation, the airways stretch and thin in order to accommodate the additional air volume. The thinning of the airways results in reduced tissue imaging density, and leakage thus arises even at lower threshold values.

Another example is that each time the threshold is increased, the algorithm runs from the initial seed point. Hence, if the threshold is increased ten times before leakage arises, each of the voxels analyzed in the initial iteration, is analyzed nine more times. This algorithm is thus inherently taxing on processing resources.

As such, a need is identified for a region-growing algorithm that is able to identify localized weaknesses in image data and “repair” them such that more distal branches of a bronchial tree can be segmented and “grown”.

The present invention provides a technique and algorithm for controlling leakage while using a high threshold during a region growing procedure. Rather than beginning with a conservative (low) threshold, a high threshold is used but growing is analyzed and controlled.

One aspect of the present invention uses an algorithm that defines iteration as a single voxel layer of growth, rather than growth until leakage is detected. Each of the iterations is analyzed for a predicted increase (e.g., parabolic increase) in the number of voxels. If the voxels are not growing according to an expected rate, the unexpected increase is identified as leakage.

Rather than ending the region-growing process when leakage is detected, the point of leakage is isolated or “patched” so that further iterations on the current path do not continue from that point, but the rest of the model is allowed continued growth.

Another aspect of the present invention provides a post-iteration step which, in effect, repairs or salvages branches encountering leakage. After all of the iterations are performed, branches that had leakage are retrieved from a stored location and regrown with a reduced threshold. These branches are then added to the model.

The advantages of the algorithm of the present invention are numerous. One advantage is a more meaningful increase in the number of branches as a result of the utilization of the highest possible threshold.

Another advantage of the present invention is that the appearance of “holes” in the central segmented area of the model is greatly reduced.

Yet another advantage of the present invention is a reduced number of false branches. Because each iteration is analyzed, growth is controlled and false branches are prevented from growing.

Another advantage of the present invention is that the branches grown have an increased length, due to an optimized threshold as well as secondary growing efforts.

Still another advantage of the present invention is reduced importance on initial threshold value selection. Through experimentation, it has been found that this algorithm is self-correcting, yielding virtually identical results regardless of the initial threshold used, so long as the thresholds are relatively high.

FIG. 1 is a flow-chart of a preferred embodiment of an algorithm of the present invention.

The technique 10 of the present invention is charted in the flowchart presented as FIG. 1. The technique 10 begins at 20 by selecting a starting point for the segmentation of the CT data. For example, selecting a point in the trachea is a logical starting point as it is the largest, and most proximal airway, and easily recognizable on a CT scan. Preferably, the starting point is a single voxel inside the trachea that is centered and meets a high threshold value. In other words, a voxel which is clearly air is selected. Any point from which further adjacent voxels are analyzed is hereinafter referred to as a “seed point”. The starting point is the first seed point.

At 30 the propagation process is initiated by designating adjacent voxels around the starting point. This designation is known as segmentation, and it indicates that the new voxels met the threshold level for air. Because the starting point is preferably selected in the trachea, and it is not desired to grow the airway back toward the mouth of the patient, only voxels in a distal direction of the starting point are segmented. As such, a “wave” is generated that travels distally into the airways. It is understood that the branches of the lungs fan out in all directions. As such, “distal direction” as used herein is interpreted as getting further away from the starting point along a path that remains in the airway. In other words, some “distal” points in the airways may be relatively close to the starting point if one were to cut through tissue to make a straight line between the points.

It is understood that the starting point, being a single voxel, is surrounded by 26 adjacent voxels, 17 of which are extending in a direction of desired growth (in a direction not yet segmented and not in a reverse direction, such as toward the mouth).

At 40, it is determined whether any new voxels were segmented. In other words, if no voxels in that “wave” met the threshold level for air, there is no growth and the tree is complete.

If the answer at 40 is “yes”, the algorithm continues to 50, where the segmented voxels are counted and analyzed to determine whether there is leakage. The new voxels may be more numerous than the previous iteration, but the growth should be controlled. In other words, if the increase in the number of voxels is expected (more specifically, a parabolic increase has been observed in normal growth patterns without leakage) then it is determined that there is no leakage and the process returns to step 30 to begin a new iteration. For example, as indicated above, the starting point consisted of one voxel. Assuming the starting point was surrounded by air, the next “wave” of voxels would be seventeen new seed points. However, because many of these are adjacent to each other, the next successive wave would not give rise to seventeen new seed points for each of the previous seventeen seed points. Additionally, the voxels behind each seed point that have been already analyzed, are not segmented again. If the airway being segmented were perfectly cylindrical, as soon as the seed points reached the walls of the airway, the “wave-front” would be a convex sheet, a single voxel in thickness, and would remain constant. Hence, the mathematical model for growing is somewhat parabolic, except when new branches are introduced, and considering that the airways are narrowing in the distal direction. Leakage, however, results in an abrupt increase in the number of segmented voxels.

If at 50 the analysis results in an unexpected or abnormally high increase in segmented voxels, it is determined that leakage exists and the process moves to step 60, which identifies and records the segmented voxels from the previous iteration and labels them as accurate.

Leakage determination is derived from two important conclusions: (1) It is expected that the front size has an inverse (not necessarily linear) dependence on the iteration number, e.g. [front size]˜(1/iteration number). (2) Bifurcations and changes in airway shape may result in somewhat linear growth in front size.

At 70, upon the detection of leakage, an analysis is done in order to select the most recent “good” iteration that does not contain leakage. This decision is based on the same principals used to satisfy the mathematical model in compliance with the natural structure of the bronchial tree.

The voxels segmented up to the last good iteration are assumed to be committed to the segmented voxel list, while voxels that belong to each iteration above the “good” one are analyzed in order to separate the voxels that led to the leakage. In order to make this analysis, recently segmented voxels are labeled to connected objects (part of the branch). Each object is then analyzed in order to detect the object that caused leakage.

The coordinates of voxels that belong to inaccurate objects are stored separately and treated differently thereafter. They are locked in the binary map to prevent their participation in the segmentation process. Voxels, belonging to accurate branches are returned to the segmentation and the process returns to 30.

At 80 the objects identified as leaking are removed from further segmentation and stored in a queue for post processing. After 80 the process returns to 30 for the next iteration.

If at 50 the answer was “no” for leakage, the process returns to 30 for the next iteration. It should be noted that the flow chart 10, though presented in series for clarification, is actually a parallel operation. In other words, each new voxel is a seed point and the flow chart is performed on each next iteration therefrom simultaneously. Hence, viewing the growth of the bronchial tree real time, one would see a near-instant tree appear, depending of course on the power of the processor running the algorithm.

If at 40 there are no new voxels detected, the algorithm proceeds to 90, which is a decision step asking whether any leakage objects were identified. If the answer is “yes” step 100 is executed, which retrieves the last object from the storage queue (step 80).

Next at 110, the threshold is reduced and the algorithm is performed on only the selected leakage object. Because a reduced threshold is being used, the likelihood of leakage is reduced.

If at 90 it is determined that there are no leakage objects, either because there were none or they have all been reprocessed, the process is completed at 120.

Although the invention has been described in terms of particular embodiments and applications, one of ordinary skill in the art, in light of this teaching, can generate additional embodiments and modifications without departing from the spirit of or exceeding the scope of the claimed invention. Accordingly, it is to be understood that the drawings and descriptions herein are proffered by way of example to facilitate comprehension of the invention and should not be construed to limit the scope thereof.

Averbuch, Dorian, Kreinin, Yuri

Patent Priority Assignee Title
Patent Priority Assignee Title
4346384, Jun 30 1980 CHITTENDEN BANK Remote object position and orientation locator
4791934, Aug 07 1986 Brainlab AG Computer tomography assisted stereotactic surgery system and method
5383454, Oct 19 1990 St. Louis University System for indicating the position of a surgical probe within a head on an image of the head
5386828, Dec 23 1991 SMITHS MEDICAL MD, INC Guide wire apparatus with location sensing member
5402801, Nov 02 1993 International Business Machines Corporation System and method for augmentation of surgery
5417210, May 27 1992 INTERNATIONAL BUSINESS MACHINES CORPORATION A CORP OF NEW YORK System and method for augmentation of endoscopic surgery
5425367, Sep 04 1991 CORPAK MEDSYSTEMS, INC Catheter depth, position and orientation location system
5445166, Nov 02 1993 International Business Machines Corporation System for advising a surgeon
5472441, Nov 08 1993 AngioDynamics, Inc Device for treating cancer and non-malignant tumors and methods
5480422, Jul 20 1993 Biosense, Inc. Apparatus for treating cardiac arrhythmias
5558091, Oct 06 1993 Biosense, Inc Magnetic determination of position and orientation
5572999, May 27 1992 International Business Machines Corporation Robotic system for positioning a surgical instrument relative to a patient's body
5600330, Jul 12 1994 Ascension Technology Corporation; ROPER ASCENSION ACQUISITION, INC Device for measuring position and orientation using non-dipole magnet IC fields
5630431, Jun 13 1991 International Business Machines Corporation System and method for augmentation of surgery
5668844, Apr 28 1992 WAKE FOREST UNIVERSITY HEALTH SCIENCES Self-calibrated tomosynthetic, radiographic-imaging system, method, and device
5695500, Nov 02 1993 International Business Machines Corporation System for manipulating movement of a surgical instrument with computer controlled brake
5704361, Nov 08 1991 Mayo Foundation for Medical Education and Research Volumetric image ultrasound transducer underfluid catheter system
5729129, Jun 07 1995 Biosense, Inc Magnetic location system with feedback adjustment of magnetic field generator
5730129, Apr 03 1995 General Electric Company Imaging of interventional devices in a non-stationary subject
5738096, Jul 20 1993 Biosense, Inc Cardiac electromechanics
5740802, Apr 20 1993 General Electric Company Computer graphic and live video system for enhancing visualization of body structures during surgery
5749362, May 27 1992 International Business Machines Corporation Method of creating an image of an anatomical feature where the feature is within a patient's body
5752513, Jun 07 1995 Biosense, Inc Method and apparatus for determining position of object
5772594, Oct 16 1996 SOFAMOR DANEK HOLDINGS, INC Fluoroscopic image guided orthopaedic surgery system with intraoperative registration
5797849, Mar 28 1995 Sonometrics Corporation Method for carrying out a medical procedure using a three-dimensional tracking and imaging system
5800352, Sep 13 1995 GE Medical Systems Global Technology Company, LLC Registration system for use with position tracking and imaging system for use in medical applications
5810007, Jul 26 1995 HARVARD MEDICAL SCHOOL Ultrasound localization and image fusion for the treatment of prostate cancer
5829444, Sep 15 1994 GE Medical Systems Global Technology Company, LLC Position tracking and imaging system for use in medical applications
5840025, Jul 20 1993 Biosense, Inc. Apparatus and method for treating cardiac arrhythmias
5871445, Apr 26 1993 ST LOUIS UNIVERSITY System for indicating the position of a surgical probe within a head on an image of the head
5873822, Sep 13 1995 GE Medical Systems Global Technology Company, LLC Automatic registration system for use with position tracking and imaging system for use in medical applications
5891034, Oct 19 1990 ST LOUIS UNIVERSITY System for indicating the position of a surgical probe within a head on an image of the head
5902239, Oct 30 1996 U.S. Philips Corporation Image guided surgery system including a unit for transforming patient positions to image positions
5913820, Aug 14 1992 British Telecommunications public limited company Position location system
5919188, Feb 04 1997 Medtronic, Inc Linear ablation catheter
5928248, Feb 25 1997 Biosense, Inc Guided deployment of stents
5944023, Dec 07 1995 DELTEC, INC Systems and methods for determining the location of an implanted device including a magnet
5976127, Jan 14 1998 Soft tissue fixation devices
6016439, Oct 15 1996 Biosense, Inc Method and apparatus for synthetic viewpoint imaging
6019724, Feb 08 1996 Sonowand AS Method for ultrasound guidance during clinical procedures
6032675, Mar 17 1997 ZELTIQ AESTHETICS, INC Freezing method for controlled removal of fatty tissue by liposuction
6073043, Dec 22 1997 CorMedica Measuring position and orientation using magnetic fields
6077257, Jun 07 1991 VIDACARE, INC Ablation of rectal and other internal body structures
6115626, Mar 26 1998 Boston Scientific Scimed, Inc Systems and methods using annotated images for controlling the use of diagnostic or therapeutic instruments in instruments in interior body regions
6147480, Oct 23 1997 Biosense, Inc Detection of metal disturbance
6149592, Nov 26 1997 Picker International, Inc.; PICKER INTERNATIONAL, INC Integrated fluoroscopic projection image data, volumetric image data, and surgical device position data
6161032, Mar 30 1998 Biosense, Inc Three-axis coil sensor
6188355, Dec 12 1997 Covidien LP Wireless six-degree-of-freedom locator
6201387, Oct 07 1997 Biosense, Inc Miniaturized position sensor having photolithographic coils for tracking a medical probe
6203493, Feb 15 1996 Biosense, Inc. Attachment with one or more sensors for precise position determination of endoscopes
6211666, Feb 27 1996 Biosense, Inc. Object location system and method using field actuation sequences having different field strengths
6226543, Sep 24 1998 Covidien LP System and method of recording and displaying in context of an image a location of at least one point-of-interest in a body during an intra-body medical procedure
6233476, May 18 1999 ST JUDE MEDICAL INTERNATIONAL HOLDING S À R L Medical positioning system
6236875, Oct 07 1994 SURGICAL NAVIGATION TECHNOLOGIES, INC ; ST LOUIS UNIVERSITY Surgical navigation systems including reference and localization frames
6289235, Mar 05 1998 WAKE FOREST UNIVERSITY HEALTH SCIENCES Method and system for creating three-dimensional images using tomosynthetic computed tomography
6314310, Mar 31 1997 Biosense, Inc. X-ray guided surgical location system with extended mapping volume
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
6332089, Aug 26 1996 Biosense, Inc. Medical procedures and apparatus using intrabody probes
6335617, May 06 1996 Biosense, Inc. Method and apparatus for calibrating a magnetic field generator
6366799, Feb 15 1996 Biosense, Inc. Movable transmit or receive coils for location system
6373240, Oct 15 1998 Biosense, Inc Metal immune system for tracking spatial coordinates of an object in the presence of a perturbed energy field
6405072, Jan 28 1991 INTEGRA BURLINGTON MA, INC Apparatus and method for determining a location of an anatomical target with reference to a medical apparatus
6427314, Oct 06 1993 Biosense, Inc. Magnetic determination of position and orientation
6453190, Feb 15 1996 Biosense, Inc. Medical probes with field transducers
6484118, Jul 20 2000 Biosense, Inc Electromagnetic position single axis system
6556696, Aug 19 1997 The United States of America as represented by the Department of Health and Human Services Method for segmenting medical images and detecting surface anomalies in anatomical structures
6558333, Sep 24 1998 Covidien LP System and method of recording and displaying in context of an image a location of at least one point-of-interest in a body during an intra-body medical procedure
6574498, Sep 16 1999 Covidien LP Linking of an intra-body tracking system to external reference coordinates
6580938, Feb 25 1997 Biosense, Inc Image-guided thoracic therapy and apparatus therefor
6591129, Feb 15 1996 Biosense, Inc. Method for treating tissue through injection of a therapeutic agent
6593884, Aug 02 1998 Covidien LP Intrabody navigation system for medical applications
6615155, Mar 09 2000 Covidien LP Object tracking using a single sensor or a pair of sensors
6618612, Feb 15 1996 Biosense, Inc. Independently positionable transducers for location system
6650927, Aug 18 2000 Biosense, Inc Rendering of diagnostic imaging data on a three-dimensional map
6690816, Apr 07 2000 UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL, THE Systems and methods for tubular object processing
6690963, Jan 24 1995 Biosense, Inc System for determining the location and orientation of an invasive medical instrument
6702780, Sep 08 1999 Covidien LP Steering configuration for catheter with rigid distal device
6706041, Aug 15 2001 CONTRACT MEDICAL MANUFACTURING, LLC Holders for ablation devices, surgical devices employing such holders, and methods of employing such surgical devices
6711429, Sep 24 1998 Covidien LP System and method for determining the location of a catheter during an intra-body medical procedure
6788967, May 14 1997 Biosense, Inc. Medical diagnosis, treatment and imaging systems
6833814, Jan 21 2000 Covidien LP Intrabody navigation system for medical applications
6947788, Aug 02 1998 Covidien LP Navigable catheter
6995729, Jan 09 2004 Biosense Webster, Inc Transponder with overlapping coil antennas on a common core
6996430, Aug 16 1999 Covidien LP Method and system for displaying cross-sectional images of a body
7176936, Mar 27 2001 Siemens Medical Solutions USA, Inc Augmented reality guided instrument positioning with modulated guiding graphics
7197354, Jun 21 2004 ST JUDE MEDICAL INTERNATIONAL HOLDING S À R L System for determining the position and orientation of a catheter
7233820, Apr 16 2003 Covidien LP Endoscope structures and techniques for navigating to a target in branched structure
7236567, Mar 24 2005 SIEMENS HEALTHINEERS AG Method and apparatus for synchronizing operation of an x-ray system and a magnetic system
7286868, Jun 15 2001 Biosense, Inc Medical device with position sensor having accuracy at high temperatures
7301332, Oct 06 2005 Biosense Webster, Inc Magnetic sensor assembly
7321228, Jul 31 2003 BIOSENSE WEBSTER INC Detection of metal disturbance in a magnetic tracking system
7324915, Jul 14 2005 Biosense Webster, Inc Data transmission to a position sensor
7343195, May 18 1999 ST JUDE MEDICAL INTERNATIONAL HOLDING S À R L Method and apparatus for real time quantitative three-dimensional image reconstruction of a moving organ and intra-body navigation
7353125, Apr 17 2003 BANK OF MONTREAL Eddy current detection and compensation
7366562, Oct 17 2003 SURGICAL NAVIGATION TECHNOLOGIES, INC Method and apparatus for surgical navigation
7370656, Apr 15 2003 KONINKLIJKE PHILIPS ELECTRONICS, N V Method and arrangement for influencing magnetic particles and detecting interfering material
7373271, Sep 20 2004 NORTHERN DIGITAL, INC System and method for measuring position and orientation using distortion-compensated magnetic fields
7386339, May 18 1999 ST JUDE MEDICAL INTERNATIONAL HOLDING S À R L Medical imaging and navigation system
7397364, Nov 11 2003 BIOSENSE WEBSTER INC Digital wireless position sensor
7517318, Apr 26 2005 Biosense Webster, Inc Registration of electro-anatomical map with pre-acquired image using ultrasound
7822461, Jul 11 2003 Siemens Medical Solutions USA, Inc System and method for endoscopic path planning
7831076, Dec 08 2006 Biosense Webster, Inc Coloring electroanatomical maps to indicate ultrasound data acquisition
8165385, Mar 24 2003 YANKELEVITZ, DAVID, DR ; YANKELEVITZ, DAVID DR System and method for three-dimensional image rendering and analysis
8218847, Jun 06 2008 Covidien LP Hybrid registration method
8218848, Jul 23 2008 Siemens Healthcare GmbH System and method for the generation of attenuation correction maps from MR images
8842898, Feb 01 2010 Covidien LP Region-growing algorithm
9042625, Feb 01 2010 Covidien LP Region-growing algorithm
20010031919,
20020022837,
20020065461,
20020082498,
20020193686,
20030074011,
20030099390,
20030144658,
20030216639,
20040006268,
20040019350,
20040097804,
20040138548,
20040215181,
20040249267,
20040254454,
20050033149,
20050090818,
20050107688,
20050182295,
20050197566,
20060058647,
20060064006,
20070167738,
20070167743,
20070167806,
20070232896,
20070287901,
20080008367,
20080033452,
20080086051,
20080097187,
20080118135,
20080132909,
20080132911,
20080139915,
20080147000,
20080157755,
20080161682,
20080162074,
20080183071,
20080183073,
20080188749,
20080247622,
20090182224,
20100016658,
20100063410,
JP2007312837,
WO2008125910,
WO9605768,
WO9625882,
/////
Executed onAssignorAssigneeConveyanceFrameReelDoc
Apr 25 2011KREININ, YURISuperdimension, LtdASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0356200017 pdf
Apr 28 2011AVERBUCH, DORIANSuperdimension, LtdASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0356200017 pdf
Nov 12 2012Superdimension, LtdCOVIDIEN GROUP S A R L ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0356480665 pdf
Nov 13 2012COVIDIEN GROUP S A R L Covidien LPASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0356480756 pdf
May 12 2015Covidien LP(assignment on the face of the patent)
Date Maintenance Fee Events
Aug 20 2020M1551: Payment of Maintenance Fee, 4th Year, Large Entity.
Aug 21 2024M1552: Payment of Maintenance Fee, 8th Year, Large Entity.


Date Maintenance Schedule
Mar 14 20204 years fee payment window open
Sep 14 20206 months grace period start (w surcharge)
Mar 14 2021patent expiry (for year 4)
Mar 14 20232 years to revive unintentionally abandoned end. (for year 4)
Mar 14 20248 years fee payment window open
Sep 14 20246 months grace period start (w surcharge)
Mar 14 2025patent expiry (for year 8)
Mar 14 20272 years to revive unintentionally abandoned end. (for year 8)
Mar 14 202812 years fee payment window open
Sep 14 20286 months grace period start (w surcharge)
Mar 14 2029patent expiry (for year 12)
Mar 14 20312 years to revive unintentionally abandoned end. (for year 12)