Sciweavers

498 search results - page 41 / 100
» Measuring the Complexity of Polygonal Objects
Sort
View
DCOSS
2007
Springer
15 years 1 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
VLDB
1999
ACM
112views Database» more  VLDB 1999»
15 years 2 months ago
Context-Based Prefetch for Implementing Objects on Relations
When implementing persistent objects on a relational database, a major performance issue is prefetching data to minimize the number of roundtrips to the database. This is especial...
Philip A. Bernstein, Shankar Pal, David Shutt
ICPR
2008
IEEE
15 years 5 months ago
Online Feature Evaluation For Object Tracking Using Kalman Filter
An online feature evaluation method for visual object tracking is put forward in this paper. Firstly, a combined feature set is built using color histogram (HC) bins and gradien...
Zhenjun Han, Qixiang Ye, Jianbin Jiao+
AMDO
2004
Springer
15 years 3 months ago
Image Cues Fusion for Object Tracking Based on Particle Filter
Particle filter is a powerful algorithm to deal with non-linear and non-Gaussian tracking problems. However the algorithm relying only upon one image cue often fails in challengin...
Peihua Li, François Chaumette
PR
2007
125views more  PR 2007»
14 years 9 months ago
Calculating geometric properties of three-dimensional objects from the spherical harmonic representation
The volume, location of the centroid, and second order moments of a threedimensional star-shaped object are determined in terms of the spherical harmonic coefficients of its bound...
Artemy Baxansky, Nahum Kiryati