• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.383-386
• /
• 2007

허프 변환(Hough transform)은 영상에서 몇 개의 파라미터로 표현되는 기하학적 요소 추출을 위해 널리 사용되고 있는 방법 중 하나이다. 하지만 허프 변환은 영상의 한 픽셀이 허프 공간(Hough space)의 한 방정식에 대응되는 일대다 특성으로 인해 잡음에 민감한 특성을 갖는다. 이러한 잡음 민감성은 검출되는 직선의 개수뿐만이 아니라 검출된 직선의 품질에도 영향을 미칠 수 있다. 즉, 실제 직선에서 벗어난 직선이 검출되거나 하나의 실제 직선에 대해 여러 개의 직선이 검출되는 등의 직선 왜곡이 발생할 수 있다. 이러한 직선 왜곡은 잡음 이외에도 허프 공간의 설정, 특히 각 해상도의 설정에 영향을 받는다. 이 논문에서는 기존의 허프 변환에서 발생하는 이러한 직선 왜곡을 분석하고, 잡음 민감성을 줄이기 위해 제안된 경계선 강도 허프 변환(Edge Strength Hough Transform, ESHT)에서 이러한 왜곡이 적게 발생함을 보인다. 또한 ESHT에서만 발생할 수 있는 왜곡을 분석하고 해결방안을 제시한다. 제시한 방법에 의해 직선의 왜곡이 감소하는 것은 실험 결과를 통해 확인할 수 있다.

• 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 Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.728-731
• /
• 2007

Though the Hough transform is a well-known method for detecting analytical shape represented by a number of free parameters, the basic property of the Hough transform, the one-to-many mapping from an image space to a Hough space, causes the innate problem, the sensitivity to noise. To remedy this problem, Edge Strength Hough Transform (ESHT) was proposed and proved to reduce the noise sensitivity. However the performance of ESHT depends on the size of a Hough space and image and some other parameters, which play an important role in ESHT and should be decided experimentally. In this paper, we derived a formula to decide decreasing parameter. Using the derived formulae, the decreasing parameter value can be decided only with the pre-determined values, the size of a Hough space and an image, which make it possible to decide them automatically.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.11
• /
• pp.2055-2061
• /
• 2006

The detection of geometric primitives from a digital image is one of the basic tasks in computer vision area and the Hough transform is a well-known method for detecting analytical shape represented by a number of free parameters. However the basic property of the Hough transform, the one-to-many mapping from an image space to a Hough space, causes the innate problem, the sensitivity to noise. In this paper, we proposed Edge Strength Hough Transform which uses edge strength to reduce the sensitivity to noise and proved the insensitivity using the ratio of peaks in a Mough space. We also experimented the proposed method on lines and got small number of peaks in a Hough space compared to traditional Hough transform, which supports the noise insensitivity of the proposed method.

• Journal of Convergence for Information Technology
• /
• v.7 no.6
• /
• pp.143-151
• /
• 2017

The generalized Hough transform(GHough) can be used effectively for detecting and extracting an arbitrary-shaped 2-D model in an input image. However, the main drawbacks of the GHough are both heavy computation and an excessive storage requirement. Thus, most of the researches so far have focused on reducing both the time and space requirement of the GHough. But it is still not clear how well their improved algorithms will perform under various noise in an input image. Thus, this paper proposes a new framework that can measure the performance of the GHough quantitatively. For this purpose, we view the GHough as a detector in signal detection theory and the ROC curve will be used to specify the performance of the GHough. Finally, we show that we can evaluate the GHough under various noise conditions in an input image.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.674-677
• /
• 2017

The Hough transform is the most representative algorithm for a straight line detection based on edge pixels. It shows excellent performance in a simple linear image but requires a considerable amount of computation in a noisy or complex image and has a problem of detecting a pseudo straight line easily. In this paper, we propose a straight line detection algorithm to solve the problem of the conventional Hough transform. The proposed algorithm detects the straight line information of edge pixels by using principal component analysis (PCA) before performing Hough transform and performs the Hough transform of the limited slope area in the valid edge pixels based on the detected straight line information of edge pixels. Simulation results show that the proposed algorithm reduces the amount of computation as well as eliminates pseudo straight lines.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.5
• /
• pp.575-581
• /
• 2007

Though the Hough transform is a well-known method for detecting analytical shape represented by a number of free parameters, the basic property of the Hough transform, the one-to-many mapping from an image space to a Hough space, causes the innate problem, the sensitivity to noise. To remedy this problem, Edge Strength Hough Transform (ESHT) was proposed and proved to reduce the noise sensitivity. However the performance of ESHT depends on the size of a Hough space and image and some other parameters which should be decided experimentally. In this paper, we derived formulae to decide 2 parameter values; decreasing parameter and broadening parameter, which play an important role in ESHT. Using the derived formulae, 2 parameter values can be decided only with the pre-determined values, the size of a Hough space and an image, which make it possible to decide them automatically. The experiments with different parameter values also support the result.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.369-377
• /
• 2008

Though the Hough transform(HT) is a well-known method for detecting analytical shape represented by a number of free parameters, the basic property of the HT, the one-to-many mapping from an image spare to a Hough space, causes the innate problem, the sensitivity to noise. This basic problem also deteriorates the quality of detected lines and makes the detected line deviated from the real one or generates some bogus, multiple lines where only one real line exists. The size of Hough space also affects the quality of detected lines. In this paper, we analyzed the line distortions in the traditional Hough transform and showed that the distortions are relieved in the edge strength Hough transform(ESHT), which is a modified HT. However the usage of expanded edge and edge strength in ESHT can cause some new line distortions which do not exist in the HT. These new ones can be solved by a proper setting of decreasing and broadening parameter values and the optimal values can be determined only by some pre-determined values. We also illustrated several examples to show the distortion-decreasing property of ESHT.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.12
• /
• pp.1868-1873
• /
• 2021

This paper proposes the Hough transform(HT) using an extended lookup table(LUT) to reduce the computational burden of the HT that is a typical straight line detection algorithm, and analyzes its performance. The conventional HT also uses a LUT to the calculation of the parameter 𝜌 of all straight lines passing through an edge pixel of interest(ePel) in order to reduce the computational burden. However, the proposed HT adopts an extended LUT that can be applied to straight lines across the ePel as well as its peripheral edge pixels to induce more computational reduction. This paper proves the validity of the proposed algorithm mathematically and also verifies it through simulation. The simulation results show that the proposed HT reduces the multiplication computation from 49.6% up to 16.1%, depending on the image and the applied extended LUT, compared to the conventional HT.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.2
• /
• pp.193-200
• /
• 2013

In this paper, underwater acoustic image classification of a cylindrical object using the Hough transformation is proposed. Hough transformation is often used to classify a cylindrical object in the optical systems. However, it is difficult to apply to the underwater acoustic image system because of lower resolution and noisier underwater environments. Thus, the cylindrical object was modeled and its geometric depth(GD) pixels were restored in order to make them suitable for the Hough transformation by using moving average filter and a polynomial interpolation method. As a result, restored GD pixels are similar to original ones and test results show high performance in classification.