| |
Records |
Links |
|
Author |
Petia Radeva; Enric Marti |
|
| |
Title |
An improved model of snakes for model-based segmentation |
Type |
Conference Article |
| |
Year |
1995 |
Publication |
Proceedings of Computer Analysis of Images and Patterns |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
515-520 |
|
| |
Keywords |
|
|
| |
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. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
CAIP |
|
| |
Notes |
MILAB;IAM |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ RaM1995b |
Serial |
1632 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Gemma Sanchez; Josep Llados; Enric Marti |
|
| |
Title |
Segmentation and analysis of linial texture in plans |
Type |
Conference Article |
| |
Year |
1997 |
Publication |
Intelligence Artificielle et Complexité. |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
Structural Texture, Voronoi, Hierarchical Clustering, String Matching. |
|
| |
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. |
|
| |
Address |
Paris, France |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
Paris |
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
AERFAI |
|
| |
Notes |
DAG;IAM; |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ SLM1997 |
Serial |
1649 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Josep Llados; Ernest Valveny; Gemma Sanchez; Enric Marti |
|
| |
Title |
Symbol recognition: current advances and perspectives |
Type |
Book Chapter |
| |
Year |
2002 |
Publication |
Graphics Recognition Algorithms And Applications |
Abbreviated Journal |
LNCS |
|
| |
Volume |
2390 |
Issue |
|
Pages |
104-128 |
|
| |
Keywords |
|
|
| |
Abstract |
The recognition of symbols in graphic documents is an intensive research activity in the community of pattern recognition and document analysis. A key issue in the interpretation of maps, engineering drawings, diagrams, etc. is the recognition of domain dependent symbols according to a symbol database. In this work we first review the most outstanding symbol recognition methods from two different points of view: application domains and pattern recognition methods. In the second part of the paper, open and unaddressed problems involved in symbol recognition are described, analyzing their current state of art and discussing future research challenges. Thus, issues such as symbol representation, matching, segmentation, learning, scalability of recognition methods and performance evaluation are addressed in this work. Finally, we discuss the perspectives of symbol recognition concerning to new paradigms such as user interfaces in handheld computers or document database and WWW indexing by graphical content. |
|
| |
Address |
London, UK |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Springer-Verlag |
Place of Publication |
|
Editor |
Dorothea Blostein and Young- Bin Kwon |
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
Lecture Notes in Computer Science |
Abbreviated Series Title |
LNCS |
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
3-540-44066-6 |
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
GREC |
|
| |
Notes |
DAG; IAM; |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ LVS2002 |
Serial |
1572 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Josep Llados; Enric Marti; Juan J.Villanueva |
|
| |
Title |
Symbol recognition by error-tolerant subgraph matching between region adjacency graphs |
Type |
Journal Article |
| |
Year |
2001 |
Publication |
IEEE Transactions on Pattern Analysis and Machine Intelligence |
Abbreviated Journal |
|
|
| |
Volume |
23 |
Issue |
10 |
Pages |
1137-1143 |
|
| |
Keywords |
|
|
| |
Abstract |
The recognition of symbols in graphic documents is an intensive research activity in the community of pattern recognition and document analysis. A key issue in the interpretation of maps, engineering drawings, diagrams, etc. is the recognition of domain dependent symbols according to a symbol database. In this work we first review the most outstanding symbol recognition methods from two different points of view: application domains and pattern recognition methods. In the second part of the paper, open and unaddressed problems involved in symbol recognition are described, analyzing their current state of art and discussing future research challenges. Thus, issues such as symbol representation, matching, segmentation, learning, scalability of recognition methods and performance evaluation are addressed in this work. Finally, we discuss the perspectives of symbol recognition concerning to new paradigms such as user interfaces in handheld computers or document database and WWW indexing by graphical content. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
DAG;IAM;ISE; |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ LMV2001 |
Serial |
1581 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Gemma Sanchez; Josep Llados; Enric Marti |
|
| |
Title |
A string-based method to recognize symbols and structural textures in architectural plans |
Type |
Conference Article |
| |
Year |
1997 |
Publication |
2nd IAPR Workshop on Graphics Recognition |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
|
|
| |
Keywords |
|
|
| |
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. |
|
| |
Address |
Nancy, France |
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
DAG; IAM |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ SLE1997 |
Serial |
1498 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Josep Llados; Gemma Sanchez; Enric Marti |
|
| |
Title |
A string based method to recognize symbols and structural textures in architectural plans |
Type |
Book Chapter |
| |
Year |
1998 |
Publication |
Graphics Recognition Algorithms and Systems Second International Workshop, GREC' 97 Nancy, France, August 22–23, 1997 Selected Papers |
Abbreviated Journal |
LNCS |
|
| |
Volume |
1389 |
Issue |
1998 |
Pages |
91-103 |
|
| |
Keywords |
|
|
| |
Abstract |
This paper deals with the recognition of symbols and structural 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 clustering 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 similarity 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. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Springer Link |
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
LNCS |
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
DAG; IAM |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ SLE1998 |
Serial |
1573 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Ole Larsen; Petia Radeva; Enric Marti |
|
| |
Title |
Bounds on the optimal elasticity parameters for a snake |
Type |
Journal Article |
| |
Year |
1995 |
Publication |
Image Analysis and Processing |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
37-42 |
|
| |
Keywords |
|
|
| |
Abstract |
This paper develops a formalism by which an estimate for the upper and lower bounds for the elasticity parameters for a snake can be obtained. Objects different in size and shape give rise to different bounds. The bounds can be obtained based on an analysis of the shape of the object of interest. Experiments on synthetic images show a good correlation between the estimated behaviour of the snake and the one actually observed. Experiments on real X-ray images show that the parameters for optimal segmentation lie within the estimated bounds. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
MILAB;IAM |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ LRM1995a |
Serial |
1559 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Josep Llados; Jaime Lopez-Krahe; Enric Marti |
|
| |
Title |
Hand drawn document understanding using the straight line Hough transform and graph matching |
Type |
Conference Article |
| |
Year |
1996 |
Publication |
Proceedings of the 13th International Pattern Recognition Conference (ICPR’96) |
Abbreviated Journal |
|
|
| |
Volume |
2 |
Issue |
|
Pages |
497-501 |
|
| |
Keywords |
|
|
| |
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 |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
Vienna , Austria |
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
DAG;IAM; |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ LLM1996 |
Serial |
1579 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Ole Vilhelm-Larsen; Petia Radeva; Enric Marti |
|
| |
Title |
Guidelines for choosing optimal parameters of elasticity for snakes |
Type |
Book Chapter |
| |
Year |
1995 |
Publication |
Computer Analysis Of Images And Patterns |
Abbreviated Journal |
LNCS |
|
| |
Volume |
970 |
Issue |
|
Pages |
106-113 |
|
| |
Keywords |
|
|
| |
Abstract |
This paper proposes a guidance in the process of choosing and using the parameters of elasticity of a snake in order to obtain a precise segmentation. A new two step procedure is defined based on upper and lower bounds on the parameters. Formulas, by which these bounds can be calculated for real images where parts of the contour may be missing, are presented. Experiments on segmentation of bone structures in X-ray images have verified the usefulness of the new procedure. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
Lecture Notes in Computer Science |
Abbreviated Series Title |
LNCS |
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
MILAB;IAM |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ LRM1995b |
Serial |
1558 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Aura Hernandez-Sabate; Debora Gil;Eduard Fernandez-Nofrerias;Petia Radeva; Enric Marti |
|
| |
Title |
Approaching Artery Rigid Dynamics in IVUS |
Type |
Journal Article |
| |
Year |
2009 |
Publication |
IEEE Transactions on Medical Imaging |
Abbreviated Journal |
TMI |
|
| |
Volume |
28 |
Issue |
11 |
Pages |
1670-1680 |
|
| |
Keywords |
Fourier analysis; intravascular ultrasound (IVUS) dynamics; longitudinal motion; quality measures; tissue deformation. |
|
| |
Abstract |
Tissue biomechanical properties (like strain and stress) are playing an increasing role in diagnosis and long-term treatment of intravascular coronary diseases. Their assessment strongly relies on estimation of vessel wall deformation. Since intravascular ultrasound (IVUS) sequences allow visualizing vessel morphology and reflect its dynamics, this technique represents a useful tool for evaluation of tissue mechanical properties. Image misalignment introduced by vessel-catheter motion is a major artifact for a proper tracking of tissue deformation. In this work, we focus on compensating and assessing IVUS rigid in-plane motion due to heart beating. Motion parameters are computed by considering both the vessel geometry and its appearance in the image. Continuum mechanics laws serve to introduce a novel score measuring motion reduction in in vivo sequences. Synthetic experiments validate the proposed score as measure of motion parameters accuracy; whereas results in in vivo pullbacks show the reliability of the presented methodologies in clinical cases. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
0278-0062 |
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
IAM; MILAB |
Approved |
no |
|
| |
Call Number |
IAM @ iam @ HGF2009 |
Serial |
1545 |
|
| Permanent link to this record |
