A fast projected fixed-point algorithm for large graph matching
type: Item
instance of: scholarly article
title: A fast projected fixed-point algorithm for large graph matching
zbMATH Open document ID: 1414.68097
author: Yao Lu
author: Kaizhu Huang
author: Cheng-Lin Liu
published in: Pattern Recognition
publication date: 2019-05-29T00:00:00Z
full work available at URL: https://arxiv.org/abs/1207.1114
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7060909
zbMATH Keywords: graph matching
zbMATH Keywords: projected fixed-point
zbMATH Keywords: large graph algorithm
zbMATH Keywords: feature correspondence
zbMATH Keywords: point matching
describes a project that uses: SIFT
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W1592360969
arXiv ID: 1207.1114
cites work: Video indexing and similarity retrieval by largest common subgraph detection using decision trees
cites work: Protein classification by matching and clustering surface graphs
cites work: An Algorithm for Subgraph Isomorphism
cites work: Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis
cites work: Scene Labeling by Relaxation Operations
cites work: An eigendecomposition approach to weighted graph matching problems
cites work: The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
cites work: The quadratic assignment problem
cites work: Concerning nonnegative matrices and doubly stochastic matrices
cites work: Q5519710
cites work: Functional Operators (AM-22), Volume 2
cites work: On the complexity of nonnegative-matrix scaling
cites work: On complexity of matrix scaling
DOI: 10.1016/J.PATCOG.2016.07.015
description: scientific article