|
|
Gemma Sanchez, Ernest Valveny, Josep Llados, Enric Marti, Oriol Ramos Terrades, N.Lozano, et al. (2003)." A system for virtual prototyping of architectural projects" In Proceedings of Fifth IAPR International Workshop on Pattern Recognition (pp. 65–74).
|
|
|
|
Joan Serrat, & Enric Marti. (1991)." Elastic matching using interpolation splines" In IV Spanish Symposium of Pattern Recognition and image Analysis.
|
|
|
|
Elena Valderrama, Joan Oliver, Josep Maria-Basart, Enric Marti, Petia Radeva, Ricardo Toledo, et al. (2005)." Convergencia al EEES de la ingeniería informática. Título de Grado en tecnología (Informática)" .
Abstract: Elena Valderrama
|
|
|
|
Ernest Valveny, & Enric Marti. (2001). "Learning of structural descriptions of graphic symbols using deformable template matching " In Proc. Sixth Int Document Analysis and Recognition Conf (pp. 455–459).
Abstract: Accurate symbol recognition in graphic documents needs an accurate representation of the symbols to be recognized. If structural approaches are used for recognition, symbols have to be described in terms of their shape, using structural relationships among extracted features. Unlike statistical pattern recognition, in structural methods, symbols are usually manually defined from expertise knowledge, and not automatically infered from sample images. In this work we explain one approach to learn from examples a representative structural description of a symbol, thus providing better information about shape variability. The description of a symbol is based on a probabilistic model. It consists of a set of lines described by the mean and the variance of line parameters, respectively providing information about the model of the symbol, and its shape variability. The representation of each image in the sample set as a set of lines is achieved using deformable template matching.
|
|
|
|
Ernest Valveny, & Enric Marti. (1999). "Application of deformable template matching to symbol recognition in hand-written architectural draw " In Proceedings of the Fifth International Conference on. Bangalore (India).
Abstract: We propose to use deformable template matching as a new approach to recognize characters and lineal symbols in hand-written line drawings, instead of traditional methods based on vectorization and feature extraction. Bayesian formulation of the deformable template matching allows combining fidelity to the ideal shape of the symbol with maximum flexibility to get the best fit to the input image. Lineal nature of symbols can be exploited to define a suitable representation of models and the set of deformations to be applied to them. Matching, however, is done over the original binary image to avoid losing relevant features during vectorization. We have applied this method to hand-written architectural drawings and experimental results demonstrate that symbols with high distortions from ideal shape can be accurately identified.
|
|
|
|
Ernest Valveny, & Enric Marti. (1999)." Recognition of lineal symbols in hand-written drawings using deformable template matching" In Proceedings of the VIII Symposium Nacional de Reconocimiento de Formas y Análisis de Imágenes.
|
|
|
|
Ernest Valveny, & Enric Marti. (1997)." Dimensions analysis in hand-drawn architectural drawings" In VII National Simposium of Pattern Recognition and image Analysis, SNRFAI´97 (pp. 90–91). CVC-UAB.
|
|
|
|
Ernest Valveny, Ricardo Toledo, Ramon Baldrich, & Enric Marti. (2002)." Combining recognition-based in segmentation-based approaches for graphic symol recognition using deformable template matching" In Proceeding of the Second IASTED International Conference Visualization, Imaging and Image Proceesing VIIP 2002 (502–507).
|
|
|
|
Fernando Vilariño, & Enric Marti. (2008)." New didactic techniques in the EHES applying mobile technologies" .
|
|
|
|
David Roche, Debora Gil, & Jesus Giraldo. (2011). "An inference model for analyzing termination conditions of Evolutionary Algorithms " In 14th Congrès Català en Intel·ligencia Artificial (pp. 216–225).
Abstract: In real-world problems, it is mandatory to design a termination condition for Evolutionary Algorithms (EAs) ensuring stabilization close to the unknown optimum. Distribution-based quantities are good candidates as far as suitable parameters are used. A main limitation for application to real-world problems is that such parameters strongly depend on the topology of the objective function, as well as, the EA paradigm used.
We claim that the termination problem would be fully solved if we had a model measuring to what extent a distribution-based quantity asymptotically behaves like the solution accuracy. We present a regression-prediction model that relates any two given quantities and reports if they can be statistically swapped as termination conditions. Our framework is applied to two issues. First, exploring if the parameters involved in the computation of distribution-based quantities influence their asymptotic behavior. Second, to what extent existing distribution-based quantities can be asymptotically exchanged for the accuracy of the EA solution.
Keywords: Evolutionary Computation Convergence, Termination Conditions, Statistical Inference
|
|
