Shanghai Jiao Tong University; Arizona State University
deep graph matching;edge embedding;combinatorial problem;Hungarian loss
Learning deep graph matching with channel-independent embedding and Hungarian attention