Automatic liver segmentation from abdominal CT volumes using graph cuts and border marching

M Liao, Y Zhao, X Liu, Y Zeng, B Zou, X Wang… - Computer methods and …, 2017 - Elsevier
Abstract Background and Objective Identifying liver regions from abdominal computed
tomography (CT) volumes is an important task for computer-aided liver disease diagnosis …

Unsupervised generation of polygonal approximations based on the convex hull

NLF García, LDM Martínez, ÁC Poyato… - Pattern Recognition …, 2020 - Elsevier
The present paper proposes a new non-optimal but unsupervised algorithm, called ICT-
RDP, for generation of polygonal approximations based on the convex hull. Firstly, the new …

[HTML][HTML] A generalisable framework for saliency-based line segment detection

M Brown, D Windridge, JY Guillemaut - Pattern Recognition, 2015 - Elsevier
Here we present a novel, information-theoretic salient line segment detector. Existing line
detectors typically only use the image gradient to search for potential lines. Consequently …

A new thresholding approach for automatic generation of polygonal approximations

NL Fernández-García, LDM Martínez… - Journal of Visual …, 2016 - Elsevier
The present paper proposes a new algorithm for automatic generation of polygonal
approximations of 2D closed contours based on a new thresholding method. The new …

A heuristic method for initial dominant point detection for polygonal approximations

S Kalaivani, BK Ray - Soft Computing, 2019 - Springer
This paper presents a novel initial dominant point detection technique for polygonal
approximation in digital planar curves. This technique concentrates on the local and global …

Dominant point detection based on suboptimal feature selection methods

Ş Işık - Expert Systems with Applications, 2020 - Elsevier
This paper presents a viable alternative solution for dominant point detection predicated on
the comparison of suboptimal feature selection methods. Suboptimal feature selection …

[HTML][HTML] Fast progressive polygonal approximations for online strokes

MT Parvez - Graphical Models, 2023 - Elsevier
This paper presents a fast and progressive polygonal approximation algorithm for online
strokes. A stroke is defined as a sequence of points between a pen-down and a pen-up. The …

A new dominant point detection technique for polygonal approximation of digital planar closed curves

S Kalaivani, BK Ray - International Journal of Intelligent …, 2021 - inderscienceonline.com
On the visual perception, the real-world objects are the collection of irregular polygons.
Representation and understanding the irregular polygon is an interesting and major task in …

Context-free grammars to detect straight segments and a novel polygonal approximation method

OA Tapia-Dueñas, H Sánchez-Cruz - Signal Processing: Image …, 2021 - Elsevier
A new method for the polygonal approximation is presented. The method is based on the
search for break points through a context-free grammar, that accepts digital straight …

Polygonal approximation of digital planar curve using novel significant measure

M Ramaiah, DK Prasad - arxiv preprint arxiv:1812.09271, 2018 - arxiv.org
This paper presents an iterative smoothing technique for polygonal approximation of digital
image boundary. The technique starts with finest initial segmentation points of a curve. The …