scispace - formally typeset
Proceedings ArticleDOI

2D objects recognition by graph matching

I. Gaudron
- pp 508-511
Reads0
Chats0
TLDR
The author constructs a Markov model of a matching for two graphs taking into account local geometric constraints and proposes a distance between two graphs to be able to discriminate their shapes.
Abstract
Presents an algorithm for recognition of plane and rigid objects. The method represents the shape of these objects by valuate graphs. The author constructs a Markov model of a matching for two graphs taking into account local geometric constraints. The author finally proposes a distance between two graphs to be able to discriminate their shapes. >

read more

Citations
More filters
Journal ArticleDOI

A parallel algorithm for graph matching and its MasPar implementation

TL;DR: An algorithm is presented that reduces the computation time for graph matching by employing both branch-and-bound pruning of the search tree and massively-parallel search of the as-yet-unpruned portions of the space.

Robust Motion Detection with Temporal Decomposition and Statistical Regularization

TL;DR: A method able to cope with perturbations frequently encountered during acquisition of outdoor image sequences and a formal way to combine different sets of computed information, while exploiting a priori knowledge on the primitives to be determined is defined.
References
More filters
Journal ArticleDOI

Model-based recognition and localization from sparse range or tactile data

TL;DR: In this paper, the authors show that inconsistent hypotheses about pairings between sensed points and object surfaces can be discarded efficiently by using local constraints on distances between faces, angles between face normals, and angles (relative to the surface normals) of vectors between the sensed points.
Journal ArticleDOI

HYPER: A New Approach for the Recognition and Positioning of Two-Dimensional Objects

TL;DR: The method has been integrated within a vision system coupled to an indutrial robot arm, to provide automatic picking and repositioning of partially overlapping industrial parts to provide strong robustness to partial occlusions.
Journal ArticleDOI

Localizing Overlapping Parts by Searching the Interpretation Tree

TL;DR: The approach operates by examining all hypotheses about pairings between sensed data and object surfaces and efficiently discarding inconsistent ones by using local constraints on distances between faces, angles between face normals, and angles of vectors between sensed points.
Book ChapterDOI

Bayesian 3-d path search and its applications to focusing seismic data

TL;DR: In this paper, a 3D-Markov random field model is used to estimate the plausibility of a path by an energy function, which is then adjusted by an interactive robust parameter localization approach.
Related Papers (5)