Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
We present a new method for detecting interest points
using histogram information. Unlike existing interest point
detectors, which measure pixel-wise differences in image
intens...
Wei-Ting Lee (National Tsing Hua University), Hwan...
We propose a novel geometric Rao-Blackwellized particle filtering framework for monocular SLAM with locally planar landmarks. We represent the states for the camera pose and the la...
Junghyun Kwon (Seoul National University) and Kyou...
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on universe. In the view of granular computing, classical ro...