Sciweavers

51 search results - page 6 / 11
» Constrained Hardy space approximation
Sort
View
IJRR
2007
104views more  IJRR 2007»
13 years 7 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
ICIP
2000
IEEE
14 years 9 months ago
Complexity-Regularized Denoising of Poisson-Corrupted Data
In this paper, we apply the complexity?regularization principle to Poisson imaging. We formulate a natural distortion measure in image space, and present a connection between comp...
Juan Liu, Pierre Moulin
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
14 years 1 months ago
Haptic Rendering of Topological Constraints to Users Manipulating Serial Virtual Linkages
— This paper presents an approach for haptic rendering of topological constraints to users operating serial virtual linkages. In the proposed approach, a haptic device controller...
Daniela Constantinescu, S. E. Salcudean, Elizabeth...
CCCG
2001
13 years 8 months ago
Translational polygon covering using intersection graphs
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
Karen Daniels, Rajasekhar Inkulu
TIFS
2008
157views more  TIFS 2008»
13 years 7 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...