|
|
Petia Radeva, & Enric Marti. (1995). "An improved model of snakes for model-based segmentation " In Proceedings of Computer Analysis of Images and Patterns (pp. 515–520).
Abstract: The main advantage of segmentation by snakes consists in its ability to incorporate smoothness constraints on the detected shapes that can occur. Likewise, we propose to model snakes with other properties that reflect the information provided about the object of interest in a different extent. We consider different kinds of snakes, those searching for contours with a certain direction, those preserving an object’s model, those seeking for symmetry, those expanding open, etc. The availability of such a collection of snakes allows not only the more complete use of the knowledge about the segmented object, but also to solve some problems of the existing snakes. Our experiments on segmentation of facial features justify the usefulness of snakes with different properties.
|
|
|
|
Petia Radeva, & Enric Marti. (1995). Facial Features Segmentation by Model-Based Snakes In International Conference on Computing Analysis and Image Processing. Bellaterra (Barcelona), Spain.
Abstract: Deformable models have recently been accepted as a standard technique to segment different features in facial images. Despite they give a good approximation of the salient features in a facial image, the resulting shapes of the segmentation process seem somewhat artificial with respect to the natural feature shapes. In this paper we show that active contour models (in particular, rubber snakes) give more close and natural representation of the detected feature shape. Besides, using snakes for facial segmentation frees us from the problem of determination of the numerous weigths of deformable models. Another advantage of rubber snakes is their reduced computational cost. Our experiments using rubber snakes for segmentation of facial snapshots have shown a significant improvement compared to deformable models.
|
|
|
|
F. Javier Sanchez, Jordi Vitria, & Enric Marti. (1991)." Transformaciones Morfológicas de Polígonos Isotéticos" In Primer Congreso Español de Informática Gráfica..
|
|
|
|
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. (2003). "A model for image generation and symbol recognition through the deformation of lineal shapes " . Pattern Recognition Letters, 24(15), 2857–2867.
Abstract: We describe a general framework for the recognition of distorted images of lineal shapes, which relies on three items: a model to represent lineal shapes and their deformations, a model for the generation of distorted binary images and the combination of both models in a common probabilistic framework, where the generation of deformations is related to an internal energy, and the generation of binary images to an external energy. Then, recognition consists in the minimization of a global energy function, performed by using the EM algorithm. This general framework has been applied to the recognition of hand-drawn lineal symbols in graphic documents.
|
|
|
|
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. (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.
|
|
