Sciweavers

1119 search results - page 97 / 224
» Hypercube Algorithms for Image Transformations
Sort
View
SSWMC
2004
15 years 3 months ago
On the complexity and hardness of the steganography embedding problem
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
Rajarathnam Chandramouli, Shalin P. Trivedi, R. N....
ICPR
2008
IEEE
16 years 3 months ago
New extensions of the 3-simplex for exterior orientation
Object pose may be determined from a set of 2D image points and corresponding 3D model points, given the camera's intrinsic parameters. In this paper, two new exterior orient...
John Martin Steinbis, Tyrone Vincent, William A. H...
ICMCS
2006
IEEE
103views Multimedia» more  ICMCS 2006»
15 years 8 months ago
Multiplierless Approximation of Fast DCT Algorithms
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
Raymond Chan, Moon-chuen Lee
ICASSP
2011
IEEE
14 years 5 months ago
A general Bayesian algorithm for visual object tracking based on sparse features
This paper describes a Bayesian algorithm for rigid/non-rigid 2D visual object tracking based on sparse image features. The algorithm is inspired by the way human visual cortex se...
Mauricio Soto Alvarez, Carlo S. Regazzoni
3DIM
2003
IEEE
15 years 7 months ago
Geometrically Stable Sampling for the ICP Algorithm
The Iterative Closest Point (ICP) algorithm is a widely used method for aligning three-dimensional point sets. The quality of alignment obtained by this algorithm depends heavily ...
Natasha Gelfand, Szymon Rusinkiewicz, Leslie Ikemo...