Patient position control for scanning
US-10635930-B2 · Apr 28, 2020 · US
US10957057B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10957057-B2 |
| Application number | US-201816109018-A |
| Country | US |
| Kind code | B2 |
| Filing date | Aug 22, 2018 |
| Priority date | Aug 22, 2018 |
| Publication date | Mar 23, 2021 |
| Grant date | Mar 23, 2021 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method includes calculating a center-of-mass of a volume of an organ of a patient in a computerized anatomical map of the volume. A location is found on the anatomical map, on a surface of the volume, that is farthest from the center-of-mass. The location is identified as a known anatomical opening of the organ.
Opening claim text (preview).
The invention claimed is: 1. A method for finding and denoting anatomical features in an anatomical map, the method comprising: receiving a map of an organ of a patient generated from data collected utilizing an electro-anatomical catheter positioned in the organ; calculating a center-of-mass of a volume of the organ of a patient in a computerized anatomical map of the volume; finding on the anatomical map a location on a surface of the volume that is farthest from the center-of-mass; finding on the anatomical map one or more next-farthest locations on a surface of the volume, which are farthest from the center-of-mass after excluding the identified opening, and farthest from the identified opening among the one or more next-farthest locations, and identifying the next-farthest locations as one or more additional openings, wherein finding the next-farthest locations comprises iteratively finding each of the next-farthest locations by selecting each next-farthest location based on being farthest, among the one or more next-farthest locations, from the identified openings, until finding a pre-set number of locations; and identifying the location as a known anatomical opening of the organ. 2. The method according to claim 1 , wherein finding the location comprises calculating paths from the center-of-mass to multiple locations on the surface of the volume, and finding a longest path among the multiple paths. 3. The method according to claim 2 , wherein identifying the location comprises including multiple locations on the surface of the volume that are within a predefined distance from the found location as being part of the opening. 4. The method according to claim 2 , wherein calculating the paths comprises dividing the surface of the volume into a given number of pixels, and calculating a shortest path to each pixel. 5. The method according to claim 1 , wherein the volume comprises a cardiac chamber. 6. The method according to claim 1 , further comprising presenting the found location to a user. 7. A system for finding and denoting anatomical features in an anatomical map, the system comprising: an apparatus, including an electro-anatomical catheter, for creating an anatomical map, the electro-anatomical catheter being positioned within the organ to gather data for creating the map; a memory, configured to store a computerized anatomical map of a volume of an organ of a patient; and a processor, configured to: calculate a center-of-mass of a volume of an organ of a patient in the anatomical map; find on the anatomical map a location on a surface of the volume that is farthest from the center-of-mass; find on the anatomical map one or more next-farthest locations on a surface of the volume, which are farthest from the center-of-mass after excluding the identified opening, and farthest from the identified opening among the one or more next-farthest locations, and to identify the next-farthest locations as one or more additional openings, wherein the processor is configured to iteratively find each of the next-farthest locations by selecting each next-farthest location based on being farthest, among the one or more next-farthest locations, from the identified openings, until finding a pre-set number of locations; and identify the location as a known anatomical opening of the organ. 8. The system according to claim 7 , wherein the processor is configured to find the location by calculating paths from the center-of-mass to multiple locations on the surface of the volume, and finding a longest path among the multiple paths. 9. The system according to claim 8 , wherein the processor is configured to identify the location by including multiple locations on the surface of the volume that are within a predefined distance from the found location as being part of the opening. 10. The system according to claim 8 , wherein the processor is configured to calculate the paths by dividing the surface of the volume into a given number of pixels, and calculating a shortest path to each pixel. 11. The system according to claim 7 , wherein the processor is configured to calculate a center of mass inside a mapped volume of a cardiac chamber. 12. The system according to claim 7 , wherein the processor is further configured to present the one or more found farthest locations to a user.
Heart; Cardiac · CPC title
Catheter; Guide wire · CPC title
Ultrasound image · CPC title
Endoscopic image · CPC title
Three-dimensional [3D] modelling for computer graphics · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.