138 search results - page 23 / 28 » Efficient Planar Graph Cuts with Applications in Computer Vi... |
PAMI
2008
13 years 7 months ago
2008
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
ASUNAM
2010
IEEE
13 years 9 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
Given a video sequence, obtaining accurate layer segmentation and alpha matting is very important for various applications. However, when a non-textured or smooth area is present ...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
We present a novel multi-object tracking algorithm based on multiple hypotheses about the trajectories of the objects. Our work is inspired by Reid's multiple hypothesis trac...