• 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 IEEK Conference
• /
• 2001.09a
• /
• pp.477-480
• /
• 2001

본 논문에서는 허프만 코딩의 기본 원리인 이진트리로부터 생성된 효율적인 일차원 검색테이블 구성과, 프로세싱 효율을 증가시키기 위한 수치연산 기법의 도입을 통하여 도출된 효율적인 허프만 디코딩 방법을 제시한다. 제안된 방법에서는 허프만 코드화 된 비트스트림으로부터 읽어 들인 비트 데이터를 직접 이진트리를 검색하기 위한 주소연산에 적용함으로써, 기존의 이진트리 검색을 위하여 수행되던 비교 및 분기문의 제거를 가능토록 하였다. 본 논문에서 제안하는 허프만 디코딩 기법은 기존의 비교 및 분기구분에 의하여 수행되던 허프만 디코딩 기법대비 30%이상의 검색속도 증가 및 이진트리 방식의 검색을 수행하기 위하여 필요로 하는 검색테이블에서 존재하던 데이터 및 노드간의 연결주소를 저장하기 위하여 사용되던 메모리 공간을 효율적으로 제거할 수 있는 일차원 검색테이블을 구성함으최써, 기존 방법대비 1/3의 메모리 공간만을 사용하도록 하였다. 제안된 허프만 디코딩 기법의 성능평가를 위하여 MPEG-2 AAC의 허프만 디코더에 적용한 결과 기존의 순차검색방법에 의한 디코딩 기법대비 198%의 성능향상 결과를 확인할 수 있었다.

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

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.360-362
• /
• 2018

본 논문에서는 X-ray 영상에서 척추 영역을 추출 및 분석하여 척추만곡도를 자동으로 측정하는 방법을 제안한다. 제안된 방법은 X-ray 영상에서 어깨뼈와 골반뼈 등과 같이 필요 없는 영역을 제거한 ROI(Region of Interest) 영역을 추출하고, 추출된 ROI 영역에서 척추 에지를 검출하기 위해 가우시안-라플라시안(Laplacian of Gaussian) 필터를 적용하여 척추 에지를 검출한다. 추출된 척추 영역을 척추의 Apex를 기준으로 Above Apex와 Below Apex 영역으로 구분하고 허프 변환(Hough Transform) 기법을 적용하여 두 영역에 대한 ($r,{\theta}$) 허프 공간을 구한다. ($r,{\theta}$) 허프 공간에서 척추만곡도 측정에 필요한 수평 직선만을 검출하기 위하여 수직 직선을 나타내는 교점들의 영역을 제거하여 척추만곡도 측정에 필요한 영역을 추출한다. 제안된 척추 추출 방법을 다양한 X-ray 영상을 대상으로 실험한 결과, 전문의가 척추만곡도를 효과적으로 측정하고 분석할 수 있는 척추 영역이 추출된 것을 확인할 수 있었다.

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

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

• Journal of Korea Multimedia Society
• /
• v.16 no.11
• /
• pp.1288-1296
• /
• 2013

The prominent line at the singe image is the important fact for understanding spatial structure or estimating aesthetic scoring. According to this thesis, the abstraction of the background line helps analyzing vanishing point, reconstitution of 3 dimensions, and determining of image sloppiness. It also makes easy to calculate the rule of thirds. This thesis is composed of section hough transform mapping, prioritizing of the prominent line, and selection of the prominent line. These technologies are departmentalized to be applied abstraction of traffic lane, analyzing of building structure, abstraction of vanishing point, and abstraction of straight line documentation. This gives the choice that users are able to compose technology by considering characteristic of objects and luminous environment. This thesis also can be applied to abstract circle. The interval hough transform is able to select the number of prominent line which users want to abstract. It can analyze important prominent line numbers at the image and then abstract the lines, too. Results of prominent lines by experiments would be show at this thesis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2094-2105
• /
• 1994

This paper contains a Hough transform based projection method derived from Radon transform for tracking dim unresolved(sub-pixel) moving targets that move along straight line parths across a time sequential image data. In contrast to several recently presented Hough transform methods using a compressed image referred to as the track map our proposed technique utilizing a set of projections taken along arbitrary orientations effectively increases the changes of target detection, and creates a robust track estimation environment by incorporating all the available knowledge obtained from the projections. Moreover, in order to quantitatively assess the estimation capability of the projection-based Hough transform algorithm, the analytical bounds on the Hough space parameter errors introduced by image space noise contamination are derived. The simulation yielded promising results of estimating the track parameters even under low signal to noise rations when our technique was tested against the time sequential sets of real infrared image data referred to as the HiCamps.