Displaying similar documents to “Projection-based text line segmentation with a variable threshold”

K3M: a universal algorithm for image skeletonization and a review of thinning techniques

Khalid Saeed, Marek Tabędzki, Mariusz Rybnik, Marcin Adamski (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper aims at three aspects closely related to each other: first, it presents the state of the art in the area of thinning methodologies, by giving descriptions of general ideas of the most significant algorithms with a comparison between them. Secondly, it proposes a new thinning algorithm that presents interesting properties in terms of processing quality and algorithm clarity, enriched with examples. Thirdly, the work considers parallelization issues for intrinsically sequential...

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...

Fast and Robust Orientation of Cryo-Electron Microscopy Images

Guoliang Xu, Xia Wang, Ming Li, Zhucui Jing (2015)

Molecular Based Mathematical Biology

Similarity:

We present an efficient and reliable algorithm for determining the orientations of noisy images obtained fromprojections of a three-dimensional object. Based on the linear relationship among the common line vectors in one image plane, we construct a sparse matrix, and show that the coordinates of the common line vectors are the eigenvectors of the matrix with respect to the eigenvalue 1. The projection directions and in-plane rotation angles can be determined fromthese coordinates. A...

Tuning the Zhu-Takaoka string matching algorithm and experimental results

Thomas Berry, Somasundaram Ravindran (2002)

Kybernetika

Similarity:

In this paper we present experimental results for string matching algorithms which have a competitive theoretical worst case run time complexity. Of these algorithms a few are already famous for their speed in practice, such as the Boyer–Moore and its derivatives. We chose to evaluate the algorithms by counting the number of comparisons made and by timing how long they took to complete a given search. Using the experimental results we were able to introduce a new string matching algorithm...

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...