Sciweavers

1190 search results - page 33 / 238
» Complex Salient Regions for Computer Vision Problems
Sort
View
CVPR
2008
IEEE
15 years 4 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie
CVPR
2008
IEEE
15 years 12 months ago
Auto-context and its application to high-level vision tasks
The notion of using context information for solving highlevel vision problems has been increasingly realized in the field. However, how to learn an effective and efficient context...
Zhuowen Tu
CVPR
2006
IEEE
15 years 12 months ago
Stereo Vision in Structured Environments by Consistent Semi-Global Matching
This paper considers the use of stereo vision in structured environments. Sharp discontinuities and large untextured areas must be anticipated, but complex or natural shapes of ob...
Heiko Hirschmüller
ICPR
2002
IEEE
15 years 11 months ago
Automated Feature Registration for Robust Tracking Methods
Tracking people within a scene has been a longstanding challenge in the field of computer vision. A common approach involves matching the background against the incoming video str...
Shawn Arseneau, Jeremy R. Cooperstock
TCBB
2008
73views more  TCBB 2008»
14 years 9 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple