—We consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical problem in distri...
In this paper, we address the task of tracking groups of people in surveillance scenarios. This is a major challenge in computer vision, since groups are structured entities, subj...
Cross-domain learning methods have shown promising
results by leveraging labeled patterns from auxiliary domains
to learn a robust classifier for target domain, which
has a limi...
Dong Xu, Ivor Wai-Hung Tsang, Lixin Duan, Stephen ...
An algorithm is given for computing projective structure from a set of six points seen in a sequence of many images. The method is based on the notion of duality between cameras a...
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
Erik B. Sudderth, Alexander T. Ihler, William T. F...