Sciweavers

7259 search results - page 4 / 1452
» From Fields to Trees
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
LION
2009
Springer
135views Optimization» more  LION 2009»
14 years 2 months ago
Neural Network Pairwise Interaction Fields for Protein Model Quality Assessment
We present a new knowledge-based Model Quality Assessment Program (MQAP) at the residue level which evaluates single protein structure models. We use a tree representation of the ...
Alberto J. M. Martin, Alessandro Vullo, Gianluca P...
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
ICIP
2006
IEEE
14 years 2 months ago
MRF Modeling for Optical Flow Computation from Multi-Structure Objects
We propose in this paper a new formulation of the equation of the optical flow enabling to compute global and local motions of multi-structure objects (flowers and petals, trees...
Véronique Prinet, Cyril Cassisa, FengFeng T...
ICDAR
2009
IEEE
13 years 5 months ago
Recognition of Handwritten Numerical Fields in a Large Single-Writer Historical Collection
This paper presents a segmentation-based handwriting recognizer and the performance that it achieves on the numerical fields extracted from a large single-writer historical collec...
Marius Bulacu, Axel Brink, Tijn van der Zant, Lamb...