Sciweavers

1430 search results - page 76 / 286
» Representing Probability Measures using Probabilistic Proces...
Sort
View
DAGM
2001
Springer
14 years 1 months ago
Similarity Measures for Occlusion, Clutter, and Illumination Invariant Object Recognition
Novel similarity measures for object recognition and image matching are proposed, which are inherently robust against occlusion, clutter, and nonlinear illumination changes. They c...
Carsten Steger
IAT
2006
IEEE
14 years 3 months ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler
CVPR
2003
IEEE
14 years 2 months ago
Continuous Tracking Within and Across Camera Streams
This paper presents a new approach for continuous tracking of moving objects observed by multiple, heterogeneous cameras. Our approach simultaneously processes video streams from ...
Jinman Kang, Isaac Cohen, Gérard G. Medioni
AAAI
1996
13 years 10 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
BMCBI
2008
111views more  BMCBI 2008»
13 years 9 months ago
Probabilistic base calling of Solexa sequencing data
Background: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA ...
Jacques Rougemont, Arnaud Amzallag, Christian Isel...