Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles
DOI10.1007/s11263-014-0766-9zbMath1398.68631OpenAlexW2136552606WikidataQ33360870 ScholiaQ33360870MaRDI QIDQ1799950
Xingwei Yang, Nagesh Adluru, Longin Jan Latecki
Publication date: 19 October 2018
Published in: International Journal of Computer Vision (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc4456043
sequential Monte Carlograph matchinggraph searchparticle filteringQAPsampling importance resamplingmaximum weight cliquejigsaw puzzle problem
Applications of graph theory (05C90) Monte Carlo methods (65C05) Computing methodologies for image processing (68U10) Signed and weighted graphs (05C22)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On risk-averse maximum weighted subgraph problems
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- The Steiner tree problem on graphs: inapproximability results
- Analysis of heuristics for finding a maximum weight planar subgraph
- Approximations for the maximum acyclic subgraph problem
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
- Complexity of finding dense subgraphs
- A tabu search algorithm for the quadratic assignment problem
- An application of tabu search heuristic for the maximum edge-weighted subgraph problem
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- Sequential Monte Carlo Methods in Practice
- Finding, Minimizing, and Counting Weighted Subgraphs
- Word Reordering and a Dynamic Programming Beam Search Algorithm for Statistical Machine Translation
- Mathematical Aspects of Mixing Times in Markov Chains
- An eigendecomposition approach to weighted graph matching problems
- Tabu Search—Part I
- P-Complete Approximation Problems
- Comparison of iterative searches for the quadratic assignment problem
- A global approach to automatic solution of jigsaw puzzles
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree
- The Maximum Weight Connected Subgraph Problem
- A survey of convergence results on particle filtering methods for practitioners
- Computer Vision - ECCV 2004
- Monte Carlo strategies in scientific computing
- Probabilistic methods for finding people
This page was built for publication: Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles
