کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
505209 864484 2015 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Finding splitting lines for touching cell nuclei with a shortest path algorithm
ترجمه فارسی عنوان
پیدا کردن خطوط تقسیم برای لمس کردن هسته سلول با الگوریتم کوتاه ترین مسیر
کلمات کلیدی
خط تقسیم؛ جاذب هسته سلولی؛ کوتاه ترین مسیر. تقسیم بندی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
چکیده انگلیسی


• We utilize the ellipse fitting algorithm to obtain the markers of cell nuclei.
• The splitting line of touching cell nuclei is extracted by EDT.
• The concave points are adopted to adjust the endpoints of initial splitting line.
• We calculate the shortest path between the adjusted endpoints to find the accurate splitting line.
• Our algorithm achieves good experimental results on different types of touching cell nuclei.

A shortest path-based algorithm is proposed in this paper to find splitting lines for touching cell nuclei. First, an initial splitting line is obtained through the distance transform of a marker image and the watershed algorithm. The initial splitting line is then separated into different line segments as necessary, and the endpoint positions of these line segments are adjusted to the concave points on the contour. Finally, a shortest path algorithm is used to find the accurate splitting line between the starting-point and the end-point, and the final split can be achieved by the contour of the touching cell nuclei and the splitting lines. Comparisons of experimental results show that the proposed algorithm is effective for segmentation of different types of touching cell nuclei.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers in Biology and Medicine - Volume 63, 1 August 2015, Pages 277–286
نویسندگان
, , , , , ,