Abstract: A method including searching image data corresponding to a series of axial image slices with a processor, searching axial image slices from a starting image slice and calculating a confidence score that an image slice includes a cross-section image of an aorta, identifying an image slice containing at least one seed disk, including an ascending aorta seed disk, from candidate image slices identified according to the confidence score, and growing a 3D segmentation of the ascending aorta by stacking ascending aorta image disks included in consecutive image slices beginning from the ascending aorta seed disk.

Abstract: A method of operating on volumetric imaging data representing organ anatomy includes determining whether a polyp location within a specified range from a viewing point is visible, or hidden by an anatomical feature, and marking the polyp as visible or hidden with a viewable indicator.

Abstract: A method including searching image data corresponding to a series of axial image slices with a processor, searching axial image slices from a starting image slice and calculating a confidence score that an image slice includes a cross-section image of an aorta, identifying an image slice containing at least one seed disk, including an ascending aorta seed disk, from candidate image slices identified according to the confidence score, and growing a 3D segmentation of the ascending aorta by stacking ascending aorta image disks included in consecutive image slices beginning from the ascending aorta seed disk.

Abstract: A method including searching image data corresponding to a series of axial image slices with a processor, searching axial image slices from a starting image slice and calculating a confidence score that an image slice includes a cross-section image of an aorta, identifying an image slice containing at least one seed disk, including an ascending aorta seed disk, from candidate image slices identified according to the confidence score, and growing a 3D segmentation of the ascending aorta by stacking ascending aorta image disks included in consecutive image slices beginning from the ascending aorta seed disk.

Abstract: This document discusses, among other things, systems and methods for efficiently calculating a colon segmentation from one or more candidate virtual three-dimensional objects. A sequence of image scans are analyzed and candidate segments are identified. Landmark segments are identified from the candidate segments. A characteristic path is generated for each candidate segment. The paths are joined using a cost network and reoriented to be consistent with a typical flythrough path. The connected path is then used to generate a continuous volumetric virtual object.

Abstract: This document discusses, among other things, systems and methods for efficiently calculating a colon segmentation from one or more candidate virtual three-dimensional objects. A sequence of image scans are analyzed and candidate segments are identified. Landmark segments are identified from the candidate segments. A characteristic path is generated for each candidate segment. The paths are joined using a cost network and re-oriented to be consistent with a typical flythrough path. The connected path is then used to generate a continuous volumetric virtual object.

Abstract: This document discusses, among other things, systems and methods for efficiently calculating a registration of multiple characteristic paths of a virtual three-dimensional object. 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. The subintervals are mapped to the longer path using a minimization function that minimizes a 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.

Abstract: This document discusses, among other things, systems and methods for efficiently calculating a colon segmentation from one or more candidate virtual three-dimensional objects. A sequence of image scans are analyzed and regions that represent air-filled objects and tagged-stool are identified as candidate segments. A characteristic path is generated for each candidate segment. The paths are joined using a cost network and re-oriented to be consistent with a typical flythrough path. The connected path is then used to generate a continuous volumetric virtual object.

Abstract: A system including a memory to store image data corresponding to a three dimensional (3D) reconstructed image, and a processor that includes an automatic vessel tree extraction module. The automatic vessel tree extraction module includes a load data module to access the stored image data, a component identification module to identify those components of the image data deemed likely to belong to a vessel, a characteristic path computation module to compute one or more characteristic paths for an identified component having a volume greater than a specified threshold volume value and discard an identified component having a volume less than the specified threshold volume value, and a connection module to connect the computed one or more characteristic paths of the identified component to a characteristic path of another identified component or to a common vessel source until the identified components are connected or discarded.

Abstract: This document discusses, among other things, systems and methods for efficiently calculating a registration of multiple characteristic paths of a virtual three-dimensional object. 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. The subintervals are mapped to the longer path using a minimization function that minimizes a 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.

Abstract: This document discusses, among other things, systems and methods for efficiently calculating a colon segmentation from one or more candidate virtual three-dimensional objects. A sequence of image scans are analyzed and regions that represent air-filled objects and tagged-stool are identified as candidate segments. A characteristic path is generated for each candidate segment. The paths are joined using a cost network and re-oriented to be consistent with a typical flythrough path. The connected path is then used to generate a continuous volumetric virtual object.

Abstract: A method including searching image data corresponding to a series of axial image slices with a processor, searching axial image slices from a starting image slice and calculating a confidence score that an image slice includes a cross-section image of an aorta, identifying an image slice containing at least one seed disk, including an ascending aorta seed disk, from candidate image slices identified according to the confidence score, and growing a 3D segmentation of the ascending aorta by stacking ascending aorta image disks included in consecutive image slices beginning from the ascending aorta seed disk.

Abstract: Systems and methods for deriving a cardiac cycle signal by selecting images of a portion of a cardiovascular system include receiving a plurality of images from a scanner that have been recorded over a period of time. The images represent one or more locations along the extent of the cardiovascular system. The images are then selected based on common criteria determined from the plurality of images and without reference to an external signal. The common criteria comprises changes in the size of a cross section of the aorta, changes in the volume of the heart, changes in the area of a cross section of the heart. In addition, the criteria can include the mean pixel difference between adjacent images.

Abstract: A method of operating on volumetric imaging data representing organ anatomy includes determining whether a polyp location within a specified range from a viewing point is visible, or hidden by an anatomical feature, and marking the polyp as visible or hidden with a viewable indicator.

Abstract: Systems and methods for deriving a cardiac cycle signal by selecting images of a portion of a cardiovascular system include receiving a plurality of images from a scanner that have been recorded over a period of time. The images represent one or more locations along the extent of the cardiovascular system. The images are then selected based on common criteria determined from the plurality of images and without reference to an external signal. The common criteria comprises changes in the size of a cross section of the aorta, changes in the volume of the heart, changes in the area of a cross section of the heart. In addition, the criteria can include the mean pixel difference between adjacent images.

Abstract: This document discusses, among other things, systems and methods for segmenting and displaying blood vessels or other tubular structures in volumetric imaging data. The vessel of interest is specified by user input, such as by using a single point-and-click of a mouse or using a menu to select the desired vessel. A central vessel axis (CVA) or centerline path is obtained. A segmentation algorithm uses the centerline to propagate a front that collects voxels associated with the vessel. Re-initialization of the algorithm permits control parameter(s) to be adjusted to accommodate local variations at different parts of the vessel. Termination of the front occurs, among other things, upon vessel departure, for example, indicated by a speed of front evolution falling below a predetermined threshold.