Releases: dthuerck/mapmap_cpu
Releases · dthuerck/mapmap_cpu
v1.5
Envelope optimization
- Deterministic solver path with user-provided seed.
- Several bugfixes and smaller improvements.
- Envelope optimization for Potts, TruncatedLinear, TruncatedQuadratic.
- Ability to have individual cost functions per edge.
- Removed UNARY/PAIRWISE template parameters from solver, hiding these
internally. - Improved multilevel performance, even in the case of individual costs.
- Added GTest for automatic built instead of a hard dependency.
Included new coordinate selection
Based on graph coloring, a new lock-free coordinate selection is up to 3x faster than the improved, old algorithm in v1.0 and v1.1.
Heavily improved tree sampling
(Acyclic) tree sampling is now up to 10x faster by....
- early termination by counting available nodes.
- allowing to relax the maximality guarantee, thus avoiding excessive rescue iterations.
Additionally, we improved rescue iterations by adding more nodes at the same time and included root conflict handling into the phase-based control flow (sampling roots is largely equivalent to executing a phase I). Thus,
the conflict-handling code is now at one common place for all cases.
Stable release for use in mvs-texturing
v1.0 Added callback for external logging.