Sciweavers

2520 search results - page 283 / 504
» The complexity of approximating entropy
Sort
View
COMPGEOM
2011
ACM
14 years 10 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
ICCV
1999
IEEE
16 years 8 months ago
A Dynamic Bayesian Network Approach to Figure Tracking using Learned Dynamic Models
The human figure exhibits complex and rich dynamic behavior that is both nonlinear and time-varying. However, most work on tracking and synthesizing figure motion has employed eit...
Vladimir Pavlovic, James M. Rehg, Tat-Jen Cham, Ke...
ECCV
2008
Springer
16 years 8 months ago
GeoS: Geodesic Image Segmentation
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
Antonio Criminisi, Toby Sharp, Andrew Blake
ICIP
2008
IEEE
16 years 8 months ago
Conditional iterative decoding of Two Dimensional Hidden Markov Models
Two Dimensional Hidden Markov Models (2D-HMMs) provide substantial benefits for many computer vision and image analysis applications. Many fundamental image analysis problems, inc...
Mehmet Emre Sargin, Alphan Altinok, Kenneth Rose, ...
ICIP
2005
IEEE
16 years 8 months ago
The M-term pursuit for image representation and progressive compression
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
Adel Rahmoune, Pierre Vandergheynst, Pascal Frossa...