• Title/Summary/Keyword: distance transform

Search Result 431, Processing Time 0.032 seconds

An Analysis on Face Recognition system of Housdorff Distance and Hough Transform (Housdorff Distance 와 Hough Transform을 적용한 얼굴인식시스템의 분석)

  • Cho, Meen-Hwan
    • Journal of the Korea Computer Industry Society
    • /
    • v.8 no.3
    • /
    • pp.155-166
    • /
    • 2007
  • In this paper, captured face-image was pre-processing, segmentation, and extracting features from thinning by differential operator and minute-delineation. A straight line in slope-intercept form was transformed at the $r-\theta$ domain using Hough Transform, instead of Housdorff distance are extract feature as length, rotation, displacement of lines from thinning line components by differentiation. This research proposed a new approach compare with Hough Transformation and Housdorff Distance for face recognition so that Hough transform is simple and fast processing of face recognition than processing by Housdorff Distance. Rcognition accuracy rate is that Housdorff method is higher than Hough transformation's method.

  • PDF

2-D object recognition using distance transform on morphological skeleton (형태학적 골격에서의 거리 변환을 이용한 2차원 물체 인식)

  • 권준식;최종수
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.7
    • /
    • pp.138-146
    • /
    • 1996
  • In this paper, w epropose a new mehtod to represent the shape and to recognize the object. The shape description and the matching is implemented by using the distance transform on the morphological skeleton. The employed distance transform is the chamfer (3,4) distance transform, because the chamfer distance transform (CDT) has an approximate value to the euclidean distance. The 2-D object can be represented by means of the distribution of the distance transform on the morphological skeleton, the number of skeletons, the sum of the CDT, and the other features are employed as the mtching parameters. The matching method has the invariant features (rotation, translation, and scaling), and then the method is used effectively for recognizing the differently-posed objects and/or marks of the different shape and size.

  • PDF

Distance Transform Path Planning using DEM and Obstacle Map (DEM과 장애물 지도를 이용한 거리변환 경로계획)

  • Choe, Tok-Son;Jee, Tae-Young;Kim, Jun;Park, Yong-Woon;Ryu, Chul-Hyung
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.92-94
    • /
    • 2005
  • Unmanned ground vehicles(UGVs) are expected to play a key role in the future army. These UGVs would be used for weapons platforms. logistics carriers, reconnaissance, surveillance, and target acquisition in the rough terrain. Most of path planning methodologies for UGVs offer an optimal or sub-optimal shortest-path in a 20 space. However, those methodologies do not consider increment and reduction effects of relative distance when a UGV climbs up or goes down in the slope of rough terrain. In this paper, we propose a novel path planning methodology using the modified distance transform algorithm. Our proposed path planning methodology employs two kinds of map. One is binary obstacle map. The other is the DEM. With these two maps, the modified distance transform algorithm in which distance between cells is increased or decreased by weighting function of slope is suggested. The proposed methodology is verified by various simulations on the randomly generated DEM and obstacle map.

  • PDF

Robust Oriented Hausdorff Measure for 2-D Object Matching (이차원 물체 정합을 위한 Robust Oriented Hausdorff Measure)

  • Sim, Dong-Gyu;Park, Rae-Hong
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.11
    • /
    • pp.60-67
    • /
    • 1999
  • This paper proposes a robust oriented Hausdorff measure (ROHM) for 20D object matching. The ROHM is introduced by replacing the distance concept of the conventional Hausdorff distance (HD) algorithm by the accumulation scheme of the Hough transform (HT). The proposed algorithm can be considered as the modified directed HT using the distance transform (DT). The orientation information at each pixel is also used for removing incorrect correspondences. Experiments with various test images show that the performance of the proposed algorithm is better than that of conventional HD algorithms considered.

  • PDF

Distance Transform Using Upper Mean (Upper Mean을 이용한 Distance Transform)

  • Park Joungwook;Park Jeungchul;Lee Kwan H.
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.718-720
    • /
    • 2005
  • 반짝이는 물체를 촬영하면 이미지에 하이라이트(highlight)와 반짝거림(specularity)이 발생한다. 하이라이트가 발생한 이미지에서 하이라이트를 제거하고 원색으로 복원하는 방법 중에 하나가 하이라이트 색 복원(inpainting)이다. 하이라이트 색을 복원하는 과정은 다음 두 단계로 구성된다. 첫 단계로 하이라이트의 위치를 알고 있다고 가정하aus 하이라이트의 주변 영역을 찾고 CL-projection을 이용해 주변 영역의 색에서 하이라이트나 반짝거림의 영향을 제거한다. 두 번째 단계로 하이라이트 주변 영역의 색을 기반으로 upper mean을 이용하여 distance transform을 수행한다. Upper mean을 이용한 distance transform의 가장 큰 장점은 하이라이트 주변을 보정하고 그 정보를 이용하기 때문에 하이라이트 색을 복원할 뿐만 아니라 반짝거림에 대한 보정도 된다.

  • PDF

Improvement of Digital Distance Relaying Algorithm Using Wavelet Transform in Combined Transmission Line (웨이브렛을 이용한 혼합송전선로에서의 거리계전 알고리즘 개선)

  • 정채균;김경호;하체웅;이종범;윤양웅
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.52 no.10
    • /
    • pp.593-601
    • /
    • 2003
  • Distance realy is tripped by the line impedance calculated at the relay point. Accordingly the accurate operation depends on the precise calculation of line impedance. Impedance can be accurately calculated in case of overhead line. However, in case of power cables or combined transmission lines, impedance can not be accurately calculated because cable systems have the sheath, grounding resistance, and sheath voltage limiters(SVLs). There are also several grounding systems in cable systems. Therefore, if there is a fault in cable systems, these terms will severely be caused much error to calculation of impedance. Accordingly the proper compensation should be developed for the correct operation of the distance relay. This paper presents the distance calculating algorithm in combined transmission line with power cable using wavelet transform. In order to achieve such purpose, judgement method to discriminate the fault section in both sections was proposed using D1 coefficient summation in db4. And also, error compensation value was proposed for correct calculation of impedance in power cables section.

Estimation of target distance based on fractional Fourier transform analysis of active sonar linear frequency modulation signals (능동소나 linear frequency modulation 신호의 fractional Fourier transform 분석에 기반한 표적의 거리 추정)

  • Hyung, Sungwoong;Park, Myungho;Hwang, Soobok;Bae, Keunsung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.35 no.1
    • /
    • pp.8-15
    • /
    • 2016
  • As a generalized form of the conventional Fourier transform, fractional Fourier transform (FrFT) can analyze a signal at intermediate domain between time and frequency domains with a transform order ${\alpha}$. Especially, FrFT has a number of advantages in the analysis of LFM (Linear Frequency Modulation) signals due to its robustness to noise. In this paper, we have proposed a new method to detect and estimate the distance of the target from the FrFT spectrum of the received echo signal. Experimental results have validated the proposed method, and shown that reliable target distance could be estimated in noise and reverberation environments.

ON THE STABILITY OF MEDIAL AXIS TRANSFORM

  • Choi, Sung-Woo
    • Journal of applied mathematics & informatics
    • /
    • v.23 no.1_2
    • /
    • pp.419-433
    • /
    • 2007
  • Medial axis transform (MAT) is very sensitive to noise, in the sense that, even if a shape is perturbed only slightly, the Hausdorff distance between the MATs of the original shape and the perturbed one may be large. Recently, Choi et al.(2002) showed that MAT is stable for a class of 2D domains called weakly injective, if we view this phenomenon with the one-sided Hausdorff distance, rather than with the two-sided Hausdorff distance. In this paper, we extend this result to general 2D domains with natural boundary regularity. We also present explicit bounds for this general one-sided stability of the 2D MAT.

Finding the Ball with WaterShed Algorism (Water Shed 알고리듬을 이용한 공 찾기)

  • Yu Ji-Chul;Kim Young-Kil
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.833-836
    • /
    • 2006
  • This is the paper for the finding the hidden ball with the Water Shed Algorism, and for analyzing the weakness. So, With this paper, Other institutions or organizations can improve their researching. For this researching, Visual Studio C++ is used, and some kinds of Algorism is added to the software such as Distance Transform, Labelling which we make.

  • PDF

Finding the Ball with WaterShed Algorism (Water Shed 알고리듬을 이용한 공 찾기)

  • Yu, Ji-Chul;Kim, Young-Kil
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.5
    • /
    • pp.882-888
    • /
    • 2007
  • This is the paper for finding the hidden ball with the Water Shed Algorism, and for analyzing the weakness. So, With this paper, Other institutions or organizations can improve their research skill. For this research, Visual Studio C++ is used, and some kinds of Algorism is added to the software such as Distance Transform, Labelling which we make.