• Title/Summary/Keyword: Shape matching

Search Result 437, Processing Time 0.024 seconds

Pruning and Matching Scheme for Rotation Invariant Leaf Image Retrieval

  • Tak, Yoon-Sik;Hwang, Een-Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제2권6호
    • /
    • pp.280-298
    • /
    • 2008
  • For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf’s center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.

Relaxation을 이용한 2차원 물체의 형상매칭에 관한 연구 (A Study on Shape Matching of Two-Dimensional Object using Relaxation)

  • 곽윤식;이대령
    • 한국통신학회논문지
    • /
    • 제18권1호
    • /
    • pp.133-142
    • /
    • 1993
  • 본 논문은 2차원 물체의 형상 매칭에 관한것으로 다각근사화된 단순 2차원 물체에 적용하였다. 많은 형상 매칭 방법론이 수학적 벡터의 의현에 기초를 두고 확솔적인 패턴 인식을 사용하고 있다. 유출된 형상의 다양성과 많은 데이타량은 형상의 전체적인 구조의 관계를 나타내는데 단점을 갖고 있다. 본 논문에서는 영상을 다 각근사적 과정를 통하여 Relaxation 라벨링 기술을 이용함으로써 형상 매칭의 지점을 해결하였다.

  • PDF

필기체 한글의 오프라인 인식을 위한 효과적인 두 단계 패턴 정합 방법 (Efficient two-step pattern matching method for off-line recognition of handwritten Hangul)

  • 박정선;이성환
    • 전자공학회논문지B
    • /
    • 제31B권4호
    • /
    • pp.1-8
    • /
    • 1994
  • In this paper, we propose an efficient two-step pattern matching method which promises shape distortion-tolerant recognition of handwritten of handwritten Hangul syllables. In the first step, nonlinear shape normalization is carried out to compensate for global shape distortions in handwritten characters, then a preliminary classification based on simple pattern matching is performed. In the next step, nonlinear pattern matching which achieves best matching between input and reference pattern is carried out to compensate for local shape distortions, then detailed classification which determines the final result of classification is performed. As the performance of recognition systems based on pattern matching methods is greatly effected by the quality of reference patterns. we construct reference patterns by combining the proposed nonlinear pattern matching method with a well-known averaging techniques. Experimental results reveal that recognition performance is greatly improved by the proposed two-step pattern matching method and the reference pattern construction scheme.

  • PDF

일부가 가리워진 2차원 물체의 형상 정합 알고리즘 (A Shape Matching Algorithm for Occluded Two-Dimensional Objects)

  • 박충수;이상욱
    • 대한전자공학회논문지
    • /
    • 제27권12호
    • /
    • pp.1817-1824
    • /
    • 1990
  • This paper describes a shape matching algorithm for occluded or distorted two-dimensional objects. In our approach, the shape matchin is viewed as a segment matching problem. A shape matching algorithm, based on both the stochastic labeling technique and the hypothesis generate-test paradigm, is proposed, and a simple technique which performs the stochastic labeling process in accordance with the definition of consisten labeling assignment without requiring an iterative updating process of probability valiues is also proposed. Several simulation results show that the proposed algorithm is very effective when occlusion, scaling or change of orientation has occurred in the object.

  • PDF

Bottom-Up Segmentation Based Robust Shape Matching in the Presence of Clutter and Occlusion

  • Joo, Han-Byul;Jeong, Ye-Keun;Kweon, In-So
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 2009년도 IWAIT
    • /
    • pp.307-310
    • /
    • 2009
  • In this paper, we present a robust shape matching approach based on bottom-up segmentation. We show how over-segmentation results can be used to overcome both ambiguity of contour matching and occlusion. To measure the shape difference between a template and the object in the input, we use oriented chamfer matching. However, in contrast to previous work, we eliminate the affection of the background clutters before calculating the shape differences using over-segmentation results. By this method, we can increase the matching cost interval between true matching and false matching, which gives reliable results. Finally, our experiments also demonstrate that our method is robust despite the presence of occlusion.

  • PDF

Noninformative Priors for the Common Shape Parameter in the Gamma Distributions

  • Kang, Sang-Gil;Kim, Dal-Ho;Lee, Woo-Dong
    • Journal of the Korean Data and Information Science Society
    • /
    • 제18권1호
    • /
    • pp.247-257
    • /
    • 2007
  • In this paper, we develop the noninformative priors for the common shape parameter in the gamma distributions. We develop the matching priors and reveal that the second order matching prior does not exist. It turns out that the one-at-a-time reference prior and the two group reference prior satisfy a first order probability matching criterion. Some simulation study is peformed.

  • PDF

Noninformative priors for the common shape parameter of several inverse Gaussian distributions

  • Kang, Sang Gil;Kim, Dal Ho;Lee, Woo Dong
    • Journal of the Korean Data and Information Science Society
    • /
    • 제26권1호
    • /
    • pp.243-253
    • /
    • 2015
  • In this paper, we develop the noninformative priors for the common shape parameter of several inverse Gaussian distributions. Specially, we want to develop noninformative priors which satisfy certain objective criterion. The probability matching priors and reference priors of the common shape parameter will be developed. It turns out that the second order matching prior does not exist. The reference priors satisfy the first order matching criterion, but Jeffrey's prior is not the first order matching prior. We showed that the proposed reference prior matches the target coverage probabilities in a frequentist sense through simulation study, and an example based on real data is given.

폭풍해일 침수예상도 검증을 위한 형상유사도 분석 : 형상기준 (Shape Similarity Analysis for Verification of Hazard Map for Storm Surge : Shape Criterion)

  • 김영인;김동현;이승오
    • 한국방재안전학회논문집
    • /
    • 제12권3호
    • /
    • pp.13-24
    • /
    • 2019
  • 실시간 재난위험도 예측 모델인 SIND 모델의 정확도 확인 및 검증을 위해 다양한 형상유사도 개념을 적용하였다. 기하학적 방법론 중에서 가장 널리 이용되는 CRITIC 기법은 침수예상도와 같은 복잡한 지형 형상에 적용하기에는 분명한 한계점을 보여서 본 연구에서는 복잡한 전파특성의 형상을 평가할 수 있는 RCCI와 TF 등과 같은 형상인자를 추가하여 수정된 CRITIC 기법을 제시하였다. 본 연구에서 제안된 형상유사도 평가 방법을 폭풍해일의 침수예상도에 적용하여 검토한 결과, 면 객체 쌍들을 수동으로 정 매칭쌍과 오 매칭쌍으로 구분하였으며, 각 형상 인자들, 위치기준, 면적기준, 형상 기준의 가중치들을 변화시켜가며 각 매칭쌍의 형상유사도를 산정하였다. 본 연구에서 제안된 방법론과 산정된 가중치를 참고자료인 침수예상도의 지도 객체와 목표자료인 SIND 모델결과의 객체에 적용한 결과, 정 매칭쌍은 약 90%가 형상유사도 0.5 이상의 값을 가졌고, 오 매칭쌍은 약 70%가 0.5 미만으로 나타났다. 향후 다수의 객체가 하나의 객체와 대응되는 점을 보완 조정한다면 정 매칭쌍의 형상유사도는 전체적으로 증가하고 오 매칭쌍의 형상유사도는 감소할 것이라 판단된다.

2D Sketch Based Query Interface with Coarse Filter for 3D Shape Matching

  • Lee, Jae-Ho;Park, Joon-Young
    • International Journal of CAD/CAM
    • /
    • 제7권1호
    • /
    • pp.113-120
    • /
    • 2007
  • Sketch based query plays an important role in shape matching for 3D shape retrieval system. Some researchers suggest the sketch based query interfaces. It is more effective to capture the needs of users rather than query by example. In this paper, we propose a new 2D sketch based query interface with coarse filters for shape matching. Coarse filtering enables to eliminate unfavorable shapes from shapes in DB. For the purpose of coarse filtering, we use two filters with the topological and geometric patterns. For the validity of our method, we show the experimental results.

파수영역매칭을 통한 링 형상의 음향집적공간 형성 (Ring-shaped Sound Focusing using Wavenumber Domain Matching)

  • 박진영;김양한
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2006년도 추계학술대회논문집
    • /
    • pp.506-509
    • /
    • 2006
  • Shaped Sound Focusing is defined as the generation of acoustically bright shape in space using multiple sources. The acoustically bright shape is a spatially focused region with relatively high acoustic potential energy level. In view of the energy transfer, acoustical focusing is essential because acoustic energy is very small to use other type of energy. Practically, focused sound shape control not a point is meaningful because there are so many needs to enlarge the focal region especially in clinical uses and others. If focused sound shape can be controlled, it offers various kinds of solutions for clinical uses and others because a regional focusing is essentially needed to reduce a treatment time and enhance the performance of transducers. For making the shaped-sound field, control variables, such as a number of sources, excitation frequency, source positioning, etc., should be taken according to geometrical sound shape. To verify these relations between them, wavenumber domain matching method is suggested because wavenumber spectrum can provide the information of control variables of sources. In this paper, the procedures of shaped sound focusing using wavenumber domain matching and relations between control variables and geometrical sound shape are covered in case of an acoustical ring.

  • PDF