1525 search results - page 121 / 305 » Matching with Regular Constraints |
117
click to vote
CVPR
1997
IEEE
16 years 6 months ago
1997
IEEE
We present a method for computing dense visual correspondence based on general assumptions about scene geometry. Our algorithm does not rely on correlation, and uses a variable re...
147
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
The puzzle assembly problem has many application areas such as restoration and reconstruction of archeological findings, repairing of broken objects, solving jigsaw type puzzles, ...
121
click to vote
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
— Facing new tasks, the conventional rigid design of robotic joints has come to its limits. Operating in unknown environments current robots are prone to failure when hitting unf...
147
click to vote
SCVMA
2004
Springer
15 years 9 months ago
2004
Springer
We present a method for figure-ground segregation of moving objects from monocular video sequences. The approach is based on tracking extracted contour fragments, in contrast to ...
136
click to vote
NIPS
2008
15 years 5 months ago
2008
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...