Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
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...
Irene Reisner-Kollmann, Andreas Reichinger, Werner...
A clothoid has the property that its curvature varies linearly with arclength. This is a useful feature for the path of a vehicle whose turning radius is controlled as a linear fu...
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight li...
This paper proposes a new approach to describe the salient contours in cluttered scenes. No need to do the preprocessing, such as edge detection, we directly use a set of random s...
In this paper, we present a novel approach to vectorize elliptic arcs for 3D pie chart recognition and data extraction. As a preprocessing step, a set of straight line segments ar...
In this paper we propose a new method for detecting straight line segments in digital images. It improves upon existing methods by giving precise results while controlling the num...
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...