summaryrefslogtreecommitdiff
AgeCommit message (Collapse)Author
2020-03-06Reorganize matching_dist code, minor fixes.Arnur Nigmetov
2020-03-04Make matching distance header-only.Arnur Nigmetov
2020-03-01Keep only unique positions in module.Arnur Nigmetov
Other minor changes: 1. Remove bi-grades and unnecessary IntPoint class. 2. Remove ModulePresentation ctor from file.
2020-02-19Require first file line specify the format.Arnur Nigmetov
1. Input format must be in the first line of input file, as in RIVET. 2. Disable more unnecessary output. 3. Get rid of some warnings.
2020-02-19Fix BifiltrationProxy bug; disable debug output.Arnur Nigmetov
1. Same bifiltration was used in constructing two bifiltration proxies; the second bifiltration was ignored. Fixed. 2. Switched from spd::info to spd::debug in most places. 3. Get rid of absolute paths for test bifiltrations.
2020-02-18Rename enum.Arnur Nigmetov
2020-02-18Merge branch 'matching_distance' of bitbucket.org:grey_narn/hera into ↵Arnur Nigmetov
matching_distance
2020-02-18README and boost/progress changes from master.Arnur Nigmetov
2020-02-18Interim: matching distance for modulesArnur Nigmetov
1. Templatize DistanceCalculator (DiagramProvider) 2. Add BifiltrationProxy with the same interface as ModulePresentation (dimension fixed). 3. Call Hera with relative error. 4. Add class ModulePresentation. To-Do: reading module presentations from Rivet format.
2020-02-18Add matching distance code.Arnur Nigmetov
2020-02-18One gitignoreArnur Nigmetov
2020-02-18Rename directories for bottleneck and WassersteinArnur Nigmetov
2020-01-14Interim: matching distance for modulesArnur Nigmetov
1. Templatize DistanceCalculator (DiagramProvider) 2. Add BifiltrationProxy with the same interface as ModulePresentation (dimension fixed). 3. Call Hera with relative error. 4. Add class ModulePresentation. To-Do: reading module presentations from Rivet format.
2020-01-02remove unused attributeArnur Nigmetov
2019-12-03Add matching distance code.Arnur Nigmetov
2019-12-03One gitignoreArnur Nigmetov
2019-12-03Rename directories for bottleneck and WassersteinArnur Nigmetov
2019-09-17Add traits for long double (Wasserstein).Arnur Nigmetov
2019-09-16Add traits for float in Wasserstein.Arnur Nigmetov
2019-09-15Update README, BSD license only.Arnur Nigmetov
2019-02-06Switch to opts, tolerate max-iterations-exceeded.Arnur Nigmetov
1. Use opts.h for command-line parsing in wasserstein_dist. 2. Real relative error at the end of auction is stored in params, params is passed by reference. 3. If -e command line option is given to wasserstein_dist, relative error will be printed. 4. If -t option is given to wasserstein_dist, no exception will be thrown, if maximum number of iterations is exceeded. 5. Run wasserstein_dist -h to see all options.
2018-06-21Bug in longest edge for negative persistence fixedArnur Nigmetov
2018-06-19Template bug fixedArnur Nigmetov
2018-06-19Longest edge for bottleneck, tests for bottleneckArnur Nigmetov
2018-06-03First tests addedArnur Nigmetov
Preparation for longest edge computation.
2018-06-03Add const qualifierArnur Nigmetov
2018-06-01First trivial test for point cloud versionArnur Nigmetov
2018-05-312 bugs fixed in Jacobi for point cloudArnur Nigmetov
2018-05-31Fix bug in point cloud version.Arnur Nigmetov
internal_p was not respected by DynamicPointTraits, l_2 distance was always used.
2018-05-19Add inline qualifier to Wasserstein code.Arnur Nigmetov
To avoid linking problems.
2018-05-19Points at infinity handled correctly.Arnur Nigmetov
1. Reader copied from wasserstein code, can parse inf, moved to hera namespace. 2. addProjections removes points at infinity. 3. Points at infinity handled separately by getInfinityCost().
2018-05-15Fixed iterator arithmetic for small diagsArnur Nigmetov
2018-03-16Minor changes (indentation, etc)Arnur Nigmetov
2018-03-16Test cases for the DIPHA input reader.Gard Spreemann
2018-03-15Support for reading persistence diagrams in the DIPHA format.Gard Spreemann
2018-03-06Points with 0 persistence ignored in the inputArnur Nigmetov
2018-01-25Fix for inf-only diagramsArnur Nigmetov
2018-01-20Major rewrite, templatized versionArnur Nigmetov
2017-07-19Include cmath instead of math.hArnur Nigmetov
2017-07-05Price adjustment; maxIterNum increasedArnur Nigmetov
For high Wasserstein powers price adjustment (subtract minimal price) is needed.
2017-04-26More debug outputArnur Nigmetov
2017-04-26More debug outputArnur Nigmetov
2017-04-24Some more debug outputArnur Nigmetov
2017-04-24Lots of debug output for sampling heuristicArnur Nigmetov
To fix a problem on Mac OS.
2017-04-24Verbose timing for bottleneck addedArnur Nigmetov
Timing info is printed, if VERBOSE_BOTTLENECK is #defined in def_debug_bt.h.
2017-04-24Debug output suppressedArnur Nigmetov
2017-04-24Empty diagram bug for Wasserstein fixedArnur Nigmetov
2017-04-14Bug in Wasserstein fixed: internal_p not passed to kd-treeArnur Nigmetov
2017-04-06Minor changesArnur Nigmetov
2017-04-06Heuristic for bottleneck: estimate on sampled diagramArnur Nigmetov
Sample input diagrams and use the distance between samples as initial guess in binary search. Relevant variables: bottleneck_dist.cpp:10 useSamplingHeur (if false, heuristic is never applied) bottleneck_dist.cpp:11 heurThreshold (heuristic is not applid to diagrams with fewer points) TODO: add command-line parameters instead Sampling strategy: sort points by multiplicity, set cutting value to be the multiplicity where the increase of the next one is maximal and only keep points whose multiplicity is less then the cutting value
generated by cgit v1.2.3 (git 2.39.1) at 2024-06-29 18:38:44 +0000