Sciweavers

1736 search results - page 88 / 348
» On antimagic directed graphs
Sort
View
ECCV
2010
Springer
14 years 4 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
ECCV
2010
Springer
14 years 3 months ago
A Stochastic Graph Evolution Framework for Robust Multi-Target Tracking
Maintaining the stability of tracks on multiple targets in video over extended time periods remains a challenging problem. A few methods which have recently shown encouraging resul...
ICIP
2009
IEEE
13 years 8 months ago
Optical flow and depth from motion for omnidirectional images using a TV-L1 variational framework on graphs
This paper deals with the problem of efficiently computing the optical flow of image sequences acquired by omnidirectional (nearly full field of view) cameras. We formulate the pr...
Luigi Bagnato, Pascal Frossard, Pierre Vandergheyn...
ICIP
2007
IEEE
15 years 14 days ago
Determining Topology in a Distributed Camera Network
Recently, `entry/exit' events of objects in the field-of-views of cameras were used to learn the topology of the camera network. The integration of object appearance was also...
Xiaotao Zou, Bir Bhanu, Bi Song, Amit K. Roy Chowd...
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
14 years 11 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale