Discrete artificial electric field algorithm for high-order graph matching
Authors:
- AnitaANAnita
- Anupam YadavAYAnupam Yadav
- 1 July 2020
- journal article
- research article
- Published by Elsevier in Applied Soft Computing
- Vol. 92
Abstract
No abstract availableKeywords
Funding Information
- Dr. BR Ambedkar National Institute of Technology Jalandhar
- NIT Uttarakhand
This publication has 21 references indexed in Scilit:
- Intrinsic shape matching via tensor-based optimizationComputer-Aided Design, 2019
- Fine-Tuning CNN Image Retrieval with No Human AnnotationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2018
- Image Classification Based on the Boost Convolutional Neural NetworkIEEE Access, 2018
- Video Salient Object Detection via Fully Convolutional NetworksIEEE Transactions on Image Processing, 2017
- 3D object retrieval with multi-feature collaboration and bipartite graph matchingNeurocomputing, 2016
- Robust object tracking based on local region sparse appearance modelNeurocomputing, 2016
- Finding Matches in a Haystack: A Max-Pooling Strategy for Graph Matching in the Presence of Outliers2014
- Fast and Scalable Approximate Spectral Matching for Higher Order Graph MatchingIEEE Transactions on Pattern Analysis and Machine Intelligence, 2013
- A Tensor-Based Algorithm for High-Order Graph MatchingIEEE Transactions on Pattern Analysis and Machine Intelligence, 2011
- Weighted matchings for dense stereo correspondencePattern Recognition, 2000