We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
to appear in Proc. IEEE International Conference on Computer Vision (ICCV), 2005 Bayesian methods have been extensively used in various applications. However, there are two intrin...
Yunqiang Chen, Hongcheng Wang, Tong Fang, Jason Ty...
Every stereovision application must cope with the correspondence problem. The space of the matching variables, often consisting of spatial coordinates, intensity and disparity, is...
The satellite image deconvolution problem is ill-posed and must be regularized. Herein, we use an edge-preserving regularization model using a ' function, involving two hyper...
In this paper we aim to train deep neural networks for rapid visual recognition. The task is highly challenging, largely due to the lack of a meaningful regularizer on the functio...