Sciweavers

1404 search results - page 145 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ICCV
2009
IEEE
16 years 2 months ago
Optimal Correspondences from Pairwise Constraints
Correspondence problems are of great importance in computer vision. They appear as subtasks in many applications such as object recognition, merging partial 3D reconstructions a...
Olof Enqvist, Klas Josephson, Fredrik Kahl
IEEEMSP
2002
IEEE
15 years 2 months ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...
CVPR
2008
IEEE
14 years 10 months ago
Globally optimal surface segmentation using regional properties of segmented objects
Efficient segmentation of globally optimal surfaces in volumetric images is a central problem in many medical image analysis applications. Intra-class variance has been successful...
Xin Dou, Xiaodong Wu, Andreas Wahle, Milan Sonka
MVA
1998
230views Computer Vision» more  MVA 1998»
14 years 11 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
NIPS
2008
14 years 11 months ago
Estimating Robust Query Models with Convex Optimization
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
Kevyn Collins-Thompson