| Home | [1–10] << 11 12 13 14 15 16 17 18 19 20 >> [21–30] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Naveen Onkarappa; Angel Sappa | ||||
| Title | Laplacian Derivative based Regularization for Optical Flow Estimation in Driving Scenario | Type | Conference Article | ||
| Year | 2013 | Publication | 15th International Conference on Computer Analysis of Images and Patterns | Abbreviated Journal | |
| Volume | 8048 | Issue | Pages | 483-490 | |
Keywords  |
Optical flow; regularization; Driver Assistance Systems; Performance Evaluation | ||||
| Abstract | Existing state of the art optical flow approaches, which are evaluated on standard datasets such as Middlebury, not necessarily have a similar performance when evaluated on driving scenarios. This drop on performance is due to several challenges arising on real scenarios during driving. Towards this direction, in this paper, we propose a modification to the regularization term in a variational optical flow formulation, that notably improves the results, specially in driving scenarios. The proposed modification consists on using the Laplacian derivatives of flow components in the regularization term instead of gradients of flow components. We show the improvements in results on a standard real image sequences dataset (KITTI). | ||||
| Address | York; UK; August 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-40245-6 | Medium | |
| Area | Expedition | Conference | CAIP | ||
| Notes | ADAS; 600.055; 601.215 | Approved | no | ||
| Call Number | Admin @ si @ OnS2013b | Serial | 2244 | ||
| Permanent link to this record | |||||
| Author | Patricia Marquez; H. Kause; A. Fuster; Aura Hernandez-Sabate; L. Florack; Debora Gil; Hans van Assen | ||||
| Title | Factors Affecting Optical Flow Performance in Tagging Magnetic Resonance Imaging | Type | Conference Article | ||
| Year | 2014 | Publication | 17th International Conference on Medical Image Computing and Computer Assisted Intervention | Abbreviated Journal | |
| Volume | 8896 | Issue | Pages | 231-238 | |
| Keywords |
Optical flow; Performance Evaluation; Synthetic Database; ANOVA; Tagging Magnetic Resonance Imaging | ||||
| Abstract | Changes in cardiac deformation patterns are correlated with cardiac pathologies. Deformation can be extracted from tagging Magnetic Resonance Imaging (tMRI) using Optical Flow (OF) techniques. For applications of OF in a clinical setting it is important to assess to what extent the performance of a particular OF method is stable across di erent clinical acquisition artifacts. This paper presents a statistical validation framework, based on ANOVA, to assess the motion and appearance factors that have the largest in uence on OF accuracy drop.
In order to validate this framework, we created a database of simulated tMRI data including the most common artifacts of MRI and test three di erent OF methods, including HARP. |
||||
| Address | Boston; USA; September 2014 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer International Publishing | 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-319-14677-5 | Medium | |
| Area | Expedition | Conference | STACOM | ||
| Notes | IAM; ADAS; 600.060; 601.145; 600.076; 600.075 | Approved | no | ||
| Call Number | Admin @ si @ MKF2014 | Serial | 2495 | ||
| Permanent link to this record | |||||
| Author | Patricia Marquez; Debora Gil; R.Mester; Aura Hernandez-Sabate | ||||
| Title | Local Analysis of Confidence Measures for Optical Flow Quality Evaluation | Type | Conference Article | ||
| Year | 2014 | Publication | 9th International Conference on Computer Vision Theory and Applications | Abbreviated Journal | |
| Volume | 3 | Issue | Pages | 450-457 | |
| Keywords |
Optical Flow; Confidence Measure; Performance Evaluation. | ||||
| Abstract | Optical Flow (OF) techniques facing the complexity of real sequences have been developed in the last years. Even using the most appropriate technique for our specific problem, at some points the output flow might fail to achieve the minimum error required for the system. Confidence measures computed from either input data or OF output should discard those points where OF is not accurate enough for its further use. It follows that evaluating the capabilities of a confidence measure for bounding OF error is as important as the definition
itself. In this paper we analyze different confidence measures and point out their advantages and limitations for their use in real world settings. We also explore the agreement with current tools for their evaluation of confidence measures performance. |
||||
| Address | Lisboa; January 2014 | ||||
| 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 | IAM; ADAS; 600.044; 600.060; 600.057; 601.145; 600.076; 600.075 | Approved | no | ||
| Call Number | Admin @ si @ MGM2014 | Serial | 2432 | ||
| Permanent link to this record | |||||
| Author | Patricia Marquez;Debora Gil;Aura Hernandez-Sabate | ||||
| Title | A Complete Confidence Framework for Optical Flow | Type | Conference Article | ||
| Year | 2012 | Publication | 12th European Conference on Computer Vision – Workshops and Demonstrations | Abbreviated Journal | |
| Volume | 7584 | Issue | 2 | Pages | 124-133 |
| Keywords |
Optical flow, confidence measures, sparsification plots, error prediction plots | ||||
| Abstract | Medial representations are powerful tools for describing and parameterizing the volumetric shape of anatomical structures. Existing methods show excellent results when applied to 2D objects, but their quality drops across dimensions. This paper contributes to the computation of medial manifolds in two aspects. First, we provide a standard scheme for the computation of medial manifolds that avoid degenerated medial axis segments; second, we introduce an energy based method which performs independently of the dimension. We evaluate quantitatively the performance of our method with respect to existing approaches, by applying them to synthetic shapes of known medial geometry. Finally, we show results on shape representation of multiple abdominal organs, exploring the use of medial manifolds for the representation of multi-organ relations. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer-Verlag | Place of Publication | Florence, Italy, October 7-13, 2012 | Editor | Andrea Fusiello, Vittorio Murino ,Rita Cucchiara |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-3-642-33867-0 | Medium | ||
| Area | Expedition | Conference | ECCVW | ||
| Notes | IAM;ADAS; | Approved | no | ||
| Call Number | IAM @ iam @ MGH2012b | Serial | 1991 | ||
| Permanent link to this record | |||||
| Author | Patricia Marquez; Debora Gil; Aura Hernandez-Sabate; Daniel Kondermann | ||||
| Title | When Is A Confidence Measure Good Enough? | Type | Conference Article | ||
| Year | 2013 | Publication | 9th International Conference on Computer Vision Systems | Abbreviated Journal | |
| Volume | 7963 | Issue | Pages | 344-353 | |
| Keywords |
Optical flow, confidence measure, performance evaluation | ||||
| Abstract | Confidence estimation has recently become a hot topic in image processing and computer vision.Yet, several definitions exist of the term “confidence” which are sometimes used interchangeably. This is a position paper, in which we aim to give an overview on existing definitions,
thereby clarifying the meaning of the used terms to facilitate further research in this field. Based on these clarifications, we develop a theory to compare confidence measures with respect to their quality. |
||||
| Address | St Petersburg; Russia; July 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Link | 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-39401-0 | Medium | |
| Area | Expedition | Conference | ICVS | ||
| Notes | IAM;ADAS; 600.044; 600.057; 600.060; 601.145 | Approved | no | ||
| Call Number | IAM @ iam @ MGH2013a | Serial | 2218 | ||
| Permanent link to this record | |||||
| Author | Patricia Marquez; Debora Gil ; Aura Hernandez-Sabate | ||||
| Title | Error Analysis for Lucas-Kanade Based Schemes | Type | Conference Article | ||
| Year | 2012 | Publication | 9th International Conference on Image Analysis and Recognition | Abbreviated Journal | |
| Volume | 7324 | Issue | I | Pages | 184-191 |
| Keywords |
Optical flow, Confidence measure, Lucas-Kanade, Cardiac Magnetic Resonance | ||||
| Abstract | Optical flow is a valuable tool for motion analysis in medical imaging sequences. A reliable application requires determining the accuracy of the computed optical flow. This is a main challenge given the absence of ground truth in medical sequences. This paper presents an error analysis of Lucas-Kanade schemes in terms of intrinsic design errors and numerical stability of the algorithm. Our analysis provides a confidence measure that is naturally correlated to the accuracy of the flow field. Our experiments show the higher predictive value of our confidence measure compared to existing measures. | ||||
| Address | Aveiro, Portugal | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer-Verlag Berlin Heidelberg | Place of Publication | Editor | ||
| Language | english | Summary Language | Original Title | ||
| Series Editor | Campilho, Aurélio and Kamel, Mohamed | Series Title | Lecture Notes in Computer Science | Abbreviated Series Title | LNCS |
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-642-31294-6 | Medium | |
| Area | Expedition | Conference | ICIAR | ||
| Notes | IAM | Approved | no | ||
| Call Number | IAM @ iam @ MGH2012a | Serial | 1899 | ||
| Permanent link to this record | |||||
| Author | Katerine Diaz; Jesus Martinez del Rincon; Marçal Rusiñol; Aura Hernandez-Sabate | ||||
| Title | Feature Extraction by Using Dual-Generalized Discriminative Common Vectors | Type | Journal Article | ||
| Year | 2019 | Publication | Journal of Mathematical Imaging and Vision | Abbreviated Journal | JMIV |
| Volume | 61 | Issue | 3 | Pages | 331-351 |
| Keywords |
Online feature extraction; Generalized discriminative common vectors; Dual learning; Incremental learning; Decremental learning | ||||
| Abstract | In this paper, a dual online subspace-based learning method called dual-generalized discriminative common vectors (Dual-GDCV) is presented. The method extends incremental GDCV by exploiting simultaneously both the concepts of incremental and decremental learning for supervised feature extraction and classification. Our methodology is able to update the feature representation space without recalculating the full projection or accessing the previously processed training data. It allows both adding information and removing unnecessary data from a knowledge base in an efficient way, while retaining the previously acquired knowledge. The proposed method has been theoretically proved and empirically validated in six standard face recognition and classification datasets, under two scenarios: (1) removing and adding samples of existent classes, and (2) removing and adding new classes to a classification problem. Results show a considerable computational gain without compromising the accuracy of the model in comparison with both batch methodologies and other state-of-art adaptive methods. | ||||
| 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 | DAG; ADAS; 600.084; 600.118; 600.121; 600.129 | Approved | no | ||
| Call Number | Admin @ si @ DRR2019 | Serial | 3172 | ||
| Permanent link to this record | |||||
| Author | Kai Wang; Joost Van de Weijer; Luis Herranz | ||||
| Title | ACAE-REMIND for online continual learning with compressed feature replay | Type | Journal Article | ||
| Year | 2021 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 150 | Issue | Pages | 122-129 | |
| Keywords |
online continual learning; autoencoders; vector quantization | ||||
| Abstract | Online continual learning aims to learn from a non-IID stream of data from a number of different tasks, where the learner is only allowed to consider data once. Methods are typically allowed to use a limited buffer to store some of the images in the stream. Recently, it was found that feature replay, where an intermediate layer representation of the image is stored (or generated) leads to superior results than image replay, while requiring less memory. Quantized exemplars can further reduce the memory usage. However, a drawback of these methods is that they use a fixed (or very intransigent) backbone network. This significantly limits the learning of representations that can discriminate between all tasks. To address this problem, we propose an auxiliary classifier auto-encoder (ACAE) module for feature replay at intermediate layers with high compression rates. The reduced memory footprint per image allows us to save more exemplars for replay. In our experiments, we conduct task-agnostic evaluation under online continual learning setting and get state-of-the-art performance on ImageNet-Subset, CIFAR100 and CIFAR10 dataset. | ||||
| 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 | LAMP; 600.147; 601.379; 600.120; 600.141 | Approved | no | ||
| Call Number | Admin @ si @ WWH2021 | Serial | 3575 | ||
| Permanent link to this record | |||||
| Author | Santiago Segui; Laura Igual; Jordi Vitria | ||||
| Title | Bagged One Class Classifiers in the Presence of Outliers | Type | Journal Article | ||
| Year | 2013 | Publication | International Journal of Pattern Recognition and Artificial Intelligence | Abbreviated Journal | IJPRAI |
| Volume | 27 | Issue | 5 | Pages | 1350014-1350035 |
| Keywords |
One-class Classifier; Ensemble Methods; Bagging and Outliers | ||||
| Abstract | The problem of training classifiers only with target data arises in many applications where non-target data are too costly, difficult to obtain, or not available at all. Several one-class classification methods have been presented to solve this problem, but most of the methods are highly sensitive to the presence of outliers in the target class. Ensemble methods have therefore been proposed as a powerful way to improve the classification performance of binary/multi-class learning algorithms by introducing diversity into classifiers.
However, their application to one-class classification has been rather limited. In this paper, we present a new ensemble method based on a non-parametric weighted bagging strategy for one-class classification, to improve accuracy in the presence of outliers. While the standard bagging strategy assumes a uniform data distribution, the method we propose here estimates a probability density based on a forest structure of the data. This assumption allows the estimation of data distribution from the computation of simple univariate and bivariate kernel densities. Experiments using original and noisy versions of 20 different datasets show that bagging ensemble methods applied to different one-class classifiers outperform base one-class classification methods. Moreover, we show that, in noisy versions of the datasets, the non-parametric weighted bagging strategy we propose outperforms the classical bagging strategy in a statistically significant way. |
||||
| 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; 600.046;MV | Approved | no | ||
| Call Number | Admin @ si @ SIV2013 | Serial | 2256 | ||
| Permanent link to this record | |||||
| Author | Pierluigi Casale; Oriol Pujol; Petia Radeva | ||||
| Title | Approximate polytope ensemble for one-class classification | Type | Journal Article | ||
| Year | 2014 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 47 | Issue | 2 | Pages | 854-864 |
| Keywords |
One-class classification; Convex hull; High-dimensionality; Random projections; Ensemble learning | ||||
| Abstract | In this work, a new one-class classification ensemble strategy called approximate polytope ensemble is presented. The main contribution of the paper is threefold. First, the geometrical concept of convex hull is used to define the boundary of the target class defining the problem. Expansions and contractions of this geometrical structure are introduced in order to avoid over-fitting. Second, the decision whether a point belongs to the convex hull model in high dimensional spaces is approximated by means of random projections and an ensemble decision process. Finally, a tiling strategy is proposed in order to model non-convex structures. Experimental results show that the proposed strategy is significantly better than state of the art one-class classification methods on over 200 datasets. | ||||
| 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 | MILAB; 605.203 | Approved | no | ||
| Call Number | Admin @ si @ CPR2014a | Serial | 2469 | ||
| Permanent link to this record | |||||
| Author | Joan Serrat; Felipe Lumbreras; Antonio Lopez | ||||
| Title | Cost estimation of custom hoses from STL files and CAD drawings | Type | Journal Article | ||
| Year | 2013 | Publication | Computers in Industry | Abbreviated Journal | COMPUTIND |
| Volume | 64 | Issue | 3 | Pages | 299-309 |
| Keywords |
On-line quotation; STL format; Regression; Gaussian process | ||||
| Abstract | We present a method for the cost estimation of custom hoses from CAD models. They can come in two formats, which are easy to generate: a STL file or the image of a CAD drawing showing several orthogonal projections. The challenges in either cases are, first, to obtain from them a high level 3D description of the shape, and second, to learn a regression function for the prediction of the manufacturing time, based on geometric features of the reconstructed shape. The chosen description is the 3D line along the medial axis of the tube and the diameter of the circular sections along it. In order to extract it from STL files, we have adapted RANSAC, a robust parametric fitting algorithm. As for CAD drawing images, we propose a new technique for 3D reconstruction from data entered on any number of orthogonal projections. The regression function is a Gaussian process, which does not constrain the function to adopt any specific form and is governed by just two parameters. We assess the accuracy of the manufacturing time estimation by k-fold cross validation on 171 STL file models for which the time is provided by an expert. The results show the feasibility of the method, whereby the relative error for 80% of the testing samples is below 15%. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier | 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.057; 600.054; 605.203 | Approved | no | ||
| Call Number | Admin @ si @ SLL2013; ADAS @ adas @ | Serial | 2161 | ||
| Permanent link to this record | |||||
| Author | Francisco Javier Orozco; Ognjen Rudovic; Jordi Gonzalez; Maja Pantic | ||||
| Title | Hierarchical On-line Appearance-Based Tracking for 3D Head Pose, Eyebrows, Lips, Eyelids and Irises | Type | Journal Article | ||
| Year | 2013 | Publication | Image and Vision Computing | Abbreviated Journal | IMAVIS |
| Volume | 31 | Issue | 4 | Pages | 322-340 |
| Keywords |
On-line appearance models; Levenberg–Marquardt algorithm; Line-search optimization; 3D face tracking; Facial action tracking; Eyelid tracking; Iris tracking | ||||
| Abstract | In this paper, we propose an On-line Appearance-Based Tracker (OABT) for simultaneous tracking of 3D head pose, lips, eyebrows, eyelids and irises in monocular video sequences. In contrast to previously proposed tracking approaches, which deal with face and gaze tracking separately, our OABT can also be used for eyelid and iris tracking, as well as 3D head pose, lips and eyebrows facial actions tracking. Furthermore, our approach applies an on-line learning of changes in the appearance of the tracked target. Hence, the prior training of appearance models, which usually requires a large amount of labeled facial images, is avoided. Moreover, the proposed method is built upon a hierarchical combination of three OABTs, which are optimized using a Levenberg–Marquardt Algorithm (LMA) enhanced with line-search procedures. This, in turn, makes the proposed method robust to changes in lighting conditions, occlusions and translucent textures, as evidenced by our experiments. Finally, the proposed method achieves head and facial actions tracking in real-time. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier | 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 | ISE; 605.203; 302.012; 302.018; 600.049 | Approved | no | ||
| Call Number | ORG2013 | Serial | 2221 | ||
| Permanent link to this record | |||||
| Author | Fadi Dornaika; Angel Sappa | ||||
| Title | A Featureless and Stochastic Approach to On-board Stereo Vision System Pose | Type | Journal Article | ||
| Year | 2009 | Publication | Image and Vision Computing | Abbreviated Journal | IMAVIS |
| Volume | 27 | Issue | 9 | Pages | 1382–1393 |
| Keywords |
On-board stereo vision system; Pose estimation; Featureless approach; Particle filtering; Image warping | ||||
| Abstract | This paper presents a direct and stochastic technique for real-time estimation of on-board stereo head’s position and orientation. Unlike existing works which rely on feature extraction either in the image domain or in 3D space, our proposed approach directly estimates the unknown parameters from the stream of stereo pairs’ brightness. The pose parameters are tracked using the particle filtering framework which implicitly enforces the smoothness constraints on the estimated parameters. The proposed technique can be used with a driver assistance applications as well as with augmented reality applications. Extended experiments on urban environments with different road geometries are presented. Comparisons with a 3D data-based approach are presented. Moreover, we provide a performance study aiming at evaluating the accuracy of the proposed approach. | ||||
| 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 | Approved | no | ||
| Call Number | ADAS @ adas @ DoS2009b | Serial | 1152 | ||
| Permanent link to this record | |||||
| Author | T. Widemann; Xavier Otazu | ||||
| Title | Titanias radius and an upper limit on its atmosphere from the September 8, 2001 stellar occultation | Type | Journal Article | ||
| Year | 2009 | Publication | International Journal of Solar System Studies | Abbreviated Journal | |
| Volume | 199 | Issue | 2 | Pages | 458–476 |
| Keywords |
Occultations; Uranus, satellites; Satellites, shapes; Satellites, dynamics; Ices; Satellites, atmospheres | ||||
| Abstract | On September 8, 2001 around 2 h UT, the largest uranian moon, Titania, occulted Hipparcos star 106829 (alias SAO 164538, a V=7.2, K0 III star). This was the first-ever observed occultation by this satellite, a rare event as Titania subtends only 0.11 arcsec on the sky. The star's unusual brightness allowed many observers, both amateurs or professionals, to monitor this unique event, providing fifty-seven occultations chords over three continents, all reported here. Selecting the best 27 occultation chords, and assuming a circular limb, we derive Titania's radius: View the MathML source (1-σ error bar). This implies a density of View the MathML source using the value View the MathML source derived by Taylor [Taylor, D.B., 1998. Astron. Astrophys. 330, 362–374]. We do not detect any significant difference between equatorial and polar radii, in the limit View the MathML source, in agreement with Voyager limb image retrieval during the 1986 flyby. Titania's offset with respect to the DE405 + URA027 (based on GUST86 theory) ephemeris is derived: ΔαTcos(δT)=−108±13 mas and ΔδT=−62±7 mas (ICRF J2000.0 system). Most of this offset is attributable to a Uranus' barycentric offset with respect to DE405, that we estimate to be: View the MathML source and ΔδU=−85±25 mas at the moment of occultation. This offset is confirmed by another Titania stellar occultation observed on August 1st, 2003, which provides an offset of ΔαTcos(δT)=−127±20 mas and ΔδT=−97±13 mas for the satellite. The combined ingress and egress data do not show any significant hint for atmospheric refraction, allowing us to set surface pressure limits at the level of 10–20 nbar. More specifically, we find an upper limit of 13 nbar (1-σ level) at 70 K and 17 nbar at 80 K, for a putative isothermal CO2 atmosphere. We also provide an upper limit of 8 nbar for a possible CH4 atmosphere, and 22 nbar for pure N2, again at the 1-σ level. We finally constrain the stellar size using the time-resolved star disappearance and reappearance at ingress and egress. We find an angular diameter of 0.54±0.03 mas (corresponding to View the MathML source projected at Titania). With a distance of 170±25 parsecs, this corresponds to a radius of 9.8±0.2 solar radii for HIP 106829, typical of a K0 III giant. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | ELSEVIER | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0019-1035 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | CIC | Approved | no | ||
| Call Number | CAT @ cat @ Wid2009 | Serial | 1052 | ||
| Permanent link to this record | |||||
| Author | David Aldavert; Arnau Ramisa; Ramon Lopez de Mantaras; Ricardo Toledo | ||||
| Title | Real-time Object Segmentation using a Bag of Features Approach | Type | Conference Article | ||
| Year | 2010 | Publication | 13th International Conference of the Catalan Association for Artificial Intelligence | Abbreviated Journal | |
| Volume | 220 | Issue | Pages | 321–329 | |
| Keywords |
Object Segmentation; Bag Of Features; Feature Quantization; Densely sampled descriptors | ||||
| Abstract | In this paper, we propose an object segmentation framework, based on the popular bag of features (BoF), which can process several images per second while achieving a good segmentation accuracy assigning an object category to every pixel of the image. We propose an efficient color descriptor to complement the information obtained by a typical gradient-based local descriptor. Results show that color proves to be a useful cue to increase the segmentation accuracy, specially in large homogeneous regions. Then, we extend the Hierarchical K-Means codebook using the recently proposed Vector of Locally Aggregated Descriptors method. Finally, we show that the BoF method can be easily parallelized since it is applied locally, thus the time necessary to process an image is further reduced. The performance of the proposed method is evaluated in the standard PASCAL 2007 Segmentation Challenge object segmentation dataset. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | IOS Press Amsterdam, | Place of Publication | Editor | In R.Alquezar, A.Moreno, J.Aguilar. | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 9781607506423 | Medium | ||
| Area | Expedition | Conference | CCIA | ||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ ARL2010b | Serial | 1417 | ||
| Permanent link to this record | |||||