• Title/Summary/Keyword: distance transform algorithm

Search Result 147, Processing Time 0.032 seconds

A Preprocessing Algorithm for Layered Depth Image Coding (계층적 깊이영상 정보의 압축 부호화를 위한 전처리 방법)

  • 윤승욱;김성열;호요성
    • Journal of Broadcast Engineering
    • /
    • v.9 no.3
    • /
    • pp.207-213
    • /
    • 2004
  • The layered depth image (LDI) is an efficient approach to represent three-dimensional objects with complex geometry for image-based rendering (IBR). LDI contains several attribute values together with multiple layers at each pixel location. In this paper, we propose an efficient preprocessing algorithm to compress depth information of LDI. Considering each depth value as a point in the two-dimensional space, we compute the minimum distance between a straight line passing through the previous two values and the current depth value. Finally, the minimum distance replaces the current attribute value. The proposed algorithm reduces the variance of the depth information , therefore, It Improves the transform and coding efficiency.

3-Dimensional visualizationof heart in EBT images (EBT 단층 영상에서 심장의 3차원 시각화)

  • 원철호;조진호
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.7
    • /
    • pp.37-45
    • /
    • 1998
  • In this paper, we extracted heart region using dyamic contour model, increased the vertical resolution of heart region by proposed 2-dimensional interpolation method and visualized the 3-dimensional hearet volutme. the proposed new energy term of dynamic contour model considering the gray level and direction of controur vectors is effective to extract the closed heart boundary. And, we generatedvertical slice images from the extracted heart region images using the 2-dimensional linear interpolation by DT(distance transform). We showed that proposed algorithm is useful by 3-dimensional visualization of heart volume.

  • PDF

Collision Avoidances of an Autonomous Mobile Robot Hilt Unknown Obstacles (알려지지 않은 장애물 존재시 자율주행 운반체의 장애물 회피)

  • Won, Ji-Uk;Lee, Kee-Seong
    • Proceedings of the KIEE Conference
    • /
    • 1994.11a
    • /
    • pp.345-348
    • /
    • 1994
  • A real-time collision avoidance algorithm for an AMR (Autonomous Mobile Robot) using the Distance Transform and Vector Field Histogram is studied. This approach enables AMR to find a collision-free path with the unknown obstacles. All system parameters including positions of the obstacles can be accepted using a mouse icon and all the obtained trajectories can be displayed on a computer monitor in graphics.

  • PDF

Fast Algorithm for Recognition of Korean Isolated Words (한국어 고립단어인식을 위한 고속 알고리즘)

  • 남명우;박규홍;정상국;노승용
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.1
    • /
    • pp.50-55
    • /
    • 2001
  • This paper presents a korean isolated words recognition algorithm which used new endpoint detection method, auditory model, 2D-DCT and new distance measure. Advantages of the proposed algorithm are simple hardware construction and fast recognition time than conventional algorithms. For comparison with conventional algorithm, we used DTW method. At result, we got similar recognition rate for speaker dependent korean isolated words and better it for speaker independent korean isolated words. And recognition time of proposed algorithm was 200 times faster than DTW algorithm. Proposed algorithm had a good result in noise environments too.

  • PDF

An Accurate Moving Distance Measurement Using the Rear-View Images in Parking Assistant Systems (후방영상 기반 주차 보조 시스템에서 정밀 이동거리 추출 기법)

  • Kim, Ho-Young;Lee, Seong-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.12
    • /
    • pp.1271-1280
    • /
    • 2012
  • In the recent parking assistant systems, finding out the distance to the object behind a car is often performed by the range sensors such as ultrasonic sensors, radars. However, the installation of additional sensors on the used vehicle could be difficult and require extra cost. On the other hand, the motion stereo technique that extracts distance information using only an image sensor was also proposed. However, In the stereo rectification step, the motion stereo requires good features and exacts matching result. In this paper, we propose a fast algorithm that extracts the accurate distance information for the parallel parking situation using the consecutive images that is acquired by a rear-view camera. The proposed algorithm uses the quadrangle transform of the image, the horizontal line integral projection, and the blocking-based correlation measurement. In the experiment with the magna parallel test sequence, the result shows that the line-accurate distance measurement with the image sequence from the rear-view camera is possible.

A Study on the Precise Distance Measurement for Radar Level Transmitter of FMCW Type using Correlation Anaysis Method (상관분석법을 이용한 FMCW 타입 레이더 레벨 트랜스미터의 정밀 거리 측정에 관한 연구)

  • Ji, Suk-Joon;Lee, John-Tark
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.7
    • /
    • pp.1024-1031
    • /
    • 2012
  • In this paper, FMCW type radar level transmitter using correlation analysis method is implemented for precise distance measurement of cargo tank. FMCW type radar level transmitter is the device for distance measurement which calculates the distance by analyzing the beat frequency, that is, the frequency difference between Tx and RX signal from radar antenna using Fast Fourier Transform(FFT), but compensated algorithm like Zoom FFT is needed for the improvement of the frequency precision because the frequency precision of FFT is limited depending on sampling frequency and the number of sampling data. In case of Zoom FFT, the number of sampling data and noisy signal are the main factor influencing the measurement accuracy of Zoom FFT like FFT. Therefore, in order to overcome the limited environment and achieve the precise measurement, correlation coefficient is used for the distance measurement and the errors of measurement are verified to be in the range of ${\pm}1mm$.

Identification of Transformed Image Using the Composition of Features

  • Yang, Won-Keun;Cho, A-Young;Cho, Ik-Hwan;Oh, Weon-Geun;Jeong, Dong-Seok
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.6
    • /
    • pp.764-776
    • /
    • 2008
  • Image identification is the process of checking whether the query image is the transformed version of the specific original image or not. In this paper, image identification method based on feature composition is proposed. Used features include color distance, texture information and average pixel intensity. We extract color characteristics using color distance and texture information by Modified Generalized Symmetry Transform as well as average intensity of each pixel as features. Individual feature is quantized adaptively to be used as bins of histogram. The histogram is normalized according to data type and it is used as the signature in comparing the query image with database images. In matching part, Manhattan distance is used for measuring distance between two signatures. To evaluate the performance of the proposed method, independent test and accuracy test are achieved. In independent test, 60,433 images are used to evaluate the ability of discrimination between different images. And 4,002 original images and its 29 transformed versions are used in accuracy test, which evaluate the ability that the proposed algorithm can find the original image correctly when some transforms was applied in original image. Experiment results show that the proposed identification method has good performance in accuracy test. And the proposed method is very useful in real environment because of its high accuracy and fast matching capacity.

  • PDF

A Lane-Departure Identification Based on Linear Regression and Symmetry of Lane-Related Parameters (차선관련 파라미터의 대칭성과 선형회귀에 기반한 차선이탈 인식)

  • Yi Un-Kun;Lee Joon-Woong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.5
    • /
    • pp.435-444
    • /
    • 2005
  • This paper presents a lane-departure identification (LDI) algorithm for a traveling vehicle on a structured road. The algorithm makes up for the weak points of the former method based on EDF[1] by introducing a Lane Boundary Pixel Extractor (LBPE), the well known Hough transform, and liner regression. As a filter to extract pixels expected to be on lane boundaries, the LBPE plays an important role in enhancing the robustness of LDI. Utilizing the pixels from the LBPE the Hough transform provides the lane-related parameters composed of orientation and distance, which are used in the LDI. The proposed LDI is based on the fact the lane-related parameters of left and right lane boundaries are symmetrical as for as the optical axis of a camera mounted on a vehicle is coincident with the center of lane; as the axis deviates from the center of lane, the symmetrical property is correspondingly lessened. In addition, the LDI exploits a linear regression of the lane-related parameters of a series of successive images. It plays the key role of determining the trend of a vehicle's traveling direction and minimizing the noise effect. Except for the two lane-related parameters, the proposed algorithm does not use other information such as lane width, a curvature, time to lane crossing, and of feet between the center of a lane and the optical axis of a camera. The system performed successfully under various degrees of illumination and on various road types.

Implementation of Fingerprint Recognition System Based on the Embedded LINUX

  • Bae, Eun-Dae;Kim, Jeong-Ha;Nam, Boo-Hee
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1550-1552
    • /
    • 2005
  • In this paper, we have designed a Fingerprint Recognition System based on the Embedded LINUX. The fingerprint is captured using the AS-S2 semiconductor sensor. To extract a feature vector we transform the image of the fingerprint into a column vector. The image is row-wise filtered with the low-pass filter of the Haar wavelet. The feature vectors of the different fingerprints are compared by computing with the probabilistic neural network the distance between the target feature vector and the stored feature vectors in advance. The system implemented consists of a server PC based on the LINUX and a client based on the Embedded LINUX. The client is a Tynux box-x board using a PXA-255 CPU. The algorithm is simple and fast in computing and comparing the fingerprints.

  • PDF

Implementation of Fingerprint Cognition System Based on the Embedded LINUX (임베디드 리눅스 기반의 지문 인식 시스템 구현)

  • Bae, Eun-Dae;Kim, Jeoung-Ha;Nam, Boo-Hee
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.204-206
    • /
    • 2005
  • In this paper, we have designed a Fingerprint Recognition System based on the Embedded LINUX. The fingerprint is captured using the AS-S2 semiconductor sensor. To extract a feature vector we transform the image of t10he fingerprint into a column vector. The image is row-wise filtered with the low-pass filter of the Haar wavelet. The feature vectors of the different fingerprints are compared by computing with the probabilistic neural network the distance between the target feature vector and the stored feature vectors in advance. The system implemented consists of a server PC based on the LINUX and a client based on the Embedded LINUX. The client is a Tynux box-x board using a PXA-255 CPU. The algorithm is simple and fast in computing and comparing the fingerprints.

  • PDF