Sciweavers

2127 search results - page 145 / 426
» Computing large matchings fast
Sort
View
CVPR
2007
IEEE
16 years 6 months ago
Fast Keypoint Recognition in Ten Lines of Code
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, Pascal Fua, Vincent Lepetit
ICASSP
2008
IEEE
15 years 10 months ago
Fusion of cleavage site detection and pairwise alignment for fast subcellular localization
In recent years, homology-based and signal-based methods have been proposed for predicting the subcellular localization of proteins. While it has been known that homology-based me...
Man-Wai Mak, Sun-Yuan Kung
ICPR
2010
IEEE
15 years 6 months ago
Fast Training of Object Detection Using Stochastic Gradient Descent
Training datasets for object detection problems are typically very large and Support Vector Machine (SVM) implementations are computationally complex. As opposed to these complex ...
Rob Wijnhoven, Peter H. N. De With
CVPR
2000
IEEE
16 years 6 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
SIGGRAPH
1996
ACM
15 years 8 months ago
Combining Frequency and Spatial Domain Information for Fast Interactive Image Noise Removal
Scratches on old films must be removed since these are more noticeable on higher definition and digital televisions. Wires that suspend actors or cars must be carefully erased dur...
Anil N. Hirani, Takashi Totsuka