1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
|
/*
Copyright (c) 2015, M. Kerber, D. Morozov, A. Nigmetov
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
You are under no obligation whatsoever to provide any bug fixes, patches, or
upgrades to the features, functionality or performance of the source code
(Enhancements) to anyone; however, if you choose to make your Enhancements
available either publicly, or directly to copyright holder,
without imposing a separate written license agreement for such Enhancements,
then you hereby grant the following license: a non-exclusive, royalty-free
perpetual license to install, use, modify, prepare derivative works, incorporate
into other computer software, distribute, and sublicense such enhancements or
derivative works thereof, in binary and source code form.
*/
#include <assert.h>
#include <algorithm>
#include <functional>
#include <iterator>
#include "def_debug_ws.h"
#include "wasserstein.h"
#ifdef GAUSS_SEIDEL_AUCTION
#include "auction_runner_gs.h"
#else
#include "auction_runner_jac.h"
#endif
namespace geom_ws {
double wassersteinDistVec(const std::vector<DiagramPoint>& A,
const std::vector<DiagramPoint>& B,
const double q,
const double delta,
const double _internal_p,
const double _initialEpsilon,
const double _epsFactor)
{
if (q < 1) {
#ifndef FOR_R_TDA
std::cerr << "Wasserstein distance not defined for q = " << q << ", must be >= 1" << std::endl;
#endif
throw std::runtime_error("Bad q in Wasserstein " + std::to_string(q));
}
if (delta < 0.0) {
#ifndef FOR_R_TDA
std::cerr << "Relative error " << delta << ", must be > 0" << std::endl;
#endif
throw std::runtime_error("Bad delta in Wasserstein " + std::to_string(delta));
}
if (_initialEpsilon < 0.0) {
#ifndef FOR_R_TDA
std::cerr << "Initial epsilon = " << _initialEpsilon << ", must be non-negative" << std::endl;
#endif
throw std::runtime_error("Bad initial epsilon in Wasserstein" + std::to_string(_initialEpsilon));
}
if (_epsFactor < 0.0) {
#ifndef FOR_R_TDA
std::cerr << "Epsilon factor = " << _epsFactor << ", must be non-negative" << std::endl;
#endif
throw std::runtime_error("Bad epsilon factor in Wasserstein " + std::to_string(_epsFactor));
}
if (A.empty() && B.empty())
return 0.0;
if (A.empty()) {
double result { 0.0 } ;
for(const auto& pt : B) {
result += pt.persistenceLp(_internal_p);
}
return result;
}
if (B.empty()) {
double result { 0.0 } ;
for(const auto& pt : A) {
result += pt.persistenceLp(_internal_p);
}
return result;
}
#ifdef GAUSS_SEIDEL_AUCTION
AuctionRunnerGS auction(A, B, q, delta, _internal_p, _initialEpsilon, _epsFactor);
#else
AuctionRunnerJac auction(A, B, q, delta, _internal_p);
#endif
double result = auction.getWassersteinDistance();
return result;
}
double wassersteinCostVec(const std::vector<DiagramPoint>& A,
const std::vector<DiagramPoint>& B,
const double q,
const double delta,
const double _internal_p,
const double _initialEpsilon,
const double _epsFactor)
{
if (q < 1) {
#ifndef FOR_R_TDA
std::cerr << "Wasserstein distance not defined for q = " << q << ", must be >= 1" << std::endl;
#endif
throw std::runtime_error("Bad q in Wasserstein " + std::to_string(q));
}
if (delta < 0.0) {
#ifndef FOR_R_TDA
std::cerr << "Relative error " << delta << ", must be > 0" << std::endl;
#endif
throw std::runtime_error("Bad delta in Wasserstein " + std::to_string(delta));
}
if (_initialEpsilon < 0.0) {
#ifndef FOR_R_TDA
std::cerr << "Initial epsilon = " << _initialEpsilon << ", must be non-negative" << std::endl;
#endif
throw std::runtime_error("Bad initial epsilon in Wasserstein" + std::to_string(_initialEpsilon));
}
if (_epsFactor < 0.0) {
#ifndef FOR_R_TDA
std::cerr << "Epsilon factor = " << _epsFactor << ", must be non-negative" << std::endl;
#endif
throw std::runtime_error("Bad epsilon factor in Wasserstein " + std::to_string(_epsFactor));
}
#ifdef GAUSS_SEIDEL_AUCTION
AuctionRunnerGS auction(A, B, q, delta, _internal_p, _initialEpsilon, _epsFactor);
#else
AuctionRunnerJac auction(A, B, q, delta, _internal_p);
#endif
double result = auction.getWassersteinCost();
return result;
}
bool readDiagramPointSet(const std::string& fname, PairVector& result)
{
return readDiagramPointSet(fname.c_str(), result);
}
bool readDiagramPointSet(const char* fname, PairVector& result)
{
size_t lineNumber { 0 };
result.clear();
std::ifstream f(fname);
if (!f.good()) {
#ifndef FOR_R_TDA
std::cerr << "Cannot open file " << fname << std::endl;
#endif
return false;
}
std::string line;
while(std::getline(f, line)) {
lineNumber++;
// process comments: remove everything after hash
auto hashPos = line.find_first_of("#", 0);
if( std::string::npos != hashPos) {
line = std::string(line.begin(), line.begin() + hashPos);
}
if (line.empty()) {
continue;
}
// trim whitespaces
auto whiteSpaceFront = std::find_if_not(line.begin(),line.end(),isspace);
auto whiteSpaceBack = std::find_if_not(line.rbegin(),line.rend(),isspace).base();
if (whiteSpaceBack <= whiteSpaceFront) {
// line consists of spaces only - move to the next line
continue;
}
line = std::string(whiteSpaceFront,whiteSpaceBack);
double x, y;
std::istringstream iss(line);
if (not(iss >> x >> y)) {
#ifndef FOR_R_TDA
std::cerr << "Error in file " << fname << ", line number " << lineNumber << ": cannot parse \"" << line << "\"" << std::endl;
#endif
return false;
}
result.push_back(std::make_pair(x,y));
}
f.close();
return true;
}
void removeDuplicates(PairVector& dgmA, PairVector& dgmB)
{
std::map<std::pair<double, double>, int> mapA, mapB;
// copy points to maps
for(const auto& ptA : dgmA) {
mapA[ptA]++;
}
for(const auto& ptB : dgmB) {
mapB[ptB]++;
}
// clear vectors
dgmA.clear();
dgmB.clear();
// remove duplicates from maps
for(auto& pointMultiplicityPair : mapA) {
auto iterB = mapB.find(pointMultiplicityPair.first);
if (iterB != mapB.end()) {
int duplicateMultiplicity = std::min(pointMultiplicityPair.second, iterB->second);
pointMultiplicityPair.second -= duplicateMultiplicity;
iterB->second -= duplicateMultiplicity;
}
}
// copy points back to vectors
for(const auto& pointMultiplicityPairA : mapA) {
assert( pointMultiplicityPairA.second >= 0);
for(int i = 0; i < pointMultiplicityPairA.second; ++i) {
dgmA.push_back(pointMultiplicityPairA.first);
}
}
for(const auto& pointMultiplicityPairB : mapB) {
assert( pointMultiplicityPairB.second >= 0);
for(int i = 0; i < pointMultiplicityPairB.second; ++i) {
dgmB.push_back(pointMultiplicityPairB.first);
}
}
}
} // end of namespace geom_ws
|
