• 제목/요약/키워드: Similarity Matching

검색결과 411건 처리시간 0.024초

최소고유치로 분할된 영상의 영역기반 유사도를 이용한 목표추적 (An Approach to Target Tracking Using Region-Based Similarity of the Image Segmented by Least-Eigenvalue)

  • 오홍균;손용준;장동식;김문화
    • 제어로봇시스템학회논문지
    • /
    • 제8권4호
    • /
    • pp.327-332
    • /
    • 2002
  • The main problems of computational complexity in object tracking are definition of objects, segmentations and identifications in non-structured environments with erratic movements and collisions of objects. The object's information as a region that corresponds to objects without discriminating among objects are considered. This paper describes the algorithm that, automatically and efficiently, recognizes and keeps tracks of interest-regions selected by users in video or camera image sequences. The block-based feature matching method is used for the region tracking. This matching process considers only dominant feature points such as corners and curved-edges without requiring a pre-defined model of objects. Experimental results show that the proposed method provides above 96% precision for correct region matching and real-time process even when the objects undergo scaling and 3-dimen-sional movements In successive image sequences.

패턴 매칭을 이용한 EKF 기반 이동 로봇 실내 위치 추정 (EKF based Mobile Robot Indoor Localization using Pattern Matching)

  • 김석용;이지홍
    • 로봇학회논문지
    • /
    • 제7권1호
    • /
    • pp.45-56
    • /
    • 2012
  • This paper proposes how to improve the performance of CSS-based indoor localization system. CSS based localization utilizes signal flight time between anchors and tag to estimate distance. From the distances, the 3-dimensional position is calculated through trilateration. However the error in distance caused from multi-path effect transfers to the position error especially in indoor environment. This paper handles a problem of reducing error in raw distance information. And, we propose the new localization method by pattern matching instead of the conventional localization method based on trilateration that is affected heavily on multi-path error. The pattern matching method estimates the position by using the fact that the measured data of near positions possesses a high similarity. In order to gain better performance of localization, we use EKF(Extended Kalman Filter) to fuse the result of CSS based localization and robot model.

수중에서의 특징점 매칭을 위한 CNN기반 Opti-Acoustic변환 (CNN-based Opti-Acoustic Transformation for Underwater Feature Matching)

  • 장혜수;이영준;김기섭;김아영
    • 로봇학회논문지
    • /
    • 제15권1호
    • /
    • pp.1-7
    • /
    • 2020
  • In this paper, we introduce the methodology that utilizes deep learning-based front-end to enhance underwater feature matching. Both optical camera and sonar are widely applicable sensors in underwater research, however, each sensor has its own weaknesses, such as light condition and turbidity for the optic camera, and noise for sonar. To overcome the problems, we proposed the opti-acoustic transformation method. Since feature detection in sonar image is challenging, we converted the sonar image to an optic style image. Maintaining the main contents in the sonar image, CNN-based style transfer method changed the style of the image that facilitates feature detection. Finally, we verified our result using cosine similarity comparison and feature matching against the original optic image.

실외 이동로봇의 고도지도 기반의 전역 위치추정을 위한 Hausdorff 거리 정합 기법 (Hausdorff Distance Matching for Elevation Map-based Global Localization of an Outdoor Mobile Robot)

  • 지용훈;송재복;백주현;유재관
    • 제어로봇시스템학회논문지
    • /
    • 제17권9호
    • /
    • pp.916-921
    • /
    • 2011
  • Mobile robot localization is the task of estimating the robot pose in a given environment. This research deals with outdoor localization based on an elevation map. Since outdoor environments are large and contain many complex objects, it is difficult to robustly estimate the robot pose. This paper proposes a Hausdorff distance-based map matching method. The Hausdorff distance is exploited to measure the similarity between extracted features obtained from the robot and elevation map. The experiments and simulations show that the proposed Hausdorff distance-based map matching is useful for robust outdoor localization using an elevation map. Also, it can be easily applied to other probabilistic approaches such as a Markov localization method.

A Statistical Matching Method with k-NN and Regression

  • Chung, Sung-S.;Kim, Soon-Y.;Lee, Seung-S.;Lee, Ki-H.
    • Journal of the Korean Data and Information Science Society
    • /
    • 제18권4호
    • /
    • pp.879-890
    • /
    • 2007
  • Statistical matching is a method of data integration for data sources that do not share the same units. It could produce rapidly lots of new information at low cost and decrease the response burden affecting the quality of data. This paper proposes a statistical matching technique combining k-NN (k-nearest neighborhood) and regression methods. We select k records in a donor file that have similarity in value with a specific observation of the common variable in a recipient file and estimate an imputation value for the recipient file, using regression modeling in the donor file. An empirical comparison study is conducted to show the properties of the proposed method.

  • PDF

A Persistent Naming of Shells

  • Marcheix, David
    • International Journal of CAD/CAM
    • /
    • 제6권1호
    • /
    • pp.125-137
    • /
    • 2006
  • Nowadays, many commercial CAD systems support history-based, constraint-based and feature-based modeling. Unfortunately, most systems fail during the re-evaluation phase when various kind of topological changes occur. This issue is known as "persistent naming" which refers to the problem of identifying entities in an initial parametric model and matching them in the re-evaluated model. Most works in this domain focus on the persistent naming of atomic entities such as vertices, edges or faces. But very few of them consider the persistent naming of aggregates like shells (any set of faces). We propose in this paper a complete framework for identifying and matching any kind of entities based on their underlying topology, and particularly shells. The identifying method is based on the invariant structure of each class of form features (a hierarchical structure of shells) and on its topological evolution (an historical structure of faces). The matching method compares the initial and the re-evaluated topological histories, and computes two measures of topological similarity between any couple of entities occurring in both models. The naming and matching method has been implemented and integrated in a prototype of commercial CAD Software (Topsolid).

Patent Document Similarity Based on Image Analysis Using the SIFT-Algorithm and OCR-Text

  • Park, Jeong Beom;Mandl, Thomas;Kim, Do Wan
    • International Journal of Contents
    • /
    • 제13권4호
    • /
    • pp.70-79
    • /
    • 2017
  • Images are an important element in patents and many experts use images to analyze a patent or to check differences between patents. However, there is little research on image analysis for patents partly because image processing is an advanced technology and typically patent images consist of visual parts as well as of text and numbers. This study suggests two methods for using image processing; the Scale Invariant Feature Transform(SIFT) algorithm and Optical Character Recognition(OCR). The first method which works with SIFT uses image feature points. Through feature matching, it can be applied to calculate the similarity between documents containing these images. And in the second method, OCR is used to extract text from the images. By using numbers which are extracted from an image, it is possible to extract the corresponding related text within the text passages. Subsequently, document similarity can be calculated based on the extracted text. Through comparing the suggested methods and an existing method based only on text for calculating the similarity, the feasibility is achieved. Additionally, the correlation between both the similarity measures is low which shows that they capture different aspects of the patent content.

Hausdorff Distance와 이미지정합 알고리듬을 이용한 물체인식 (Object Recognition Using Hausdorff Distance and Image Matching Algorithm)

  • 김동기;이완재;강이석
    • 대한기계학회논문집A
    • /
    • 제25권5호
    • /
    • pp.841-849
    • /
    • 2001
  • The pixel information of the object was obtained sequentially and pixels were clustered to a label by the line labeling method. Feature points were determined by finding the slope for edge pixels after selecting the fixed number of edge pixels. The slope was estimated by the least square method to reduce the detection error. Once a matching point was determined by comparing the feature information of the object and the pattern, the parameters for translation, scaling and rotation were obtained by selecting the longer line of the two which passed through the matching point from left and right sides. Finally, modified Hausdorff Distance has been used to identify the similarity between the object and the given pattern. The multi-label method was developed for recognizing the patterns with more than one label, which performs the modified Hausdorff Distance twice. Experiments have been performed to verify the performance of the proposed algorithm and method for simple target image, complex target image, simple pattern, and complex pattern as well as the partially hidden object. It was proved via experiments that the proposed image matching algorithm for recognizing the object had a good performance of matching.

수치 사진측량에 있어서 정합 강도 측정에 의한 불량 정합점 제거에 관한 연구 (Blunder Detection by Matching Strength Measurement in Digital Photogrammetry)

  • 정명훈;윤홍식;위광재
    • 한국측량학회지
    • /
    • 제18권2호
    • /
    • pp.191-198
    • /
    • 2000
  • 수치사진 측량은 신속한 정보 획득과 갱신을 통하여 지리정보체계의 데이터 베이스 구축에 중요한 역할을 하고 있다. 이러한 수치사진측량의 기본적인 처리과정 중의 하나는 영상정합이다. 그러나 어떠한 영상정합 알고리즘도 인간의 판단과 지적 능력에 의해서 수행되는 것만큼 만족스러운 결과를 산출하지는 못하고 있다. 따라서 본 논문에서는 대상지역이 완만한 경우 정합점이라고 판단되는 점과 그 이웃 점들간에 전체적인 유사성을 관측하여 불량 정합점들을 제거하는 방법(정합 강도의 측정)을 제안하였고, 또한 최종적으로 얻어지는 정합점들의 3차원 좌표를 광속 조정법을 통하여 구하였다 실험결과 제안방법은 불량정합점들을 효과적으로 제거하였고, 계산된 3차원 지상좌표도 허용 오차 범위 이내로 들어왔다.

  • PDF

Development of a link extrapolation-based food web model adapted to Korean stream ecosystems

  • Minyoung Lee;Yongeun Kim;Kijong Cho
    • 환경생물
    • /
    • 제42권2호
    • /
    • pp.207-218
    • /
    • 2024
  • Food webs have received global attention as next-generation biomonitoring tools; however, it remains challenging because revealing trophic links between species is costly and laborious. Although a link-extrapolation method utilizing published trophic link data can address this difficulty, it has limitations when applied to construct food webs in domestic streams due to the lack of information on endemic species in global literature. Therefore, this study aimed to develop a link extrapolation-based food web model adapted to Korean stream ecosystems. We considered taxonomic similarity of predation and dominance of generalists in aquatic ecosystems, designing taxonomically higher-level matching methods: family matching for all fish (Family), endemic fish (Family-E), endemic fish playing the role of consumers (Family-EC), and resources (Family-ER). By adding the commonly used genus matching method (Genus) to these four matching methods, a total of five matching methods were used to construct 103 domestic food webs. Predictive power of both individual links and food web indices were evaluated by comparing constructed food webs with corresponding empirical food webs. Results showed that, in both evaluations, proposed methods tended to perform better than Genus in a data-poor environment. In particular, Family-E and Family-EC were the most effective matching methods. Our model addressed domestic data scarcity problems when using a link-extrapolation method. It offers opportunities to understand stream ecosystem food webs and may provide novel insights into biomonitoring.