Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR International Workshop, S+SSPR 2018, Beijing, China, August 17–19, 2018, Proceedings: Lecture Notes in Computer Science, cartea 11004
Editat de Xiao Bai, Edwin R. Hancock, Tin Kam Ho, Richard C. Wilson, Battista Biggio, Antonio Robles-Kellyen Limba Engleză Paperback – 2 aug 2018
The 49 papers presented in this volume were carefully reviewed and selected from 75 submissions. They were organized in topical sections named: classification and clustering; deep learning and neurla networks; dissimilarity representations and Gaussian processes; semi and fully supervised learning methods; spatio-temporal pattern recognition and shape analysis; structural matching; multimedia analysis and understanding; and graph-theoretic methods.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 344.42 lei
Preț vechi: 430.53 lei
-20% Nou
Puncte Express: 517
Preț estimativ în valută:
65.91€ • 68.40$ • 55.09£
65.91€ • 68.40$ • 55.09£
Carte tipărită la comandă
Livrare economică 17-31 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319977843
ISBN-10: 3319977849
Pagini: 494
Ilustrații: XIII, 524 p. 134 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.75 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Image Processing, Computer Vision, Pattern Recognition, and Graphics
Locul publicării:Cham, Switzerland
ISBN-10: 3319977849
Pagini: 494
Ilustrații: XIII, 524 p. 134 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.75 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Image Processing, Computer Vision, Pattern Recognition, and Graphics
Locul publicării:Cham, Switzerland
Cuprins
Classification and Clustering.- Image annotation using a semantic hierarchy.- Malignant Brain Tumor Classification using the Random Forest Method.- Rotationally Invariant Bark Recognition.- Dynamic voting in multi-view learning for radiomics applications.- Iterative Deep Subspace Clustering.- A scalable spectral clustering algorithm based on landmark-embedding and cosine similarity.- Deep Learning and Neural Networks.- On Fast Sample Preselection for Speeding up Convolutional Neural Network Training.- UAV First View Landmark Localization via Deep Reinforcement Learning.- Context Free Band Reduction Using a Convolutional Neural Network.- Local Patterns and Supergraph for Chemical Graph Classification with Convolutional Networks.- Learning Deep Embeddings via Margin-based Discriminate Loss.- Dissimilarity Representations and Gaussian Processes.- Protein Remote Homology Detection using Dissimilarity-based Multiple Instance Learning.- Local Binary Patterns based on Subspace Representationof Image Patch for Face Recognition.- An image-based representation for graph classification.- Visual Tracking via Patch-based Absorbing Markov Chain.- Gradient Descent for Gaussian Processes Variance Reduction.- Semi and Fully Supervised Learning Methods.- Sparsification of Indefinite Learning Models.- Semi-supervised Clustering Framework Based on Active Learning for Real Data.- Supervised Classification Using Feature Space Partitioning.- Deep Homography Estimation with Pairwise Invertibility Constraint.- Spatio-temporal Pattern Recognition and Shape Analysis.- Graph Time Series Analysis using Transfer Entropy.- Analyzing Time Series from Chinese Financial Market Using A Linear-Time Graph Kernel.- A Preliminary Survey of Analyzing Dynamic Time-varying Financial Networks Using Graph Kernels.- Few-Example Affine Invariant Ear Detection in the Wild.- Line Voronoi Diagram using Elliptical Distances.- Structural Matching.- Modelling the Generalised Median Correspondence through an Edit Distance.- Learning the Graph Edit Distance edit costs based on an embedded model.- Ring Based Approximation of Graph Edit Distance.- Graph Edit Distance in the exact context.- The VF3-Light Subgraph Isomorphism Algorithm: when doing less is more effective.- A Deep Neural Network Architecture to Estimate Node Assignment Costs for the Graph Edit Distance.- Error-Tolerant Geometric Graph Similarity.- Learning Cost Functions for Graph Matching.- Multimedia Analysis and Understanding.- Matrix Regression-based Classification for Face Recognition.- Plenoptic Imaging for Seeing Through Turbulence.- Weighted Local Mutual Information for 2D-3D Registration in Vascular Interventions.- Cross-model Retrieval with Reconstruct Hashing.- Deep Supervised Hashing with Information Loss.- Single Image Super Resolution via Neighbor Reconstruction.- An Efficient Method for Boundary Detection from Hyperspectral Imagery.- Graph-Theoretic Methods.- Bags of Graphs for Human Action Recognition.- Categorization ofRNA Molecules using Graph Methods.- Quantum Edge Entropy for Alzheimer's Disease Analysis.- Approximating GED using a Stochastic Generator and Multistart IPFP.- Offline Signature Verification by Combining Graph Edit Distance and Triplet Networks.- On Association Graph Techniques for Hypergraph Matching.- Directed Network Analysis using Transfer Entropy Component Analysis.- A Mixed Entropy Local-Global Reproducing Kernel for Attributed Graphs.- Dirichlet Densifiers: Beyond Constraining the Spectral Gap.