3DIM
2011
IEEE
13 years 1 months ago
2011
IEEE
Abstract—In this paper, we propose a novel propagationbased stereo matching algorithm. Starting from an initial disparity map, our algorithm selects highly reliable pixels and pr...
MICCAI
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Deformable surface models are often represented as triangular meshes in image segmentation applications. For a fast and easily regularized deformation onto the target obj...
ISVC
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. This paper describes a new method for matching line segments between two images in order to compute the relative camera pose. This approach improves the camera pose for i...
FSS
2008
14 years 10 days ago
2008
We propose new types of linguistic summaries of time-series data that extend those proposed in our previous papers. The proposed summaries of time series refer to the summaries of...
IPL
2006
14 years 1 months ago
2006
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficie...
IEICET
2006
14 years 1 months ago
2006
A linkage is a collection of line segments, called bars, possibly joined at their ends, called joints. Straightening a tree linkage is a continuous motion of their bars from an ini...
ALGORITHMICA
2007
14 years 1 months ago
2007
d abstract) Lars Arge1 , Darren Erik Vengroff2 , and Jeffrey Scott Vitter3 1 BRICS† , Department of Computer Science, University of Aarhus, Aarhus, Denmark 2 Department of Comp...
ICVGIP
2004
14 years 3 months ago
2004
This article aims to propose a method to use the idea of Hough Transform (HT) implemented in grey scale images to color images for region extraction. A region in an image is seen ...
CCCG
2001
14 years 3 months ago
2001
Local coordinates based on the Voronoi diagram are used in natural neighbour interpolation to quantify the "neighbourliness" of data sites. In an earlier paper, we have ...
CCCG
2007
14 years 3 months ago
2007
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...