In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
We present a system to segment the medial edges of the vocal folds from stroboscopic video. The system has two components. The first learns a color transformation that optimally d...
Sonya Allin, John M. Galeotti, George D. Stetten, ...
Interest point detection is an established method to select relevent image regions. Such techniques use features like corners or edges, which are known to indicate regions likely ...
Graph-based semi-supervised learning has gained considerable
interests in the past several years thanks to its effectiveness
in combining labeled and unlabeled data through
labe...
In this paper, we present a new solution to the problem of appearance matching across multiple nonoverlapping cameras. Objects of interest, pedestrians are represented by a set of...