000 05091nam a22005895i 4500
001 978-3-540-45028-3
003 DE-He213
005 20160624101956.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 _a9783540450283
_9978-3-540-45028-3
024 7 _a10.1007/3-540-45028-9
_2doi
050 4 _aQ337.5
050 4 _aTK7882.P3
072 7 _aUYQP
_2bicssc
072 7 _aCOM016000
_2bisacsh
082 0 4 _a006.4
_223
245 1 0 _aGraph Based Representations in Pattern Recognition
_h[electronic resource] :
_b4th IAPR International Workshop, GbRPR 2003 York, UK, June 30 – July 2, 2003 Proceedings /
_cedited by Edwin Hancock, Mario Vento.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2003.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2003.
300 _aVIII, 276 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2726
505 0 _aData Structures and Representation -- Construction of Combinatorial Pyramids -- On Graphs with Unique Node Labels -- Constructing Stochastic Pyramids by MIDES — Maximal Independent Directed Edge Set -- Segmentation -- Functional Modeling of Structured Images -- Building of Symbolic Hierarchical Graphs for Feature Extraction -- Comparison and Convergence of Two Topological Models for 3D Image Segmentation -- Graph Edit Distance -- Tree Edit Distance from Information Theory -- Self-Organizing Graph Edit Distance -- Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification -- Graph Matching -- Orthonormal Kernel Kronecker Product Graph Mdatching -- Theoretical Analysis and Experimental Comparison of Graph Matching Algorithms for Database Filtering -- A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs -- Swap Strategies for Graph Matching -- Matrix Methods -- Graph Matching Using Spectral Seriation and String Edit Distance -- Graph Polynomials, Principal Pivoting, and Maximum Independent Sets -- Graph Partition for Matching -- Graph Clustering -- Spectral Clustering of Graphs -- Comparison of Distance Measures for Graph-Based Clustering of Documents -- Some Experiments on Clustering a Set of Strings -- A New Median Graph Algorithm -- Graph Clustering Using the Weighted Minimum Common Supergraph -- ACM Attributed Graph Clustering for Learning Classes of Images -- A Competitive Winner-Takes-All Architecture for Classification and Pattern Recognition of Structures.
520 _aThis volume contains the papers presented at the Fourth IAPR Workshop on Graph Based Representations in Pattern Recognition. The workshop was held at the King’s Manor in York, England between 30 June and 2nd July 2003. The previous workshops in the series were held in Lyon, France (1997), Haindorf, Austria (1999), and Ischia, Italy (2001). The city of York provided an interesting venue for the meeting. It has been said that the history of York is the history of England. There have been both Roman and Viking episodes. For instance, Constantine was proclaimed emperor in York. The city has also been a major seat of ecclesiastical power and was also involved in the development of the railways in the nineteenth century. Much of York’s history is evidenced by its buildings, and the King’s Manor is one of the most important and attractive of these. Originally part of the Abbey, after the dissolution of the monasteries by Henry VIII, the building became a center of government for the Tudors and the Stuarts (who stayed here regularly on their journeys between London and Edinburgh), serving as the headquarters of the Council of the North until it was disbanded in 1561. The building became part of the University of York at its foundation in 1963. The papers in the workshop span the topics of representation, segmentation, graph-matching, graph edit-distance, matrix and spectral methods, and gra- clustering.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputational complexity.
650 0 _aComputer graphics.
650 0 _aComputer vision.
650 0 _aOptical pattern recognition.
650 1 4 _aComputer Science.
650 2 4 _aPattern Recognition.
650 2 4 _aComputer Science, general.
650 2 4 _aData Structures.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer Graphics.
650 2 4 _aImage Processing and Computer Vision.
700 1 _aHancock, Edwin.
_eeditor.
700 1 _aVento, Mario.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540404521
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2726
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-45028-9
942 _2EBK5133
_cEBK
999 _c34427
_d34427