|
Gemma Sanchez, Josep Llados, & Enric Marti. (1997). Segmentation and analysis of linial texture in plans In Intelligence Artificielle et Complexité.. Paris.
Abstract: The problem of texture segmentation and interpretation is one of the main concerns in the field of document analysis. Graphical documents often contain areas characterized by a structural texture whose recognition allows both the document understanding, and its storage in a more compact way. In this work, we focus on structural linial textures of regular repetition contained in plan documents. Starting from an atributed graph which represents the vectorized input image, we develop a method to segment textured areas and recognize their placement rules. We wish to emphasize that the searched textures do not follow a predefined pattern. Minimal closed loops of the input graph are computed, and then hierarchically clustered. In this hierarchical clustering, a distance function between two closed loops is defined in terms of their areas difference and boundary resemblance computed by a string matching procedure. Finally it is noted that, when the texture consists of isolated primitive elements, the same method can be used after computing a Voronoi Tesselation of the input graph.
Keywords: Structural Texture, Voronoi, Hierarchical Clustering, String Matching.
|
|
|
Oriol Pujol, Debora Gil, & Petia Radeva. (2005). "Fundamentals of Stop and Go active models " . Image and Vision Computing, 23(8), 681–691.
Abstract: An efficient snake formulation should conform to the idea of picking the smoothest curve among all the shapes approximating an object of interest. In current geodesic snakes, the regularizing curvature also affects the convergence stage, hindering the latter at concave regions. In the present work, we make use of characteristic functions to define a novel geodesic formulation that decouples regularity and convergence. This term decoupling endows the snake with higher adaptability to non-convex shapes. Convergence is ensured by splitting the definition of the external force into an attractive vector field and a repulsive one. In our paper, we propose to use likelihood maps as approximation of characteristic functions of object appearance. The better efficiency and accuracy of our decoupled scheme are illustrated in the particular case of feature space-based segmentation.
Keywords: Deformable models; Geodesic snakes; Region-based segmentation
|
|
|
Debora Gil, & Petia Radeva. (2006). "Inhibition of false landmarks " . Pattern Recognition Letters, 27(9), 1022–1030.
Abstract: Corners and junctions are landmarks characterized by the lack of differentiability in the unit tangent to the image level curve. Detectors based on differential operators are not, by their own definition, the best posed as they require a higher degree of differentiability to yield a reliable response. We argue that a corner detector should be based on the degree of continuity of the tangent vector to the image level sets, work on the image domain and need no assumptions on neither the image local structure nor the particular geometry of the corner/junction. An operator measuring the degree of differentiability of the projection matrix on the image gradient fulfills the above requirements. Because using smoothing kernels leads to corner misplacement, we suggest an alternative fake response remover based on the receptive field inhibition of spurious details. The combination of both orientation discontinuity detection and noise inhibition produce our inhibition orientation energy (IOE) landmark locator.
|
|
|
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.
|
|
|
Enric Marti. (2008)." Project Based Learning in engineering" . Lleida.
|
|
|
Enric Marti, G.Estape, & S.Fernandez. (2008)." Bluestar: Diseño e implementación de una aplicación para la visualización interactiva en 3D de funciones reales como herramienta de aprendizaje" . Lleida.
|
|
|
Enric Marti, Debora Gil, Marc Vivet, & Carme Julia. (2009)." Uso de recursos virtuales en Aprendizaje Basado en Proyectos. Una experiencia en la asignatura de Gráficos por Computador" . Octava Jornada sobre Aprendizaje Cooperativo. Lleida.
|
|
|
Enric Marti, Debora Gil, Marc Vivet, & Carme Julia. (2008)." Uso de recursos virtuales en Aprendizaje Basado en Proyectos. Una experiencia en la asignatura de Gráficos por Computador" . Lleida.
|
|
|
Enric Marti, Jaume Rocarias, Petia Radeva, Ricardo Toledo, & Jordi Vitria. (2008)." Caronte: diseño, implementación y mejora de actividades de evaluación y primeras experiencias en asignaturas" . Lleida.
|
|
|
Debora Gil, & Petia Radeva. (2003). "Curvature Vector Flow to Assure Convergent Deformable Models for Shape Modelling " In B. Springer (Ed.), Energy Minimization Methods In Computer Vision And Pattern Recognition (Vol. 2683, pp. 357–372). Lecture Notes in Computer Science. Lisbon, PORTUGAL: Springer, Berlin.
Abstract: Poor convergence to concave shapes is a main limitation of snakes as a standard segmentation and shape modelling technique. The gradient of the external energy of the snake represents a force that pushes the snake into concave regions, as its internal energy increases when new inexion points are created. In spite of the improvement of the external energy by the gradient vector ow technique, highly non convex shapes can not be obtained, yet. In the present paper, we develop a new external energy based on the geometry of the curve to be modelled. By tracking back the deformation of a curve that evolves by minimum curvature ow, we construct a distance map that encapsulates the natural way of adapting to non convex shapes. The gradient of this map, which we call curvature vector ow (CVF), is capable of attracting a snake towards any contour, whatever its geometry. Our experiments show that, any initial snake condition converges to the curve to be modelled in optimal time.
Keywords: Initial condition; Convex shape; Non convex analysis; Increase; Segmentation; Gradient; Standard; Standards; Concave shape; Flow models; Tracking; Edge detection; Curvature
|
|