| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–20] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Miguel Angel Bautista; Antonio Hernandez; Sergio Escalera; Laura Igual; Oriol Pujol; Josep Moya; Veronica Violant; Maria Teresa Anguera | ||||
| Title | A Gesture Recognition System for Detecting Behavioral Patterns of ADHD | Type | Journal Article | ||
| Year | 2016 | Publication | IEEE Transactions on System, Man and Cybernetics, Part B | Abbreviated Journal  |
TSMCB |
| Volume | 46 | Issue | 1 | Pages | 136-147 |
| Keywords | Gesture Recognition; ADHD; Gaussian Mixture Models; Convex Hulls; Dynamic Time Warping; Multi-modal RGB-Depth data | ||||
| Abstract | We present an application of gesture recognition using an extension of Dynamic Time Warping (DTW) to recognize behavioural patterns of Attention Deficit Hyperactivity Disorder (ADHD). We propose an extension of DTW using one-class classifiers in order to be able to encode the variability of a gesture category, and thus, perform an alignment between a gesture sample and a gesture class. We model the set of gesture samples of a certain gesture category using either GMMs or an approximation of Convex Hulls. Thus, we add a theoretical contribution to classical warping path in DTW by including local modeling of intra-class gesture variability. This methodology is applied in a clinical context, detecting a group of ADHD behavioural patterns defined by experts in psychology/psychiatry, to provide support to clinicians in the diagnose procedure. The proposed methodology is tested on a novel multi-modal dataset (RGB plus Depth) of ADHD children recordings with behavioural patterns. We obtain satisfying results when compared to standard state-of-the-art approaches in the DTW context. | ||||
| 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 | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | HuPBA; MILAB; | Approved | no | ||
| Call Number | Admin @ si @ BHE2016 | Serial | 2566 | ||
| Permanent link to this record | |||||
| Author | Daniel Hernandez; Antonio Espinosa; David Vazquez; Antonio Lopez; Juan C. Moure | ||||
| Title | 3D Perception With Slanted Stixels on GPU | Type | Journal Article | ||
| Year | 2021 | Publication | IEEE Transactions on Parallel and Distributed Systems | Abbreviated Journal |
TPDS |
| Volume | 32 | Issue | 10 | Pages | 2434-2447 |
| Keywords | Daniel Hernandez-Juarez; Antonio Espinosa; David Vazquez; Antonio M. Lopez; Juan C. Moure | ||||
| Abstract | This article presents a GPU-accelerated software design of the recently proposed model of Slanted Stixels, which represents the geometric and semantic information of a scene in a compact and accurate way. We reformulate the measurement depth model to reduce the computational complexity of the algorithm, relying on the confidence of the depth estimation and the identification of invalid values to handle outliers. The proposed massively parallel scheme and data layout for the irregular computation pattern that corresponds to a Dynamic Programming paradigm is described and carefully analyzed in performance terms. Performance is shown to scale gracefully on current generation embedded GPUs. We assess the proposed methods in terms of semantic and geometric accuracy as well as run-time performance on three publicly available benchmark datasets. Our approach achieves real-time performance with high accuracy for 2048 × 1024 image sizes and 4 × 4 Stixel resolution on the low-power embedded GPU of an NVIDIA Tegra Xavier. | ||||
| 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 | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.124; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ HEV2021 | Serial | 3561 | ||
| Permanent link to this record | |||||
| Author | Albert Gordo; Florent Perronnin; Yunchao Gong; Svetlana Lazebnik | ||||
| Title | Asymmetric Distances for Binary Embeddings | Type | Journal Article | ||
| Year | 2014 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal |
TPAMI |
| Volume | 36 | Issue | 1 | Pages | 33-47 |
| Keywords | |||||
| Abstract | In large-scale query-by-example retrieval, embedding image signatures in a binary space offers two benefits: data compression and search efficiency. While most embedding algorithms binarize both query and database signatures, it has been noted that this is not strictly a requirement. Indeed, asymmetric schemes which binarize the database signatures but not the query still enjoy the same two benefits but may provide superior accuracy. In this work, we propose two general asymmetric distances which are applicable to a wide variety of embedding techniques including Locality Sensitive Hashing (LSH), Locality Sensitive Binary Codes (LSBC), Spectral Hashing (SH), PCA Embedding (PCAE), PCA Embedding with random rotations (PCAE-RR), and PCA Embedding with iterative quantization (PCAE-ITQ). We experiment on four public benchmarks containing up to 1M images and show that the proposed asymmetric distances consistently lead to large improvements over the symmetric Hamming distance for all binary embedding techniques. | ||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG; 600.045; 605.203; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ GPG2014 | Serial | 2272 | ||
| Permanent link to this record | |||||
| Author | Jiaolong Xu; Sebastian Ramos; David Vazquez; Antonio Lopez | ||||
| Title | Domain Adaptation of Deformable Part-Based Models | Type | Journal Article | ||
| Year | 2014 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal |
TPAMI |
| Volume | 36 | Issue | 12 | Pages | 2367-2380 |
| Keywords | Domain Adaptation; Pedestrian Detection | ||||
| Abstract | The accuracy of object classifiers can significantly drop when the training data (source domain) and the application scenario (target domain) have inherent differences. Therefore, adapting the classifiers to the scenario in which they must operate is of paramount importance. We present novel domain adaptation (DA) methods for object detection. As proof of concept, we focus on adapting the state-of-the-art deformable part-based model (DPM) for pedestrian detection. We introduce an adaptive structural SVM (A-SSVM) that adapts a pre-learned classifier between different domains. By taking into account the inherent structure in feature space (e.g., the parts in a DPM), we propose a structure-aware A-SSVM (SA-SSVM). Neither A-SSVM nor SA-SSVM needs to revisit the source-domain training data to perform the adaptation. Rather, a low number of target-domain training examples (e.g., pedestrians) are used. To address the scenario where there are no target-domain annotated samples, we propose a self-adaptive DPM based on a self-paced learning (SPL) strategy and a Gaussian Process Regression (GPR). Two types of adaptation tasks are assessed: from both synthetic pedestrians and general persons (PASCAL VOC) to pedestrians imaged from an on-board camera. Results show that our proposals avoid accuracy drops as high as 15 points when comparing adapted and non-adapted detectors. | ||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.057; 600.054; 601.217; 600.076 | Approved | no | ||
| Call Number | ADAS @ adas @ XRV2014b | Serial | 2436 | ||
| Permanent link to this record | |||||
| Author | Oriol Ramos Terrades; Ernest Valveny; Salvatore Tabbone | ||||
| Title | Optimal Classifier Fusion in a Non-Bayesian Probabilistic Framework | Type | Journal Article | ||
| Year | 2009 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal |
TPAMI |
| Volume | 31 | Issue | 9 | Pages | 1630–1644 |
| Keywords | |||||
| Abstract | The combination of the output of classifiers has been one of the strategies used to improve classification rates in general purpose classification systems. Some of the most common approaches can be explained using the Bayes' formula. In this paper, we tackle the problem of the combination of classifiers using a non-Bayesian probabilistic framework. This approach permits us to derive two linear combination rules that minimize misclassification rates under some constraints on the distribution of classifiers. In order to show the validity of this approach we have compared it with other popular combination rules from a theoretical viewpoint using a synthetic data set, and experimentally using two standard databases: the MNIST handwritten digit database and the GREC symbol database. Results on the synthetic data set show the validity of the theoretical approach. Indeed, results on real data show that the proposed methods outperform other common combination schemes. | ||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ RVT2009 | Serial | 1220 | ||
| Permanent link to this record | |||||
| Author | Oriol Pujol; David Masip | ||||
| Title | Geometry-Based Ensembles: Toward a Structural Characterization of the Classification Boundary | Type | Journal Article | ||
| Year | 2009 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal |
TPAMI |
| Volume | 31 | Issue | 6 | Pages | 1140–1146 |
| Keywords | |||||
| Abstract | This article introduces a novel binary discriminative learning technique based on the approximation of the non-linear decision boundary by a piece-wise linear smooth additive model. The decision border is geometrically defined by means of the characterizing boundary points – points that belong to the optimal boundary under a certain notion of robustness. Based on these points, a set of locally robust linear classifiers is defined and assembled by means of a Tikhonov regularized optimization procedure in an additive model to create a final lambda-smooth decision rule. As a result, a very simple and robust classifier with a strong geometrical meaning and non-linear behavior is obtained. The simplicity of the method allows its extension to cope with some of nowadays machine learning challenges, such as online learning, large scale learning or parallelization, with linear computational complexity. We validate our approach on the UCI database. Finally, we apply our technique in online and large scale scenarios, and in six real life computer vision and pattern recognition problems: gender recognition, intravascular ultrasound tissue classification, speed traffic sign detection, Chagas' disease severity detection, clef classification and action recognition using a 3D accelerometer data. The results are promising and this paper opens a line of research that deserves further attention | ||||
| 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 | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | OR;HuPBA;MV | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ PuM2009 | Serial | 1252 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera; Oriol Pujol; Petia Radeva | ||||
| Title | On the Decoding Process in Ternary Error-Correcting Output Codes | Type | Journal Article | ||
| Year | 2010 | Publication | IEEE on Pattern Analysis and Machine Intelligence | Abbreviated Journal |
TPAMI |
| Volume | 32 | Issue | 1 | Pages | 120–134 |
| Keywords | |||||
| Abstract | A common way to model multiclass classification problems is to design a set of binary classifiers and to combine them. Error-correcting output codes (ECOC) represent a successful framework to deal with these type of problems. Recent works in the ECOC framework showed significant performance improvements by means of new problem-dependent designs based on the ternary ECOC framework. The ternary framework contains a larger set of binary problems because of the use of a ldquodo not carerdquo symbol that allows us to ignore some classes by a given classifier. However, there are no proper studies that analyze the effect of the new symbol at the decoding step. In this paper, we present a taxonomy that embeds all binary and ternary ECOC decoding strategies into four groups. We show that the zero symbol introduces two kinds of biases that require redefinition of the decoding design. A new type of decoding measure is proposed, and two novel decoding strategies are defined. We evaluate the state-of-the-art coding and decoding strategies over a set of UCI machine learning repository data sets and into a real traffic sign categorization problem. The experimental results show that, following the new decoding strategies, the performance of the ECOC design is significantly improved. | ||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | MILAB;HUPBA | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ EPR2010b | Serial | 1277 | ||
| Permanent link to this record | |||||
| Author | David Geronimo; Antonio Lopez; Angel Sappa; Thorsten Graf | ||||
| Title | Survey on Pedestrian Detection for Advanced Driver Assistance Systems | Type | Journal Article | ||
| Year | 2010 | Publication | IEEE Transaction on Pattern Analysis and Machine Intelligence | Abbreviated Journal |
TPAMI |
| Volume | 32 | Issue | 7 | Pages | 1239–1258 |
| Keywords | ADAS, pedestrian detection, on-board vision, survey | ||||
| Abstract | Advanced driver assistance systems (ADASs), and particularly pedestrian protection systems (PPSs), have become an active research area aimed at improving traffic safety. The major challenge of PPSs is the development of reliable on-board pedestrian detection systems. Due to the varying appearance of pedestrians (e.g., different clothes, changing size, aspect ratio, and dynamic shape) and the unstructured environment, it is very difficult to cope with the demanded robustness of this kind of system. Two problems arising in this research area are the lack of public benchmarks and the difficulty in reproducing many of the proposed methods, which makes it difficult to compare the approaches. As a result, surveying the literature by enumerating the proposals one-after-another is not the most useful way to provide a comparative point of view. Accordingly, we present a more convenient strategy to survey the different approaches. We divide the problem of detecting pedestrians from images into different processing steps, each with attached responsibilities. Then, the different proposed methods are analyzed and classified with respect to each processing stage, favoring a comparative viewpoint. Finally, discussion of the important topics is presented, putting special emphasis on the future needs and challenges. | ||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ GLS2010 | Serial | 1340 | ||
| Permanent link to this record | |||||
| Author | Eduard Vazquez; Ramon Baldrich; Joost Van de Weijer; Maria Vanrell | ||||
| Title | Describing Reflectances for Colour Segmentation Robust to Shadows, Highlights and Textures | Type | Journal Article | ||
| Year | 2011 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal |
TPAMI |
| Volume | 33 | Issue | 5 | Pages | 917-930 |
| Keywords | |||||
| Abstract | The segmentation of a single material reflectance is a challenging problem due to the considerable variation in image measurements caused by the geometry of the object, shadows, and specularities. The combination of these effects has been modeled by the dichromatic reflection model. However, the application of the model to real-world images is limited due to unknown acquisition parameters and compression artifacts. In this paper, we present a robust model for the shape of a single material reflectance in histogram space. The method is based on a multilocal creaseness analysis of the histogram which results in a set of ridges representing the material reflectances. The segmentation method derived from these ridges is robust to both shadow, shading and specularities, and texture in real-world images. We further complete the method by incorporating prior knowledge from image statistics, and incorporate spatial coherence by using multiscale color contrast information. Results obtained show that our method clearly outperforms state-of-the-art segmentation methods on a widely used segmentation benchmark, having as a main characteristic its excellent performance in the presence of shadows and highlights at low computational cost. | ||||
| Address | Los Alamitos; CA; USA; | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Computer Society | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | CIC | Approved | no | ||
| Call Number | Admin @ si @ VBW2011 | Serial | 1715 | ||
| Permanent link to this record | |||||
| Author | Arjan Gijsenij; Theo Gevers | ||||
| Title | Color Constancy Using Natural Image Statistics and Scene Semantics | Type | Journal Article | ||
| Year | 2011 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal |
TPAMI |
| Volume | 33 | Issue | 4 | Pages | 687-698 |
| Keywords | |||||
| Abstract | Existing color constancy methods are all based on specific assumptions such as the spatial and spectral characteristics of images. As a consequence, no algorithm can be considered as universal. However, with the large variety of available methods, the question is how to select the method that performs best for a specific image. To achieve selection and combining of color constancy algorithms, in this paper natural image statistics are used to identify the most important characteristics of color images. Then, based on these image characteristics, the proper color constancy algorithm (or best combination of algorithms) is selected for a specific image. To capture the image characteristics, the Weibull parameterization (e.g., grain size and contrast) is used. It is shown that the Weibull parameterization is related to the image attributes to which the used color constancy methods are sensitive. An MoG-classifier is used to learn the correlation and weighting between the Weibull-parameters and the image attributes (number of edges, amount of texture, and SNR). The output of the classifier is the selection of the best performing color constancy method for a certain image. Experimental results show a large improvement over state-of-the-art single algorithms. On a data set consisting of more than 11,000 images, an increase in color constancy performance up to 20 percent (median angular error) can be obtained compared to the best-performing single algorithm. Further, it is shown that for certain scene categories, one specific color constancy algorithm can be used instead of the classifier considering several algorithms. | ||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ISE | Approved | no | ||
| Call Number | Admin @ si @ GiG2011 | Serial | 1724 | ||
| Permanent link to this record | |||||
| Author | Koen E.A. van de Sande; Theo Gevers; C.G.M. Snoek | ||||
| Title | Evaluating Color Descriptors for Object and Scene Recognition | Type | Journal Article | ||
| Year | 2010 | Publication | IEEE Transaction on Pattern Analysis and Machine Intelligence | Abbreviated Journal |
TPAMI |
| Volume | 32 | Issue | 9 | Pages | 1582 - 1596 |
| Keywords | |||||
| Abstract | Impact factor: 5.308
Image category recognition is important to access visual information on the level of objects and scene types. So far, intensity-based descriptors have been widely used for feature extraction at salient points. To increase illumination invariance and discriminative power, color descriptors have been proposed. Because many different descriptors exist, a structured overview is required of color invariant descriptors in the context of image category recognition. Therefore, this paper studies the invariance properties and the distinctiveness of color descriptors (software to compute the color descriptors from this paper is available from http://www.colordescriptors.com) in a structured way. The analytical invariance properties of color descriptors are explored, using a taxonomy based on invariance properties with respect to photometric transformations, and tested experimentally using a data set with known illumination conditions. In addition, the distinctiveness of color descriptors is assessed experimentally using two benchmarks, one from the image domain and one from the video domain. From the theoretical and experimental results, it can be derived that invariance to light intensity changes and light color changes affects category recognition. The results further reveal that, for light intensity shifts, the usefulness of invariance is category-specific. Overall, when choosing a single descriptor and no prior knowledge about the data set and object and scene categories is available, the OpponentSIFT is recommended. Furthermore, a combined set of color descriptors outperforms intensity-based SIFT and improves category recognition by 8 percent on the PASCAL VOC 2007 and by 7 percent on the Mediamill Challenge. |
||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ALTRES;ISE | Approved | no | ||
| Call Number | Admin @ si @ SGS2010 | Serial | 1846 | ||
| Permanent link to this record | |||||
| Author | R. Valenti; Theo Gevers | ||||
| Title | Accurate Eye Center Location through Invariant Isocentric Patterns | Type | Journal Article | ||
| Year | 2012 | Publication | IEEE Transaction on Pattern Analysis and Machine Intelligence | Abbreviated Journal |
TPAMI |
| Volume | 34 | Issue | 9 | Pages | 1785-1798 |
| Keywords | |||||
| Abstract | Impact factor 2010: 5.308
Impact factor 2011/12?: 5.96 Locating the center of the eyes allows for valuable information to be captured and used in a wide range of applications. Accurate eye center location can be determined using commercial eye-gaze trackers, but additional constraints and expensive hardware make these existing solutions unattractive and impossible to use on standard (i.e., visible wavelength), low-resolution images of eyes. Systems based solely on appearance are proposed in the literature, but their accuracy does not allow us to accurately locate and distinguish eye centers movements in these low-resolution settings. Our aim is to bridge this gap by locating the center of the eye within the area of the pupil on low-resolution images taken from a webcam or a similar device. The proposed method makes use of isophote properties to gain invariance to linear lighting changes (contrast and brightness), to achieve in-plane rotational invariance, and to keep low-computational costs. To further gain scale invariance, the approach is applied to a scale space pyramid. In this paper, we extensively test our approach for its robustness to changes in illumination, head pose, scale, occlusion, and eye rotation. We demonstrate that our system can achieve a significant improvement in accuracy over state-of-the-art techniques for eye center location in standard low-resolution imagery. |
||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ALTRES;ISE | Approved | no | ||
| Call Number | Admin @ si @ VaG 2012a | Serial | 1849 | ||
| Permanent link to this record | |||||
| Author | Arjan Gijsenij; Theo Gevers; Joost Van de Weijer | ||||
| Title | Improving Color Constancy by Photometric Edge Weighting | Type | Journal Article | ||
| Year | 2012 | Publication | IEEE Transaction on Pattern Analysis and Machine Intelligence | Abbreviated Journal |
TPAMI |
| Volume | 34 | Issue | 5 | Pages | 918-929 |
| Keywords | |||||
| Abstract | : Edge-based color constancy methods make use of image derivatives to estimate the illuminant. However, different edge types exist in real-world images such as material, shadow and highlight edges. These different edge types may have a distinctive influence on the performance of the illuminant estimation. Therefore, in this paper, an extensive analysis is provided of different edge types on the performance of edge-based color constancy methods. First, an edge-based taxonomy is presented classifying edge types based on their photometric properties (e.g. material, shadow-geometry and highlights). Then, a performance evaluation of edge-based color constancy is provided using these different edge types. From this performance evaluation it is derived that specular and shadow edge types are more valuable than material edges for the estimation of the illuminant. To this end, the (iterative) weighted Grey-Edge algorithm is proposed in which these edge types are more emphasized for the estimation of the illuminant. Images that are recorded under controlled circumstances demonstrate that the proposed iterative weighted Grey-Edge algorithm based on highlights reduces the median angular error with approximately $25\%$. In an uncontrolled environment, improvements in angular error up to $11\%$ are obtained with respect to regular edge-based color constancy. | ||||
| Address | Los Alamitos; CA; USA; | ||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | CIC;ISE | Approved | no | ||
| Call Number | Admin @ si @ GGW2012 | Serial | 1850 | ||
| Permanent link to this record | |||||
| Author | David Vazquez; Javier Marin; Antonio Lopez; Daniel Ponsa; David Geronimo | ||||
| Title | Virtual and Real World Adaptation for Pedestrian Detection | Type | Journal Article | ||
| Year | 2014 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal |
TPAMI |
| Volume | 36 | Issue | 4 | Pages | 797-809 |
| Keywords | Domain Adaptation; Pedestrian Detection | ||||
| Abstract | Pedestrian detection is of paramount interest for many applications. Most promising detectors rely on discriminatively learnt classifiers, i.e., trained with annotated samples. However, the annotation step is a human intensive and subjective task worth to be minimized. By using virtual worlds we can automatically obtain precise and rich annotations. Thus, we face the question: can a pedestrian appearance model learnt in realistic virtual worlds work successfully for pedestrian detection in realworld images?. Conducted experiments show that virtual-world based training can provide excellent testing accuracy in real world, but it can also suffer the dataset shift problem as real-world based training does. Accordingly, we have designed a domain adaptation framework, V-AYLA, in which we have tested different techniques to collect a few pedestrian samples from the target domain (real world) and combine them with the many examples of the source domain (virtual world) in order to train a domain adapted pedestrian classifier that will operate in the target domain. V-AYLA reports the same detection accuracy than when training with many human-provided pedestrian annotations and testing with real-world images of the same domain. To the best of our knowledge, this is the first work demonstrating adaptation of virtual and real worlds for developing an object detector. | ||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.057; 600.054; 600.076 | Approved | no | ||
| Call Number | ADAS @ adas @ VML2014 | Serial | 2275 | ||
| Permanent link to this record | |||||
| Author | Naila Murray; Maria Vanrell; Xavier Otazu; C. Alejandro Parraga | ||||
| Title | Low-level SpatioChromatic Grouping for Saliency Estimation | Type | Journal Article | ||
| Year | 2013 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal |
TPAMI |
| Volume | 35 | Issue | 11 | Pages | 2810-2816 |
| Keywords | |||||
| Abstract | We propose a saliency model termed SIM (saliency by induction mechanisms), which is based on a low-level spatiochromatic model that has successfully predicted chromatic induction phenomena. In so doing, we hypothesize that the low-level visual mechanisms that enhance or suppress image detail are also responsible for making some image regions more salient. Moreover, SIM adds geometrical grouplets to enhance complex low-level features such as corners, and suppress relatively simpler features such as edges. Since our model has been fitted on psychophysical chromatic induction data, it is largely nonparametric. SIM outperforms state-of-the-art methods in predicting eye fixations on two datasets and using two metrics. | ||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | CIC; 600.051; 600.052; 605.203 | Approved | no | ||
| Call Number | Admin @ si @ MVO2013 | Serial | 2289 | ||
| Permanent link to this record | |||||