Sciweavers

6251 search results - page 191 / 1251
» Randomness, Computability, and Density
Sort
View
143
Voted
PAMI
2010
249views more  PAMI 2010»
15 years 2 months ago
Fast Keypoint Recognition Using Random Ferns
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Michael Calonder, Vincent Le...
ICPR
2000
IEEE
16 years 5 months ago
The Multimodal Signature Method: An Efficiency and Sensitivity Study
The multimodal neighbourhood signature (MNS) method has given acceptable results both for the colour-based image retrieval and the object recognition task. Local colour content is...
Dimitri Koubaroulis, Jiri Matas, Josef Kittler
ICPR
2010
IEEE
15 years 7 months ago
Transition Thresholds for Binarization of Historical Documents
Abstract--This paper extends the transition method for binarization based on transition pixels, a generalization of edge pixels. This method originally computes transition threshol...
Marte Alejandro Ramírez-Ortegón, Raul Rojas
CVPR
2009
IEEE
16 years 11 months ago
Global Connectivity Potentials for Random Field Models
Markov random field (MRF, CRF) models are popular in computer vision. However, in order to be computationally tractable they are limited to incorporate only local interactions a...
Sebastian Nowozin, Christoph H. Lampert
ICCV
2009
IEEE
16 years 9 months ago
Semi-Supervised Random Forests
Random Forests (RFs) have become commonplace in many computer vision applications. Their popularity is mainly driven by their high computational efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...