Displaying similar documents to “K3M: a universal algorithm for image skeletonization and a review of thinning techniques”

Segmentation of breast cancer fine needle biopsy cytological images

Maciej Hrebień, Piotr Steć, Tomasz Nieczkowski, Andrzej Obuchowicz (2008)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper describes three cytological image segmentation methods. The analysis includes the watershed algorithm, active contouring and a cellular automata GrowCut method. One can also find here a description of image pre-processing, Hough transform based pre-segmentation and an automatic nuclei localization mechanism used in our approach. Preliminary experimental results collected on a benchmark database present the quality of the methods in the analyzed issue. The discussion of common...

Integrated region-based segmentation using color components and texture features with prior shape knowledge

Mehryar Emambakhsh, Hossein Ebrahimnezhad, Mohammad Hossein Sedaaghi (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

Segmentation is the art of partitioning an image into different regions where each one has some degree of uniformity in its feature space. A number of methods have been proposed and blind segmentation is one of them. It uses intrinsic image features, such as pixel intensity, color components and texture. However, some virtues, like poor contrast, noise and occlusion, can weaken the procedure. To overcome them, prior knowledge of the object of interest has to be incorporated in a top-down...

Weighted ICP Algorithm for Alignment of Stars from Scanned Astronomical Photographic Plates

Marinov, Alexander, Zlateva, Nadezhda, Dimov, Dimo, Marinov, Delian (2012)

Serdica Journal of Computing

Similarity:

ACM Computing Classification System (1998): I.2.8, I.2.10, I.5.1, J.2. Given the coarse celestial coordinates of the centre of a plate scan and the field of view, we are looking for a mapping between the stars extracted from the image and the stars from a catalogue, where the stars from both sources are represented by their stellar magnitudes and coordinates, relatively to the image centre. In a previous work we demonstrated the application of Iterative Closest Point (ICP)...

A modified K3M thinning algorithm

Marek Tabedzki, Khalid Saeed, Adam Szczepański (2016)

International Journal of Applied Mathematics and Computer Science

Similarity:

The K3M thinning algorithm is a general method for image data reduction by skeletonization. It had proved its feasibility in most cases as a reliable and robust solution in typical applications of thinning, particularly in preprocessing for optical character recognition. However, the algorithm had still some weak points. Since then K3M has been revised, addressing the best known drawbacks. This paper presents a modified version of the algorithm. A comparison is made with the original...

Parallel implementation of local thresholding in Mitrion-C

Tomasz Kryjak, Marek Gorgoń (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

Mitrion-C based implementations of three image processing algorithms: a look-up table operation, simple local thresholding and Sauvola's local thresholding are described. Implementation results, performance of the design and FPGA logic utilization are discussed.