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

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.257-260
• /
• 2001

본 논문에서는 2 채널 MAIN 프로필 MPEG-2 AAC 복호화 시스템의 구조를 제안하고 구현하였다. 복호화 알고리듬의 구조적인 모듈화에 근거하여, 시스템 설계 과정에서 전체 시스템을 3 개의 하드웨어 모듈로 분할하였다. 전체 시스템은 허프만 복호화기, 예측기, 20 비트 고정소수점 DSP 코어로 이루어져 있다. 허프만 복호화기는 주어진 작업을 1 클럭 사이클 내에 수행할 수 있는 고속의 하드와이어드 모듈이고, 예측기는 높은 해상도를 가지고 다른 모듈들과 병렬처리가 가능한 구조를 가진 모듈이다. 구현된 시스템은 16.9 MIPS 로 2 채널의 MPEG-2 AAC 비트열을 고음질로 복호화할 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.824-833
• /
• 2004

Due to the bandwidth and storage limitations, medical images are needed to be compressed before transmission and storage. DICOM (Digital Imaging and Communications in Medicine) specification, which is the medical images standard, provides a mechanism for supporting the use of JPEG still image compression standard. In this paper, we explain a method for compressing medical images by JPEG standard and propose two methods for JPEG compression. First, because medical images differ from natural images in optical feature, we propose a method to design adaptively the quantization table using spectrum analysis. Second, because medical images have higher pixel depth than natural images do, we propose a method to design Huffman table which considers the probability distribution feature of symbols. Therefore, we propose methods to design a quantization table and Huffman table suitable for medical images. Simulation results show the improved performance compared to the quantization table and the adjusted Huffman table of JPEG standard. Proposed methods which are satisfied JPEG Standard, can be applied to PACS (Picture Archiving and Communications System).

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

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

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2615-2628
• /
• 1997

In this paper, a new codebook design algorithm is proposed. It uses a DCT map based on two-dimensional discrete cosine of transform (2D DCT) and finite state vector quantizer (FSVQ) when the vector quantizer is designed for image transmission. We make the map by dividing input image according to edge quantity, then by the map, the significant features of training image are extracted by using the 2D DCT. A master codebook of FSVQ is generated by partitioning the training set using binary tree based on tree-structure. The state codebook is constructed from the master codebook, and then the index of input image is searched at not master codebook but state codebook. And, because the coding of index is important part for high speed digital transmission, it converts fixed length codes to variable length codes in terms of entropy coding rule. The huffman coding assigns transmission codes to codes of codebook. This paper proposes single-side growing huffman tree to speed up huffman code generation process of huffman tree. Compared with the pairwise nearest neighbor (PNN) and classified VQ (CVQ) algorithm, about Einstein and Bridge image, the new algorithm shows better picture quality with 2.04 dB and 2.48 dB differences as to PNN, 1.75 dB and 0.99 dB differences as to CVQ respectively.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1998.06a
• /
• pp.1044-1048
• /
• 1998