Search Results for author:
Found 2 papers, 1 papers with code
Eigenbackground Revisited: Can We Model the Background with Eigenvectors?
Using dominant eigenvectors for background modeling (usually known as Eigenbackground) is a common technique in the literature.
An Upper Bound for Minimum True Matches in Graph Isomorphism with Simulated Annealing
Graph matching is one of the most important problems in graph theory and combinatorial optimization, with many applications in various domains.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
