| |
Records |
Links |
|
Author |
Koen E.A. van de Sande; Jasper Uilings; Theo Gevers; Arnold Smeulders |
|
| |
Title |
Segmentation as Selective Search for Object Recognition |
Type |
Conference Article |
| |
Year |
2011 |
Publication |
13th IEEE International Conference on Computer Vision |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
1879-1886 |
|
| |
Keywords |
|
|
| |
Abstract |
For object recognition, the current state-of-the-art is based on exhaustive search. However, to enable the use of more expensive features and classifiers and thereby progress beyond the state-of-the-art, a selective search strategy is needed. Therefore, we adapt segmentation as a selective search by reconsidering segmentation: We propose to generate many approximate locations over few and precise object delineations because (1) an object whose location is never generated can not be recognised and (2) appearance and immediate nearby context are most effective for object recognition. Our method is class-independent and is shown to cover 96.7% of all objects in the Pascal VOC 2007 test set using only 1,536 locations per image. Our selective search enables the use of the more expensive bag-of-words method which we use to substantially improve the state-of-the-art by up to 8.5% for 8 out of 20 classes on the Pascal VOC 2010 detection challenge. |
|
| |
Address |
Barcelona |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume  |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
1550-5499 |
ISBN |
978-1-4577-1101-5 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ICCV |
|
| |
Notes |
ISE |
Approved |
no |
|
| |
Call Number |
Admin @ si @ SUG2011 |
Serial |
1780 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
E. Serradell; Adriana Romero; R. Leta; Carlo Gatta; Francesc Moreno-Noguer |
|
| |
Title |
Simultaneous Correspondence and Non-Rigid 3D Reconstruction of the Coronary Tree from Single X-Ray Images |
Type |
Conference Article |
| |
Year |
2011 |
Publication |
13th IEEE International Conference on Computer Vision |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
850-857 |
|
| |
Keywords |
|
|
| |
Abstract |
|
|
| |
Address |
Barcelona |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ICCV |
|
| |
Notes |
MILAB |
Approved |
no |
|
| |
Call Number |
Admin @ si @ SRL2011 |
Serial |
1803 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Bhaskar Chakraborty; Michael Holte; Thomas B. Moeslund; Jordi Gonzalez; Xavier Roca |
|
| |
Title |
A Selective Spatio-Temporal Interest Point Detector for Human Action Recognition in Complex Scenes |
Type |
Conference Article |
| |
Year |
2011 |
Publication |
13th IEEE International Conference on Computer Vision |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
1776-1783 |
|
| |
Keywords |
|
|
| |
Abstract |
Recent progress in the field of human action recognition points towards the use of Spatio-Temporal Interest Points (STIPs) for local descriptor-based recognition strategies. In this paper we present a new approach for STIP detection by applying surround suppression combined with local and temporal constraints. Our method is significantly different from existing STIP detectors and improves the performance by detecting more repeatable, stable and distinctive STIPs for human actors, while suppressing unwanted background STIPs. For action representation we use a bag-of-visual words (BoV) model of local N-jet features to build a vocabulary of visual-words. To this end, we introduce a novel vocabulary building strategy by combining spatial pyramid and vocabulary compression techniques, resulting in improved performance and efficiency. Action class specific Support Vector Machine (SVM) classifiers are trained for categorization of human actions. A comprehensive set of experiments on existing benchmark datasets, and more challenging datasets of complex scenes, validate our approach and show state-of-the-art performance. |
|
| |
Address |
Barcelona |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
1550-5499 |
ISBN |
978-1-4577-1101-5 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ICCV |
|
| |
Notes |
ISE |
Approved |
no |
|
| |
Call Number |
Admin @ si @ CHM2011 |
Serial |
1811 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Mohammad Rouhani; Angel Sappa |
|
| |
Title |
Correspondence Free Registration through a Point-to-Model Distance Minimization |
Type |
Conference Article |
| |
Year |
2011 |
Publication |
13th IEEE International Conference on Computer Vision |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
2150-2157 |
|
| |
Keywords |
|
|
| |
Abstract |
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of the existing works, which are based on minimizing a point-wise correspondence term, we propose to describe the model set by means of an implicit representation. It allows a new definition of the registration error, which works beyond the point level representation. Moreover, it could be used in a gradient-based optimization framework. The proposed approach consists of two stages. Firstly, a novel formulation is proposed that relates the registration parameters with the distance between the model and data set. Secondly, the registration parameters are obtained by means of the Levengberg-Marquardt algorithm. Experimental results and comparisons with state of the art show the validity of the proposed framework. |
|
| |
Address |
Barcelona |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
1550-5499 |
ISBN |
978-1-4577-1101-5 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ICCV |
|
| |
Notes |
ADAS |
Approved |
no |
|
| |
Call Number |
Admin @ si @ RoS2011b; ADAS @ adas @ |
Serial |
1832 |
|
| Permanent link to this record |
