|
Petia Radeva, Joan Serrat, & Enric Marti. (1995). "A snake for model-based segmentation " In Proc. Conf. Fifth Int Computer Vision (pp. 816–821).
Abstract: Despite the promising results of numerous applications, the hitherto proposed snake techniques share some common problems: snake attraction by spurious edge points, snake degeneration (shrinking and attening), convergence and stability of the deformation process, snake initialization and local determination of the parameters of elasticity. We argue here that these problems can be solved only when all the snake aspects are considered. The snakes proposed here implement a new potential eld and external force in order to provide a deformation convergence, attraction by both near and far edges as well as snake behaviour selective according to the edge orientation. Furthermore, we conclude that in the case of model-based seg mentation, the internal force should include structural information about the expected snake shape. Experiments using this kind of snakes for segmenting bones in complex hand radiographs show a signicant improvement.
Keywords: snakes; elastic matching; model-based segmenta tion
|
|
|
Oriol Rodriguez-Leon, Josefina Mauri, Eduard Fernandez-Nofrerias, M.Gomez, Antonio Tovar, L.Cano, et al. (2002)." Ecografia Intracoronària: Segmentació Automàtica de area de la llum" In XXXVIII Congreso Nacional de la Sociedad Española de Cardiología..
|
|
|
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.
|
|
|
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). "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)." 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, 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).
|
|
|
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
|
|