| Home | << 1 2 >> |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Jiaolong Xu; Sebastian Ramos; David Vazquez; Antonio Lopez | ||||
| Title | Hierarchical Adaptive Structural SVM for Domain Adaptation | Type | Journal Article | ||
| Year | 2016 | Publication | International Journal of Computer Vision | Abbreviated Journal | IJCV |
| Volume | 119 | Issue | 2 | Pages | 159-178 |
| Keywords | Domain Adaptation; Pedestrian Detection | ||||
| Abstract | A key topic in classification is the accuracy loss produced when the data distribution in the training (source) domain differs from that in the testing (target) domain. This is being recognized as a very relevant problem for many
computer vision tasks such as image classification, object detection, and object category recognition. In this paper, we present a novel domain adaptation method that leverages multiple target domains (or sub-domains) in a hierarchical adaptation tree. The core idea is to exploit the commonalities and differences of the jointly considered target domains. Given the relevance of structural SVM (SSVM) classifiers, we apply our idea to the adaptive SSVM (A-SSVM), which only requires the target domain samples together with the existing source-domain classifier for performing the desired adaptation. Altogether, we term our proposal as hierarchical A-SSVM (HA-SSVM). As proof of concept we use HA-SSVM for pedestrian detection, object category recognition and face recognition. In the former we apply HA-SSVM to the deformable partbased model (DPM) while in the rest HA-SSVM is applied to multi-category classifiers. We will show how HA-SSVM is effective in increasing the detection/recognition accuracy with respect to adaptation strategies that ignore the structure of the target data. Since, the sub-domains of the target data are not always known a priori, we shown how HA-SSVM can incorporate sub-domain discovery for object category recognition. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer US | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0920-5691 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.085; 600.082; 600.076 | Approved | no | ||
| Call Number | Admin @ si @ XRV2016 | Serial | 2669 | ||
| Permanent link to this record | |||||
| Author | Antonio Hernandez; Sergio Escalera; Stan Sclaroff | ||||
| Title | Poselet-basedContextual Rescoring for Human Pose Estimation via Pictorial Structures | Type | Journal Article | ||
| Year | 2016 | Publication | International Journal of Computer Vision | Abbreviated Journal | IJCV |
| Volume | 118 | Issue | 1 | Pages | 49–64 |
| Keywords | Contextual rescoring; Poselets; Human pose estimation | ||||
| Abstract | In this paper we propose a contextual rescoring method for predicting the position of body parts in a human pose estimation framework. A set of poselets is incorporated in the model, and their detections are used to extract spatial and score-related features relative to other body part hypotheses. A method is proposed for the automatic discovery of a compact subset of poselets that covers the different poses in a set of validation images while maximizing precision. A rescoring mechanism is defined as a set-based boosting classifier that computes a new score for each body joint detection, given its relationship to detections of other body joints and mid-level parts in the image. This new score is incorporated in the pictorial structure model as an additional unary potential, following the recent work of Pishchulin et al. Experiments on two benchmarks show comparable results to Pishchulin et al. while reducing the size of the mid-level representation by an order of magnitude, reducing the execution time by 68 % accordingly. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer US | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0920-5691 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | HuPBA;MILAB; | Approved | no | ||
| Call Number | Admin @ si @ HES2016 | Serial | 2719 | ||
| Permanent link to this record | |||||
| Author | Fahad Shahbaz Khan; Muhammad Anwer Rao; Joost Van de Weijer; Andrew Bagdanov; Antonio Lopez; Michael Felsberg | ||||
| Title | Coloring Action Recognition in Still Images | Type | Journal Article | ||
| Year | 2013 | Publication | International Journal of Computer Vision | Abbreviated Journal | IJCV |
| Volume | 105 | Issue | 3 | Pages | 205-221 |
| Keywords | |||||
| Abstract | In this article we investigate the problem of human action recognition in static images. By action recognition we intend a class of problems which includes both action classification and action detection (i.e. simultaneous localization and classification). Bag-of-words image representations yield promising results for action classification, and deformable part models perform very well object detection. The representations for action recognition typically use only shape cues and ignore color information. Inspired by the recent success of color in image classification and object detection, we investigate the potential of color for action classification and detection in static images. We perform a comprehensive evaluation of color descriptors and fusion approaches for action recognition. Experiments were conducted on the three datasets most used for benchmarking action recognition in still images: Willow, PASCAL VOC 2010 and Stanford-40. Our experiments demonstrate that incorporating color information considerably improves recognition performance, and that a descriptor based on color names outperforms pure color descriptors. Our experiments demonstrate that late fusion of color and shape information outperforms other approaches on action recognition. Finally, we show that the different color–shape fusion approaches result in complementary information and combining them yields state-of-the-art performance for action classification. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer US | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0920-5691 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | CIC; ADAS; 600.057; 600.048 | Approved | no | ||
| Call Number | Admin @ si @ KRW2013 | Serial | 2285 | ||
| Permanent link to this record | |||||
| Author | Jasper Uilings; Koen E.A. van de Sande; Theo Gevers; Arnold Smeulders | ||||
| Title | Selective Search for Object Recognition | Type | Journal Article | ||
| Year | 2013 | Publication | International Journal of Computer Vision | Abbreviated Journal | IJCV |
| Volume | 104 | Issue | 2 | Pages | 154-171 |
| Keywords | |||||
| Abstract | This paper addresses the problem of generating possible object locations for use in object recognition. We introduce selective search which combines the strength of both an exhaustive search and segmentation. Like segmentation, we use the image structure to guide our sampling process. Like exhaustive search, we aim to capture all possible object locations. Instead of a single technique to generate possible object locations, we diversify our search and use a variety of complementary image partitionings to deal with as many image conditions as possible. Our selective search results in a small set of data-driven, class-independent, high quality locations, yielding 99 % recall and a Mean Average Best Overlap of 0.879 at 10,097 locations. The reduced number of locations compared to an exhaustive search enables the use of stronger machine learning techniques and stronger appearance models for object recognition. In this paper we show that our selective search enables the use of the powerful Bag-of-Words model for recognition. The selective search software is made publicly available (Software: http://disi.unitn.it/~uijlings/SelectiveSearch.html). | ||||
| Address | |||||
| 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 | 0920-5691 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ALTRES;ISE | Approved | no | ||
| Call Number | Admin @ si @ USG2013 | Serial | 2362 | ||
| Permanent link to this record | |||||
| Author | Jose Manuel Alvarez; Theo Gevers; Antonio Lopez | ||||
| Title | Learning photometric invariance for object detection | Type | Journal Article | ||
| Year | 2010 | Publication | International Journal of Computer Vision | Abbreviated Journal | IJCV |
| Volume | 90 | Issue | 1 | Pages | 45-61 |
| Keywords | road detection | ||||
| Abstract | Impact factor: 3.508 (the last available from JCR2009SCI). Position 4/103 in the category Computer Science, Artificial Intelligence. Quartile
Color is a powerful visual cue in many computer vision applications such as image segmentation and object recognition. However, most of the existing color models depend on the imaging conditions that negatively affect the performance of the task at hand. Often, a reflection model (e.g., Lambertian or dichromatic reflectance) is used to derive color invariant models. However, this approach may be too restricted to model real-world scenes in which different reflectance mechanisms can hold simultaneously. Therefore, in this paper, we aim to derive color invariance by learning from color models to obtain diversified color invariant ensembles. First, a photometrical orthogonal and non-redundant color model set is computed composed of both color variants and invariants. Then, the proposed method combines these color models to arrive at a diversified color ensemble yielding a proper balance between invariance (repeatability) and discriminative power (distinctiveness). To achieve this, our fusion method uses a multi-view approach to minimize the estimation error. In this way, the proposed method is robust to data uncertainty and produces properly diversified color invariant ensembles. Further, the proposed method is extended to deal with temporal data by predicting the evolution of observations over time. Experiments are conducted on three different image datasets to validate the proposed method. Both the theoretical and experimental results show that the method is robust against severe variations in imaging conditions. The method is not restricted to a certain reflection model or parameter tuning, and outperforms state-of-the-art detection techniques in the field of object, skin and road recognition. Considering sequential data, the proposed method (extended to deal with future observations) outperforms the other methods |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer US | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0920-5691 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS;ISE | Approved | no | ||
| Call Number | ADAS @ adas @ AGL2010c | Serial | 1451 | ||
| Permanent link to this record | |||||
| Author | Arjan Gijsenij; Theo Gevers; Joost Van de Weijer | ||||
| Title | Generalized Gamut Mapping using Image Derivative Structures for Color Constancy | Type | Journal Article | ||
| Year | 2010 | Publication | International Journal of Computer Vision | Abbreviated Journal | IJCV |
| Volume | 86 | Issue | 2-3 | Pages | 127-139 |
| Keywords | |||||
| Abstract | The gamut mapping algorithm is one of the most promising methods to achieve computational color constancy. However, so far, gamut mapping algorithms are restricted to the use of pixel values to estimate the illuminant. Therefore, in this paper, gamut mapping is extended to incorporate the statistical nature of images. It is analytically shown that the proposed gamut mapping framework is able to include any linear filter output. The main focus is on the local n-jet describing the derivative structure of an image. It is shown that derivatives have the advantage over pixel values to be invariant to disturbing effects (i.e. deviations of the diagonal model) such as saturated colors and diffuse light. Further, as the n-jet based gamut mapping has the ability to use more information than pixel values alone, the combination of these algorithms are more stable than the regular gamut mapping algorithm. Different methods of combining are proposed. Based on theoretical and experimental results conducted on large scale data sets of hyperspectral, laboratory and realworld scenes, it can be derived that (1) in case of deviations of the diagonal model, the derivative-based approach outperforms the pixel-based gamut mapping, (2) state-of-the-art algorithms are outperformed by the n-jet based gamut mapping, (3) the combination of the different n-jet based gamut | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Kluwer Academic Publishers Hingham, MA, USA | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0920-5691 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ISE | Approved | no | ||
| Call Number | CAT @ cat @ GGW2010 | Serial | 1274 | ||
| Permanent link to this record | |||||