Sciweavers

173 search results - page 28 / 35
» Object recognition based on binary partition trees
Sort
View
ICML
2004
IEEE
15 years 10 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
IAJIT
2008
201views more  IAJIT 2008»
14 years 9 months ago
Implementation of a Novel Efficient Multiwavelet Based Video Coding Algorithm
: The recent explosion in digital video storage and delivery has presented strong motivation for high performance video compression solutions. An efficient video compression techni...
Sudhakar Radhakrishnan, Jayaraman Subramaniam
80
Voted
NIPS
2007
14 years 11 months ago
Loop Series and Bethe Variational Bounds in Attractive Graphical Models
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
Erik B. Sudderth, Martin J. Wainwright, Alan S. Wi...
CVPR
2010
IEEE
15 years 6 months ago
Linked Edges as Stable Region Boundaries
Many of the recently popular shape based category recognition methods require stable, connected and labeled edges as input. This paper introduces a novel method to find the most st...
Michael Donoser, Hayko Riemenschneider and Horst B...
ECML
2007
Springer
15 years 1 months ago
Efficient Computation of Recursive Principal Component Analysis for Structured Input
Recently, a successful extension of Principal Component Analysis for structured input, such as sequences, trees, and graphs, has been proposed. This allows the embedding of discret...
Alessandro Sperduti