|
Ernest Valveny, & Enric Marti. (2000). "Deformable Template Matching within a Bayesian Framework for Hand-Written Graphic Symbol Recognition " . Graphics Recognition Recent Advances, 1941, 193–208.
Abstract: We describe a method for hand-drawn symbol recognition based on deformable template matching able to handle uncertainty and imprecision inherent to hand-drawing. Symbols are represented as a set of straight lines and their deformations as geometric transformations of these lines. Matching, however, is done over the original binary image to avoid loss of information during line detection. It is defined as an energy minimization problem, using a Bayesian framework which allows to combine fidelity to ideal shape of the symbol and flexibility to modify the symbol in order to get the best fit to the binary input image. Prior to matching, we find the best global transformation of the symbol to start the recognition process, based on the distance between symbol lines and image lines. We have applied this method to the recognition of dimensions and symbols in architectural floor plans and we show its flexibility to recognize distorted symbols.
|
|
|
Ernest Valveny, & Enric Marti. (2000). "Hand-drawn symbol recognition in graphic documents using deformable template matching and a Bayesian framework " In Proc. 15th Int Pattern Recognition Conf (Vol. 2, pp. 239–242).
Abstract: Hand-drawn symbols can take many different and distorted shapes from their ideal representation. Then, very flexible methods are needed to be able to handle unconstrained drawings. We propose here to extend our previous work in hand-drawn symbol recognition based on a Bayesian framework and deformable template matching. This approach gets flexibility enough to fit distorted shapes in the drawing while keeping fidelity to the ideal shape of the symbol. In this work, we define the similarity measure between an image and a symbol based on the distance from every pixel in the image to the lines in the symbol. Matching is carried out using an implementation of the EM algorithm. Thus, we can improve recognition rates and computation time with respect to our previous formulation based on a simulated annealing algorithm.
|
|
|
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, Debora Gil, & Petia Radeva. (2004). "A Novel FLDA Formulation for Numerical Stability Analysis " In P. R. and I. A. J. Vitrià (Ed.), Recent Advances in Artificial Intelligence Research and Development (Vol. 113, pp. 77–84). IOS Press.
Abstract: Fisher Linear Discriminant Analysis (FLDA) is one of the most popular techniques used in classification applying dimensional reduction. The numerical scheme involves the inversion of the within-class scatter matrix, which makes FLDA potentially ill-conditioned when it becomes singular. In this paper we present a novel explicit formulation of FLDA in terms of the eccentricity ratio and eigenvector orientations of the within-class scatter matrix. An analysis of this function will characterize those situations where FLDA response is not reliable because of numerical instability. This can solve common situations of poor classification performance in computer vision.
Keywords: Supervised Learning; Linear Discriminant Analysis; Numerical Stability; Computer Vision
|
|
|
Fernando Vilariño, & Enric Marti. (2008)." New didactic techniques in the EHES applying mobile technologies" .
|
|
|
Aura Hernandez-Sabate, Debora Gil, David Roche, Monica M. S. Matsumoto, & Sergio S. Furuie. (2011). "Inferring the Performance of Medical Imaging Algorithms " In Pedro Real, Daniel Diaz-Pernil, Helena Molina-Abril, Ainhoa Berciano, & Walter Kropatsch (Eds.), 14th International Conference on Computer Analysis of Images and Patterns (Vol. 6854, pp. 520–528). L. Berlin: Springer-Verlag Berlin Heidelberg.
Abstract: Evaluation of the performance and limitations of medical imaging algorithms is essential to estimate their impact in social, economic or clinical aspects. However, validation of medical imaging techniques is a challenging task due to the variety of imaging and clinical problems involved, as well as, the difficulties for systematically extracting a reliable solely ground truth. Although specific validation protocols are reported in any medical imaging paper, there are still two major concerns: definition of standardized methodologies transversal to all problems and generalization of conclusions to the whole clinical data set.
We claim that both issues would be fully solved if we had a statistical model relating ground truth and the output of computational imaging techniques. Such a statistical model could conclude to what extent the algorithm behaves like the ground truth from the analysis of a sampling of the validation data set. We present a statistical inference framework reporting the agreement and describing the relationship of two quantities. We show its transversality by applying it to validation of two different tasks: contour segmentation and landmark correspondence.
Keywords: Validation, Statistical Inference, Medical Imaging Algorithms.
|
|
|
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
|
|