2219 search results - page 93 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
114
click to vote
CIARP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical...
134
Voted
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
109
Voted
ICCV
1998
IEEE
16 years 4 months ago
1998
IEEE
W e introduce a novel view-based object representation, called the saliency map graph (SMG), which captures the salient regions of an object view at multiple scales using a wavele...
121
Voted
ICPR
2004
IEEE
16 years 3 months ago
2004
IEEE
Voronoi condensing reduces training patterns of nearest neighbor classifiers without changing the classification boundaries. This method plays important roles not only in the near...
117
Voted
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
Large-scale digitization projects aimed at periodicals often have as input streams of completely unlabeled document images. In such situations, the results produced by the automat...