Publicacions CVC -- Query Results

	Publicacions CVC Home \| Show All \| Simple Search \| Advanced Search \| Add Record \| Import	Login Quick Search: Field: contains: ...
	91–105 of 149 records found matching your query (RSS \| history):

Search & Display Options

Select All Deselect All

<< 1 2 3 4 5 6 7 8 9 10 >>

List View

Citations

Details

	Records
	Author	Francesco Ciompi; Oriol Pujol; Oriol Rodriguez-Leor; Carlo Gatta; Angel Serrano; Petia Radeva
	Title	Enhancing In-Vitro IVUS Data for Tissue Characterization			Type	Conference Article
	Year	2009	Publication	4th Iberian Conference on Pattern Recognition and Image Analysis	Abbreviated Journal
	Volume	5524	Issue		Pages	241–248
	Keywords
	Abstract	Intravascular Ultrasound (IVUS) data validation is usually performed by comparing post-mortem (in-vitro) IVUS data and corresponding histological analysis of the tissue, obtaining a reliable ground truth. The main drawback of this method is the few number of available study cases due to the complex procedure of histological analysis. In this work we propose a novel semi-supervised approach to enhance the in-vitro training set by including examples from in-vivo coronary plaques data set. For this purpose, a Sequential Floating Forward Selection method is applied on in-vivo data and plaque characterization performances are evaluated by Leave-One-Patient-Out cross-validation technique. Supervised data inclusion improves global classification accuracy from 89.39% to 91.82%.
	Address	Póvoa de Varzim, Portugal
	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-02171-8	Medium
	Area		Expedition		Conference	IbPRIA
	Notes	MILAB;HuPBA			Approved	no
	Call Number	BCNPCL @ bcnpcl @ CPR2009a			Serial	1162
Permanent link to this record



	Author	Sergio Escalera; Oriol Pujol; J. Mauri; Petia Radeva
	Title	Intravascular Ultrasound Tissue Characterization with Sub-class Error-Correcting Output Codes			Type	Journal Article
	Year	2009	Publication	Journal of Signal Processing Systems	Abbreviated Journal
	Volume	55	Issue	1-3	Pages	35–47
	Keywords
	Abstract	Intravascular ultrasound (IVUS) represents a powerful imaging technique to explore coronary vessels and to study their morphology and histologic properties. In this paper, we characterize different tissues based on radial frequency, texture-based, and combined features. To deal with the classification of multiple tissues, we require the use of robust multi-class learning techniques. In this sense, error-correcting output codes (ECOC) show to robustly combine binary classifiers to solve multi-class problems. In this context, we propose a strategy to model multi-class classification tasks using sub-classes information in the ECOC framework. The new strategy splits the classes into different sub-sets according to the applied base classifier. Complex IVUS data sets containing overlapping data are learnt by splitting the original set of classes into sub-classes, and embedding the binary problems in a problem-dependent ECOC design. The method automatically characterizes different tissues, showing performance improvements over the state-of-the-art ECOC techniques for different base classifiers. Furthermore, the combination of RF and texture-based features also shows improvements over the state-of-the-art approaches.
	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	1939-8018	ISBN		Medium
	Area		Expedition		Conference
	Notes	MILAB;HuPBA			Approved	no
	Call Number	BCNPCL @ bcnpcl @ EPM2009			Serial	1258
Permanent link to this record



	Author	Carlo Gatta; Oriol Pujol; Oriol Rodriguez-Leor; J. M. Ferre; Petia Radeva
	Title	Fast Rigid Registration of Vascular Structures in IVUS Sequences			Type	Journal Article
	Year	2009	Publication	IEEE Transactions on Information Technology in Biomedicine	Abbreviated Journal
	Volume	13	Issue	6	Pages	106-1011
	Keywords
	Abstract	Intravascular ultrasound (IVUS) technology permits visualization of high-resolution images of internal vascular structures. IVUS is a unique image-guiding tool to display longitudinal view of the vessels, and estimate the length and size of vascular structures with the goal of accurate diagnosis. Unfortunately, due to pulsatile contraction and expansion of the heart, the captured images are affected by different motion artifacts that make visual inspection difficult. In this paper, we propose an efficient algorithm that aligns vascular structures and strongly reduces the saw-shaped oscillation, simplifying the inspection of longitudinal cuts; it reduces the motion artifacts caused by the displacement of the catheter in the short-axis plane and the catheter rotation due to vessel tortuosity. The algorithm prototype aligns 3.16 frames/s and clearly outperforms state-of-the-art methods with similar computational cost. The speed of the algorithm is crucial since it allows to inspect the corrected sequence during patient intervention. Moreover, we improved an indirect methodology for IVUS rigid registration algorithm evaluation.
	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	1089-7771	ISBN		Medium
	Area		Expedition		Conference
	Notes	MILAB;HuPBA			Approved	no
	Call Number	BCNPCL @ bcnpcl @ GPL2009			Serial	1250
Permanent link to this record



	Author	C. Alejandro Parraga; Robert Benavente; Maria Vanrell; Ramon Baldrich
	Title	Psychophysical measurements to model inter-colour regions of colour-naming space			Type	Journal Article
	Year	2009	Publication	Journal of Imaging Science and Technology	Abbreviated Journal
	Volume	53	Issue	3	Pages	031106 (8 pages)
	Keywords	image processing; Analysis
	Abstract	JCR Impact Factor 2009: 0.391 In this paper, we present a fuzzy-set of parametric functions which segment the CIE lab space into eleven regions which correspond to the group of common universal categories present in all evolved languages as identified by anthropologists and linguists. The set of functions is intended to model a color-name assignment task by humans and differs from other models in its emphasis on the inter-color boundary regions, which were explicitly measured by means of a psychophysics experiment. In our particular implementation, the CIE lab space was segmented into eleven color categories using a Triple Sigmoid as the fuzzy sets basis, whose parameters are included in this paper. The modelâ€™s parameters were adjusted according to the psychophysical results of a yes/no discrimination paradigm where observers had to choose (English) names for isoluminant colors belonging to regions in-between neighboring categories. These colors were presented on a calibrated CRT monitor (14-bit x 3 precision). The experimental results show that inter- color boundary regions are much less defined than expected and color samples other than those near the most representatives are needed to define the position and shape of boundaries between categories. The extended set of model parameters is given as a table.
	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	CIC			Approved	no
	Call Number	CAT @ cat @ PBV2009			Serial	1157
Permanent link to this record



	Author	Sergio Escalera; Eloi Puertas; Petia Radeva; Oriol Pujol
	Title	Multimodal laughter recognition in video conversations			Type	Conference Article
	Year	2009	Publication	2nd IEEE Workshop on CVPR for Human communicative Behavior analysis	Abbreviated Journal
	Volume		Issue		Pages	110–115
	Keywords
	Abstract	Laughter detection is an important area of interest in the Affective Computing and Human-computer Interaction fields. In this paper, we propose a multi-modal methodology based on the fusion of audio and visual cues to deal with the laughter recognition problem in face-to-face conversations. The audio features are extracted from the spectogram and the video features are obtained estimating the mouth movement degree and using a smile and laughter classifier. Finally, the multi-modal cues are included in a sequential classifier. Results over videos from the public discussion blog of the New York Times show that both types of features perform better when considered together by the classifier. Moreover, the sequential methodology shows to significantly outperform the results obtained by an Adaboost classifier.
	Address	Miami (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	2160-7508	ISBN	978-1-4244-3994-2	Medium
	Area		Expedition		Conference	CVPR
	Notes	MILAB;HuPBA			Approved	no
	Call Number	BCNPCL @ bcnpcl @ EPR2009c			Serial	1188
Permanent link to this record



	Author	Sergio Escalera; Alicia Fornes; O. Pujol; Petia Radeva; Gemma Sanchez; Josep Llados
	Title	Blurred Shape Model for Binary and Grey-level Symbol Recognition			Type	Journal Article
	Year	2009	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	30	Issue	15	Pages	1424–1433
	Keywords
	Abstract	Many symbol recognition problems require the use of robust descriptors in order to obtain rich information of the data. However, the research of a good descriptor is still an open issue due to the high variability of symbols appearance. Rotation, partial occlusions, elastic deformations, intra-class and inter-class variations, or high variability among symbols due to different writing styles, are just a few problems. In this paper, we introduce a symbol shape description to deal with the changes in appearance that these types of symbols suffer. The shape of the symbol is aligned based on principal components to make the recognition invariant to rotation and reflection. Then, we present the Blurred Shape Model descriptor (BSM), where new features encode the probability of appearance of each pixel that outlines the symbols shape. Moreover, we include the new descriptor in a system to deal with multi-class symbol categorization problems. Adaboost is used to train the binary classifiers, learning the BSM features that better split symbol classes. Then, the binary problems are embedded in an Error-Correcting Output Codes framework (ECOC) to deal with the multi-class case. The methodology is evaluated on different synthetic and real data sets. State-of-the-art descriptors and classifiers are compared, showing the robustness and better performance of the present scheme to classify symbols with high variability of appearance.
	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; DAG; MILAB			Approved	no
	Call Number	BCNPCL @ bcnpcl @ EFP2009a			Serial	1180
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	Sergio Escalera; Alicia Fornes; Oriol Pujol; Petia Radeva
	Title	Multi-class Binary Symbol Classification with Circular Blurred Shape Models			Type	Conference Article
	Year	2009	Publication	15th International Conference on Image Analysis and Processing	Abbreviated Journal
	Volume	5716	Issue		Pages	1005–1014
	Keywords
	Abstract	Multi-class binary symbol classification requires the use of rich descriptors and robust classifiers. Shape representation is a difficult task because of several symbol distortions, such as occlusions, elastic deformations, gaps or noise. In this paper, we present the Circular Blurred Shape Model descriptor. This descriptor encodes the arrangement information of object parts in a correlogram structure. A prior blurring degree defines the level of distortion allowed to the symbol. Moreover, we learn the new feature space using a set of Adaboost classifiers, which are combined in the Error-Correcting Output Codes framework to deal with the multi-class categorization problem. The presented work has been validated over different multi-class data sets, and compared to the state-of-the-art descriptors, showing significant performance improvements.
	Address	Salerno, 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	MILAB;HuPBA;DAG			Approved	no
	Call Number	BCNPCL @ bcnpcl @ EFP2009c			Serial	1186
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	Jorge Bernal
	Title	Use of Projection and Back-projection Methods in Bidimensional Computed Tomography Image Reconstruction			Type	Report
	Year	2009	Publication	CVC Tecnical Report	Abbreviated Journal
	Volume	141	Issue		Pages
	Keywords	Projection, Back-projection, CT scan, Euclidean geometry, Radon transform
	Abstract	One of the biggest drawbacks related to the use of CT scanners is the cost (in memory and in time) associated. In this project many methods to simulate their functioning, but in a more feasible way (taking an industrial point of view), will be studied. The main group of techniques that are being used are the one entitled as ’back-projection’. The concept behind is to simulate the X ray emission in CT scans by lines that cross with the image we want to reconstruct. In the first part of this document euclidean geometry is used to face the tasks of projec- tion and back-projection. After analysing the results achieved it has been proved that this approach does not lead to a fully perfect reconstruction (and also has some other problems related to running time and memory cost). Because of this in the second part of the document ’Filtered Back-projection’ method is introduced in order to improve the results. Filtered Back-projection methods rely on mathematical transforms (Fourier, Radon) in order to provide more accurate results that can be obtained in much less time. The main cause of this better results is the use of a filtering process before the back-projection in order to avoid high frequency-caused errors. As a result of this project two different implementations (one for each approach) had been implemented in order to compare their performance.
	Address
	Corporate Author	Computer Vision Center			Thesis	Master's thesis
	Publisher		Place of Publication	Barcelona, Spain	Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area	800	Expedition		Conference
	Notes	MV;			Approved	no
	Call Number	IAM @ iam @ Ber2009			Serial	1693
Permanent link to this record



	Author	Sergio Escalera; Oriol Pujol; Petia Radeva
	Title	Recoding Error-Correcting Output Codes			Type	Conference Article
	Year	2009	Publication	8th International Workshop of Multiple Classifier Systems	Abbreviated Journal
	Volume	5519	Issue		Pages	11–21
	Keywords
	Abstract	One of the most widely applied techniques to deal with multi- class categorization problems is the pairwise voting procedure. Recently, this classical approach has been embedded in the Error-Correcting Output Codes framework (ECOC). This framework is based on a coding step, where a set of binary problems are learnt and coded in a matrix, and a decoding step, where a new sample is tested and classified according to a comparison with the positions of the coded matrix. In this paper, we present a novel approach to redefine without retraining, in a problem-dependent way, the one-versus-one coding matrix so that the new coded information increases the generalization capability of the system. Moreover, the final classification can be tuned with the inclusion of a weighting matrix in the decoding step. The approach has been validated over several UCI Machine Learning repository data sets and two real multi-class problems: traffic sign and face categorization. The results show that performance improvements are obtained when comparing the new approach to one of the best ECOC designs (one-versus-one). Furthermore, the novel methodology obtains at least the same performance than the one-versus-one ECOC design.
	Address	Reykjavik (Iceland)
	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-02325-5	Medium
	Area		Expedition		Conference	MCS
	Notes	MILAB;HuPBA			Approved	no
	Call Number	BCNPCL @ bcnpcl @ EPR2009d			Serial	1190
Permanent link to this record



	Author	Oriol Pujol; Eloi Puertas; Carlo Gatta
	Title	Multi-scale Stacked Sequential Learning			Type	Conference Article
	Year	2009	Publication	8th International Workshop of Multiple Classifier Systems	Abbreviated Journal
	Volume	5519	Issue		Pages	262–271
	Keywords
	Abstract	One of the most widely used assumptions in supervised learning is that data is independent and identically distributed. This assumption does not hold true in many real cases. Sequential learning is the discipline of machine learning that deals with dependent data such that neighboring examples exhibit some kind of relationship. In the literature, there are different approaches that try to capture and exploit this correlation, by means of different methodologies. In this paper we focus on meta-learning strategies and, in particular, the stacked sequential learning approach. The main contribution of this work is two-fold: first, we generalize the stacked sequential learning. This generalization reflects the key role of neighboring interactions modeling. Second, we propose an effective and efficient way of capturing and exploiting sequential correlations that takes into account long-range interactions by means of a multi-scale pyramidal decomposition of the predicted labels. Additionally, this new method subsumes the standard stacked sequential learning approach. We tested the proposed method on two different classification tasks: text lines classification in a FAQ data set and image classification. Results on these tasks clearly show that our approach outperforms the standard stacked sequential learning. Moreover, we show that the proposed method allows to control the trade-off between the detail and the desired range of the interactions.
	Address	Reykjavik, Iceland
	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-02325-5	Medium
	Area		Expedition		Conference	MCS
	Notes	MILAB;HuPBA			Approved	no
	Call Number	BCNPCL @ bcnpcl @ PPG2009			Serial	1260
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 signicantly as a function of distance, a system based on multiple classiers 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 eect of the distance in pedestrian detection. We have evaluated three pedestrian detectors (HOG, HAAR and EOH) in two dierent databases (INRIA and Daimler09) for two dierent 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	Maria Salamo; Sergio Escalera; Petia Radeva
	Title	Quality Enhancement based on Reinforcement Learning and Feature Weighting for a Critiquing-Based Recommender			Type	Conference Article
	Year	2009	Publication	8th International Conference on Case-Based Reasoning	Abbreviated Journal
	Volume	5650	Issue		Pages	298–312
	Keywords
	Abstract	Personalizing the product recommendation task is a major focus of research in the area of conversational recommender systems. Conversational case-based recommender systems help users to navigate through product spaces, alternatively making product suggestions and eliciting users feedback. Critiquing is a common form of feedback and incremental critiquing-based recommender system has shown its efficiency to personalize products based primarily on a quality measure. This quality measure influences the recommendation process and it is obtained by the combination of compatibility and similarity scores. In this paper, we describe new compatibility strategies whose basis is on reinforcement learning and a new feature weighting technique which is based on the user’s history of critiques. Moreover, we show that our methodology can significantly improve recommendation efficiency in comparison with the state-of-the-art approaches.
	Address	Seattle, 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-02998-1	Medium
	Area		Expedition		Conference	ICCBR
	Notes	HuPBA; MILAB			Approved	no
	Call Number	BCNPCL @ bcnpcl @ SER2009			Serial	1187
Permanent link to this record



	Author	Enric Marti; Jaume Rocarias; Debora Gil; Aura Hernandez-Sabate; Jaume Garcia; Carme Julia; Marc Vivet
	Title	Uso de recursos virtuales en Aprendizaje Basado en Proyectos. Una experiencia en la asignatura de Gráficos por Computador			Type	Miscellaneous
	Year	2009	Publication	I Congreso de Docencia Universitaria	Abbreviated Journal
	Volume		Issue		Pages
	Keywords	Aprendizaje Basado en Proyectos; Project Based Learning; Aprendizaje Cooperativo; Recursos Virtuales para el Aprendizaje Cooperativo; Moodle
	Abstract	Presentamos una experiencia en Aprendizaje Basado en Proyectos (ABP) realizada los últimos cuatro años en Gráficos por Computador 2, asignatura de Ingeniería Informática, de la Escuela Técnica Superior de Ingeniería (ETSE) de la Universidad Autónoma de Barcelona (UAB). Utilizamos un entorno Moodle adaptado por nosotros llamado Caronte para poder gestionar la documentación generada en ABP. Primero se presenta la asignatura, basada en dos itinerarios para cursarla: ABP y TPPE (Teoría, Problemas, Prácticas, Examen). El alumno debe escoger uno de ellos. Ambos itinerarios generan una cantidad importante de documentación (entregas de trabajos y prácticas, correcciones, ejercicios, etc.) a gestionar. En la comunicación presentamos los espacios electrónicos Moodle de ambos itinerarios. Finalmente, mostramos los resultados de encuestas realizadas a los alumnos para finalmente exponer las conclusiones de la experiencia en ABP y el uso de Moodle, así como plantear mejoras y temas de discusión.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication	Vigo (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;ADAS;			Approved	no
	Call Number	IAM @ iam @ MRG2009a			Serial	1602
Permanent link to this record