373 search results - page 25 / 75 » Identifying graphs from noisy and incomplete data |
MICCAI
2004
Springer
14 years 8 months ago
2004
Springer
Extraction of structures of interest in medical images is often an arduous task because of noisy or incomplete data. However, handsegmented data are often available and most of the...
ECCV
2004
Springer
14 years 1 months ago
2004
Springer
This paper deals with the computation of optical flow and occlusion detection in the case of large displacements. We propose a Bayesian approach to the optical flow problem and s...
ANLP
1994
13 years 9 months ago
1994
Given a noisy text page, a word recognizer can generate a set of candidates for each word image. A relaxation algorithm was proposed previously by the authors that uses word collo...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We study the beneficial effect of side information on the Structure from Motion (SfM) estimation problem. The side information that we consider is measurement of a `reference vect...