Sciweavers

1024 search results - page 72 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
IVC
2008
138views more  IVC 2008»
14 years 9 months ago
Reconstructing relief surfaces
This paper generalizes Markov Random Field (MRF) stereo methods to the generation of surface relief (height) fields rather than disparity or depth maps. This generalization enable...
George Vogiatzis, Philip H. S. Torr, Steven M. Sei...
ML
1998
ACM
139views Machine Learning» more  ML 1998»
14 years 9 months ago
The Hierarchical Hidden Markov Model: Analysis and Applications
We introduce, analyze and demonstrate a recursive hierarchical generalization of the widely used hidden Markov models, which we name Hierarchical Hidden Markov Models (HHMM). Our m...
Shai Fine, Yoram Singer, Naftali Tishby
TSP
2011
151views more  TSP 2011»
14 years 4 months ago
Stochastic Models for Sparse and Piecewise-Smooth Signals
Abstract—We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential...
Michael Unser, Pouya Dehghani Tafti
WEA
2009
Springer
165views Algorithms» more  WEA 2009»
15 years 2 months ago
On Computational Models for Flash Memory Devices
Flash memory-based solid-state disks are fast becoming the dominant form of end-user storage devices, partly even replacing the traditional hard-disks. Existing two-level memory hi...
Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulric...
KDD
2005
ACM
112views Data Mining» more  KDD 2005»
15 years 10 months ago
Model-based overlapping clustering
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
Arindam Banerjee, Chase Krumpelman, Joydeep Ghosh,...