Sciweavers

891 search results - page 117 / 179
» An Optimal Control Formulation of an Image Registration Prob...
Sort
View
ICASSP
2010
IEEE
14 years 10 months ago
Searching with expectations
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
Harsimrat Sandhawalia, Herve Jegou
IJDSN
2006
132views more  IJDSN 2006»
14 years 9 months ago
Using Misbehavior to Analyze Strategic versus Aggregate Energy Minimization in Wireless Sensor Networks
Abstract-- We present a novel formulation of the problem of energy misbehavior and develop an analytical framework for quantifying its impact on other nodes. Specifically, we formu...
Rajgopal Kannan, Shuangqing Wei, Vasu Chakravarthy...
ECCV
2010
Springer
15 years 2 months ago
Error-tolerant Image Compositing
Abstract. Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and...
VLSISP
1998
111views more  VLSISP 1998»
14 years 9 months ago
Quantitative Analysis of MR Brain Image Sequences by Adaptive Self-Organizing Finite Mixtures
This paper presents an adaptive structure self-organizing finite mixture network for quantification of magnetic resonance (MR) brain image sequences. We present justification fo...
Yue Wang, Tülay Adali, Chi-Ming Lau, Sun-Yuan...
CVPR
2010
IEEE
15 years 6 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler