Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1708.09055

Fused Segmentation of Geometric Models for Myocardium and Coronary Artery via Medial Axis

Jehyun Chaa·Joonghyun Ryub·Jin-Ho Choi·Deok-Soo Kim
View original source ↗Read source document ↗Export metadata ↓

Abstract

Coronary arteries and their branches supply blood to myocardium. The obstruction of coronary arteries results in significant loss of myocardium, called acute myocardial infarction, and the number one cause of death globally. Hence, quantification of the regional amount of heart muscle subtended by obstructed coronary arteries is of critical value in clinical medicine. However, the conventional methods are inaccurate and frequently disagree with clinical practices. This study proposes a novel algorithm to segment regional myocardium-at-risk subtended by any potentially obstructed coronary artery. Assuming the geometric triangular mesh models of coronary artery and myocardium derived from an individual cardiac computed tomography image, the proposed algorithm performs (i) computation of the medial axis of the coronary artery and (ii) segmentation of the coronary artery and myocardium using the medial axis. The algorithm provides the fused segmentation of coronary artery and myocardium via the medial axis. The computed result provides a robust mathematical linkage between myocardium-at-risk and supplying coronary arteries so that ischemic myocardial regions can be accurately identified, and both the extent and severity of myocardial ischemia can be quantified effectively and efficiently. Furthermore, the correspondence between segmented coronary artery and myocardium can be more importantly used for building optimization models of cardiac systems for various applications. We believe that the proposed algorithm and implemented VoroHeart program, which is freely available at http://voronoi.hanyang.ac.kr/software/voroheart, will be an invaluable tool for patient-specific risk predictions and the treatment of obstructed coronary artery disease in clinical medicine. The algorithmic accuracy and efficiency are theoretically asserted and experimentally verified.

Explore related subjects

cs.CG

Keep this discovery

BibTeXRIS

Jehyun Chaa, Joonghyun Ryub, Jin-Ho Choi, Deok-Soo Kim. 2017-08-29. Fused Segmentation of Geometric Models for Myocardium and Coronary Artery via Medial Axis. https://arxiv.org/abs/1708.09055

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Almost Linear Universal Point Sets for Planar Graphs

A point set is universal for planar graphs on $n$ vertices if every such graph has a straight-line drawing without crossings whose vertices belong to the set. We construct universal point sets of size $n^{1+o(1)}$, improving the previous quadratic upper bound. Our construction uses the reduction of Bannister, Cheng, Devanny, and Eppstein from universal point sets to superpatterns for $213$-avoiding permutations. We represent these permutations by ordered rooted forests and construct a small family of intervals containing every such forest. The result follows from a straightforward bound on the size of the family of intervals. GPT-6 Astra assisted in developing the construction and proof.

cs.CG↗
arXiv2026

Some results on Archdeacon's conjecture for rotation systems

A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements. A four-element subset is non-planar if its induced rotation system cannot be realized by a crossing-free drawing of $K_4$. As a combinatorial strengthening of Hill's conjecture on the crossing number of the complete graph, Archdeacon conjectured that every rotation system on $n$ elements has at least $H(n)=\frac{1}{4} \lfloor\frac {n}{2}\rfloor \lfloor\frac{n-1}{2}\rfloor \lfloor\frac{n-2}{2}\rfloor \lfloor\frac{n-3}{2}\rfloor$ non-planar four-element subsets. We computationally verify Archdeacon's conjecture for $n\leq 10$ and show that every extremal rotation system in these orders is realizable by a simple drawing. With computer assistance, we prove that every rotation system on $n$ elements has at least $(8/9 - o(1)) H(n)$ non-planar four-element subsets. We also present a proof by hand for a weaker lower bound of $(2/3-o(1)) H(n)$. Finally, extending recent work of Felsner on antipodal pairs in drawings, we show that Archdeacon's conjecture holds for antipodally shellable rotation systems.

cs.CG↗
arXiv2026

The Hyperbolic Surface Distance, Diameter, and Dirichlet Problems

Despite the prominence of hyperbolic surfaces in mathematics, basic algorithmic questions about them, even computing the distance between two points, have remained open, leaving many features of these surfaces inaccessible. The classical machinery assumes a polyhedral structure absent on a smooth surface. We remove these obstacles. We begin with an efficient $O(g^2)$ algorithm for the distance between two points, where $g$ is the genus of the surface. Building on it, we obtain an $O(g^2 \log g)$ method for answering distance queries from a fixed source and, as a consequence, for recentering a Dirichlet domain around an arbitrary point. This understanding of distances on the surface then lets us approximate the diameter to within any $\eps$ in time $O(g^3 \log g / \eps^2)$. We further show that the diameter, a single real number encoding a great deal about the surface, is exactly computable. Its hyperbolic cosine is an algebraic number over the field encoding the coefficients of the hyperbolic isometries defining the surface.

cs.CG↗