Graph matching by simplified convex-concave relaxation procedure
type: Item
instance of: scholarly article
title: Graph matching by simplified convex-concave relaxation procedure
zbMATH Open document ID: 1328.68186
author: H. Qiao
author: Xu Yang
author: Steven C. H. Hoi
author: Zhi-Yong Liu
published in: International Journal of Computer Vision
publication date: 2016-01-06T00:00:00Z
full work available at URL: https://ink.library.smu.edu.sg/sis_research/2286
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6526792
zbMATH Keywords: graph matching
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: deterministic annealing
zbMATH Keywords: graduated optimization
zbMATH Keywords: feature correspondence
describes a project that uses: CASIA
MaRDI profile type: Publication
OpenAlex ID: W2165107571
cites work: Q4821526
cites work: An eigendecomposition approach to weighted graph matching problems
cites work: Q5519710
cites work: Unsupervised learning for graph matching
cites work: Geometric latent Dirichlet allocation on a matching graph for large-scale image datasets
cites work: Statistical inference on parametric part for partially linear single-index model
DOI: 10.1007/S11263-014-0707-7
description: scientific article; zbMATH DE number 6526792