Sciweavers

14548 search results - page 2504 / 2910
» The Optimal Path-Matching Problem
Sort
View
DCC
2004
IEEE
16 years 6 months ago
Discrete Universal Filtering Through Incremental Parsing
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinb...
ACCV
2009
Springer
16 years 5 months ago
Estimating Human Pose from Occluded Images
We address the problem of recovering 3D human pose from single 2D images, in which the pose estimation problem is formulated as a direct nonlinear regression from image observation...
Jia-Bin Huang and Ming-Hsuan Yang
ECCV
2008
Springer
16 years 5 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee

Publication
207views
16 years 5 months ago
Incorporating Higher-Order Cues in Image Colorization
We consider the colorization problem of grayscale images when some pixels, called scribbles, with initial colors are given. In this paper, we propose a new multi-layer graph model ...
Tae Hoon Kim (Seoul National University), Kyoung M...
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
16 years 4 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...
« Prev « First page 2504 / 2910 Last » Next »