|
|
Enric Marti, Ferran Poveda, Antoni Gurgui, Jaume Rocarias, Debora Gil, & Aura Hernandez-Sabate. (2013). Una experiencia de estructura, funcionamiento y evaluación de la asignatura de graficos por computador con metodologia de aprendizaje basado en proyectos.
Abstract: IV Congreso Internacional UNIVEST
|
|
|
|
Muhammad Muzzamil Luqman, Jean-Yves Ramel, & Josep Llados. (2012). Improving Fuzzy Multilevel Graph Embedding through Feature Selection Technique. In Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop (Vol. 7626, pp. 243–253). LNCS. Springer Berlin Heidelberg.
Abstract: Graphs are the most powerful, expressive and convenient data structures but there is a lack of efficient computational tools and algorithms for processing them. The embedding of graphs into numeric vector spaces permits them to access the state-of-the-art computational efficient statistical models and tools. In this paper we take forward our work on explicit graph embedding and present an improvement to our earlier proposed method, named “fuzzy multilevel graph embedding – FMGE”, through feature selection technique. FMGE achieves the embedding of attributed graphs into low dimensional vector spaces by performing a multilevel analysis of graphs and extracting a set of global, structural and elementary level features. Feature selection permits FMGE to select the subset of most discriminating features and to discard the confusing ones for underlying graph dataset. Experimental results for graph classification experimentation on IAM letter, GREC and fingerprint graph databases, show improvement in the performance of FMGE.
|
|
|
|
Muhammad Muzzamil Luqman, Thierry Brouard, Jean-Yves Ramel, & Josep Llados. (2012). Recherche de sous-graphes par encapsulation floue des cliques d'ordre 2: Application à la localisation de contenu dans les images de documents graphiques. In Colloque International Francophone sur l'Écrit et le Document (pp. 149–162).
|
|
|
|
Jose Antonio Rodriguez, Gemma Sanchez, & Josep Llados. (2008). Categorization of Digital Ink Elements using Spectral Features. In J.M. Ogier J. L. W. Liu (Ed.), Graphics Recognition: Recent Advances and New Opportunities (Vol. 5046, 188–198). LNCS. Springer–Verlag.
|
|
|
|
David Aldavert, & Ricardo Toledo. (2008). Stereo Vision Local Map Alignment for Robot Environment Mapping. In Robot Vision Second International Workshop, RobVis (Vol. 4931, 111–124). LNCS.
|
|
|
|
Enric Marti, Jaume Rocarias, Debora Gil, Marc Vivet, & Carme Julia. (2008). Uso de recursos virtuales en Aprendizaje Basado en Proyectos. Una experiencia en la asignatura de Graficos por Computador.
Abstract: En esta comunicación presentamos una experiencia en Aprendizaje Basado en Proyectos (Project
Based Learning – PBL) realizada los últimos cuatro años (cursos del 2004-05 al 2007-08) en Gráficos
por Computador 2, asignatura optativa de tercer curso de Ingeniería Informática, titulación impartida
en la Escuela Técnica Superior de Ingeniería (ETSE) de la Universidad Autónoma de Barcelona
(UAB).
Fruto de la constante voluntad de mejora de la organización ABP de nuestra asignatura nos decidimos
a utilizar una herramienta LMS (Learning Management System) basada en Moodle y adaptada por
nosotros llamada Caronte para poder gestionar la documentación generada en ABP, y añadir una
componente semipresencial a la asignatura.
En primer lugar se presenta la organización de nuestra asignatura, basada proponer al alumno dos
itinerarios para cursarla: el itinerario ABP y el itinerario basado en clases magistrales i examen que
llamaremos TPPE (Teoría, Problemas, Prácticas, Examen). La dinámica ABP nos genera una cantidad
importante de documentación entre los grupos y el profesor, aparte de el feedback que el profesor
genera a los alumnos.
En la segunda parte del artículo presentamos los espacios docentes electrónicos de ambos itinerarios,
con los que trabajan los alumnos.
Finalmente, mostramos los resultados obtenidos de alumnos matriculados y de encuestas de valoración
realizados por los alumnos para finalmente exponer las conclusiones de estos cuatro años de
experiencia en ABP y en el uso de recursos virtuales en ABP, así como plantear mejoras y temas de
discusión sobre ABP.
|
|
|
|
Dani Rowe. (2008). Towards Robust Multiple-Target Tracking in Unconstrained Human-Populated Environments.
|
|
|
|
Carme Julia. (2008). Missig Data Matrix Factorization Addressing the Structure from Motion Problem.
|
|
|
|
Miquel Ferrer. (2008). Theory and Algorithms on the Median Graph. Application to Graph-based Classification and Clustering (Francesc Serratosa Casanelles, & Ernest Valveny, Eds.). Ph.D. thesis, , .
|
|
|
|
Sergio Escalera. (2008). Coding and Decoding Design of ECOCs for Multi-Class Pattern and Object Recognition.
|
|
|
|
Fadi Dornaika, & Bogdan Raducanu. (2008). 3D Face Pose Detection and Tracking Using Monocular Videos: Tool and Application. IEEE Transactions on Systems, Man and Cybernetics (Part B) (IEEE).
|
|
|
|
Robert Benavente, Laura Igual, & Fernando Vilariño. (2008). Current Challenges in Computer Vision.
|
|
|
|
Francisco Javier Orozco, & Jordi Gonzalez. (2008). Confidence Assessment on Eyelid and Eyebrow Expression Recognition. In 2008 8th IEEE International Conference on Automatic Face and Gesture Recognition (FG 2008).
|
|
|
|
Bhaskar Chakraborty, Ognjen Rudovic, & Jordi Gonzalez. (2008). View-Invariant Human-Body Detection with Extension to Human Action Recognition using Component-Wise HMM of Body Parts. In 8th IEEE International Conference on Automatic Face and Gesture Recognition.
|
|
|
|
Miquel Ferrer, Ernest Valveny, & F. Serratosa. (2009). Median graph: A new exact algorithm using a distance based on the maximum common subgraph. PRL - Pattern Recognition Letters, 30(5), 579–588.
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.
|
|
