• Publications
  • Influence
Computing visual attention from scene depth
TLDR
The investigation presented in this paper aims at an extension of the visual attention model to the scene depth component and results of visual attention, obtained form the extended model and for various 3D scenes, are presented.
Empirical Validation of the Saliency-based Model of Visual Attention
TLDR
A new method for quantitatively assessing the plausibility of this model of visual attention by comparing its performance with human behavior is proposed, which can easily be compared by qualitative and quantitative methods.
Generation And Use Of Color Pseudo Random Sequences For Coding Structured Light In Active Ranging
TLDR
This study uses color coding and generates the projected light stripes as a sequence of colors showing subsequences of length N which are all different and thus can be indexed by analysis of the observed stripe sequence.
A multi-resolution ICP with heuristic closest point search for fast and robust 3D registration of range images
  • T. Jost, Heinz Hugli
  • Computer Science
    Fourth International Conference on 3-D Digital…
  • 27 October 2003
TLDR
This work presents a new solution for the speeding up of the ICP algorithm and special care is taken to avoid any tradeoff with the quality of the registration.
Multi-feature matching algorithm for free-form 3D surface registration
TLDR
The convergence of the multi-feature ICP algorithm cannot be proven any more, however, experiments show successful convergence and a significant increase of the range of successful convergence range.
Optimized scattering compensation for time-of-flight camera
TLDR
It is shown that scattering reduction can be expressed as a deconvolution problem on a complex, two-dimensional signal and the problem of optimizing the description of the inverse filter for best scattering compensation results is treated.
A multi-resolution scheme ICP algorithm for fast shape registration
  • T. Jost, Heinz Hugli
  • Computer Science
    Proceedings. First International Symposium on 3D…
  • 7 November 2002
TLDR
This paper investigates this multiresolution ICP approach when coupled with the tree search or the neighbor search closest point algorithms, and shows that this combination permits us to create a very fast ICP algorithm, gaining speed up to a factor of 27 over a standard fast I CP algorithm.
Fast ICP Algorithms for Shape Registration
TLDR
This paper proposes and analyses a new, even less complex ICP algorithm, that uses a heuristic approach to find the closest points and permits to reduce the complexity to O(N) and to greatly accelerate the process.
Real-time scattering compensation for time-of-flight camera
TLDR
A simple scattering model is formulated and assuming a space invariant point spread function as a model for the scattering leads to a solution in a form of a deconvolution scheme whose computational feasibility and practical applicability are further discussed.
...
1
2
3
4
5
...