2219 search results - page 41 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
PERCOM
2006
ACM
14 years 8 months ago
2006
ACM
This paper presents Cantag, an open source software toolkit for building Marker-based Vision (MBV) systems that can identify and accurately locate printed markers in three dimensi...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
CVPR
2007
IEEE
14 years 3 months ago
2007
IEEE
A sketch captures the most informative part of an object, in a much more concise and potentially robust representation (e.g., for face recognition or new capabilities of manipulat...
SIGSOFT
1994
ACM
14 years 1 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
ICCV
2009
IEEE
13 years 6 months ago
2009
IEEE
This paper examines the problem of moving object detection. More precisely, it addresses the difficult scenarios where background scene textures in the video might change over tim...