Sciweavers

1158 search results - page 46 / 232
» Template Generation and Selection Algorithms
Sort
View
121
Voted
CORR
2010
Springer
100views Education» more  CORR 2010»
15 years 4 months ago
Convex Relaxations for Subset Selection
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
Francis Bach, Selin Damla Ahipasaoglu, Alexandre d...
TIT
2008
76views more  TIT 2008»
15 years 4 months ago
Improved Risk Tail Bounds for On-Line Algorithms
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
Nicolò Cesa-Bianchi, Claudio Gentile
ICDAR
2003
IEEE
15 years 9 months ago
Photo time-stamp detection and recognition
This paper addresses the problem of photo time-stamp detection and recognition, which is to determine the time a photo was taken. Since the time-stamp is exposed together with the...
Xiang-Rong Chen, HongJiang Zhang
RAS
2007
151views more  RAS 2007»
15 years 3 months ago
Recursive scan-matching SLAM
This paper presents Scan-SLAM, a new generalisation of simultaneous localisation and mapping (SLAM). SLAM implementations based on extended Kalman filter (EKF) data fusion have t...
Juan Nieto, Tim Bailey, Eduardo Mario Nebot
PCM
2001
Springer
139views Multimedia» more  PCM 2001»
15 years 8 months ago
Fast and Robust Sprite Generation for MPEG-4 Video Coding
This paper presents a fast and robust sprite generation algorithm for MPEG-4 video coding. Our contributions consist of two aspects. Firstly, a fast and robust Global Motion Estima...
Yan Lu, Wen Gao, Feng Wu