Presenting more comprehensive information than key frame and any subset of frames, mosaic has attracted a growing attention in recent years as a useful element for a variety of vi...
Tao Mei, Xian-Sheng Hua, He-Qin Zhou, Shipeng Li, ...
Robust registration of two 3-D point sets is a common problem in computer vision. The Iterative Closest Point (ICP) algorithm is undoubtedly the most popular algorithm for solving...
In the paper, an automatic spatio-temporal video sequence segmentation algorithm is proposed. To address this very di cult computer vision problem, several novel algorithms have b...
Conveying shape using feature lines is an important visualization tool in visual computing. The existing feature lines (e.g., ridges, valleys, silhouettes, suggestive contours, etc...
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...