Graph Matching Based on Stochastic Perturbation

DOI10.1109/TIP.2015.2469153MaRDI QIDQ4613230zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Chengcai Leng, Wei Xu, Irene Cheng, Anup Basu

Publication date 31 January 2019

Published in IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tip.2015.2469153

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cited in

(7)

• Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs
• Inexact graph matching using a hierarchy of matching processes
• On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching
• scientific article; zbMATH DE number 1844618 (Why is no real title available?)
• Graph matching with hierarchical discrete relaxation
• scientific article; zbMATH DE number 7626795 (Why is no real title available?)
• Information Recovery in Shuffled Graphs via Graph Matching

This page was built for publication: Graph Matching Based on Stochastic Perturbation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4613230)