Results 1 - 10 of 32,915

Directional Statistics and Shape Analysis

by K. V. Mardia , 1995
"... There have been various developments in shape analysis in the last decade. We describe here some relationships of shape analysis with directional statistics. For shape, rotations are to be integrated out or to be optimized over whilst they are the basis for directional statistics. However, various c ..."
Abstract - Cited by 794 (33 self) - Add to MetaCart
There have been various developments in shape analysis in the last decade. We describe here some relationships of shape analysis with directional statistics. For shape, rotations are to be integrated out or to be optimized over whilst they are the basis for directional statistics. However, various

A theory of shape by space carving

by Kiriakos N. Kutulakos, Steven M. Seitz - In Proceedings of the 7th IEEE International Conference on Computer Vision (ICCV-99), volume I, pages 307– 314, Los Alamitos, CA , 1999
"... In this paper we consider the problem of computing the 3D shape of an unknown, arbitrarily-shaped scene from multiple photographs taken at known but arbitrarilydistributed viewpoints. By studying the equivalence class of all 3D shapes that reproduce the input photographs, we prove the existence of a ..."
Abstract - Cited by 566 (14 self) - Add to MetaCart
of a special member of this class, the photo hull, that (1) can be computed directly from photographs of the scene, and (2) subsumes all other members of this class. We then give a provably-correct algorithm, called Space Carving, for computing this shape and present experimental results on complex

System architecture directions for networked sensors

by Jason Hill, Robert Szewczyk, Alec Woo, Seth Hollar, David Culler, Kristofer Pister - IN ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS , 2000
"... Technological progress in integrated, low-power, CMOS communication devices and sensors makes a rich design space of networked sensors viable. They can be deeply embedded in the physical world or spread throughout our environment. The missing elements are an overall system architecture and a methodo ..."
Abstract - Cited by 1789 (58 self) - Add to MetaCart
Technological progress in integrated, low-power, CMOS communication devices and sensors makes a rich design space of networked sensors viable. They can be deeply embedded in the physical world or spread throughout our environment. The missing elements are an overall system architecture and a

Randomized kinodynamic planning

by Steven M. Lavalle, James J. Kuffner, Jr. - THE INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH 2001; 20; 378 , 2001
"... This paper presents the first randomized approach to kinodynamic planning (also known as trajectory planning or trajectory design). The task is to determine control inputs to drive a robot from an initial configuration and velocity to a goal configuration and velocity while obeying physically based ..."
Abstract - Cited by 626 (35 self) - Add to MetaCart
space that has both first-order differential constraints and obstaclebased global constraints. The state space serves the same role as the configuration space for basic path planning; however, standard randomized path-planning techniques do not directly apply to planning trajectories in the state space

Footprint evaluation for volume rendering

by Lee Westover - Computer Graphics , 1990
"... This paper presents a forward mapping rendering algo-rithm to display regular volumetric grids that may not have the same spacings in the three grid directions. It takes advantage of the fact that convolution can be thought of as distributing energy from input samples into space. The renderer calcul ..."
Abstract - Cited by 501 (1 self) - Add to MetaCart
This paper presents a forward mapping rendering algo-rithm to display regular volumetric grids that may not have the same spacings in the three grid directions. It takes advantage of the fact that convolution can be thought of as distributing energy from input samples into space. The renderer

Depth first search and linear graph algorithms

by Robert Tarjan - SIAM JOURNAL ON COMPUTING , 1972
"... The value of depth-first search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect ..."
Abstract - Cited by 1406 (19 self) - Add to MetaCart
The value of depth-first search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components

From Few to many: Illumination cone models for face recognition under variable lighting and pose

by Athinodoros S. Georghiades, Peter N. Belhumeur, David J. Kriegman - IEEE Transactions on Pattern Analysis and Machine Intelligence , 2001
"... We present a generative appearance-based method for recognizing human faces under variation in lighting and viewpoint. Our method exploits the fact that the set of images of an object in fixed pose, but under all possible illumination conditions, is a convex cone in the space of images. Using a smal ..."
Abstract - Cited by 754 (12 self) - Add to MetaCart
We present a generative appearance-based method for recognizing human faces under variation in lighting and viewpoint. Our method exploits the fact that the set of images of an object in fixed pose, but under all possible illumination conditions, is a convex cone in the space of images. Using a

Depth-first Iterative-Deepening: An Optimal Admissible Tree Search

by Richard E. Korf - Artificial Intelligence , 1985
"... The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is known that breadth-first search requires too much space and depth-first search can use too much time and doesn't always find a cheapest path. A depth-first iteratiw-deepening a ..."
Abstract - Cited by 527 (24 self) - Add to MetaCart
The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is known that breadth-first search requires too much space and depth-first search can use too much time and doesn't always find a cheapest path. A depth-first iteratiw

A Simple Proof of the Restricted Isometry Property for Random Matrices

by Richard Baraniuk, Mark Davenport, Ronald DeVore, Michael Wakin - CONSTR APPROX , 2008
"... We give a simple technique for verifying the Restricted Isometry Property (as introduced by Candès and Tao) for random matrices that underlies Compressed Sensing. Our approach has two main ingredients: (i) concentration inequalities for random inner products that have recently provided algorithmical ..."
Abstract - Cited by 631 (64 self) - Add to MetaCart
, we obtain simple and direct proofs of Kashin’s theorems on widths of finite balls in Euclidean space (and their improvements due to Gluskin) and proofs of the existence of optimal Compressed Sensing measurement matrices. In the process, we also prove that these measurements have a certain

Seiberg-Witten prepotential from instanton counting

by Nikita A. Nekrasov , 2002
"... In my lecture I consider integrals over moduli spaces of supersymmetric gauge field configurations (instantons, Higgs bundles, torsion free sheaves). The applications are twofold: physical and mathematical; they involve supersymmetric quantum mechanics of D-particles in various dimensions, direct co ..."
Abstract - Cited by 496 (9 self) - Add to MetaCart
In my lecture I consider integrals over moduli spaces of supersymmetric gauge field configurations (instantons, Higgs bundles, torsion free sheaves). The applications are twofold: physical and mathematical; they involve supersymmetric quantum mechanics of D-particles in various dimensions, direct
Results 1 - 10 of 32,915