• Title/Summary/Keyword: Partial matching

Search Result 156, Processing Time 0.025 seconds

A FAST PARTIAL DISTORTION ELIMINATION ALGORITHM USING IMPROVED SUB-BLOCK MATCHING SCAN

  • Kim, Jong-Nam;Ryu, Tae-Kyung;Moon, Kwang-Seok
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.278-281
    • /
    • 2009
  • In this paper, we propose a fast partial distortion algorithm using normalized dithering matching scan to get uniform distribution of partial distortion which can reduce only unnecessary computation significantly. Our algorithm is based on normalized dithering order matching scan and calibration of threshold error using LOG value for each sub-block continuously for efficient elimination of unlike candidate blocks while keeping the same prediction quality compared with the full search algorithm. Our algorithm reduces about 60% of computations for block matching error compared with conventional PDE (partial distortion elimination) algorithm without any prediction quality, and our algorithm will be useful to real-time video coding applications using MPEG-4 AVC or MPEG-2.

  • PDF

Index-based Boundary Matching Supporting Partial Denoising for Large Image Databases

  • Kim, Bum-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.10
    • /
    • pp.91-99
    • /
    • 2019
  • In this paper, we propose partial denoising boundary matching based on an index for faster matching in very large image databases. Attempts have recently been made to convert boundary images to time-series with the objective of solving the partial denoising problem in boundary matching. In this paper, we deal with the disk I/O overhead problem of boundary matching to support partial denoising in a large image database. Although the solution to the problem superficially appears trivial as it only applies indexing techniques to boundary matching, it is not trivial since multiple indexes are required for every possible denoising parameters. Our solution is an efficient index-based approach to partial denoising using $R^*-tree$ in boundary matching. The results of experiments conducted show that our index-based matching methods improve search performance by orders of magnitude.

Partial Denoising Boundary Image Matching Based on Time-Series Data (시계열 데이터 기반의 부분 노이즈 제거 윤곽선 이미지 매칭)

  • Kim, Bum-Soo;Lee, Sanghoon;Moon, Yang-Sae
    • Journal of KIISE
    • /
    • v.41 no.11
    • /
    • pp.943-957
    • /
    • 2014
  • Removing noise, called denoising, is an essential factor for the more intuitive and more accurate results in boundary image matching. This paper deals with a partial denoising problem that tries to allow a limited amount of partial noise embedded in boundary images. To solve this problem, we first define partial denoising time-series which can be generated from an original image time-series by removing a variety of partial noises and propose an efficient mechanism that quickly obtains those partial denoising time-series in the time-series domain rather than the image domain. We next present the partial denoising distance, which is the minimum distance from a query time-series to all possible partial denoising time-series generated from a data time-series, and we use this partial denoising distance as a similarity measure in boundary image matching. Using the partial denoising distance, however, incurs a severe computational overhead since there are a large number of partial denoising time-series to be considered. To solve this problem, we derive a tight lower bound for the partial denoising distance and formally prove its correctness. We also propose range and k-NN search algorithms exploiting the partial denoising distance in boundary image matching. Through extensive experiments, we finally show that our lower bound-based approach improves search performance by up to an order of magnitude in partial denoising-based boundary image matching.

Fast PDE Algorithm Using Block Matching Error Prediction (블록 정합오차 예측을 이용한 고속 PDE 알고리즘)

  • Sin, Se-Ill;Oh, Jeong-Su
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.4C
    • /
    • pp.396-400
    • /
    • 2007
  • This paper proposes the fast partial difference elimination (PDE) algorithm. When the conventional PDE cannot skip the rest of matching procedure in a candidate block using a partial matching error, the proposed algorithm estimates to skip it again using the block matching error predicted from the computed partial matching error. The proposed algorithm can eliminate impossible candidate blocks earlier than the conventional PDE since the predicted block matching error is always bigger than the partial matching error. The simulation results show that the proposed algorithm can significantly reduce the computations while keeping image quality as good as the conventional PDE.

An Adaptive and Fast Motion Estimation Algorithm using Initial Matching Errors (초기 매칭 에러를 통한 적응적 고속 움직임 예측 알고리즘)

  • Jeong, Tae-Il
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.11
    • /
    • pp.1439-1445
    • /
    • 2007
  • In this paper, we propose a fast motion estimation algorithm using initial matching errors by sorting square sub-blocks to find complex sub-block area adaptively based on partial calculation of SAD(sum of absolute difference) while keeping the same prediction quality compared with the PDE(partial distortion elimination) algorithm. We reduced unnecessary calculations with square sub-block adaptive matching scan based initial SAD calculation of square sub-block in each matching block. Our algorithm reduces about 45% of computations for block matching error compared with conventional PDE(partial distortion elimination) algorithm without any degradation of prediction quality, and for algorithm will be useful to real-time video coding applications using MPEG-4 AVC or MPEG-2.

  • PDF

Design and Implementation of a Boundary Matching System Supporting Partial Denoising for Large Image Databases

  • Kim, Bum-Soo;Kim, Jin-Uk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.5
    • /
    • pp.35-40
    • /
    • 2019
  • In this paper, we design and implement a partial denoising boundary matching system using indexing techniques. Converting boundary images to time-series makes it feasible to perform a fast search using indexes even on a very large image database. Thus, using this converting method we develop a client-server system based on the previous partial denoising research in the GUI(graphical user interface) environment. The client first converts a query image given by a user to a time-series and sends denoising parameters and the tolerance with this time-series to the server. The server identifies similar images from the index by evaluating a range query, which is constructed using inputs given from the client and sends the resulting images to the client. Experimental results show that our system provides many intuitive and accurate matching results.

Transformations of Partial Matchings

  • Nakamura, Inasa
    • Kyungpook Mathematical Journal
    • /
    • v.61 no.2
    • /
    • pp.409-439
    • /
    • 2021
  • We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between partial matchings. We introduce the notion of the lattice presentation of a partial matching, and the lattice polytope associated with a pair of lattice presentations, and we investigate transformations with minimal area.

Partial Model Matching Control System Design by Considering Pole-Placements (극배치를 고려한 제분 Model Matching 제어계 설계)

  • 이수흠;김수중
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.35 no.10
    • /
    • pp.427-437
    • /
    • 1986
  • Identification of the plants is not easy task especially in the fields of process control. From this point of view, Kitamori developed a method of control system design based on partial knowledge about controlled processes. However, it is difficult to control the oscillatory plant by kitamori's method. In this paper, we develope a method of partial model matching control system design, which have desirable pole-placements in order to improve the above defects. Design examples are given to illustrate the effectiveness of the method.

  • PDF

An Index-Building Method for Boundary Matching that Supports Arbitrary Partial Denoising (임의의 부분 노이즈제거를 지원하는 윤곽선 매칭의 색인 구축 방법)

  • Kim, Bum-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.11
    • /
    • pp.1343-1350
    • /
    • 2019
  • Converting boundary images to time-series makes it feasible to perform boundary matching even on a very large image database, which is very important for interactive and fast matching. In recent research, there has been an attempt to perform fast matching considering partial denoising by converting the boundary image into time series. In this paper, to improve performance, we propose an index-building method considering all possible arbitrary denoising parameters for removing arbitrary partial noises. This is a challenging problem since the partial denoising boundary matching must be considered for all possible denoising parameters. We propose an efficient single index-building algorithm by constructing a minimum bounding rectangle(MBR) according to all possible denoising parameters. The results of extensive experiments conducted show that our index-based matching method improves the search performance up to 46.6 ~ 4023.6 times.

Design and Implemantation of Information Retrieval System based on Semantic Information (의미정보기반 검색시스템의 설계 및 구현)

  • Park, Chang-Keun;Yang, Gi-Chul
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2004.11a
    • /
    • pp.265-268
    • /
    • 2004
  • Keyword matching technique which is used in most information retrieval systems is unfit for efficient processing of geometrically increasing information. The problem can be solved by using semantic information and an efficient method of semantic processing is introduced in this paper. The technique uses conceptual graph to represent the semantic information and apply it for information retrieval. The implemented system can perform exact matching and partial matching. Partial matching has two different types. One is syntactic partial matching and the other is semantic partial matching. The semantic semilaries are measured by the subclass relations in the ontology. The introduced technique can be used not only information retrieval but also in various applications such as an implementation of dynamic hyperlinks.

  • PDF