• Title, Summary, Keyword: matching strategy

Search Result 145, Processing Time 0.042 seconds

A New Matching Strategy for SNI-based 3-D Object Recognition (면 법선 영상 기반형 3차원 물체인식에서의 새로운 매칭 기법)

  • 박종훈;최종수
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.7
    • /
    • pp.59-69
    • /
    • 1993
  • In this paper, a new matching strategy for 3-D object recognition, based on the Surface Normal Images (SNIs), is proposed. The matching strategy using the similarity decision function [9,10] lost the efficiency and the reliability of matching, because all features of models within model base must be compared with the scene object features, and the weights of the attributes of features is given by heuristic manner. However, the proposed matching strategy can solve these problems by using a new approach. In the approach, by searching the model base, a model object whose features are fully matched with the features of sceme object is selected. In this paper, the model base is constructed for the total 26 objects, and systhetic and real range images are used in the test of the system operation. Experimental result is performed to show the possibility that this strategy can be effectively used for the SNI based recognition.

  • PDF

A Frame-Based Video Signature Method for Very Quick Video Identification and Location

  • Na, Sang-Il;Oh, Weon-Geun;Jeong, Dong-Seok
    • ETRI Journal
    • /
    • v.35 no.2
    • /
    • pp.281-291
    • /
    • 2013
  • A video signature is a set of feature vectors that compactly represents and uniquely characterizes one video clip from another for fast matching. To find a short duplicated region, the video signature must be robust against common video modifications and have a high discriminability. The matching method must be fast and be successful at finding locations. In this paper, a frame-based video signature that uses the spatial information and a two-stage matching method is presented. The proposed method is pair-wise independent and is robust against common video modifications. The proposed two-stage matching method is fast and works very well in finding locations. In addition, the proposed matching structure and strategy can distinguish a case in which a part of the query video matches a part of the target video. The proposed method is verified using video modified by the VCE7 experimental conditions found in MPEG-7. The proposed video signature method achieves a robustness of 88.7% under an independence condition of 5 parts per million with over 1,000 clips being matched per second.

Automatic Control Point Measurement and Photo Orientation via Matching with Control Patch

  • Jaw, Jen-Jer;Wu, Yi-Shen
    • Proceedings of the KSRS Conference
    • /
    • /
    • pp.375-377
    • /
    • 2003
  • In this study, we employ the control patches, which have been created in previous photogrammetric projects, serving for the candidates of the control points that are likely to be found in the newly taken photos by utilizing image matching technique. Among others, the successful implementation of the above idea lies in the underlying factors: (1). Predicting the control patches and projecting them onto new photos; (2). Alignment of control patches with respect to the new photos; (3). Generating the equivalent ground elements of control patches versus the new photos for the purpose of correlation; (4). Developing effective matching methods and matching strategy; (5). Refining the exterior orientation parameters. What may show significance in this work comparing to traditional aerial-triangulation chain is that whenever at least three matched control patches succeed in a single photo, it follows that single photo orientation is applicable. The experiments suggest the potential efficiency of automatic control point measurement from control patch database and photo orientation by the proposed workflow.

  • PDF

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.

A Parallel Matching in AI Production Systems (인공지능 생성시스템에서의 병렬 매칭)

  • 강승일;윤종민;정규식
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.3
    • /
    • pp.89-99
    • /
    • 1995
  • One of the hardest problems that limit real application of production system is its slowness. One way to overcome this problem is to speed up the matching operation which occupies more than 90% of the total execution time. In this paper, we try to speed up the matching operation with parallel execution of a typical pattern matching algorithm, RETE, in a multiprocessor environment, This requires not only to make partitions of the rules but also to allocate the partitioned rules to processors, respectively. A partition strategy is proposed to make groups of similar rules by evaluating the similarity of rules according to the number of common conditions between rules. An allocation strategy is proposed to make the load of each processor even by assigning the different priority to the group of rules according to the expected amount of time required for matching operation. To compare with the existing methods, we perform simulation using OPS5 sample programs. The simulation results show that the proposed methods can improve the performance of production system.

  • PDF

Incorporation of Scene Geometry in Least Squares Correlation Matching for DEM Generation from Linear Pushbroom Images

  • Kim, Tae-Jung;Yoon, Tae-Hun;Lee, Heung-Kyu
    • Proceedings of the KSRS Conference
    • /
    • /
    • pp.182-187
    • /
    • 1999
  • Stereo matching is one of the most crucial parts in DEM generation. Naive stereo matching algorithms often create many holes and blunders in a DEM and therefore a carefully designed strategy must be employed to guide stereo matching algorithms to produce “good” 3D information. In this paper, we describe one such a strategy designed by the use of scene geometry, in particular, the epipolarity for generation of a DEM from linear pushbroom images. The epipolarity for perspective images is a well-known property, i.e., in a stereo image pair, a point in the reference image will map to a line in the search image uniquely defined by sensor models of the image pair. This concept has been utilized in stereo matching by applying epipolar resampling prior to matching. However, the epipolar matching for linear pushbroom images is rather complicated. It was found that the epipolarity can only be described by a Hyperbola- shaped curve and that epipolar resampling cannot be applied to linear pushbroom images. Instead, we have developed an algorithm of incorporating such epipolarity directly in least squares correlation matching. Experiments showed that this approach could improve the quality of a DEM.

  • PDF

Dynamic Matching Algorithms for Internet-based Logistics Brokerage Agents

  • Jeong, Keun-Chae
    • Management Science and Financial Engineering
    • /
    • v.10 no.1
    • /
    • pp.77-96
    • /
    • 2004
  • In this paper, we present a dynamic matching methodology for the logistics brokerage agent that intermediates empty vehicles and freights registered to the logistics e-marketplace by car owners and shippers. In this matching methodology, two types of decisions should be made: one is when to match freights and vehicles and the other is how to match freights and vehicles at that time. We propose three strategies for deciding when to match, ie. real time matching (RTM) , periodic matching (PM), and fixed matching (FM) and use Hungarian method for solving the how-to-match problem. In order to compare the performance of the when-to-match strategies, computational experiments are done and the results show that the waiting-and-matching strategies, PM and FM, give better performance than real time matching strategy, RTM. We can expect that the suggested matching methodology may be used as an efficient and effective tool for the brokerage agent in the logistics e-marketplaces.

Dynamic Matching Algorithms for Internet-based Logistics Brokerage Agents

  • Jeong, Geun-Chae
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • /
    • pp.139-142
    • /
    • 2004
  • In this paper, we present a dynamic matching methodology for the logistics brokerage agent that intermediates empty vehicles and freights registered to the logistics e-marketplace by car owners and shippers. In this matching methodology, two types of decisions should be made: one is when to match freights and vehicles and the other is how to match freights and vehicles at that time. We propose three strategies for deciding when to match, i.e. real time matching (RTM), periodic matching (PM), and fixed matching (FM) and use Hungarian method for solving tho how-to-match problem. In order to compare the performance of the when-to-match strategies, computational experiments are done and the results show that the waiting-and matching strategies, PM and FM, give better performance than real time matching strategy, RTM. We can expect that the suggested matching methodology may be used as an efficient and affective tool for the brokerage agent in the logistics e-marketplaces

  • PDF

Dynamic Matching Algorithms for On-Time Delivery in e-Logistics Brokerage Marketplaces

  • Jeong, Keun-Chae
    • Management Science and Financial Engineering
    • /
    • v.13 no.1
    • /
    • pp.93-113
    • /
    • 2007
  • In the previous research, we considered a logistics brokerage problem with the objective of minimizing total transportation lead time of freights in a logistics e-marketplace, in which a logistics brokerage agent intermediates empty vehicles and freights registered by car owners and shippers [7]. However, in the logistics e-marketplace, transportation due date tardiness is more important than the transportation lead time, since transportation service level is critically determined by whether the due date is met or not. Therefore, in this paper, we deal with the logistics brokerage problem with the objective of minimizing total tardiness of freights. Hungarian method based matching algorithms, real time matching(RTM), periodic matching(PM), and fixed matching(FM), are used for solving the problem considered in this paper. In order to test performance of the proposed algorithms, we perform computational experiments on a various problem instances. The results show that the waiting-and-matching algorithms, PM and FM, also give better performance than real time matching strategy, RTM, for the total tardiness minimization problem as the algorithms did for the total lead time minimization problem.

A Matching Strategy to Recognize Occluded Number (폐색된 숫자를 인식하는 매칭 방법)

  • Pham, Thi Thuong;Choi, Hyung-Il;Kim, Gye-Young
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • /
    • pp.55-58
    • /
    • 2011
  • This paper proposes a method of occluded number recognition by matching interest points. Interest points of input pattern are found via SURF features extracting and matched to interest points of clusters in database following three steps: SURF matching, coordinate matching and SURF matching on coordinate matched points. Then the satisfied interest points are counted to compute matching rate of each cluster. The input pattern will be assigned to cluster having highest matching rate. We have experimented our method to different numerical fonts and got encouraging results.

  • PDF