Graph Based Representations in Pattern Recognition: Computing Supplementa, cartea 12
Editat de Jean-Michel Jolion, Walter Kropatschen Limba Engleză Paperback – 22 iul 1998
Preț: 309.42 lei
Preț vechi: 386.78 lei
-20% Nou
Puncte Express: 464
Preț estimativ în valută:
59.23€ • 63.68$ • 49.38£
59.23€ • 63.68$ • 49.38£
Carte tipărită la comandă
Livrare economică 19 decembrie 24 - 02 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783211831212
ISBN-10: 3211831215
Pagini: 160
Ilustrații: VII, 145 p. 55 illus.
Greutate: 0.26 kg
Ediția:Softcover reprint of the original 1st ed. 1998
Editura: SPRINGER VIENNA
Colecția Springer
Seria Computing Supplementa
Locul publicării:Vienna, Austria
ISBN-10: 3211831215
Pagini: 160
Ilustrații: VII, 145 p. 55 illus.
Greutate: 0.26 kg
Ediția:Softcover reprint of the original 1st ed. 1998
Editura: SPRINGER VIENNA
Colecția Springer
Seria Computing Supplementa
Locul publicării:Vienna, Austria
Public țintă
ResearchCuprins
Hypergraphs.- Generalization of Two Hypergraphs. Algorithm of Calculation of the Greatest Sub-Hypergraph Common to Two Hypergraphs Annotated by Semantic Information.- Recognition and Detection.- Recognition of Polymorphic Patterns in Parameterized Graphs for 3D Building Reconstruction.- A Graph-Based Representation to Detect Linear Features.- Edge Detection as Finding the Minimum Cost Path in a Graph.- Matching.- Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs.- Efficient Graph Matching for Video Indexing.- Isomorphism between Strong Fuzzy Relational Graphs Based on k-Formulae.- Segmentation.- A Graph Structure for Grey Value and Texture Segmentation.- Discrete Maps: a Framework for Region Segmentation Algorithms.- Image Sequence Segmentation by a Single Evolutionary Graph Pyramid.- Implementation Problems.- Dual Graph Contraction with LEDA.- Implementing Image Analysis with a Graph-Based Parallel Computing Model.- Representation.- The Frontier-Region Graph.- Optimization Techniques on Pixel Neighborhood Graphs for Image Processing.