• Title/Summary/Keyword: part-matching

Search Result 461, Processing Time 0.551 seconds

Implementation of Real time based Multi-object recognition algorithm (실시간 다중 객체인식 알고리즘 구현)

  • Park, Tae-Ryong
    • Journal of IKEEE
    • /
    • v.17 no.1
    • /
    • pp.51-56
    • /
    • 2013
  • This thesis propose a improved matching method for implementing an ORB algorithm based multi-object recognition. SURF algorithm that is well known in the object recognition algorithms is robust in object recognition. However, there is a disadvantage for real time operation because, SURF implemention requires a lot of computation. Therefore we propose a modified ORB algorithm which shows the result of almost 70% speed improvement by improving matching part to recognize multi object on real time.

Efficient From Document Classification Large using Partial Matching Method (부분 매칭 방법을 이용한 효율적인 서식 문서 분류)

  • Byeon, Yeong-Cheol;Choe, Yeong-U;Kim, Gyeong-Hwan;Lee, Il-Byeong
    • The KIPS Transactions:PartB
    • /
    • v.8B no.1
    • /
    • pp.1-9
    • /
    • 2001
  • 본 논문에서는 서식 문서를 짧은 처리 시간에 정확히 분류함으로써 실제 환경에서 응용할 수 있는 서식 분류 방법을 제안한다. 제안하는 방법은 서식 문서 이미지 전체를 다루기보다는 처리하고자 하는 서식 문서에서 서식 구조가 많이 다른 곳을 찾아서 매칭 영역으로 결정하고, 그 영역들에 대해서만 비교를 수행함으로써 계산 시간을 줄이고 인식률을 높인다. 선분 추출 시 오류를 고려하기 위하여 기존 인쇄 문자와 채워진 데이터, 그리고 매칭 영역의 크기 정보를 페널티 함수로 반영하여 매칭 영역 선택 시 고려한다. 본 방법은 구조적으로 많이 다르고, 양질의 특징을 포함하는 적은 수의 매칭 영역을 선택함으로써 처리 시간을 줄일 수 있음은 물론 높은 서식 분류율을 얻을 수 있다.

  • PDF

XML Schema Matching based on Ontology Update for the Transformation of XML Documents (XML 문서의 변환을 위한 온톨로지 갱신 기반 XML 스키마 매칭)

  • Lee, Kyong-Ho;Lee, Jun-Seung
    • Journal of KIISE:Databases
    • /
    • v.33 no.7
    • /
    • pp.727-740
    • /
    • 2006
  • Schema matching is important as a prerequisite to the transformation of XML documents. This paper presents a schema matching method for the transformation of XML documents. The proposed method consists of two steps: preliminary matching relationships between leaf nodes in the two XML schemas are computed based on proposed ontology and leaf node similarity, and final matchings are extracted based on a proposed path similarity. Particularly, for a sophisticated schema matching, the proposed ontology is incrementally updated by users' feedback. furthermore, since the ontology can describe various relationships between concepts, the proposed method can compute complex matchings as well as simple matchings. Experimental results with schemas used in various domains show that the proposed method is superior to previous works, resulting in a precision of 97% and a recall of 83 % on the average. Furthermore, the dynamic ontology increased by 9 percent overall.

Size-Variable Block Matching for Extracting Motion Information (동작정보 추출을 위한 가변적 탐색 영역과 블록 크기의 정합)

  • Jang, Seok;Kim, Bong-Keun;Kim, Gye-Young;Choi, Hyung-Il
    • The KIPS Transactions:PartB
    • /
    • v.10B no.3
    • /
    • pp.321-328
    • /
    • 2003
  • This Paper Proposes a size-variable block matching algorithm for motion vector extraction. The Proposed algorithm dynamically determines the search area and the size of a block. We exploit the constraint of small velocity changes of a block along the time to determine the origin of the search area. The range of the search area is adjusted according to the motion coherency of spatially neighboring blocks. The process of determining the sire of a block begins matching with a small block. If the matching degree is not good enough, we expand the size of a block a little bit and then repeat the matching process until our matching criterion Is satisfied. The experimental results show that the proposed algorithm can yield very accurate block motion vectors. Our algorithm outperforms other algorithms in terms of the estimated motion vectors, though our algorithm requires some computational overhead.

The Analysis of Factors Influencing Fit by Ready-made Jacket Part preferred by Women in Twenties - Focusing on the Comparison between Female College Student Group and Fashion Model Group (20대 여성의 기성복 재킷 부위별 선호핏(fit)에 영향을 미치는 요소 분석 - 여대생집단과 패션모델집단 간 비교를 중심으로 -)

  • Ha, Seon Ju;Kang, Yeo Sun;Choi, Hei Sun
    • Korean Journal of Human Ecology
    • /
    • v.23 no.6
    • /
    • pp.1171-1189
    • /
    • 2014
  • In order to provide the basic data for creating the environment which can efficiently reflect prefer fit along with body size when selecting clothes size in the indirect purchasing environment, this study analyzed the difference of ready-made jacket part-specific fit preferred by fashion models in their twenties and female college students. This study was to analyze the impact of body size, recognition of body part-specific characteristics shape, body satisfaction on prefer fit of jacket. As for the difference of prefer fit depending on the body size, female college students preferred more loose fit than models. The difference according to recognition of body part-specific characteristics shape turned out to be significant for prefer fit depending on the degree of bend of neck, arm length, bend of back recognition and matching fit was found to be preferred as they recognize their body shape to be normal and the difference according to body satisfaction appeared to be significant in the terms of bend of back, hip width/protrusion, torso size/length, sleeve length, whole body shape and they turned out to prefer matching fit as they are satisfied with their body. As shown above, body size, recognition of body part-specific characteristics shape, especially body satisfaction have a great influence on prefer fit of jacket and therefore, if preparing for a size selection step according to body shape and satisfaction in the jacket size selection process, customers' satisfaction in jacket size may be improved and it is considered to be helpful for both consumers and sellers.

Real-time Hausdorff Matching Algorithm for Tracking of Moving Object (이동물체 추적을 위한 실시간 Hausdorff 정합 알고리즘)

  • Jeon, Chun;Lee, Ju-Sin
    • The KIPS Transactions:PartB
    • /
    • v.9B no.6
    • /
    • pp.707-714
    • /
    • 2002
  • This paper presents a real-time Hausdorff matching algorithm for tracking of moving object acquired from an active camera. The proposed method uses the edge image of object as its model and uses Hausdorff distance as the cost function to identify hypothesis with the model. To enable real-time processing, a high speed approach to calculate Hausdorff distance and half cross matching method to improve performance of existing search methods are also presented. the experimental results demonstrate that the proposed method can accurately track moving object in real-time.

Analogy-based Reuse of Object Model (아날로지를 기반으로 한 객체모델의 재사용)

  • Bae, Je-Min
    • The KIPS Transactions:PartD
    • /
    • v.14D no.6
    • /
    • pp.665-674
    • /
    • 2007
  • Code reuse in software reuse has several limitations such as difficulties of understanding and retrieval of the reuse code written by other developers. To overcome these problems, it should be possible to reuse the analysis/design information than source code itself. Therefore, this paper present analogical matching techniques for the reuse of object models and patterns. And this paper have suggested the object model and the design patterns as reusable components and the representation techniques to store them. Namely, the contents of the paper are as follows. Analogical matching functions to retrieve analogous components from reusable libraries. And the representation of reusable components to be stored in the library in order to support the analogical matching.

A Negotiation Framework for the Cloud Management System using Similarity and Gale Shapely Stable Matching approach

  • Rajavel, Rajkumar;Thangarathinam, Mala
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.6
    • /
    • pp.2050-2077
    • /
    • 2015
  • One of the major issues in emerging cloud management system needs the efficient service level agreement negotiation framework, with an optimal negotiation strategy. Most researchers focus mainly on the atomic service negotiation model, with the assistance of the Agent Controller in the broker part to reduce the total negotiation time, and communication overhead to some extent. This research focuses mainly on composite service negotiation, to further minimize both the total negotiation time and communication overhead through the pre-request optimization of broker strategy. The main objective of this research work is to introduce an Automated Dynamic Service Level Agreement Negotiation Framework (ADSLANF), which consists of an Intelligent Third-party Broker for composite service negotiation between the consumer and the service provider. A broker consists of an Intelligent Third-party Broker Agent, Agent Controller and Additional Agent Controller for managing and controlling its negotiation strategy. The Intelligent third-party broker agent manages the composite service by assigning its atomic services to multiple Agent Controllers. Using the Additional Agent Controllers, the Agent Controllers manage the concurrent negotiation with multiple service providers. In this process, the total negotiation time value is reduced partially. Further, the negotiation strategy is optimized in two stages, viz., Classified Similarity Matching (CSM) approach, and the Truncated Negotiation Group Gale Shapely Stable Matching (TNGGSSM) approach, to minimize the communication overhead.

High-Speed Image Matching Method Using Geometry - Phase Information (기하 위상 정보를 이용한 고속 영상 정합 기법)

  • Chong Min-Yeong;Oh Jae-Yong;Lee Chil-Woo;Bae Ki-Tae
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.9
    • /
    • pp.1195-1207
    • /
    • 2005
  • In this paper, we describe image matching techniques which is automatically retrieving the exact matching area using geometry-phase information. We proposed a Matching Method which is rapidly estimating the correspondent points between adjacent images that included big-rotation and top-bottom movement element. It is a method that reduce computation quantity to be required to find an exact correspondent position using geometry-phase information of extracted points in images and DT map which set the distance value among feature points and other points on the basis of each feature point of a image. The proposed method shows good performance especially in the part to search a exact correspondent position between adjacent images that included big-rotation and top-bottom movement element.

  • PDF

Keyword Spotting on Hangul Document Images Using Image-to-Image Matching (영상 대 영상 매칭을 이용한 한글 문서 영상에서의 단어 검색)

  • Park Sang Cheol;Son Hwa Jeong;Kim Soo Hyung
    • The KIPS Transactions:PartB
    • /
    • v.12B no.3 s.99
    • /
    • pp.357-364
    • /
    • 2005
  • In this paper, we propose an accurate and fast keyword spotting system for searching user-specified keyword in Hangul document images by using two-level image-to-image matching. The system is composed of character segmentation, creating a query image, feature extraction, and matching procedure. Two different feature vectors are used in the matching procedure. An experiment using 1600 Hangul word images from 8 document images, downloaded from the website of Korea Information Science Society, demonstrates that the proposed system is superior to conventional image-based document retrieval systems.