• Korean Journal of Remote Sensing
• /
• v.20 no.4
• /
• pp.261-274
• /
• 2004

The feature extraction using remotely sensed imagery has been recognized one of the important tasks in remote sensing applications. As the high-resolution imagery are widely used to the engineering purposes, need of more accurate feature information also is increasing. Especially, in case of the automatic extraction of linear feature such as road using mid or low-resolution imagery, several techniques was developed and applied in the mean time. But quantitatively comparative analysis of techniques and case studies for high-resolution imagery is rare. In this study, we implemented a computer program to perform and compare GDPA (Gradient Direction Profile Analysis) algorithm and Hough transformation. Also the results of applying two techniques to some images were compared with road centerline layers and boundary layers of digital map and presented. For quantitative comparison, the ranking method using commission error and omission error was used. As results, Hough transform had high accuracy over 20% on the average. As for execution speed, GDPA shows main advantage over Hough transform. But the accuracy was not remarkable difference between GDPA and Hough transform, when the noise removal was app]ied to the result of GDPA. In conclusion, it is expected that GDPA have more advantage than Hough transform in the application side.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.297-299
• /
• 2006

Searching the region of interest on the Hough transform domain is done to determine the real road boundary on the high speed way. The mathematical morphology is employed to obtain the gradient image which is utilized in Hough transform. Many possible candidates of lines could appear on the ordinary road environment and simple selection of the strongest line segments likely to be fault boundary lines. To solve such problem, the search area for the candidates of the road boundary which is called the region of interest is limited on the Hough space. The effectiveness of the proposed algorithm has been shown with experimental results.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.500-503
• /
• 1997

In this paper, a method for recognizing 3-D objects using the 3-D Hough transform and the robust stereo vision is studied. A 3-D object is recognized through two steps; modeling step and matching step. In modeling step, features of the object are extracted by analyzing the IGES file. In matching step, the values of the sensed image are compared with those of the IGES file which is assumed to location and orientation in the 3-D Hough transform domain. Since we use the 3-D Hough transform domain of the input image directly, the sensitivity to the noise and the high computational complexity could be significantly allcv~ated. Also, the cost efficiency is improved using the robust stereo vision for obtaining depth map image which is needed for 3-D Hough transform. In order lo verify the proposed method, real telephone model is recognized. Thc results of the location and orientation of the model are presented.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.3
• /
• pp.66-76
• /
• 1995

In this research, a mesh connected VLSI structure is proposed for the real time computation of the generalized Hough transform(GHT). The purpose of the research is to design a generalized Hough transformer that can be realized as a single chip processor. The GHT has been modified to yield a highly parallel structure consisting of simple processing elements(PEs) and communication networks. In the proposed structure, the GHT can be computed by first assigning an image pixel to a PE and performing shift and add operations. The result of the CAD circuit simulation shows that it can be computed in the time proportional to the number of pixels in the pattern. In addition to the Hough transformer, the peak detector has been designed to reduce 1)the number of the I/O operations between the transformer and the host computer and 2) the host computer's burden for peak detection by transmitting only the local peaks detected from the transformed accumulator. It is expected that the proposed single chip Hough transformer with peak detector makes a fast and inexpensive edge based object recognition systems possible for many industrial and military applications.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.3
• /
• pp.143-149
• /
• 2014

This paper is on the blind signal separation(BSS) method by the geometric method. To separate the signal sources, we use Hough transform and BSS. Hough transform is a geometric method which let us know the local informations of the signal. We find the orientations of signals by Hough transform and know the number of signal sources. When the number of sensors is more than the number of sources. the BSS algorithm can separate the mixtures well in the time domain. This algorithm has a good performance in converging fast. We had checked up the quality of the algorithm after separating the mixed signals. The results of simulations show that this BSS method has the abnormal waveforms due to unconverging coefficients in the beginning, and stably has the separated waveforms which almost equal to the sources in the most period.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.274-275
• /
• 2004

The Hough transform has been used as a tool for line detection. The main idea of the Hough transform is to transform each pixel in the image individually into the parameter domain. In this way, the Hough transform converts a difficult global detection problem in the image domain into a more easily solved local peak detection problem in the parameter domain. In this paper, we show that the discrete Hough transform is identical to the discrete Radon transform. Thus, we can use the generalized Radon transform to handle more general parameterized curve types.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.421-424
• /
• 2022

Hough transform is a representative algorithm for detecting straight lines in an edge image. It corresponds the parameters of straight lines that may occur in the edge pixel into a parameter space, and detects valid parameters satisfying a given condition as straight lines. In general Hough transform, the parameters of the line are calculated with the image origin as the reference point. However, in this paper, the Hough transform based on the image center as a reference point is performed and its performance is compared and analyzed with the conventional Hough transform.

• Proceedings of the Optical Society of Korea Conference
• /
• 2001.02a
• /
• pp.66-67
• /
• 2001

We explain a method to obtain optical Hough transform filters by use of multiplexed holograms and how they are used for optical pattern recognition.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.455-461
• /
• 2002

This paper presents a new parametric log line equation of polar form for Hough transform in log-polar plane, in which it can remove the well-known unboundedness problem of Hough parameters. Bolduc's method is used to generate a log-polar image dividing the fovea and periphery from a Cartesian image. Edges of the fovea and periphery are detected by using the Sobel mask and the proposed space-variant gradient mask, and are combined in the log-polar plane. The sampled points that might constitute a log line are quite sparse in a deep peripheral region due to severe under-sampling, which is an inherent property of LPM. To cope with such under-sampling, we determine the values of cumulative cells in Hough space by using the space-variant weighting. In our experiments, the proposed method demonstrates its validity of detecting not only the lines passing through both the fovea and periphery but also the lines in a deep periphery.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.44 no.6
• /
• pp.11-20
• /
• 2007

This paper proposes a new efficient method to detect ellipses using a segment merging based Randomized Hough Transform. The key idea of the proposed method is to separate single line segments from an edge image, to estimate ellipses from any pair of the single line segments using Randomized Hough Transform (RHT), and to merge the ellipses. This algorithm is able to accuracy estimate the number of ellipses and largely improves the computational time by reducing iterations.