Sciweavers

3244 search results - page 135 / 649
» On convex complexity measures
Sort
View
PAMI
2008
157views more  PAMI 2008»
15 years 1 months ago
Subpixel Photometric Stereo
Conventional photometric stereo recovers one normal direction per pixel of the input image. This fundamentally limits the scale of recovered geometry to the resolution of the input...
Ping Tan, Stephen Lin, Long Quan
113
Voted
RAS
2007
113views more  RAS 2007»
15 years 1 months ago
From images to rooms
In this paper we start from a set of images obtained by the robot that is moving around in an environment. We present a method to automatically group the images into groups that c...
Zoran Zivkovic, Olaf Booij, Ben J. A. Kröse
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
15 years 7 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
89
Voted
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
15 years 7 months ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...
ESANN
2007
15 years 3 months ago
Order in Complex Systems of Nonlinear Oscillators: Phase Locked Subspaces
Any order parameter quantifying the degree of organisation in a physical system can be studied in connection to source extraction algorithms. Independent component analysis (ICA) b...
Jan-Hendrik Schleimer, Ricardo Vigário