Efficient colored point set matching under noise

Santiago Diez Donoso, J. Antoni Sellarès

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Let A and B be two colored point sets in R2, with \A\ ≤ \B\. We propose a process for determining matches, in terms of the bottleneck distance, between A and subsets of B under color preserving rigid motion, assuming that the position of all colored points in both sets contains a certain amount of "noise". The process consists of two main stages: a lossless filtering algorithm and a matching algorithm. The first algorithm determines a number of candidate zones which are regions that contain a subset S of B such that A may match one or more subsets B′ of S. We use a compressed quadtree to have easy access to the subsets of B related to candidate zones and store geometric information that is used by the lossless filtering algorithm in each quadtree node. The second algorithm solves the colored point set matching problem: we generate all, up to a certain equivalence, possible motions that bring A close to some subset B′ of every S and seek for a matching between sets A and B′. To detect these possible matchings we use a bipartite matching algorithm that uses Skip Quadtrees for neighborhood queries. We have implemented the proposed algorithms and report results that show the efficiency of our approach.

Original languageEnglish
Title of host publicationComputational Science and Its Applications - ICCSA 2007 - International Conference, Proceedings
Pages26-40
Number of pages15
EditionPART 1
Publication statusPublished - 2007 Dec 1
EventInternational Conference on Computational Science and its Applications, ICCSA 2007 - Kuala Lumpur, Malaysia
Duration: 2007 Aug 262007 Aug 29

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume4705 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherInternational Conference on Computational Science and its Applications, ICCSA 2007
CountryMalaysia
CityKuala Lumpur
Period07/8/2607/8/29

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient colored point set matching under noise'. Together they form a unique fingerprint.

  • Cite this

    Diez Donoso, S., & Sellarès, J. A. (2007). Efficient colored point set matching under noise. In Computational Science and Its Applications - ICCSA 2007 - International Conference, Proceedings (PART 1 ed., pp. 26-40). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4705 LNCS, No. PART 1).