|
|
J. Weickert, Bart M. Ter Haar Romeny, Antonio Lopez, & W. Van Enk. (1997). Orientation Analysis by Coherence-Enhancing Diffusion..
|
|
|
|
J.R. Serra, & J.B. Subirana. (1997). Adaptive non-cartesian networks for vision..
|
|
|
|
Antonio Lopez. (1997). Ridge/Valley-like structures: Creases, separatrices and drainage patterns.
|
|
|
|
David Lloret, Antonio Lopez, & Joan Serrat. (1997). Rigid Registration of CT and MR volumes based on Rothes creases.
|
|
|
|
Maria Vanrell. (1997). Exploring the space of behaviour of a texture perception algorithm.
|
|
|
|
Antonio Lopez, & Joan Serrat. (1997). Ridge/Valley-like structures: Creases, separatrices and drainage patterns.
|
|
|
|
Antonio Lopez, Felipe Lumbreras, & Joan Serrat. (1997). Efficient computation of local creaseness. CVC, Bellaterra (Spain).
|
|
|
|
A. Martinez, J.R. Serra, Jordi Vitria, & J.B. Subirana. (1997). An Iconic Representation for Image Retrieval.
|
|
|
|
A. Martinez, & Jordi Vitria. (1997). A first step towards a low-dimensional face representation space.
|
|
|
|
Maria Vanrell, & Jordi Vitria. (1997). Optimal 3x3 decomposable disks for morphological transformations. Image and Vision Computing, 15(2): 845–854.
|
|
|
|
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.
|
|
|
|
Josep Llados, Horst Bunke, & Enric Marti. (1997). Finding rotational symmetries by cyclic string matching. PRL - Pattern recognition letters, 18(14), 1435–1442.
Abstract: Symmetry is an important shape feature. In this paper, a simple and fast method to detect perfect and distorted rotational symmetries of 2D objects is described. The boundary of a shape is polygonally approximated and represented as a string. Rotational symmetries are found by cyclic string matching between two identical copies of the shape string. The set of minimum cost edit sequences that transform the shape string to a cyclically shifted version of itself define the rotational symmetry and its order. Finally, a modification of the algorithm is proposed to detect reflectional symmetries. Some experimental results are presented to show the reliability of the proposed algorithm
Keywords: Rotational symmetry; Reflectional symmetry; String matching
|
|
|
|
Josep Llados, Horst Bunke, & Enric Marti. (1997). Using Cyclic String Matching to Find Rotational and Reflectional Symmetries in Shapes. In Intelligent Robots: Sensing, Modeling and Planning (pp. 164–179). World Scientific Press.
Abstract: Dagstuhl Workshop
|
|
|
|
Josep Llados, Jaime Lopez-Krahe, & Enric Marti. (1997). A system to understand hand-drawn floor plans using subgraph isomorphism and Hough transform. In Machine Vision and Applications (Vol. 10, pp. 150–158).
Abstract: Presently, man-machine interface development is a widespread research activity. A system to understand hand drawn architectural drawings in a CAD environment is presented in this paper. To understand a document, we have to identify its building elements and their structural properties. An attributed graph structure is chosen as a symbolic representation of the input document and the patterns to recognize in it. An inexact subgraph isomorphism procedure using relaxation labeling techniques is performed. In this paper we focus on how to speed up the matching. There is a building element, the walls, characterized by a hatching pattern. Using a straight line Hough transform (SLHT)-based method, we recognize this pattern, characterized by parallel straight lines, and remove from the input graph the edges belonging to this pattern. The isomorphism is then applied to the remainder of the input graph. When all the building elements have been recognized, the document is redrawn, correcting the inaccurate strokes obtained from a hand-drawn input.
Keywords: Line drawings – Hough transform – Graph matching – CAD systems – Graphics recognition
|
|
|
|
Josep Llados, & Enric Marti. (1997). Playing with error-tolerant subgraph isomorphism in line drawings. In VII National Symposium on Pattern Recognition and image Analysis.
|
|
