paper-with-me

Papers Graph Matching

“Graph Matching” 태그가 달린 논문 515편 · 필터 해제

Occluded Person Re-Identification With Single-Scale Global Representations

2021-01-01 · ICCV 2021 10 · Cheng Yan, Guansong Pang, Jile Jiao, Xiao Bai 외

Occluded person re-identification (ReID) aims at re-identifying occluded pedestrians from occluded or holistic images taken across multiple cameras. Current state-of-the-art (SOTA) occluded ReID models rely on some a…

Graph MatchingOccluded Person Re-IdentificationPerson Re-IdentificationPose Estimation

Some Algorithms on Exact, Approximate and Error-Tolerant Graph Matching

2020-12-30 · Shri Prakash Dwivedi

The graph is one of the most widely used mathematical structures in engineering and science because of its representational power and inherent ability to demonstrate the relationship between objects. The objective of thi…

Graph MatchingGraph SimilarityPosition

Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching

2020-12-16 · Chang Liu, Zetian Jiang, Runzhong Wang, Junchi Yan 외

Graph matching (GM) has been a building block in various areas including computer vision and pattern recognition. Despite recent impressive progress, existing deep GM methods often have obvious difficulty in handling out…

Combinatorial OptimizationDecision MakingDeep Reinforcement LearningGraph Matching+2

Articulated Shape Matching Using Laplacian Eigenfunctions and Unsupervised Point Registration

2020-12-14 · Diana Mateus, Radu Horaud, David Knossow, Fabio Cuzzolin 외

Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to map these graphs onto lower dimensional …

ClusteringGraph Matching

LayoutGMN: Neural Graph Matching for Structural Layout Similarity

2020-12-11 · CVPR 2021 1 · Akshay Gadi Patil, Manyi Li, Matthew Fisher, Manolis Savva 외

We present a deep neural network to predict structural similarity between 2D layouts by leveraging Graph Matching Networks (GMN). Our network, coined LayoutGMN, learns the layout metric via neural graph matching, using a…

Graph MatchingMetric LearningRetrievalTriplet

Partial Gromov-Wasserstein Learning for Partial Graph Matching

2020-12-02 · Weijie Liu, Chao Zhang, Jiahao Xie, Zebang Shen 외

Graph matching finds the correspondence of nodes across two graphs and is a basic task in graph-based machine learning. Numerous existing methods match every node in one graph to one node in the other graph whereas two g…

Graph Matching

Graduated Assignment for Joint Multi-Graph Matching and Clustering with Application to Unsupervised Graph Matching Network Learning

2020-12-01 · NeurIPS 2020 12 · Runzhong Wang, Junchi Yan, Xiaokang Yang

This paper considers the setting of jointly matching and clustering multiple graphs belonging to different groups, which naturally rises in many realistic problems. Both graph matching and clustering are challenging (NP-…

ClusteringGraph Matching

Adversarial Attacks on Deep Graph Matching

2020-12-01 · NeurIPS 2020 12 · Zijie Zhang, Zeru Zhang, Yang Zhou, Yelong Shen 외

Despite achieving remarkable performance, deep graph learning models, such as node classification and network embedding, suffer from harassment caused by small adversarial perturbations. However, the vulnerability analys…

Adversarial AttackDensity EstimationGraph LearningGraph Matching+3

Cross-modal registration using point clouds and graph-matching in the context of correlative microscopies

2020-12-01 · Stephan Kunne, Guillaume Potier, Jean Mérot, Perrine Paul-Gilloteaux

Correlative microscopy aims at combining two or more modalities to gain more information than the one provided by one modality on the same biological structure. Registration is needed at different steps of correlative mi…

Graph Matching

VLG-Net: Video-Language Graph Matching Network for Video Grounding

2020-11-19 · Mattia Soldan, Mengmeng Xu, Sisi Qu, Jesper Tegner 외

Grounding language queries in videos aims at identifying the time interval (or moment) semantically relevant to a language query. The solution to this challenging task demands understanding videos' and queries' semantic …

Graph MatchingMoment RetrievalNatural Language Moment RetrievalTemporal Localization+1

Dominant Z-Eigenpairs of Tensor Kronecker Products are Decoupled and Applications to Higher-Order Graph Matching

2020-11-17 · Charles Colley, Huda Nassar, David Gleich

Tensor Kronecker products, the natural generalization of the matrix Kronecker product, are independently emerging in multiple research communities. Like their matrix counterpart, the tensor generalization gives structure…

Graph Matching

Deep Graph Matching and Searching for Semantic Code Retrieval

2020-10-24 · Xiang Ling, Lingfei Wu, Saizhuo Wang, Gaoning Pan 외

Code retrieval is to find the code snippet from a large corpus of source code repositories that highly matches the query of natural language description. Recent work mainly uses natural language processing techniques to …

Graph MatchingRetrieval

Semantic Histogram Based Graph Matching for Real-Time Multi-Robot Global Localization in Large Scale Environment

2020-10-19 · Xiyue Guo, Junjie Hu, Junfeng Chen, Fuqin Deng 외

The core problem of visual multi-robot simultaneous localization and mapping (MR-SLAM) is how to efficiently and accurately perform multi-robot global localization (MR-GL). The difficulties are two-fold. The first is the…

Graph MatchingSimultaneous Localization and Mapping

DSLib: An open source library for the dominant set clustering method

2020-10-15 · Sebastiano Vascon, Samuel Rota Bulò, Vittorio Murino, Marcello Pelillo

DSLib is an open-source implementation of the Dominant Set (DS) clustering algorithm written entirely in Matlab. The DS method is a graph-based clustering technique rooted in the evolutionary game theory that starts gain…

ClusteringGraph Matching

High-Order Relation Construction and Mining for Graph Matching

2020-10-09 · Hui Xu, Liyao Xiang, Youmin Le, Xiaoying Gan 외

Graph matching pairs corresponding nodes across two or more graphs. The problem is difficult as it is hard to capture the structural similarity across graphs, especially on large graphs. We propose to incorporate high-or…

Graph MatchingRelationVocal Bursts Intensity Prediction

A general approach for identifying hierarchical symmetry constraints for analog circuit layout

2020-09-30 · Kishor Kunal, Jitesh Poojary, Tonmoy Dhar, Meghna Madhusudan 외

Analog layout synthesis requires some elements in the circuit netlist to be matched and placed symmetrically. However, the set of symmetries is very circuit-specific and a versatile algorithm, applicable to a broad varie…

Graph MatchingGraph Neural Network

Semantic Graph Based Place Recognition for 3D Point Clouds

2020-08-26 · Xin Kong, Xuemeng Yang, Guangyao Zhai, Xiangrui Zhao 외

Due to the difficulty in generating the effective descriptors which are robust to occlusion and viewpoint changes, place recognition for 3D point cloud remains an open issue. Unlike most of the existing methods that focu…

Graph MatchingGraph Similarity

Graph Edit Distance Reward: Learning to Edit Scene Graph

2020-08-15 · ECCV 2020 8 · Lichang Chen, Guosheng Lin, Shijie Wang, Qingyao Wu

Scene Graph, as a vital tool to bridge the gap between language domain and image domain, has been widely adopted in the cross-modality task like VQA. In this paper, we propose a new method to edit the scene graph accordi…

Graph MatchingImage RetrievalRetrievalVisual Question Answering (VQA)

Layered Neighborhood Expansion for Incremental Multiple Graph Matching

2020-08-01 · ECCV 2020 8 · Zixuan Chen, Zhihui Xie, Junchi Yan Yinqiang Zheng, Xiaokang Yang

Graph matching has been a fundamental problem in computer vision and pattern recognition, for its practical flexibility as well as NP hardness challenge. Though the matching between two graphs and among multiple graphs h…

Graph Matching

Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers

2020-08-01 · ECCV 2020 8 · Michal Rolínek, Paul Swoboda, Dominik Zietlow, Anselm Paulus 외

Building on recent progress at the intersection of combinatorial optimization and deep learning, we propose an end-to-end trainable architecture for deep graph matching that contains unmodified combinatorial solvers. Usi…

Combinatorial OptimizationDeep LearningGraph Matching
← 이전 301–320 / 515 다음 →