| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–14] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Mohammad Ali Bagheri; Qigang Gao; Sergio Escalera | ||||
| Title | Error Correcting Output Codes for multiclass classification: Application to two image vision problems | Type | Conference Article | ||
| Year | 2012 | Publication | 16th symposium on Artificial Intelligence & Signal Processing | Abbreviated Journal | |
| Volume | Issue | Pages | 508-513 | ||
| Keywords | |||||
| Abstract | Error-correcting output codes (ECOC) represents a powerful framework to deal with multiclass classification problems based on combining binary classifiers. The key factor affecting the performance of ECOC methods is the independence of binary classifiers, without which the ECOC method would be ineffective. In spite of its ability on classification of problems with relatively large number of classes, it has been applied in few real world problems. In this paper, we investigate the behavior of the ECOC approach on two image vision problems: logo recognition and shape classification using Decision Tree and AdaBoost as the base learners. The results show that the ECOC method can be used to improve the classification performance in comparison with the classical multiclass approaches. | ||||
Address  |
Shiraz, Iran | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-1-4673-1478-7 | Medium | ||
| Area | Expedition | Conference | AISP | ||
| Notes | HuPBA;MILAB | Approved | no | ||
| Call Number | Admin @ si @ BGE2012b | Serial | 2042 | ||
| Permanent link to this record | |||||
| Author | Diego Cheda; Daniel Ponsa; Antonio Lopez | ||||
| Title | Monocular Depth-based Background Estimation | Type | Conference Article | ||
| Year | 2012 | Publication | 7th International Conference on Computer Vision Theory and Applications | Abbreviated Journal | |
| Volume | Issue | Pages | 323-328 | ||
| Keywords | |||||
| Abstract | In this paper, we address the problem of reconstructing the background of a scene from a video sequence with occluding objects. The images are taken by hand-held cameras. Our method composes the background by selecting the appropriate pixels from previously aligned input images. To do that, we minimize a cost function that penalizes the deviations from the following assumptions: background represents objects whose distance to the camera is maximal, and background objects are stationary. Distance information is roughly obtained by a supervised learning approach that allows us to distinguish between close and distant image regions. Moving foreground objects are filtered out by using stationariness and motion boundary constancy measurements. The cost function is minimized by a graph cuts method. We demonstrate the applicability of our approach to recover an occlusion-free background in a set of sequences. | ||||
| Address |
Roma | ||||
| 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 | VISAPP | ||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ CPL2012b; ADAS @ adas @ cpl2012e | Serial | 2012 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; Lluis Pere de las Heras; Joan Mas; Oriol Ramos Terrades; Dimosthenis Karatzas; Anjan Dutta; Gemma Sanchez; Josep Llados | ||||
| Title | CVC-UAB's participation in the Flowchart Recognition Task of CLEF-IP 2012 | Type | Conference Article | ||
| Year | 2012 | Publication | Conference and Labs of the Evaluation Forum | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address |
Roma | ||||
| 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 | CLEF | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ RHM2012 | Serial | 2072 | ||
| Permanent link to this record | |||||
| Author | Fahad Shahbaz Khan; Muhammad Anwer Rao; Joost Van de Weijer; Andrew Bagdanov; Maria Vanrell; Antonio Lopez | ||||
| Title | Color Attributes for Object Detection | Type | Conference Article | ||
| Year | 2012 | Publication | 25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 3306-3313 | ||
| Keywords | pedestrian detection | ||||
| Abstract | State-of-the-art object detectors typically use shape information as a low level feature representation to capture the local structure of an object. This paper shows that early fusion of shape and color, as is popular in image classification,
leads to a significant drop in performance for object detection. Moreover, such approaches also yields suboptimal results for object categories with varying importance of color and shape. In this paper we propose the use of color attributes as an explicit color representation for object detection. Color attributes are compact, computationally efficient, and when combined with traditional shape features provide state-ofthe- art results for object detection. Our method is tested on the PASCAL VOC 2007 and 2009 datasets and results clearly show that our method improves over state-of-the-art techniques despite its simplicity. We also introduce a new dataset consisting of cartoon character images in which color plays a pivotal role. On this dataset, our approach yields a significant gain of 14% in mean AP over conventional state-of-the-art methods. |
||||
| Address |
Providence; Rhode Island; USA; | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | ADAS; CIC; | Approved | no | ||
| Call Number | Admin @ si @ KRW2012 | Serial | 1935 | ||
| Permanent link to this record | |||||
| Author | Marc Serra; Olivier Penacchio; Robert Benavente; Maria Vanrell | ||||
| Title | Names and Shades of Color for Intrinsic Image Estimation | Type | Conference Article | ||
| Year | 2012 | Publication | 25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 278-285 | ||
| Keywords | |||||
| Abstract | In the last years, intrinsic image decomposition has gained attention. Most of the state-of-the-art methods are based on the assumption that reflectance changes come along with strong image edges. Recently, user intervention in the recovery problem has proved to be a remarkable source of improvement. In this paper, we propose a novel approach that aims to overcome the shortcomings of pure edge-based methods by introducing strong surface descriptors, such as the color-name descriptor which introduces high-level considerations resembling top-down intervention. We also use a second surface descriptor, termed color-shade, which allows us to include physical considerations derived from the image formation model capturing gradual color surface variations. Both color cues are combined by means of a Markov Random Field. The method is quantitatively tested on the MIT ground truth dataset using different error metrics, achieving state-of-the-art performance. | ||||
| Address |
Providence, Rhode Island | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | CIC | Approved | no | ||
| Call Number | Admin @ si @ SPB2012 | Serial | 2026 | ||
| Permanent link to this record | |||||
| Author | Murad Al Haj; Jordi Gonzalez; Larry S. Davis | ||||
| Title | On Partial Least Squares in Head Pose Estimation: How to simultaneously deal with misalignment | Type | Conference Article | ||
| Year | 2012 | Publication | 25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 2602-2609 | ||
| Keywords | |||||
| Abstract | Head pose estimation is a critical problem in many computer vision applications. These include human computer interaction, video surveillance, face and expression recognition. In most prior work on heads pose estimation, the positions of the faces on which the pose is to be estimated are specified manually. Therefore, the results are reported without studying the effect of misalignment. We propose a method based on partial least squares (PLS) regression to estimate pose and solve the alignment problem simultaneously. The contributions of this paper are two-fold: 1) we show that the kernel version of PLS (kPLS) achieves better than state-of-the-art results on the estimation problem and 2) we develop a technique to reduce misalignment based on the learned PLS factors. | ||||
| Address |
Providence, Rhode Island | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | ISE | Approved | no | ||
| Call Number | Admin @ si @ HGD2012 | Serial | 2029 | ||
| Permanent link to this record | |||||
| Author | Jose Carlos Rubio; Joan Serrat; Antonio Lopez | ||||
| Title | Unsupervised co-segmentation through region matching | Type | Conference Article | ||
| Year | 2012 | Publication | 25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 749-756 | ||
| Keywords | |||||
| Abstract | Co-segmentation is defined as jointly partitioning multiple images depicting the same or similar object, into foreground and background. Our method consists of a multiple-scale multiple-image generative model, which jointly estimates the foreground and background appearance distributions from several images, in a non-supervised manner. In contrast to other co-segmentation methods, our approach does not require the images to have similar foregrounds and different backgrounds to function properly. Region matching is applied to exploit inter-image information by establishing correspondences between the common objects that appear in the scene. Moreover, computing many-to-many associations of regions allow further applications, like recognition of object parts across images. We report results on iCoseg, a challenging dataset that presents extreme variability in camera viewpoint, illumination and object deformations and poses. We also show that our method is robust against large intra-class variability in the MSRC database. | ||||
| Address |
Providence, Rhode Island | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ RSL2012b; ADAS @ adas @ | Serial | 2033 | ||
| Permanent link to this record | |||||
| Author | Albert Gordo; Jose Antonio Rodriguez; Florent Perronnin; Ernest Valveny | ||||
| Title | Leveraging category-level labels for instance-level image retrieval | Type | Conference Article | ||
| Year | 2012 | Publication | 25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 3045-3052 | ||
| Keywords | |||||
| Abstract | In this article, we focus on the problem of large-scale instance-level image retrieval. For efficiency reasons, it is common to represent an image by a fixed-length descriptor which is subsequently encoded into a small number of bits. We note that most encoding techniques include an unsupervised dimensionality reduction step. Our goal in this work is to learn a better subspace in a supervised manner. We especially raise the following question: “can category-level labels be used to learn such a subspace?” To answer this question, we experiment with four learning techniques: the first one is based on a metric learning framework, the second one on attribute representations, the third one on Canonical Correlation Analysis (CCA) and the fourth one on Joint Subspace and Classifier Learning (JSCL). While the first three approaches have been applied in the past to the image retrieval problem, we believe we are the first to show the usefulness of JSCL in this context. In our experiments, we use ImageNet as a source of category-level labels and report retrieval results on two standard dataseis: INRIA Holidays and the University of Kentucky benchmark. Our experimental study shows that metric learning and attributes do not lead to any significant improvement in retrieval accuracy, as opposed to CCA and JSCL. As an example, we report on Holidays an increase in accuracy from 39.3% to 48.6% with 32-dimensional representations. Overall JSCL is shown to yield the best results. | ||||
| Address |
Providence, Rhode Island | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ GRP2012 | Serial | 2050 | ||
| Permanent link to this record | |||||
| Author | Naila Murray; Luca Marchesotti; Florent Perronnin | ||||
| Title | AVA: A Large-Scale Database for Aesthetic Visual Analysis | Type | Conference Article | ||
| Year | 2012 | Publication | 25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 2408-2415 | ||
| Keywords | |||||
| Abstract | With the ever-expanding volume of visual content available, the ability to organize and navigate such content by aesthetic preference is becoming increasingly important. While still in its nascent stage, research into computational models of aesthetic preference already shows great potential. However, to advance research, realistic, diverse and challenging databases are needed. To this end, we introduce a new large-scale database for conducting Aesthetic Visual Analysis: AVA. It contains over 250,000 images along with a rich variety of meta-data including a large number of aesthetic scores for each image, semantic labels for over 60 categories as well as labels related to photographic style. We show the advantages of AVA with respect to existing databases in terms of scale, diversity, and heterogeneity of annotations. We then describe several key insights into aesthetic preference afforded by AVA. Finally, we demonstrate, through three applications, how the large scale of AVA can be leveraged to improve performance on existing preference tasks | ||||
| Address |
Providence, Rhode Islan | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | CIC | Approved | no | ||
| Call Number | Admin @ si @ MMP2012a | Serial | 2025 | ||
| Permanent link to this record | |||||
| Author | Diego Cheda; Daniel Ponsa; Antonio Lopez | ||||
| Title | Monocular Egomotion Estimation based on Image Matching | Type | Conference Article | ||
| Year | 2012 | Publication | 1st International Conference on Pattern Recognition Applications and Methods | Abbreviated Journal | |
| Volume | Issue | Pages | 425-430 | ||
| Keywords | SLAM | ||||
| Abstract | |||||
| Address |
Portugal | ||||
| 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 | ICPRAM | ||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ CPL2012a;; ADAS @ adas @ | Serial | 2011 | ||
| Permanent link to this record | |||||
| Author | Antonio Hernandez; Nadezhda Zlateva; Alexander Marinov; Miguel Reyes; Petia Radeva; Dimo Dimov; Sergio Escalera | ||||
| Title | Graph Cuts Optimization for Multi-Limb Human Segmentation in Depth Maps | Type | Conference Article | ||
| Year | 2012 | Publication | 25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 726-732 | ||
| Keywords | |||||
| Abstract | We present a generic framework for object segmentation using depth maps based on Random Forest and Graph-cuts theory, and apply it to the segmentation of human limbs in depth maps. First, from a set of random depth features, Random Forest is used to infer a set of label probabilities for each data sample. This vector of probabilities is used as unary term in α-β swap Graph-cuts algorithm. Moreover, depth of spatio-temporal neighboring data points are used as boundary potentials. Results on a new multi-label human depth data set show high performance in terms of segmentation overlapping of the novel methodology compared to classical approaches. | ||||
| Address |
Portland; Oregon; June 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | MILAB;HuPBA | Approved | no | ||
| Call Number | Admin @ si @ HZM2012b | Serial | 2046 | ||
| Permanent link to this record | |||||
| Author | Ekaterina Zaytseva; Jordi Vitria | ||||
| Title | A search based approach to non maximum suppression in face detection | Type | Conference Article | ||
| Year | 2012 | Publication | 19th IEEE International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Poster
paper TA.P5.12 Face detectors typically produce a large number of false positives and this leads to the need to have a further non maximum suppression stage to eliminate multiple and spurious responses. This stage is based on considering spatial heuristics: true positive responses are selected by implicitly considering several restrictions on the spatial distribution of detector responses in natural images. In this paper we analyze the limitations of this approach and propose an efficient search method to overcome them. Results show how the application of this new non-maximum suppression approach to a simple face detector boosts its performance to state of the art results. |
||||
| Address |
Orlando; USA; September 2012 | ||||
| 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-4673-2534-9 | Medium | |
| Area | Expedition | Conference | ICIP | ||
| Notes | OR;MV | Approved | no | ||
| Call Number | Admin @ si @ ZaV2012 | Serial | 2060 | ||
| Permanent link to this record | |||||
| Author | Ferran Poveda; Debora Gil;Enric Marti | ||||
| Title | Multi-resolution DT-MRI cardiac tractography | Type | Conference Article | ||
| Year | 2012 | Publication | Statistical Atlases And Computational Models Of The Heart: Imaging and Modelling Challenges | Abbreviated Journal | |
| Volume | 7746 | Issue | Pages | 270-277 | |
| Keywords | |||||
| Abstract | Even using objective measures from DT-MRI no consensus about myocardial architecture has been achieved so far. Streamlining provides good reconstructions at low level of detail, but falls short to give global abstract interpretations. In this paper, we present a multi-resolution methodology that is able to produce simplified representations of cardiac architecture. Our approach produces a reduced set of tracts that are representative of the main geometric features of myocardial anatomical structure. Experiments show that fiber geometry is preserved along reductions, which validates the simplified model for interpretation of cardiac architecture. | ||||
| Address |
Nice, France | ||||
| 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-36960-5 | Medium | |
| Area | Expedition | Conference | STACOM | ||
| Notes | IAM | Approved | no | ||
| Call Number | IAM @ iam @ PGM2012 | Serial | 1986 | ||
| Permanent link to this record | |||||
| Author | Debora Gil;Agnes Borras;Ruth Aris;Mariano Vazquez;Pierre Lafortune; Guillame Houzeaux | ||||
| Title | What a difference in biomechanics cardiac fiber makes | Type | Conference Article | ||
| Year | 2012 | Publication | Statistical Atlases And Computational Models Of The Heart: Imaging and Modelling Challenges | Abbreviated Journal | |
| Volume | 7746 | Issue | Pages | 253-260 | |
| Keywords | |||||
| Abstract | Computational simulations of the heart are a powerful tool for a comprehensive understanding of cardiac function and its intrinsic relationship with its muscular architecture. Cardiac biomechanical models require a vector field representing the orientation of cardiac fibers. A wrong orientation of the fibers can lead to a
non-realistic simulation of the heart functionality. In this paper we explore the impact of the fiber information on the simulated biomechanics of cardiac muscular anatomy. We have used the John Hopkins database to perform a biomechanical simulation using both a synthetic benchmark fiber distribution and the data obtained experimentally from DTI. Results illustrate how differences in fiber orientation affect heart deformation along cardiac cycle. |
||||
| Address |
Nice, France | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-642-36960-5 | Medium | |
| Area | Expedition | Conference | STACOM | ||
| Notes | IAM | Approved | no | ||
| Call Number | IAM @ iam @ GBA2012 | Serial | 1987 | ||
| Permanent link to this record | |||||
| Author | Sergio Vera; Miguel Angel Gonzalez Ballester; Debora Gil | ||||
| Title | Optimal Medial Surface Generation for Anatomical Volume Representations | Type | Book Chapter | ||
| Year | 2012 | Publication | Abdominal Imaging. Computational and Clinical Applications | Abbreviated Journal | LNCS |
| Volume | 7601 | Issue | Pages | 265-273 | |
| Keywords | Medial surface representation; volume reconstruction | ||||
| Abstract | Medial representations are a widely used technique in abdominal organ shape representation and parametrization. Those methods require good medial manifolds as a starting point. Any medial
surface used to parametrize a volume should be simple enough to allow an easy manipulation and complete enough to allow an accurate reconstruction of the volume. Obtaining good quality medial surfaces is still a problem with current iterative thinning methods. This forces the usage of generic, pre-calculated medial templates that are adapted to the final shape at the cost of a drop in volume reconstruction. This paper describes an operator for generation of medial structures that generates clean and complete manifolds well suited for their further use in medial representations of abdominal organ volumes. While being simpler than thinning surfaces, experiments show its high performance in volume reconstruction and preservation of medial surface main branching topology. |
||||
| Address |
Nice, France | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | Yoshida, Hiroyuki and Hawkes, David and Vannier, MichaelW. | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Lecture Notes in Computer Science | Abbreviated Series Title | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-642-33611-9 | Medium | |
| Area | Expedition | Conference | STACOM | ||
| Notes | IAM | Approved | no | ||
| Call Number | IAM @ iam @ VGG2012b | Serial | 1988 | ||
| Permanent link to this record | |||||