| |
Records |
Links |
|
Author |
Idoia Ruiz; Joan Serrat |
|
| |
Title |
Rank-based ordinal classification |
Type |
Conference Article |
| |
Year |
2020 |
Publication |
25th International Conference on Pattern Recognition |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
8069-8076 |
|
| |
Keywords |
|
|
| |
Abstract |
Differently from the regular classification task, in ordinal classification there is an order in the classes. As a consequence not all classification errors matter the same: a predicted class close to the groundtruth one is better than predicting a farther away class. To account for this, most previous works employ loss functions based on the absolute difference between the predicted and groundtruth class labels. We argue that there are many cases in ordinal classification where label values are arbitrary (for instance 1. . . C, being C the number of classes) and thus such loss functions may not be the best choice. We instead propose a network architecture that produces not a single class prediction but an ordered vector, or ranking, of all the possible classes from most to least likely. This is thanks to a loss function that compares groundtruth and predicted rankings of these class labels, not the labels themselves. Another advantage of this new formulation is that we can enforce consistency in the predictions, namely, predicted rankings come from some unimodal vector of scores with mode at the groundtruth class. We compare with the state of the art ordinal classification methods, showing
that ours attains equal or better performance, as measured by common ordinal classification metrics, on three benchmark datasets. Furthermore, it is also suitable for a new task on image aesthetics assessment, i.e. most voted score prediction. Finally, we also apply it to building damage assessment from satellite images, providing an analysis of its performance depending on the degree of imbalance of the dataset. |
|
| |
Address |
Virtual; January 2021 |
|
| |
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  |
ICPR |
|
| |
Notes |
ADAS; 600.118; 600.124 |
Approved |
no |
|
| |
Call Number |
Admin @ si @ RuS2020 |
Serial |
3549 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Katerine Diaz; Francesc J. Ferri; W. Diaz |
|
| |
Title |
Fast Approximated Discriminative Common Vectors using rank-one SVD updates |
Type |
Conference Article |
| |
Year |
2013 |
Publication |
20th International Conference On Neural Information Processing |
Abbreviated Journal |
|
|
| |
Volume |
8228 |
Issue |
III |
Pages |
368-375 |
|
| |
Keywords |
|
|
| |
Abstract |
An efficient incremental approach to the discriminative common vector (DCV) method for dimensionality reduction and classification is presented. The proposal consists of a rank-one update along with an adaptive restriction on the rank of the null space which leads to an approximate but convenient solution. The algorithm can be implemented very efficiently in terms of matrix operations and space complexity, which enables its use in large-scale dynamic application domains. Deep comparative experimentation using publicly available high dimensional image datasets has been carried out in order to properly assess the proposed algorithm against several recent incremental formulations.
K. Diaz-Chito, F.J. Ferri, W. Diaz |
|
| |
Address |
Daegu; Korea; November 2013 |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Springer Berlin Heidelberg |
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
LNCS |
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
0302-9743 |
ISBN |
978-3-642-42050-4 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ICONIP |
|
| |
Notes |
ADAS |
Approved |
no |
|
| |
Call Number |
Admin @ si @ DFD2013 |
Serial |
2439 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Jaume Amores; David Geronimo; Antonio Lopez |
|
| |
Title |
Multiple instance and active learning for weakly-supervised object-class segmentation |
Type |
Conference Article |
| |
Year |
2010 |
Publication |
3rd IEEE International Conference on Machine Vision |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
Multiple Instance Learning; Active Learning; Object-class segmentation. |
|
| |
Abstract |
In object-class segmentation, one of the most tedious tasks is to manually segment many object examples in order to learn a model of the object category. Yet, there has been little research on reducing the degree of manual annotation for
object-class segmentation. In this work we explore alternative strategies which do not require full manual segmentation of the object in the training set. In particular, we study the use of bounding boxes as a coarser and much cheaper form of segmentation and we perform a comparative study of several Multiple-Instance Learning techniques that allow to obtain a model with this type of weak annotation. We show that some of these methods can be competitive, when used with coarse
segmentations, with methods that require full manual segmentation of the objects. Furthermore, we show how to use active learning combined with this weakly supervised strategy.
As we see, this strategy permits to reduce the amount of annotation and optimize the number of examples that require full manual segmentation in the training set. |
|
| |
Address |
Hong-Kong |
|
| |
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 |
ICMV |
|
| |
Notes |
ADAS |
Approved |
no |
|
| |
Call Number |
ADAS @ adas @ AGL2010b |
Serial |
1429 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Muhammad Anwer Rao; Fahad Shahbaz Khan; Joost Van de Weijer; Jorma Laaksonen |
|
| |
Title |
Combining Holistic and Part-based Deep Representations for Computational Painting Categorization |
Type |
Conference Article |
| |
Year |
2016 |
Publication |
6th International Conference on Multimedia Retrieval |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
|
|
| |
Abstract |
Automatic analysis of visual art, such as paintings, is a challenging inter-disciplinary research problem. Conventional approaches only rely on global scene characteristics by encoding holistic information for computational painting categorization.We argue that such approaches are sub-optimal and that discriminative common visual structures provide complementary information for painting classification. We present an approach that encodes both the global scene layout and discriminative latent common structures for computational painting categorization. The region of interests are automatically extracted, without any manual part labeling, by training class-specific deformable part-based models. Both holistic and region-of-interests are then described using multi-scale dense convolutional features. These features are pooled separately using Fisher vector encoding and concatenated afterwards in a single image representation. Experiments are performed on a challenging dataset with 91 different painters and 13 diverse painting styles. Our approach outperforms the standard method, which only employs the global scene characteristics. Furthermore, our method achieves state-of-the-art results outperforming a recent multi-scale deep features based approach [11] by 6.4% and 3.8% respectively on artist and style classification. |
|
| |
Address |
New York; USA; June 2016 |
|
| |
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 |
ICMR |
|
| |
Notes |
LAMP; 600.068; 600.079;ADAS |
Approved |
no |
|
| |
Call Number |
Admin @ si @ RKW2016 |
Serial |
2763 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
David Vazquez; Antonio Lopez; Daniel Ponsa; Javier Marin |
|
| |
Title |
Virtual Worlds and Active Learning for Human Detection |
Type |
Conference Article |
| |
Year |
2011 |
Publication |
13th International Conference on Multimodal Interaction |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
393-400 |
|
| |
Keywords |
Pedestrian Detection; Human detection; Virtual; Domain Adaptation; Active Learning |
|
| |
Abstract |
Image based human detection is of paramount interest due to its potential applications in fields such as advanced driving assistance, surveillance and media analysis. However, even detecting non-occluded standing humans remains a challenge of intensive research. The most promising human detectors rely on classifiers developed in the discriminative paradigm, i.e., trained with labelled samples. However, labeling is a manual intensive step, especially in cases like human detection where it is necessary to provide at least bounding boxes framing the humans for training. To overcome such problem, some authors have proposed the use of a virtual world where the labels of the different objects are obtained automatically. This means that the human models (classifiers) are learnt using the appearance of rendered images, i.e., using realistic computer graphics. Later, these models are used for human detection in images of the real world. The results of this technique are surprisingly good. However, these are not always as good as the classical approach of training and testing with data coming from the same camera, or similar ones. Accordingly, in this paper we address the challenge of using a virtual world for gathering (while playing a videogame) a large amount of automatically labelled samples (virtual humans and background) and then training a classifier that performs equal, in real-world images, than the one obtained by equally training from manually labelled real-world samples. For doing that, we cast the problem as one of domain adaptation. In doing so, we assume that a small amount of manually labelled samples from real-world images is required. To collect these labelled samples we propose a non-standard active learning technique. Therefore, ultimately our human model is learnt by the combination of virtual and real world labelled samples (Fig. 1), which has not been done before. We present quantitative results showing that this approach is valid. |
|
| |
Address |
Alicante, Spain |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
ACM DL |
Place of Publication |
New York, NY, USA, USA |
Editor |
|
|
| |
Language |
English |
Summary Language |
English |
Original Title |
Virtual Worlds and Active Learning for Human Detection |
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
978-1-4503-0641-6 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ICMI |
|
| |
Notes |
ADAS |
Approved |
yes |
|
| |
Call Number |
ADAS @ adas @ VLP2011a |
Serial |
1683 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Ishaan Gulrajani; Kundan Kumar; Faruk Ahmed; Adrien Ali Taiga; Francesco Visin; David Vazquez; Aaron Courville |
|
| |
Title |
PixelVAE: A Latent Variable Model for Natural Images |
Type |
Conference Article |
| |
Year |
2017 |
Publication |
5th International Conference on Learning Representations |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
Deep Learning; Unsupervised Learning |
|
| |
Abstract |
Natural image modeling is a landmark challenge of unsupervised learning. Variational Autoencoders (VAEs) learn a useful latent representation and generate samples that preserve global structure but tend to suffer from image blurriness. PixelCNNs model sharp contours and details very well, but lack an explicit latent representation and have difficulty modeling large-scale structure in a computationally efficient way. In this paper, we present PixelVAE, a VAE model with an autoregressive decoder based on PixelCNN. The resulting architecture achieves state-of-the-art log-likelihood on binarized MNIST. We extend PixelVAE to a hierarchy of multiple latent variables at different scales; this hierarchical model achieves competitive likelihood on 64x64 ImageNet and generates high-quality samples on LSUN bedrooms. |
|
| |
Address |
Toulon; France; April 2017 |
|
| |
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 |
ICLR |
|
| |
Notes |
ADAS; 600.085; 600.076; 601.281; 600.118 |
Approved |
no |
|
| |
Call Number |
ADAS @ adas @ GKA2017 |
Serial |
2815 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Jose Manuel Alvarez; Ferran Diego; Joan Serrat; Antonio Lopez |
|
| |
Title |
Automatic Ground-truthing using video registration for on-board detection algorithms |
Type |
Conference Article |
| |
Year |
2009 |
Publication |
16th IEEE International Conference on Image Processing |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
4389 - 4392 |
|
| |
Keywords |
|
|
| |
Abstract |
Ground-truth data is essential for the objective evaluation of object detection methods in computer vision. Many works claim their method is robust but they support it with experiments which are not quantitatively assessed with regard some ground-truth. This is one of the main obstacles to properly evaluate and compare such methods. One of the main reasons is that creating an extensive and representative ground-truth is very time consuming, specially in the case of video sequences, where thousands of frames have to be labelled. Could such a ground-truth be generated, at least in part, automatically? Though it may seem a contradictory question, we show that this is possible for the case of video sequences recorded from a moving camera. The key idea is transferring existing frame segmentations from a reference sequence into another video sequence recorded at a different time on the same track, possibly under a different ambient lighting. We have carried out experiments on several video sequence pairs and quantitatively assessed the precision of the transformed ground-truth, which prove that our approach is not only feasible but also quite accurate. |
|
| |
Address |
Cairo, Egypt |
|
| |
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 |
1522-4880 |
ISBN |
978-1-4244-5653-6 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ICIP |
|
| |
Notes |
ADAS |
Approved |
no |
|
| |
Call Number |
ADAS @ adas @ ADS2009 |
Serial |
1201 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Angel Sappa; Mohammad Rouhani |
|
| |
Title |
Efficient Distance Estimation for Fitting Implicit Quadric Surfaces |
Type |
Conference Article |
| |
Year |
2009 |
Publication |
16th IEEE International Conference on Image Processing |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
3521–3524 |
|
| |
Keywords |
|
|
| |
Abstract |
This paper presents a novel approach for estimating the shortest Euclidean distance from a given point to the corresponding implicit quadric fitting surface. It first estimates the orthogonal orientation to the surface from the given point; then the shortest distance is directly estimated by intersecting the implicit surface with a line passing through the given point according to the estimated orthogonal orientation. The proposed orthogonal distance estimation is easily obtained without increasing computational complexity; hence it can be used in error minimization surface fitting frameworks. Comparisons of the proposed metric with previous approaches are provided to show both improvements in CPU time as well as in the accuracy of the obtained results. Surfaces fitted by using the proposed geometric distance estimation and state of the art metrics are presented to show the viability of the proposed approach. |
|
| |
Address |
Cairo, Egypt |
|
| |
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 |
1522-4880 |
ISBN |
978-1-4244-5653-6 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ICIP |
|
| |
Notes |
ADAS |
Approved |
no |
|
| |
Call Number |
ADAS @ adas @ SaR2009 |
Serial |
1232 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Fernando Barrera; Felipe Lumbreras; Angel Sappa |
|
| |
Title |
Multimodal Template Matching based on Gradient and Mutual Information using Scale-Space |
Type |
Conference Article |
| |
Year |
2010 |
Publication |
17th IEEE International Conference on Image Processing |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
2749–2752 |
|
| |
Keywords |
|
|
| |
Abstract |
This paper presents the combined use of gradient and mutual information for infrared and intensity templates matching. We propose to joint: (i) feature matching in a multiresolution context and (ii) information propagation through scale-space representations. Our method consists in combining mutual information with a shape descriptor based on gradient, and propagate them following a coarse-to-fine strategy. The main contributions of this work are: to offer a theoretical formulation towards a multimodal stereo matching; to show that gradient and mutual information can be reinforced while they are propagated between consecutive levels; and to show that they are valid cost functions in multimodal template matchings. Comparisons are presented showing the improvements and viability of the proposed approach. |
|
| |
Address |
Hong-Kong |
|
| |
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 |
1522-4880 |
ISBN |
978-1-4244-7992-4 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ICIP |
|
| |
Notes |
ADAS |
Approved |
no |
|
| |
Call Number |
ADAS @ adas @ BLS2010 |
Serial |
1358 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Mohammad Rouhani; Angel Sappa |
|
| |
Title |
A Fast accurate Implicit Polynomial Fitting Approach |
Type |
Conference Article |
| |
Year |
2010 |
Publication |
17th IEEE International Conference on Image Processing |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
1429–1432 |
|
| |
Keywords |
|
|
| |
Abstract |
This paper presents a novel hybrid approach that combines state of the art fitting algorithms: algebraic-based and geometric-based. It consists of two steps; first, the 3L algorithm is used as an initialization and then, the obtained result, is improved through a geometric approach. The adopted geometric approach is based on a distance estimation that avoids costly search for the real orthogonal distance. Experimental results are presented as well as quantitative comparisons. |
|
| |
Address |
Hong-Kong |
|
| |
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 |
1522-4880 |
ISBN |
978-1-4244-7992-4 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
ICIP |
|
| |
Notes |
ADAS |
Approved |
no |
|
| |
Call Number |
ADAS @ adas @ RoS2010b |
Serial |
1359 |
|
| Permanent link to this record |
