Skip to main navigation Skip to search Skip to main content

The graph representation of the problem of pairing points from two sets

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

The validation procedure of hand detection algorithms required the creation of scoring method for a set of detected points according to set of ground truth points. In this paper a method of finding all points pairs with a smallest mutual distance is described. The problem of finding pairs is represented in graph form and solved with use of Dijkstra's algorithm. The problem is also described with use of an example.

Original languageEnglish
Title of host publicationInternational Conference of Numerical Analysis and Applied Mathematics 2015, ICNAAM 2015
EditorsTheodore E. Simos, Theodore E. Simos, Charalambos Tsitouras, Theodore E. Simos
PublisherAmerican Institute of Physics Inc.
ISBN (Electronic)9780735413924
DOIs
Publication statusPublished - 8 Jun 2016
EventInternational Conference of Numerical Analysis and Applied Mathematics 2015, ICNAAM 2015 - Rhodes, Greece
Duration: 23 Sept 201529 Sept 2015

Publication series

NameAIP Conference Proceedings
Volume1738
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

ConferenceInternational Conference of Numerical Analysis and Applied Mathematics 2015, ICNAAM 2015
Country/TerritoryGreece
CityRhodes
Period23/09/1529/09/15

Keywords

  • Dijkstra
  • Graph
  • Pairing
  • Points classification
  • Validation

ASJC Scopus subject areas

  • General Physics and Astronomy

Fingerprint

Dive into the research topics of 'The graph representation of the problem of pairing points from two sets'. Together they form a unique fingerprint.

Cite this