We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
Antonio Robles-Kelly, Sudeep Sarkar, Edwin R. Hanc...
Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using...
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Nowadays, plagiarism has been presented as one of the main distresses that the information technology revolution has lead into our society for which using pattern matching algorith...
Gabriel Oberreuter, Gaston L'Huillier, Sebasti&aac...
Abstract. We propose a new complete method to extract significant description(s) of planar curves according to constant curvature segments. This method is based (i) on a multi-sca...