Hough transform based fast skew detection and accurate skew correction methods

Singh, Chandan; Bhatia, Nitin; Kaur, Amandeep

doi:10.1016/j.patcog.2008.06.002

Cited by 116 publications

(61 citation statements)

References 16 publications

(32 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It is evident from the rank distribution in Table 6 and Fig. 19 (Amin and Fischer, 2000;Chaudhuri and Pal, 1997;Hinds et al, 1990;Manjunath et al, 2006;Le et al, 1994;Singh et al, 2008;Srihari and Govindraju, 1989;Yin, 2001;Yu and Jain, 1996). Hence, we have compared the accuracy and computation time of our AFT-based method with an HT-based one (see Chaudhuri and Pal, 1997, Algorithm A2).…”

Section: 3mentioning

confidence: 98%

On the Farey sequence and its augmentation for applications to image analysis

Pratihar

Bhowmick

2017

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

We introduce a novel concept of the augmented Farey table (AFT). Its purpose is to store the ranks of fractions of a Farey sequence in an efficient manner so as to return the rank of any query fraction in constant time. As a result, computations on the digital plane can be crafted down to simple integer operations; for example, the tasks like determining the extent of collinearity of integer points or of parallelism of straight lines-often required to solve many image-analytic problemscan be made fast and efficient through an appropriate AFT-based tool. We derive certain interesting characterizations of an AFT for its efficient generation. We also show how, for a fraction not present in a Farey sequence, the rank of the nearest fraction in that sequence can efficiently be obtained by the regula falsi method from the AFT concerned. To assert its merit, we show its use in two applications-one in polygonal approximation of digital curves and the other in skew correction of engineering drawings in document images. Experimental results indicate the potential of the AFT in such image-analytic applications.

show abstract

Section: 3mentioning

confidence: 98%

On the Farey sequence and its augmentation for applications to image analysis

Pratihar

Bhowmick

2017

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

show abstract

“…The Hough transform is only applied on the weft boundary instead of all pixels to reduce the computational complexity and achieve the purpose of rapid detection. What's more, a rotation algorithm based on the image linear storage structure is also adopted to reduce the computational complexity and operation time of image skew correction [6]. When objects happen to be aligned by chance it can give misleading results.…”

Section: [26] Hough Transform For Skew Detectionmentioning

confidence: 99%

A Novel Approach for Automated Toll System Using Number Plate Detection

Kolhe¹,

Verma²

2017

Icsesd-2017

View full text Add to dashboard Cite

show abstract

“…K-means clustering algorithm is one of the most common iterative operator with adjustment K-means center of mass [7]. K-means is a clustering method based on squared error, is also very famous hard clustering algorithm.…”

Section: K-means Clustering Algorithmmentioning

confidence: 99%

“…Other studies such as Paragios' paper [7] have developed algorithms on the basis of geometric active contour model, which combined the edge of the image and the regional information and physiological structure constraints. Split left ventricular internal and external contour.…”

Section: Introductionmentioning

confidence: 99%

Segmentation of MRI Volume Data Based on Clustering Method

Chen

Zhang³

2016

MATEC Web of Conferences

View full text Add to dashboard Cite

Abstract. Here we analyze the difficulties of segmentation without tag line of left ventricle MR images, and propose an algorithm for automatic segmentation of left ventricle (LV) internal and external profiles. Herein, we propose an Incomplete K-means and Category Optimization (IKCO) method. Initially, using Hough transformation to automatically locate initial contour of the LV, the algorithm uses a simple approach to complete data subsampling and initial center determination. Next, according to the clustering rules, the proposed algorithm finishes MR image segmentation. Finally, the algorithm uses a category optimization method to improve segmentation results. Experiments show that the algorithm provides good segmentation results.

show abstract

Hough transform based fast skew detection and accurate skew correction methods

Cited by 116 publications

References 16 publications

On the Farey sequence and its augmentation for applications to image analysis

On the Farey sequence and its augmentation for applications to image analysis

A Novel Approach for Automated Toll System Using Number Plate Detection

Segmentation of MRI Volume Data Based on Clustering Method

Contact Info

Product

Resources

About