Image-based reconstruction from randomly scattered views is a challenging problem. We present a new algorithm that extends Seitz and Dyer’s Voxel Coloring algorithm. Unlike their...
W. Bruce Culbertson, Thomas Malzbender, Gregory G....
—To efficiently solve challenging motion-planning problems with dynamics, this paper proposes treating motion planning not just as a search problem in a continuous space but as ...
We address the problem of multi-person dataassociation-based tracking (DAT) in semi-crowded environments from a single camera. Existing trackletassociation-based methods using pur...
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...
Abstract— We present a path planning algorithm for a polyhedral robot with six degrees of freedom (6DOF) and a static obstacle. The planner consists of a dual-tree RRT algorithm ...