Sciweavers

895 search results - page 75 / 179
» Approximate convex decomposition
Sort
View
AVSS
2008
IEEE
15 years 4 months ago
Recognizing Shapes in Video Sequences Using Multi-class Boosting
We model the spatio-temporal variations of the shape of objects in a video sequence using a unique SVD-like decomposition. The decomposition is used to compute shape features, whi...
Naresh P. Cuntoor, Matt Welborn
JEI
2010
83views more  JEI 2010»
14 years 8 months ago
New image-quality measure based on wavelets
Abstract. We present an innovative approach to the objective quality evaluation that could be computed using the mean difference between the original and tested images in different...
Emil Dumic, Sonja Grgic, Mislav Grgic
ICASSP
2011
IEEE
14 years 1 months ago
Computing the nonnegative 3-way tensor factorization using Tikhonov regularization
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
Jean-Philip Royer, Pierre Comon, Nadège Thi...
WIOPT
2005
IEEE
15 years 3 months ago
Minimum Energy Transmission Scheduling Subject to Deadline Constraints
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
Alessandro Tarello, Jun Sun 0007, Murtaza Zafer, E...
COMPGEOM
1996
ACM
15 years 2 months ago
Developing a Practical Projection-Based Parallel Delaunay Algorithm
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
Guy E. Blelloch, Gary L. Miller, Dafna Talmor