• Title/Summary/Keyword: hausdorff distance

Search Result 97, Processing Time 0.022 seconds

The Recognition of Grapheme 'ㅁ', 'ㅇ' Using Neighbor Angle Histogram and Modified Hausdorff Distance (이웃 각도 히스토그램 및 변형된 하우스도르프 거리를 이용한 'ㅁ', 'ㅇ' 자소 인식)

  • Chang Won-Du;Kim Ha-Young;Cha Eui-Young;Kim Do-Hyeon
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.2
    • /
    • pp.181-191
    • /
    • 2005
  • The classification error of 'ㅁ', 'ㅇ' is one of the main causes of incorrect recognition in Korean characters, but there haven't been enough researches to solve this problem. In this paper, a new feature extraction method from Korean grapheme is proposed to recognize 'ㅁ', 'ㅇ'effectively. First, we defined an optimal neighbor-distance selection measure using modified Hausdorff distance, which we determined the optimal neighbor-distance by. And we extracted neighbor-angle feature which was used as the effective feature to classify the two graphemes 'ㅁ', 'ㅇ'. Experimental results show that the proposed feature extraction method worked efficiently with the small number of features and could recognize the untrained patterns better than the conventional methods. It proves that the proposed method has a generality and stability for pattern recognition.

  • PDF

PERTURBATION OF DOMAINS AND AUTOMORPHISM GROUPS

  • Fridman, Buma L.;Ma, Daowei
    • Journal of the Korean Mathematical Society
    • /
    • v.40 no.3
    • /
    • pp.487-501
    • /
    • 2003
  • The paper is devoted to the description of changes of the structure of the holomorphic automorphism group of a bounded domain in \mathbb{C}^n under small perturbation of this domain in the Hausdorff metric. We consider a number of examples when an arbitrary small perturbation can lead to a domain with a larger group, present theorems concerning upper semicontinuity property of some invariants of automorphism groups. We also prove that the dimension of an abelian subgroup of the automorphism group of a bounded domain in \mathbb{C}^n does not exceed n.

Object Classification Method using Hilbert Scanning Distance (힐버트 스캔 거리값을 이용한 물체식별 알고리즘)

  • Choi, Jeong-Hwan;Baek, Young-Min;Choi, Jin-Young
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.4
    • /
    • pp.700-705
    • /
    • 2008
  • In this paper, we propose object classification algorithm for real-time surveillance system. We have approached this problem using silhouette-based template matching. The silhouette of the object is extracted, and then it is compared with representative template models. Template models are previously stored in the database. Our algorithm is similar to previous pixel-based template matching scheme like Hausdorff Distance, but we use 1D image array rather than 2D regions inspired by Hilbert Path. Transformation of images could reduce computational burden to compute similarity between the detected image and the template images. Experimental results show robustness and real-time performance in object classification, even in low resolution images.

Selection of Key VOP by Clustering of Approximated Shape in MPEG-4 Compressed Domain (형상 근사화와 클러스터링 기법을 이용한 MPEG-4 영역에서의 키 VOP 선정)

  • 한상진;김용철
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.337-340
    • /
    • 2001
  • 본 논문에서는 MPEG가 비디오 스트림의 형상 정보를 클러스터링 하여 VO(Visual Object)의 동작을 요약하는 새로운 방법을 제안한다. 제안하는 방법은 MPEG-4 비트 스트림의 디코딩 없이 형상 정보를 근사화 한다. 그리고 사용자가 입력한 질의 VOP(Video Object Plane)와 VO의 각 VOP와의 NMHD(Normalized Mean Hausdorff Distance)를 구한 후 클러스터링을 수행하여 키 영역을 분리해낸다. 클러스터링에 의해 시간적으로 분리된 영역의 지속성을 고려하여 Rank를 매김으로써 사용자가 원하는 수의 키 VOP를 선택할 수 있게 한다. 제안하는 방법은 클러스터링을 사용함으로써 키 VOP를 선정하였으며, Rank와 질의 VOP를 사용하여 사용자와의 상호작용이 가능하다.

  • PDF

ERROR ANALYSIS FOR APPROXIMATION OF HELIX BY BI-CONIC AND BI-QUADRATIC BEZIER CURVES

  • Ahn, Young-Joon;Kim, Philsu
    • Communications of the Korean Mathematical Society
    • /
    • v.20 no.4
    • /
    • pp.861-873
    • /
    • 2005
  • In this paper we approximate a cylindrical helix by bi-conic and bi-quadratic Bezier curves. Each approximation method is $G^1$ end-points interpolation of the helix. We present a sharp upper bound of the Hausdorff distance between the helix and each approximation curve. We also show that the error bound has the approximation order three and monotone increases as the length of the helix increases. As an illustration we give some numerical examples.

APPROXIMATION OF QUADRIC SURFACES USING SPLINES

  • Ahn, Young-Joon
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.13 no.3
    • /
    • pp.217-224
    • /
    • 2009
  • In this paper we present an approximation method of quadric surface using quartic spline. Our method is based on the approximation of quadratic rational B$\acute{e}$zier patch using quartic B$\acute{e}$zier patch. We show that our approximation method yields $G^1$ (tangent plane) continuous quartic spline surface. We illustrate our results by the approximation of helicoid-like surface.

  • PDF

Model-Based Moving Object Tracking Algorithm (모델 기반 이동 물체 추적 알고리즘)

  • Kim, Tae-Sik;Kim, Yoon-Ho;Lee, Myong-Kil;Chun, Quan;Lee, Ju-Shin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.05a
    • /
    • pp.356-359
    • /
    • 2000
  • In this paper, we propose a model based moving object tracking algorithm in dynamic scene. To adapt the shape change of the moving object, the Hausdorff distance is applied as the measurement of similarity between model and image. To reduce the processing time, 2-D logarithmic search method is applied for locate the position of moving object. Experiments on a running motorcycle, the result showed that the mean square error of real position and tracking result is 1.845 and consequently, matching process is relatively simple and reduced.

  • PDF

Efficient Video Retrieval Scheme with Luminance Projection Model (휘도투시모델을 적용한 효율적인 비디오 검색기법)

  • Kim, Sang Hyun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.12
    • /
    • pp.8649-8653
    • /
    • 2015
  • A number of video indexing and retrieval algorithms have been proposed to manage large video databases efficiently. The video similarity measure is one of most important technical factor for video content management system. In this paper, we propose the luminance characteristics model to measure the video similarity efficiently. Most algorithms for video indexing have been commonly used histograms, edges, or motion features, whereas in this paper, the proposed algorithm is employed an efficient similarity measure using the luminance projection. To index the video sequences effectively and to reduce the computational complexity, we calculate video similarity using the key frames extracted by the cumulative measure, and compare the set of key frames using the modified Hausdorff distance. Experimental results show that the proposed luminance projection model yields the remarkable improved accuracy and performance than the conventional algorithm such as the histogram comparison method, with the low computational complexity.

Common Fixed Point Theorems of Commuting Mappinggs

  • Park, Wee-Tae
    • The Mathematical Education
    • /
    • v.26 no.1
    • /
    • pp.41-45
    • /
    • 1987
  • In this paper, we give several fixed point theorems in a complete metric space for two multi-valued mappings commuting with two single-valued mappings. In fact, our main theorems show the existence of solutions of functional equations f($\chi$)=g($\chi$)$\in$S$\chi$∩T$\chi$ and $\chi$=f($\chi$)=g($\chi$)$\in$S$\chi$∩T$\chi$ under certain conditions. We also answer an open question proposed by Rhoades-Singh-Kulsherestha. Throughout this paper, let (X, d) be a complete metric space. We shall follow the following notations : CL(X) = {A; A is a nonempty closed subset of X}, CB(X)={A; A is a nonempty closed and founded subset of X}, C(X)={A; A is a nonempty compact subset of X}, For each A, B$\in$CL(X) and $\varepsilon$>0, N($\varepsilon$, A) = {$\chi$$\in$X; d($\chi$, ${\alpha}$) < $\varepsilon$ for some ${\alpha}$$\in$A}, E$\sub$A, B/={$\varepsilon$ > 0; A⊂N($\varepsilon$ B) and B⊂N($\varepsilon$, A)}, and (equation omitted). Then H is called the generalized Hausdorff distance function fot CL(X) induced by a metric d and H defined CB(X) is said to be the Hausdorff metric induced by d. D($\chi$, A) will denote the ordinary distance between $\chi$$\in$X and a nonempty subset A of X. Let R$\^$+/ and II$\^$+/ denote the sets of nonnegative real numbers and positive integers, respectively, and G the family of functions ${\Phi}$ from (R$\^$+/)$\^$s/ into R$\^$+/ satisfying the following conditions: (1) ${\Phi}$ is nondecreasing and upper semicontinuous in each coordinate variable, and (2) for each t>0, $\psi$(t)=max{$\psi$(t, 0, 0, t, t), ${\Phi}$(t, t, t, 2t, 0), ${\Phi}$(0, t, 0, 0, t)} $\psi$: R$\^$+/ \longrightarrow R$\^$+/ is a nondecreasing upper semicontinuous function from the right. Before sating and proving our main theorems, we give the following lemmas:

  • PDF