نتایج جستجو برای: hough transform

تعداد نتایج: 115605  

2009
Hideki Yasui Koichi Shinoda Sadaoki Furui Koji Iwano

We propose a noise robust speech recognition method based on combining novel features extracted from fundamental frequency (F0) information and spectral subtraction. F0 features have been shown to be effective in speech recognition in noisy environments. Recently, F0 features obtained by Hough transform were developed for concatenated digit recognition and significantly improved recognition per...

Journal: :IJPRAI 2010
Shih-Hsuan Chiu Jiun-Jian Liaw Kuo-Hung Lin

The main drawbacks of the Hough transform (HT) are the heavy requirement of computation and storage. To improve the drawbacks of the HT, the randomized Hough transform (RHT) was proposed. But the RHT is not suitable for detecting the pattern with the complex image because the probability is too low. In this paper, we propose a fast randomized Hough transform for circle/circular arc detection. W...

2011
Su Chen Hai Jiang

Circle detection has been widely applied in image processing applications. Hough transform, the most popular method of shape detection, normally takes a long time to achieve reasonable results, especially for large images. Such performance makes it almost impossible to conduct real-time image processing with sequential algorithms on community computers. Recently, NVIDIA developed CUDA programmi...

1998
Shamik Sural

We present a neuro-fuzzy system for character recognition from printed documents using a fuzzy Hough transform technique. For each character pattern, fuzzy Hough transform extracts information from the standard Hough transform accumulator cells into a number of fuzzy sets. These basic fuzzy sets are combined by t-norms to synthesize additional fuzzy sets whose heights form an n-dimensional feat...

1997
N. GUIL E. L. ZAPATA

-In this work we present two new algorithms for the detection of circles and ellipses which use the FHT algorithm as a basis: Fast Circle Hough Transform (FCHT) and Fast Ellipse Hough Transform (FEHT). The first stage of these two algorithms, devoted to obtaining the centers of the figures, is computationally the most costly. With the objective of improving the execution times of this stage it ...

Journal: :IEEE Trans. Signal Processing 1997
Zhijian Hu Henry Leung Martin Blanchette

— This paper analyzes the statistical performance of track initiation methods. It evaluates, by considering a track initiation as a problem of signal detection, the track detection probabilities and false track probabilities of four popular approaches: the rule-based method, the logic-based method, the Hough transform, and the modified Hough transform techniques. The first two methods detect th...

2013
Muhammad Sajeer

Automatic Skew Detection and Localization of Vehicle License Plate Using Hough Transform are used to identify a vehicle by its number plate. The proposed algorithm consists of three major parts: Extraction of plate region, segmentation of characters and recognition of plate characters. The proposed license plate localization algorithm is based on a combination of several algorithms that include...

1994
Soo-Chang Pei Ji-Hwei Horng

We propose a method to detect circular arcs, including the determinations of their centers, radii, lengths, and midpoints. The center, radius of a circular arc can easily be determined using circular Hough transform. But, the determinations of the arc midpoint and length are more complicated. Theoretical analysis of the centroid of the near peak Hough transform data is presented. Then, the arc ...

2007
Hsiang-Ling Li Chaitali Chakrabarti

A novel feature-domain 2D motion estimation system based on the straight-line Hough transform (SLHT) is presented. It operates on 256256-pixel binary images and consists of two main blocks. The rst block does preprocessing work including smoothing the boundary, tracing and integrating the contours, and detecting dominant points. The second block computes the Hough transform on contour segments ...

2017
Egor I. Ershov Evgeny A. Shvets Timur M. Khanipov Dmitry P. Nikolaev

In this paper we investigate the problem of finding the minimal operations number for the generalized Hough transform computation (GHT). We demonstrate that this problem is equivalent to the addition chain problem and is therefore NP-complete. Three greedy methods for generating GHT computation algorithms are proposed and their performance is compared against the fast Hough transform (FHT) for ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید