|
|
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.
|
|
|
|
Josep Llados, Jaime Lopez-Krahe, & Enric Marti. (1996). "Hand drawn document understanding using the straight line Hough transform and graph matching " In Proceedings of the 13th International Pattern Recognition Conference (ICPR’96) (Vol. 2, pp. 497–501). Vienna , Austria.
Abstract: This paper presents a system to understand hand drawn architectural drawings in a CAD environment. The procedure is to identify in a floor plan the building elements, stored in a library of patterns, and their spatial relationships. The vectorized input document and the patterns to recognize are represented by attributed graphs. To recognize the patterns as such, we apply a structural approach based on subgraph isomorphism techniques. In spite of their value, graph matching techniques do not recognize adequately those building elements characterized by hatching patterns, i.e. walls. Here we focus on the recognition of hatching patterns and develop a straight line Hough transform based method in order to detect the regions filled in with parallel straight fines. This allows not only to recognize filling patterns, but it actually reduces the computational load associated with the subgraph isomorphism computation. The result is that the document can be redrawn by editing all the patterns recognized
|
|
|
|
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.
|
|
|
|
Josep Llados, Enric Marti, & Jaime Lopez-Krahe. (1999). "A Hough-based method for hatched pattern detection in maps and diagrams " In Proceeding of the Fifth Int. Conf. Document Analysis and Recognition ICDAR ’99 (pp. 479–482).
Abstract: A hatched area is characterized by a set of parallel straight lines placed at regular intervals. In this paper, a Hough-based schema is introduced to recognize hatched areas in technical documents from attributed graph structures representing the document once it has been vectorized. Defining a Hough-based transform from a graph instead of the raster image allows to drastically reduce the processing time and, second, to obtain more reliable results because straight lines have already been detected in the vectorization step. A second advantage of the proposed method is that no assumptions must be made a priori about the slope and frequency of hatching patterns, but they are computed in run time for each hatched area.
|
|
|
|
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 signi cant improvement.
Keywords: snakes; elastic matching; model-based segmenta tion
|
|
|
|
Ferran Poveda, Debora Gil, & Enric Marti. (2012). "Multi-resolution DT-MRI cardiac tractography " In Statistical Atlases And Computational Models Of The Heart: Imaging and Modelling Challenges (Vol. 7746, pp. 270–277). Springer Berlin Heidelberg.
Abstract: Even using objective measures from DT-MRI no consensus about myocardial architecture has been achieved so far. Streamlining provides good reconstructions at low level of detail, but falls short to give global abstract interpretations. In this paper, we present a multi-resolution methodology that is able to produce simplified representations of cardiac architecture. Our approach produces a reduced set of tracts that are representative of the main geometric features of myocardial anatomical structure. Experiments show that fiber geometry is preserved along reductions, which validates the simplified model for interpretation of cardiac architecture.
|
|
|
|
Antoni Gurgui, Debora Gil, Enric Marti, & Vicente Grau. (2016). "Left-Ventricle Basal Region Constrained Parametric Mapping to Unitary Domain " In 7th International Workshop on Statistical Atlases & Computational Modelling of the Heart (Vol. 10124, pp. 163–171).
Abstract: Due to its complex geometry, the basal ring is often omitted when putting different heart geometries into correspondence. In this paper, we present the first results on a new mapping of the left ventricle basal rings onto a normalized coordinate system using a fold-over free approach to the solution to the Laplacian. To guarantee correspondences between different basal rings, we imposed some internal constrained positions at anatomical landmarks in the normalized coordinate system. To prevent internal fold-overs, constraints are handled by cutting the volume into regions defined by anatomical features and mapping each piece of the volume separately. Initial results presented in this paper indicate that our method is able to handle internal constrains without introducing fold-overs and thus guarantees one-to-one mappings between different basal ring geometries.
Keywords: Laplacian; Constrained maps; Parameterization; Basal ring
|
|
|
|
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.
|
|
|
|
Enric Marti, Jordi Regincos, Jaime Lopez-Krahe, & Juan J.Villanueva. (1991)." A system for interpretation of hand line drawings as three-dimensional scene for CAD input" In Proceedings of the First International Conference on Document Analysis and Recognition (pp. 472–480).
|
|
|
|
Gemma Sanchez, Josep Llados, & Enric Marti. (1997). "A string-based method to recognize symbols and structural textures in architectural plans " In 2nd IAPR Workshop on Graphics Recognition.
Abstract: This paper deals with the recognition of symbols and struc- tural textures in architectural plans using string matching techniques. A plan is represented by an attributed graph whose nodes represent characteristic points and whose edges represent segments. Symbols and textures can be seen as a set of regions, i.e. closed loops in the graph, with a particular arrangement. The search for a symbol involves a graph matching between the regions of a model graph and the regions of the graph representing the document. Discriminating a texture means a clus- tering of neighbouring regions of this graph. Both procedures involve a similarity measure between graph regions. A string codification is used to represent the sequence of outlining edges of a region. Thus, the simila- rity between two regions is defined in terms of the string edit distance between their boundary strings. The use of string matching allows the recognition method to work also under presence of distortion.
|
|
