blob: e7f18ce1a172bdeccf836dd4d430c95444c97dc3 (
plain)
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
|
/* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
* See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
* Author(s): Pawel Dlotko
*
* Copyright (C) 2016 Inria
*
* Modification(s):
* - YYYY/MM Author: Description of the modification
*/
#include <gudhi/Persistence_heat_maps.h>
#include <iostream>
#include <sstream>
#include <vector>
using constant_scaling_function = Gudhi::Persistence_representations::constant_scaling_function;
using Persistence_heat_maps = Gudhi::Persistence_representations::Persistence_heat_maps<constant_scaling_function>;
int main(int argc, char** argv) {
std::clog << "This program computes scalar product of persistence heat maps stored in a file (the file needs to be "
<< "created beforehand). \n"
<< "The parameters of this programs are names of files with persistence heat maps.\n";
if (argc < 3) {
std::clog << "Wrong number of parameters, the program will now terminate \n";
return 1;
}
std::vector<const char*> filenames;
for (int i = 1; i < argc; ++i) {
filenames.push_back(argv[i]);
}
std::vector<Persistence_heat_maps> maps;
maps.reserve(filenames.size());
for (size_t file_no = 0; file_no != filenames.size(); ++file_no) {
Persistence_heat_maps l;
l.load_from_file(filenames[file_no]);
maps.push_back(l);
}
// and now we will compute the scalar product of landscapes.
// first we prepare an array:
std::vector<std::vector<double> > scalar_product(filenames.size());
for (size_t i = 0; i != filenames.size(); ++i) {
std::vector<double> v(filenames.size(), 0);
scalar_product[i] = v;
}
// and now we can compute the scalar product:
for (size_t i = 0; i != maps.size(); ++i) {
for (size_t j = i; j != maps.size(); ++j) {
scalar_product[i][j] = scalar_product[j][i] = maps[i].compute_scalar_product(maps[j]);
}
}
// and now output the result to the screen and a file:
std::ofstream out;
out.open("scalar_product.mps");
for (size_t i = 0; i != scalar_product.size(); ++i) {
for (size_t j = 0; j != scalar_product.size(); ++j) {
std::clog << scalar_product[i][j] << " ";
out << scalar_product[i][j] << " ";
}
std::clog << std::endl;
out << std::endl;
}
out.close();
std::clog << "Distance can be found in 'scalar_product.mps' file\n";
return 0;
}
|
