𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A locally adaptive region growing algorithm for vascular segmentation

✍ Scribed by Jaeyoun Yi; Jong Beom Ra


Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
500 KB
Volume
13
Category
Article
ISSN
0899-9457

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

To segment vascular structures in 3‐D CTA/MRA images, this article presents a new region growing algorithm based on local cube tracking. In the proposed algorithm, a small local cube is segmented to detect a vessel segment, and the following local cube(s) is determined based on the segmentation result. This procedure is repeated until the segmentation is completed. By confining the segmentation inside each local cube, a robust result can be obtained even in a tubular structure of steadily changing intensity. For segmentation, a locally adaptive and competitive region growing scheme is adopted to obtain well‐defined vessel boundaries. It should be emphasized that the proposed algorithm can detect all branches with practically acceptable computational complexity. In addition, its segmentation result is represented as a tree structure having many branches so that a user may easily correct the result branch‐by‐branch, if necessary. Experimental results from real images prove that the proposed algorithm produces prospective vessel segmentation results for 3‐D CTA/MRA images and segments vessels of various sizes well, including stenoses and aneurysms. Β© 2003 Wiley Periodicals, Inc. Int J Imaging Syst Technol 13, 208–214, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ima.10059


πŸ“œ SIMILAR VOLUMES


An iterative region-growing algorithm fo
✍ Raul Montoliu; Filiberto Pla πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 284 KB

This article presents a new framework for the motion segmentation and estimation task on sequences of two gray images without a priori information of the number of moving regions present in the sequence. The proposed algorithm uses temporal information, by using an accurate Generalized Least-Squares

A Scalable and Adaptive Temporal Segment
✍ S.H. Kwok; W.C. Siu; A.G. Constantinides πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 565 KB

## INTRODUCTION To achieve very low bit-rate transmission, many video coding Video coding has gained increasing interest in the past papers suggest extraction of stationary objects and the backfew years. The temporal decimation technique is regarded ground and coding only of moving objects. These

Automatic navigation path generation bas
✍ Do-Yeon Kim; Sung-Mo Chung; Jong-Won Park πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 509 KB

In this paper, we propose a fast and automated navigation path generation algorithm to visualize inside of carotid artery using MR angiography images. The carotid artery is one of the body regions not accessible by real optical probe but can be visualized with virtual endoscopy. By applying two-phas

An Algorithm for Constructing Local Regi
✍ K.T. Huber; E.E. Watson; M.D. Hendy πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 102 KB

The groupings of taxa in a phylogenetic tree cannot represent all the conflicting signals that usually occur among site patterns in aligned homologous genetic sequences. Hence a tree-building program must compromise by reporting a subset of the patterns, using some discriminatory criterion. Thus, in

A Data Parallel Algorithm for Solving th
✍ N. Copty; S. Ranka; G. Fox; R.V. Shankar πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 696 KB

Region growing is a general technique for image segmentation, where image characteristics are used to group adjacent pixels together to form regions. This paper presents a parallel algorithm for solving the region growing problem based on the split-andmerge approach, and uses it to test and compare