Sciweavers

6365 search results - page 3 / 1273
» Fast Local Computation Algorithms
Sort
View
ICIP
2002
IEEE
14 years 7 months ago
Packet loss protection of embedded data with fast local search
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...
Vladimir Stankovic, Raouf Hamzaoui, Zixiang Xiong
ICPR
2008
IEEE
14 years 7 months ago
Fast and regularized local metric for query-based operations
To learn a metric for query?based operations, we combine the concept underlying manifold learning algorithms and the minimum volume ellipsoid metric in a unified algorithm to find...
Frank P. Ferrie, Karim T. Abou-Moustafa
ICIP
2000
IEEE
14 years 7 months ago
Fast Code Enhancement with Local Search for Fractal Image Compression
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
Raouf Hamzaoui, Dietmar Saupe, Michael Hiller
HAPTICS
2002
IEEE
13 years 11 months ago
Six-Degree-of-Freedom Haptic Display Using Localized Contact Computations
: We present a six-degree-of-freedom haptic rendering algorithm using localized contact computations. It takes advantage of high motion coherence due to fast force update and spati...
Young J. Kim, Miguel A. Otaduy, Ming C. Lin, Dines...
ICRA
2010
IEEE
194views Robotics» more  ICRA 2010»
13 years 4 months ago
Continuous collision detection for non-rigid contact computations using local advancement
Abstract— We present a novel algorithm to perform continuous collision detection(CCD) between non-rigid, deformable models using local advancement. Given the initial and final c...
Min Tang, Young J. Kim, Dinesh Manocha