| Records |
| Author |
David Aldavert; Ricardo Toledo; Arnau Ramisa; Ramon Lopez de Mantaras |
| Title |
Visual Registration Method For A Low Cost Robot: Computer Vision Systems |
Type |
Conference Article |
| Year |
2009 |
Publication |
7th International Conference on Computer Vision Systems |
Abbreviated Journal |
|
| Volume |
5815 |
Issue |
|
Pages |
204–214 |
| Keywords |
|
| Abstract |
An autonomous mobile robot must face the correspondence or data association problem in order to carry out tasks like place recognition or unknown environment mapping. In order to put into correspondence two maps, most methods estimate the transformation relating the maps from matches established between low level feature extracted from sensor data. However, finding explicit matches between features is a challenging and computationally expensive task. In this paper, we propose a new method to align obstacle maps without searching explicit matches between features. The maps are obtained from a stereo pair. Then, we use a vocabulary tree approach to identify putative corresponding maps followed by the Newton minimization algorithm to find the transformation that relates both maps. The proposed method is evaluated in a typical office environment showing good performance. |
| Address |
Belgica |
| 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-04666-7 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICVS |
| Notes |
ADAS |
Approved |
no |
| Call Number |
Admin @ si @ ATR2009b |
Serial |
1247 |
| Permanent link to this record |
| |
|
| |
| Author |
Oscar Camara; Estanislao Oubel; Gemma Piella; Simone Balocco; Mathieu De Craene; Alejandro F. Frangi |
| Title |
Multi-sequence Registration of Cine, Tagged and Delay-Enhancement MRI with Shift Correction and Steerable Pyramid-Based Detagging |
Type |
Conference Article |
| Year |
2009 |
Publication |
5th International Conference on Functional Imaging and Modeling of the Heart |
Abbreviated Journal |
|
| Volume |
5528 |
Issue |
|
Pages |
330–338 |
| Keywords |
|
| Abstract |
In this work, we present a registration framework for cardiac cine MRI (cMRI), tagged (tMRI) and delay-enhancement MRI (deMRI), where the two main issues to find an accurate alignment between these images have been taking into account: the presence of tags in tMRI and respiration artifacts in all sequences. A steerable pyramid image decomposition has been used for detagging purposes since it is suitable to extract high-order oriented structures by directional adaptive filtering. Shift correction of cMRI is achieved by firstly maximizing the similarity between the Long Axis and Short Axis cMRI. Subsequently, these shift-corrected images are used as target images in a rigid registration procedure with their corresponding tMRI/deMRI in order to correct their shift. The proposed registration framework has been evaluated by 840 registration tests, considerably improving the alignment of the MR images (mean RMS error of 2.04mm vs. 5.44mm). |
| 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-01931-9 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
FIMH |
| Notes |
MILAB |
Approved |
no |
| Call Number |
BCNPCL @ bcnpcl @ COP2009 |
Serial |
1255 |
| Permanent link to this record |
| |
|
| |
| Author |
Bogdan Raducanu; Fadi Dornaika |
| Title |
Natural Facial Expression Recognition Using Dynamic and Static Schemes |
Type |
Conference Article |
| Year |
2009 |
Publication |
5th International Symposium on Visual Computing |
Abbreviated Journal |
|
| Volume |
5875 |
Issue |
|
Pages |
730–739 |
| Keywords |
|
| Abstract |
Affective computing is at the core of a new paradigm in HCI and AI represented by human-centered computing. Within this paradigm, it is expected that machines will be enabled with perceiving capabilities, making them aware about users’ affective state. The current paper addresses the problem of facial expression recognition from monocular videos sequences. We propose a dynamic facial expression recognition scheme, which is proven to be very efficient. Furthermore, it is conveniently compared with several static-based systems adopting different magnitude of facial expression. We provide evaluations of performance using Linear Discriminant Analysis (LDA), Non parametric Discriminant Analysis (NDA), and Support Vector Machines (SVM). We also provide performance evaluations using arbitrary test video sequences. |
| Address |
Las Vegas, USA |
| 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-10330-8 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ISVC |
| Notes |
OR;MV |
Approved |
no |
| Call Number |
BCNPCL @ bcnpcl @ RaD2009 |
Serial |
1257 |
| Permanent link to this record |
| |
|
| |
| Author |
Salim Jouili; Salvatore Tabbone; Ernest Valveny |
| Title |
Comparing Graph Similarity Measures for Graphical Recognition. |
Type |
Conference Article |
| Year |
2009 |
Publication |
8th IAPR International Workshop on Graphics Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
In this paper we evaluate four graph distance measures. The analysis is performed for document retrieval tasks. For this aim, different kind of documents are used including line drawings (symbols), ancient documents (ornamental letters), shapes and trademark-logos. The experimental results show that the performance of each graph distance measure depends on the kind of data and the graph representation technique. |
| Address |
La Rochelle; France; July 2009 |
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
LNCS |
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
GREC |
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ JTV2009 |
Serial |
1442 |
| Permanent link to this record |
| |
|
| |
| Author |
Debora Gil; Aura Hernandez-Sabate; Mireia Burnat; Steven Jansen; Jordi Martinez-Vilalta |
| Title |
Structure-Preserving Smoothing of Biomedical Images |
Type |
Conference Article |
| Year |
2009 |
Publication |
13th International Conference on Computer Analysis of Images and Patterns |
Abbreviated Journal |
|
| Volume |
5702 |
Issue |
|
Pages |
427-434 |
| Keywords |
non-linear smoothing; differential geometry; anatomical structures segmentation; cardiac magnetic resonance; computerized tomography. |
| Abstract |
Smoothing of biomedical images should preserve gray-level transitions between adjacent tissues, while restoring contours consistent with anatomical structures. Anisotropic diffusion operators are based on image appearance discontinuities (either local or contextual) and might fail at weak inter-tissue transitions. Meanwhile, the output of block-wise and morphological operations is prone to present a block structure due to the shape and size of the considered pixel neighborhood. In this contribution, we use differential geometry concepts to define a diffusion operator that restricts to image consistent level-sets. In this manner, the final state is a non-uniform intensity image presenting homogeneous inter-tissue transitions along anatomical structures, while smoothing intra-structure texture. Experiments on different types of medical images (magnetic resonance, computerized tomography) illustrate its benefit on a further process (such as segmentation) of images. |
| Address |
Münster, Germany |
| 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-03766-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
CAIP |
| Notes |
IAM |
Approved |
no |
| Call Number |
IAM @ iam @ GHB2009 |
Serial |
1527 |
| Permanent link to this record |
| |
|
| |
| Author |
L.Tarazon; D. Perez; N. Serrano; V. Alabau; Oriol Ramos Terrades; A. Sanchis; A. Juan |
| Title |
Confidence Measures for Error Correction in Interactive Transcription of Handwritten Text |
Type |
Conference Article |
| Year |
2009 |
Publication |
15th International Conference on Image Analysis and Processing |
Abbreviated Journal |
|
| Volume |
5716 |
Issue |
|
Pages |
567-574 |
| Keywords |
|
| Abstract |
An effective approach to transcribe old text documents is to follow an interactive-predictive paradigm in which both, the system is guided by the human supervisor, and the supervisor is assisted by the system to complete the transcription task as efficiently as possible. In this paper, we focus on a particular system prototype called GIDOC, which can be seen as a first attempt to provide user-friendly, integrated support for interactive-predictive page layout analysis, text line detection and handwritten text transcription. More specifically, we focus on the handwriting recognition part of GIDOC, for which we propose the use of confidence measures to guide the human supervisor in locating possible system errors and deciding how to proceed. Empirical results are reported on two datasets showing that a word error rate not larger than a 10% can be achieved by only checking the 32% of words that are recognised with less confidence. |
| Address |
Vietri sul Mare, Italy |
| 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-04145-7 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICIAP |
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ TPS2009 |
Serial |
1871 |
| Permanent link to this record |
| |
|
| |
| Author |
David Vazquez; David Geronimo; Antonio Lopez |
| Title |
The effect of the distance in pedestrian detection |
Type |
Report |
| Year |
2009 |
Publication |
CVC Technical Report |
Abbreviated Journal |
|
| Volume |
149 |
Issue |
|
Pages |
|
| Keywords |
Pedestrian Detection |
| Abstract |
Pedestrian accidents are one of the leading preventable causes of death. In order to reduce the number of accidents, in the last decade the pedestrian protection systems have been introduced, a special type of advanced driver assistance systems, in witch an on-board camera explores the road ahead for possible collisions with pedestrians in order to warn the driver or perform braking actions. As a result of the variability of the appearance, pose and size, pedestrian detection is a very challenging task. So many techniques, models and features have been proposed to solve the problem. As the appearance of pedestrians varies signi cantly as a function of distance, a system based on multiple classi ers specialized on diferent depths is likely to improve the overall performance with respect to a typical system based on a general detector. Accordingly, the main aim of this work is to explore the e ect of the distance in pedestrian detection. We have evaluated three pedestrian detectors (HOG, HAAR and EOH) in two di erent databases (INRIA and Daimler09) for two di erent sizes (small and big). By a extensive set of experiments we answer to questions like which datasets and evaluation methods are the most adequate, which is the best method for each size of the pedestrians and why or how do the method optimum parameters vary with respect to the distance |
| Address |
|
| Corporate Author |
|
Thesis |
Master's 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 |
M.Sc. |
| Notes |
ADAS |
Approved |
no |
| Call Number |
ADAS @ adas @ VGL2009 |
Serial |
1669 |
| Permanent link to this record |
| |
|
| |
| Author |
Albert Andaluz |
| Title |
LV Contour Segmentation in TMR images using Semantic Description of Tissue and Prior Knowledge Correction |
Type |
Report |
| Year |
2009 |
Publication |
CVC Technical Report |
Abbreviated Journal |
|
| Volume |
142 |
Issue |
|
Pages |
|
| Keywords |
Active Contour Models; Snakes; Active Shape Models; Deformable Templates; Left Ventricle Segmentation; Generalized Orthogonal Procrustes Analysis; Harmonic Phase Flow; Principal Component Analysis; Tagged Magnetic Resonance |
| Abstract |
The Diagnosis of Left Ventricle (LV) pathologies is related to regional wall motion analysis. Health indicator scores such as the rotation and the torsion are useful for the diagnose of the Left Ventricle (LV) function. However, this requires proper identification of LV segments. On one hand, manual segmentation is robust, but it is slow and requires medical expertise. On the other hand, the tag pattern in Tagged Magnetic Resonance (TMR) sequences is a problem for the automatic segmentation of the LV boundaries. Consequently, we propose a method based in the classical formulation of parametric Snakes, combined with Active Shape models. Our semantic definition of the LV is tagged tissue that experiences motion in the systolic cycle. This defines two energy potentials for the Snake convergence. Additionally, the mean shape corrects excessive deviation from the anatomical shape. We have validated our approach in 15 healthy volunteers and two short axis cuts. In this way, we have compared the automatic segmentations to manual shapes outlined by medical experts. Also, we have explored the accuracy of clinical scores computed using automatic contours. The results show minor divergence in the approximation and the manual segmentations as well as robust computation of clinical scores in all cases. From this we conclude that the proposed method is a promising support tool for clinical analysis. |
| Address |
|
| Corporate Author |
|
Thesis |
Master's thesis |
| Publisher |
|
Place of Publication |
Bellaterra 08193, Barcelona, Spain |
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 |
IAM; |
Approved |
no |
| Call Number |
IAM @ iam @ And2009 |
Serial |
1667 |
| 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 |
Jose Antonio Rodriguez; Florent Perronnin |
| Title |
Handwritten word-spotting using hidden Markov models and universal vocabularies |
Type |
Journal Article |
| Year |
2009 |
Publication |
Pattern Recognition |
Abbreviated Journal |
PR |
| Volume |
42 |
Issue |
9 |
Pages |
2103-2116 |
| Keywords |
Word-spotting; Hidden Markov model; Score normalization; Universal vocabulary; Handwriting recognition |
| Abstract |
Handwritten word-spotting is traditionally viewed as an image matching task between one or multiple query word-images and a set of candidate word-images in a database. This is a typical instance of the query-by-example paradigm. In this article, we introduce a statistical framework for the word-spotting problem which employs hidden Markov models (HMMs) to model keywords and a Gaussian mixture model (GMM) for score normalization. We explore the use of two types of HMMs for the word modeling part: continuous HMMs (C-HMMs) and semi-continuous HMMs (SC-HMMs), i.e. HMMs with a shared set of Gaussians. We show on a challenging multi-writer corpus that the proposed statistical framework is always superior to a traditional matching system which uses dynamic time warping (DTW) for word-image distance computation. A very important finding is that the SC-HMM is superior when labeled training data is scarce—as low as one sample per keyword—thanks to the prior information which can be incorporated in the shared set of Gaussians. |
| 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 |
0031-3203 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
|
Approved |
no |
| Call Number |
Admin @ si @ RoP2009 |
Serial |
1053 |
| Permanent link to this record |
| |
|
| |
| Author |
Miquel Ferrer; Ernest Valveny; F. Serratosa |
| Title |
Median graph: A new exact algorithm using a distance based on the maximum common subgraph |
Type |
Journal Article |
| Year |
2009 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
30 |
Issue |
5 |
Pages |
579–588 |
| Keywords |
|
| Abstract |
Median graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions is a very hard problem. In this work we present a new and more efficient optimal algorithm for the median graph computation. With the use of a particular cost function that permits the definition of the graph edit distance in terms of the maximum common subgraph, and a prediction function in the backtracking algorithm, we reduce the size of the search space, avoiding the evaluation of a great amount of states and still obtaining the exact median. We present a set of experiments comparing our new algorithm against the previous existing exact algorithm using synthetic data. In addition, we present the first application of the exact median graph computation to real data and we compare the results against an approximate algorithm based on genetic search. These experimental results show that our algorithm outperforms the previous existing exact algorithm and in addition show the potential applicability of the exact solutions to real problems. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Elsevier Science Inc. |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
0167-8655 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ FVS2009a |
Serial |
1114 |
| Permanent link to this record |
| |
|
| |
| Author |
Fadi Dornaika; Angel Sappa |
| Title |
Instantaneous 3D motion from image derivatives using the Least Trimmed Square Regression |
Type |
Journal Article |
| Year |
2009 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
30 |
Issue |
5 |
Pages |
535–543 |
| Keywords |
|
| Abstract |
This paper presents a new technique to the instantaneous 3D motion estimation. The main contributions are as follows. First, we show that the 3D camera or scene velocity can be retrieved from image derivatives only assuming that the scene contains a dominant plane. Second, we propose a new robust algorithm that simultaneously provides the Least Trimmed Square solution and the percentage of inliers-the non-contaminated data. Experiments on both synthetic and real image sequences demonstrated the effectiveness of the developed method. Those experiments show that the new robust approach can outperform classical robust schemes. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Elsevier Science Inc. |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
0167-8655 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
ADAS |
Approved |
no |
| Call Number |
ADAS @ adas @ DoS2009a |
Serial |
1115 |
| Permanent link to this record |
| |
|
| |
| Author |
Xavier Baro; Sergio Escalera; Jordi Vitria; Oriol Pujol; Petia Radeva |
| Title |
Traffic Sign Recognition Using Evolutionary Adaboost Detection and Forest-ECOC Classification |
Type |
Journal Article |
| Year |
2009 |
Publication |
IEEE Transactions on Intelligent Transportation Systems |
Abbreviated Journal |
TITS |
| Volume |
10 |
Issue |
1 |
Pages |
113–126 |
| Keywords |
|
| Abstract |
The high variability of sign appearance in uncontrolled environments has made the detection and classification of road signs a challenging problem in computer vision. In this paper, we introduce a novel approach for the detection and classification of traffic signs. Detection is based on a boosted detectors cascade, trained with a novel evolutionary version of Adaboost, which allows the use of large feature spaces. Classification is defined as a multiclass categorization problem. A battery of classifiers is trained to split classes in an Error-Correcting Output Code (ECOC) framework. We propose an ECOC design through a forest of optimal tree structures that are embedded in the ECOC matrix. The novel system offers high performance and better accuracy than the state-of-the-art strategies and is potentially better in terms of noise, affine deformation, partial occlusions, and reduced illumination. |
| 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 |
1524-9050 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
OR;MILAB;HuPBA;MV |
Approved |
no |
| Call Number |
BCNPCL @ bcnpcl @ BEV2008 |
Serial |
1116 |
| Permanent link to this record |
| |
|
| |
| Author |
Niki Aifanti; Angel Sappa; N. Grammalidis; Sotiris Malassiotis |
| Title |
Advances in Tracking and Recognition of Human Motion |
Type |
Book Chapter |
| Year |
2009 |
Publication |
Encyclopedia of Information Science and Technology |
Abbreviated Journal |
|
| Volume |
I |
Issue |
2nd edition |
Pages |
65–71 |
| Keywords |
|
| Abstract |
|
| 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 @ ASG2009 |
Serial |
1143 |
| Permanent link to this record |
| |
|
| |
| Author |
Mohammad Rouhani |
| Title |
3D Data Fitting and Tracking for Real Time Applications |
Type |
Report |
| Year |
2009 |
Publication |
CVC Technical Report |
Abbreviated Journal |
|
| Volume |
138 |
Issue |
138 |
Pages |
|
| Keywords |
|
| Abstract |
|
| Address |
Barcelona, Spain |
| Corporate Author |
|
Thesis |
Master's 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 |
invisible;ADAS |
Approved |
no |
| Call Number |
Admin @ si @ Rou2009 |
Serial |
1150 |
| Permanent link to this record |
