41 search results - page 7 / 9 » Non-Orthogonal Binary Subspace and Its Applications in Compu... |
IJCV
2006
13 years 7 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
ACCV
2007
Springer
14 years 2 months ago
2007
Springer
The ability to detect and recognize individuals is essential for an autonomous robot interacting with humans even if computational resources are usually rather limited. In general ...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...
CVPR
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, we propose a novel learning method, called Jensen-Shannon Boosting (JSBoost) and demonstrate its application to object recognition. JSBoost incorporates Jensen-Shan...
ICCV
2009
IEEE
15 years 25 days ago
2009
IEEE
Visual categorization problems, such as object classification or action recognition,
are increasingly often approached using a detection strategy: a classifier function
is first ...