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....
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...
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...
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...
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 ...