Cantitate/Preț
Produs

Graph Based Representations in Pattern Recognition: Computing Supplementa, cartea 12

Editat de Jean-Michel Jolion, Walter Kropatsch
en Limba Engleză Paperback – 22 iul 1998
Graph-based representation of images is becoming a popular tool since it represents in a compact way the structure of a scene to be analyzed and allows for an easy manipulation of sub-parts or of relationships between parts. Therefore, it is widely used to control the different levels from segmentation to interpretation.The 14 papers in this volume are grouped in the following subject areas: hypergraphs, recognition and detection, matching, segmentation, implementation problems, representation.
Citește tot Restrânge

Din seria Computing Supplementa

Preț: 30942 lei

Preț vechi: 38678 lei
-20% Nou

Puncte Express: 464

Preț estimativ în valută:
5923 6368$ 4938£

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

Public țintă

Research

Cuprins

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.