Centre de documentation
scientifique

Advances in Pattern Recognition, Joint IAPR International Workshops SSPR 2000 and SPR 2000, Alicante, Spain, August/September 2000 / Francesc J. Ferri (2000)  

Public Titre : Advances in Pattern Recognition, Joint IAPR International Workshops SSPR 2000 and SPR 2000, Alicante, Spain, August/September 2000 : Proceedings Type de document : Actes de congrès Auteurs : Francesc J. Ferri, Éditeur scientifique ; José M. Inesta, Éditeur scientifique ; Adnan Amin, Éditeur scientifique ; Pavel Pudil, Éditeur scientifique Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 2000 Collection : Lecture notes in Computer Science, ISSN 0302-9743 num. 1876 Conférence : SSPR - SPR 2000, Joint IAPR International Workshops SSPR and SPR 30/08/2000 01/09/2000 Alicante Espagne Proceedings Springer Importance : 901 p. Format : 15 x 24 cm ISBN/ISSN/EAN : 978-3-540-67946-2 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image [Termes IGN] analyse d'image numérique [Termes IGN] extraction de traits caractéristiques [Termes IGN] reconnaissance d'objets [Termes IGN] reconnaissance de formes [Termes IGN] traitement d'image Résumé : (éditeur) This book constitutes the joint refereed proceedings of the 8th International Workshop on Structural and Syntactic Pattern Recognition and the 3rd International Workshop on Statistical Techniques in Pattern Recognition, SSPR 2000 and SPR 2000, held in Alicante, Spain in August/September 2000. The 52 revised full papers presented together with five invited papers and 35 posters were carefully reviewed and selected from a total of 130 submissions. The book offers topical sections on hybrid and combined methods, document image analysis, grammar and language methods, structural matching, graph-based methods, shape analysis, clustering and density estimation, object recognition, general methodology, and feature extraction and selection. Numéro de notice : 19832 Affiliation des auteurs : non IGN Thématique : IMAGERIE/INFORMATIQUE Nature : Actes DOI : 10.1007/3-540-44522-6 En ligne : http://dx.doi.org/10.1007/3-540-44522-6 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85926

Contient

• A graph labelling approach for connected feature selection / Jocelyn Marchadier (2000)  
• Efficient subgraph isomorphism with "a priori" knowledge : Application to 3D reconstruction of buildings for cartography / Frank Fuchs (2000)  

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
19832-01	CG2000	Livre	Centre de documentation	Congrès	Disponible

Efficient subgraph isomorphism with "a priori" knowledge : Application to 3D reconstruction of buildings for cartography / Frank Fuchs (2000)  

Public contenu dans Advances in Pattern Recognition, Joint IAPR International Workshops SSPR 2000 and SPR 2000, Alicante, Spain, August/September 2000 / Francesc J. Ferri (2000)   Titre : Efficient subgraph isomorphism with "a priori" knowledge : Application to 3D reconstruction of buildings for cartography Type de document : Article/Communication Auteurs : Frank Fuchs , Auteur ; Hervé Le Men , Auteur Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 2000 Collection : Lecture notes in Computer Science, ISSN 0302-9743 num. 1876 Conférence : SSPR - SPR 2000, Joint IAPR International Workshops SSPR and SPR 30/08/2000 01/09/2000 Alicante Espagne Proceedings Springer Importance : pp 427 - 436 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image [Termes IGN] appariement de graphes [Termes IGN] graphe [Termes IGN] reconstruction 3D du bâti Résumé : (auteur) In this paper, a procedure which computes error-correcting subgraph isomorphisms is proposed in order to be able to take into account some external information. When matching a model graph and a data graph, if the correspondance between vertices of the model graph and some vertices of the data graph are known ’a priori’, the procedure is able to integrate this knowledge in an efficient way. The efficiency of the method is obtained in the first step of the procedure, namely, by the recursive decomposition of the model graph into subgraphs. During this step, these external information are propagated as far as possible thanks to a new procedure which makes the graphs able to share them. Since the data structure is now able to fully integrate the external information, the matching step itself becomes more efficient. The theoretical aspects of this methodology are presented, as well as practical experiments on real images. The procedure is tested in the field of 3-D building reconstruction for cartographic issues, where it allows to match model graphs partially, and then perform full matches. Numéro de notice : C2000-018 Affiliation des auteurs : MATIS (1993-2011) Thématique : IMAGERIE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl DOI : 10.1007/3-540-44522-6_44 Date de publication en ligne : 21/12/2000 En ligne : http://dx.doi.org/10.1007/3-540-44522-6_44 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85928

A graph labelling approach for connected feature selection / Jocelyn Marchadier (2000)  

Public contenu dans Advances in Pattern Recognition, Joint IAPR International Workshops SSPR 2000 and SPR 2000, Alicante, Spain, August/September 2000 / Francesc J. Ferri (2000)   Titre : A graph labelling approach for connected feature selection Type de document : Article/Communication Auteurs : Jocelyn Marchadier, Auteur ; Sylvain Michelin, Auteur ; Yves Egels , Auteur Editeur : Paris : Institut Géographique National - IGN (1940-2007) Année de publication : 2000 Conférence : SSPR - SPR 2000, Joint IAPR International Workshops SSPR and SPR 30/08/2000 01/09/2000 Alicante Espagne Proceedings Springer Importance : pp 287 - 926 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image [Termes IGN] extraction de traits caractéristiques [Termes IGN] graphe [Termes IGN] objet géographique linéaire [Termes IGN] optimisation (mathématiques) Résumé : (auteur) Many authors have already proposed linear feature extraction algorithms. In most cases, these algorithms cannot guarantee the extraction of adjacency relations between extracted features. Object contours appearing in the analyzed images are often fragmented into non-connected features. Nevertheless, the use of some topological information enables to reduce substantially the complexity of matching and registration algorithms. Here, we formulate the problem of linear feature extraction as an optimal labelling problem of a topological map obtained from low level operations. The originality of our approach is the maintaining of this data structure during the extraction process and the formulation of the problem of feature extraction as a global optimization problem. Numéro de notice : C2000-017 Affiliation des auteurs : MATIS+Ext (1993-2011) Thématique : IMAGERIE/INFORMATIQUE/MATHEMATIQUE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl DOI : 10.1007/3-540-44522-6_30 Date de publication en ligne : 21/12/2000 En ligne : http://dx.doi.org/10.1007/3-540-44522-6_30 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85927