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...
In the automatic classification of music many different segmentations of the audio signal have been used to calculate features. These include individual short frames (23 ms), lon...
We propose an algorithm for automatically obtaining a segmentation of a rigid object in a sequence of images that are calibrated for camera pose and intrinsic parameters. Until re...
Neill D. F. Campbell, George Vogiatzis, Carlos Her...
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
We introduce a new interpretation of multiscale random fields (MSRFs) that admits efficient optimization in the framework of regular (single level) random fields (RFs). It is base...
Longin Jan Latecki, ChengEn Lu, Marc Sobel, Xiang ...