This paper proposes a method for computing a quasi-dense set of matching points between three views of a scene. The method takes a sparse set of seed matches between pairs of view...
Pekka Koskenkorva, Juho Kannala, Sami Sebastian Br...
This paper introduces a method for converting an image or volume sampled on a regular grid into a space-efficient irregular point hierarchy. The conversion process retains the ori...
Abstract— The problem of place recognition appears in different mobile robot navigation problems including localization, SLAM, or change detection in dynamic environments. Wherea...
Many traditional methods for shape classification involve
establishing point correspondences between shapes to
produce matching scores, which are in turn used as similarity
meas...
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...