Characterization of 3-D coronary tree motion from MSCT angiography

Multi-constraint point set registration with redundant point removal for the registration of coronary arteries

BACKGROUND

Coronary artery disease (CAD) is the leading cause of death worldwide. The registration of the coronary artery at different phases can help radiologists explore the motion patterns of the coronary artery and assist in the diagnosis of CAD. However, there is no automatic and easy-to-execute method to solve the missing data problem that occurs at the endpoints of the coronary artery tree. This paper proposed a non-rigid multi-constraint point set registration with redundant point removal (MPSR-RPR) algorithm to tackle this challenge.

METHODS

Firstly, the MPSR-RPR algorithm roughly registered two coronary artery point sets with the pre-set smoothness regularization parameter and Gaussian filter width value. The moving coherent, local feature, and the corresponding relationship between bifurcation point pairs were exploited as the constraints. Next, the spatial geometry information of the coronary artery was utilized to automatically recognize the vessel endpoints and to delete the redundant points of the coronary artery. Finally, the algorithm continued carrying out the multi-constraint registration with another group of the pre-set parameters to improve the alignment performance.

RESULTS

The experimental results demonstrated that the MPSR-RPR algorithm achieved a significantly lower mean value of the modified Hausdorff distance (MHD) compared to the other state-of-the-art methods for addressing the serious missing data in the left and right coronary arteries.

CONCLUSION

This study demonstrated the effectiveness of the proposed algorithm in aligning coronary arteries, providing significant value in assisting in the diagnosis of coronary artery and myocardial lesions.

Estimation of coronary artery movement using a non-rigid registration with global-local structure preservation

BACKGROUND

At present, coronary artery disease (CAD) is the leading cause of death worldwide. Many studies have shown that CAD is strongly associated with the motion characteristics of the coronary arteries. Although cardiovascular imaging technology has been widely used for the diagnosis of CAD, the motion parameters of the heart and coronary arteries cannot be directly calculated from the images. In this paper, we propose a point set registration method with global and local topology constraints to quantify coronary artery movement.

METHODS

The global constraint is the motion coherence of the point set which enforces the smoothness of the displacement field. The local linear embedding based topological structure and the local feature descriptor i.e., the 3D shape context, are designed to retain the local structure of the point set. We incorporate these constraints into a maximum likelihood framework and derive an expectation-maximization algorithm to obtain the transformation function between the two point sets. The proposed method was compared with four existing algorithms using simulated data and applied to the real data obtained from 4D CT angiograms.

RESULTS

For the simulation data, the proposed method achieves a lower registration error than the comparison algorithms. For the real data, the proposed method shows that, in most cases, the right coronary artery achieves a larger velocity than the left anterior descending and left circumflex branches, and there are three well-defined velocity peaks, during the cardiac cycle for these branches.

CONCLUSION

The proposed approach is feasible and effective in quantifying coronary artery movement and thus adds to the diagnostic power of coronary imaging.

Vessel Structure Extraction using Constrained Minimal Path Propagation

Minimal path method has been widely recognized as an efficient tool for extracting vascular structures in medical imaging. In a previous paper, a method termed minimal path propagation with backtracking (MPP-BT) was derived to deal with curve-like structures such as vessel centerlines. A robust approach termed CMPP (constrained minimal path propagation) is here proposed to extend this work. The proposed method utilizes another minimal path propagation procedure to extract the complete vessel lumen after the centerlines have been found. Moreover, a process named local MPP-BT is applied to handle structure missing caused by the so-called close loop problems. This approach is fast and unsupervised with only one roughly set start point required in the whole process to get the entire vascular structure. A variety of datasets, including 2D cardiac angiography, 2D retinal images and 3D kidney CT angiography, are used for validation. A quantitative evaluation, together with a comparison to recently reported methods, is performed on retinal images for which a ground truth is available. The proposed method leads to specificity (Sp) and sensitivity (Se) values equal to 0.9750 and 0.6591. This evaluation is also extended to 3D synthetic vascular datasets and shows that the specificity (Sp) and sensitivity (Se) values are higher than 0.99. Parameter setting and computation cost are analyzed in this paper.

Vessel tree tracking in angiographic sequences

We present a method to track vessels in angiography [contrast filled vessels in two-dimensional (2-D) x-ray fluoroscopy]. Finding correspondence of a vessel tree from consecutive angiogram frames provides significant value in computer-aided clinical applications such as fast vessel tree segmentation, three-dimensional (3-D) vessel topology reconstruction from corresponding centerlines, cardiac motion understanding, etc. However, establishing an accurate vessel tree correspondence (vessel tree tracking) is a nontrivial problem due to nonlinear periodic cardiac and breathing motion in 2-D views, foreshortening, false bifurcations due to 3-D to 2-D projection, occlusion from other anatomies, etc. The vessel tree is represented by BSpline curves. The control points of the BSpline curves are landmarks that are the tracking targets. Our method maximizes the appearance similarity while preserving the vessel structure. A directed acyclic graph (DAG) is employed to represent the appearance and shape structure of the vessel tree: nodes from the DAG encode the appearance of the vessel tree landmarks, and the edges encode the relative locations between landmarks. The vessel tree tracking problem turns into finding the most similar tree from the DAG in the next frame, and it is solved using an efficient dynamic programming algorithm. We performed evaluations on 62 x-ray angiography sequences (above 1000 frames). Experiment results show our algorithm is robust to these challenges and delivers better performance, compared to four existing methods.

Curve-Like Structure Extraction Using Minimal Path Propagation With Backtracking

Minimal path techniques can efficiently extract geometrically curve-like structures by finding the path with minimal accumulated cost between two given endpoints. Though having found wide practical applications (e.g., line identification, crack detection, and vascular centerline extraction), minimal path techniques suffer from some notable problems. The first one is that they require setting two endpoints for each line to be extracted (endpoint problem). The second one is that the connection might fail when the geodesic distance between the two points is much shorter than the desirable minimal path (shortcut problem). In addition, when connecting two distant points, the minimal path connection might become inefficient as the accumulated cost increases over the propagation and results in leakage into some non-feature regions near the starting point (accumulation problem). To address these problems, this paper proposes an approach termed minimal path propagation with backtracking. We found that the information in the process of backtracking from reached points can be well utilized to overcome the above problems and improve the extraction performance. The whole algorithm is robust to parameter setting and allows a coarse setting of the starting point. Extensive experiments with both simulated and realistic data are performed to validate the performance of the proposed method.

Simulation environment of X-ray rotational angiography using 3D+t coronary tree model

The newly introduced cardiac rotational angiography (RA) can provide a large amount of projections from different angles which greatly improve the 3D coronary tree reconstruction. However, the reconstruction methods are difficult to be objectively evaluated due to the complicated topology of coronary tree and non-linear cardiac motion. In this paper, we present a simulation environment of rotational angiography acquisition system to facilitate the improvements and the evaluations of reconstruction algorithms. A 3D+t coronary tree model reconstructed from MSCT sequence is employed to enhance the reality of simulation. A simulation environment of X-ray coronary angiography is developed based on distance-driven projection algorithm. The static angiography is firstly simulated to verify the dynamic model by comparing the displacements of landmarks with the real static angiography of the same patient. Rotational simulation results are then obtained with real system parameters to provide a complete and true-to-life RA sequence representing the morphology of moving coronary tree.