๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A matching algorithm for motion analysis of dense populations

โœ Scribed by Dmitry Chetverikov; Attila Lerch

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
769 KB
Volume
11
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A novel algorithm for chromatogram match
A novel algorithm for chromatogram matching in qualitative analysis
โœ Mason, John P. ;Kirk, Ian ;Windsor, Colin G. ;Tipler, Andy ;Spragg, Richard A. ; ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 780 KB

## Abstract The matching of the pattern of peaks produced during gas chromatography is of importance to many applications. At present, this task is generally performed manually, but this generates the usual problems associated with human inspection, such as a lack of objectivity and reproducibility

Block-matching algorithm based on an ada
Block-matching algorithm based on an adaptive reduction of the search area for motion estimation
โœ Hwang-Seok Oh; Heung-Kyu Lee ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 300 KB

Block-matching algorithm based on an adaptive reduction of the search area for motion estimation T he motion estimation and compensation technique is widely used for video coding applications but the real-time motion estimation is not easy due to its enormous computations. In this paper, a new adapt

Convergence of a hill-climbing genetic a
Convergence of a hill-climbing genetic algorithm for graph matching
โœ Andrew D.J. Cross; Richard Myers; Edwin R. Hancock ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 793 KB

This paper presents a convergence analysis for the problem of consistent labelling using genetic search. The work builds on a recent empirical study of graph matching where we showed that a Bayesian consistency measure could be e$ciently optimised using a hybrid genetic search procedure which incorp