Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
In this paper, we describe the method for aligning multiple range images given by a range finder. Especially we will use range images of inside and outside of buildings which cont...
This paper presents a novel algorithm for online structure and motion estimation. The algorithm works for general camera models and minimizes object space error, it does not rely ...
We study the use of neural network algorithms in surface reconstruction from an unorganized point cloud, and meshing of an implicit surface. We found that for such applications, t...
Ioannis P. Ivrissimtzis, Won-Ki Jeong, Hans-Peter ...