Sciweavers

2031 search results - page 247 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
ICS
2004
Tsinghua U.
15 years 3 months ago
Applications of storage mapping optimization to register promotion
Storage mapping optimization is a flexible approach to folding array dimensions in numerical codes. It is designed to reduce the memory footprint after a wide spectrum of loop tr...
Patrick Carribault, Albert Cohen
FGR
2000
IEEE
230views Biometrics» more  FGR 2000»
15 years 2 months ago
A Robust Model-Based Approach for 3D Head Tracking in Video Sequences
We present a generic and robust method for model-based global 3D head pose estimation in monocular and non-calibrated video sequences. The proposed method relies on a 3D/2D matchi...
Marius Malciu, Françoise J. Prêteux
CVPR
2007
IEEE
16 years 16 hour ago
City-Scale Location Recognition
We look at the problem of location recognition in a large image dataset using a vocabulary tree. This entails finding the location of a query image in a large dataset containing 3...
Grant Schindler, Matthew Brown, Richard Szeliski
ECCV
2000
Springer
15 years 12 months ago
Plane+Parallax, Tensors and Factorization
Abstract. We study the special form that the general multi-image tensor formalism takes under the plane + parallax decomposition, including matching tensors and constraints, closur...
Bill Triggs
ICIP
2007
IEEE
15 years 11 months ago
Estimating Steganographic Capacity for Odd-Even Based Embedding and its Use in Individual Compensation
We present a method to compute the steganographic capacity for images, with odd-even based hiding in the quantized discrete cosine transform domain. The method has been generalize...
Anindya Sarkar, B. S. Manjunath