A distance field is a representation where, at each point within the field, we know the
distance from that point to the closest point on any object within the domain. In addition to …

This monograph reviews both the theory and practice of the numerical computation of
geodesic distances on Riemannian manifolds. The notion of Riemannian manifold allows …

We present an approach for identifying a set of candidate objects in a given image. This set
of candidates can be used for object recognition, segmentation, and other object-based …

Colorization, the task of coloring a grayscale image or video, involves assigning from the
single dimension of intensity or luminance a quantity that varies in three dimensions, such …

An interactive framework for soft segmentation and matting of natural images and videos is
presented in this paper. The proposed technique is based on the optimal, linear time …

Depressions (or pits) are areas within a digital elevation model that are surrounded by
higher terrain, with no outlet to lower areas. Filling them so they are level, as fluid would fill …

A wide range of computer vision applications require an accurate solution of a particular
Hamilton-Jacobi (HJ) equation, known as the Eikonal equation. In this paper, we propose an …

We propose an algorithm utilizing geodesic distances to upsample a low resolution depth
image using a registered high resolution color image. Specifically, it computes depth for …

This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional
image and video data. The segmentation problem is cast as approximate energy …

Coverage path planning (CPP) is a field of study which objective is to find a path that covers
every point of a certain area of interest. Recently, the use of Unmanned Aerial Vehicles …