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
|
/* This file is part of the Gudhi Library. The Gudhi library
* (Geometric Understanding in Higher Dimensions) is a generic C++
* library for computational topology.
*
* Author(s): Pawel Dlotko
*
* Copyright (C) 2015 INRIA (France)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <gudhi/reader_utils.h>
#include <gudhi/abstract_classes/Abs_Topological_data.h>
#include <gudhi/concretizations/Persistence_heat_maps.h>
#include <iostream>
#include <vector>
using namespace Gudhi;
using namespace Gudhi::Gudhi_stat;
double epsilon = 0.0000005;
using namespace std;
int main( int argc , char** argv )
{
//create two simple vectors with birth--death pairs:
std::vector< std::pair< double , double > > persistence1;
std::vector< std::pair< double , double > > persistence2;
persistence1.push_back( std::make_pair(1,2) );
persistence1.push_back( std::make_pair(6,8) );
persistence1.push_back( std::make_pair(0,4) );
persistence1.push_back( std::make_pair(3,8) );
persistence2.push_back( std::make_pair(2,9) );
persistence2.push_back( std::make_pair(1,6) );
persistence2.push_back( std::make_pair(3,5) );
persistence2.push_back( std::make_pair(6,10) );
//over here we define a function we sill put on a top on every birth--death pair in the persistence interval. It can be anything. Over here we will use standarg Gaussian
std::vector< std::vector<double> > filter = create_Gaussian_filter(5,1);
//creating two heat maps.
Persistence_heat_maps hm1( persistence1 , filter , constant_function, false , 20 , 0 , 11 );
Persistence_heat_maps hm2( persistence2 , filter , constant_function, false , 20 , 0 , 11 );
std::vector<Persistence_heat_maps*> vector_of_maps;
vector_of_maps.push_back( &hm1 );
vector_of_maps.push_back( &hm2 );
//compute median/mean of a vector of heat maps:
Persistence_heat_maps mean;
mean.compute_mean( vector_of_maps );
Persistence_heat_maps median;
median.compute_median( vector_of_maps );
//to compute L^1 disance between hm1 and hm2:
std::cout << "The L^1 distance is : " << hm1.distance( (Abs_Topological_data_with_distances*)(&hm2) , 1 ) << std::endl;
//to average of hm1 and hm2:
std::vector< Abs_Topological_data_with_averages* > to_average;
to_average.push_back( (Abs_Topological_data_with_averages*)(&hm1) );
to_average.push_back( (Abs_Topological_data_with_averages*)(&hm2) );
Persistence_heat_maps av;
av.compute_average( to_average );
//to compute scalar product of hm1 and hm2:
std::cout << "Scalar product is : " << hm1.compute_scalar_product( (Abs_Topological_data_with_scalar_product*)(&hm2) ) << std::endl;
return 0;
}
//Below I am storing the code used to generate tests for that functionality.
/*
std::vector< std::pair< double,double > > intervals;
intervals.push_back( std::make_pair(0.5,0.5) );
std::vector< std::vector<double> > filter = create_Gaussian_filter(5,1);
Persistence_heat_maps p( intervals , filter , constant_function, false , 100 , 0 , 1 );
p.plot( "heat_map_1" );
std::vector< std::pair< double,double > > intervals2;
intervals2.push_back( std::make_pair(7,12) );
Persistence_heat_maps q( intervals2 , filter , constant_function, false , 100 , 0 , 10 );
q.plot( "heat_map_2" );
*/
/*
std::vector< std::pair< double,double > > intervals;
intervals.push_back( std::make_pair(0.5,0.5) );
std::vector< std::vector<double> > filter = create_Gaussian_filter(5,1);
Persistence_heat_maps p( intervals , filter , constant_function, false , 10 , 0 , 1 );
p.write_to_file( "aaa" );
Persistence_heat_maps q;
q.load_from_file( "aaa" );
cerr << ( p == q ) << endl;
*/
/*
std::vector< std::vector<double> > filter = create_Gaussian_filter(30,1);
Persistence_heat_maps p( "file_with_diagram" , filter , constant_function, false , 100 , 0 , 1 );
p.plot( "heat_map_1" );
*/
/*
//test to construct persistence heat map:
std::vector< std::vector<double> > filter = create_Gaussian_filter(100,1);
Persistence_heat_maps p( "file_with_diagram" , filter , constant_function, false , 1000 , 0 , 1 );
p.print_to_file( "persistence_heat_map_from_file_with_diagram" );
Persistence_heat_maps q;
q.load_from_file( "persistence_heat_map_from_file_with_diagram" );
cerr << (p == q) << endl;
*/
/*
//test of computations of a mean:
std::vector< std::pair< double,double > > intervals;
intervals.push_back( std::make_pair(5,5) );
std::vector< std::vector<double> > filter = create_Gaussian_filter(5,1);
Persistence_heat_maps p( intervals , filter , constant_function, false , 100 , 0 , 10 );
p.plot( "heat_map_1" );
std::vector< std::pair< double,double > > intervals2;
intervals2.push_back( std::make_pair(7,7) );
Persistence_heat_maps q( intervals2 , filter , constant_function, false , 100 , 0 , 10 );
q.plot( "heat_map_2" );
std::vector< Abs_Topological_data_with_averages* > to_average;
to_average.push_back( (Abs_Topological_data_with_averages*)(&p) );
to_average.push_back( (Abs_Topological_data_with_averages*)(&q) );
Persistence_heat_maps av;
av.compute_average( to_average );
av.plot( "average" );
*/
/*
std::vector< std::vector<double> > filter = create_Gaussian_filter(30,1);
Persistence_heat_maps p( "file_with_diagram" , filter , constant_function, false , 1000 , 0 , 10 );
Persistence_heat_maps q( "file_with_diagram_1" , filter , constant_function, false , 1000 , 0 , 10 );
Persistence_heat_maps r( "file_with_diagram_2" , filter , constant_function, false , 1000 , 0 , 10 );
std::vector< Abs_Topological_data_with_averages* > to_average;
to_average.push_back( (Abs_Topological_data_with_averages*)(&p) );
to_average.push_back( (Abs_Topological_data_with_averages*)(&q) );
to_average.push_back( (Abs_Topological_data_with_averages*)(&r) );
Persistence_heat_maps av;
av.compute_average( to_average );
av.print_to_file( "template_average_of_heat_maps" );
*/
/*
std::vector< std::pair< double,double > > intervals;
intervals.push_back( std::make_pair(5,5) );
std::vector< std::vector<double> > filter = create_Gaussian_filter(5,1);
Persistence_heat_maps p( intervals , filter , constant_function, false , 10 , 0 , 10 );
p.plot( "heat_map_1" );
std::vector< std::pair< double,double > > intervals2;
intervals2.push_back( std::make_pair(7,7) );
Persistence_heat_maps q( intervals2 , filter , constant_function, false , 10 , 0 , 10 );
q.plot( "heat_map_2" );
std::vector< Persistence_heat_maps* > to_compute_median;
to_compute_median.push_back( &p );
to_compute_median.push_back( &q );
Persistence_heat_maps median;
median.compute_median( to_compute_median );
median.plot( "median" );
*/
/*
std::vector< std::vector<double> > filter = create_Gaussian_filter(30,1);
Persistence_heat_maps p( "file_with_diagram" , filter , constant_function, false , 1000 , 0 , 1 );
Persistence_heat_maps q( "file_with_diagram_1" , filter , constant_function, false , 1000 , 0 , 1 );
Persistence_heat_maps r( "file_with_diagram_2" , filter , constant_function, false , 1000 , 0 , 1 );
std::vector< Persistence_heat_maps* > to_compute_median;
to_compute_median.push_back( &p );
to_compute_median.push_back( &q );
to_compute_median.push_back( &r );
Persistence_heat_maps median;
median.compute_median( to_compute_median );
median.print_to_file( "template_median_of_heat_maps" );
*/
/*
std::vector< std::vector<double> > filter = create_Gaussian_filter(30,1);
Persistence_heat_maps p( "file_with_diagram" , filter , constant_function, false , 1000 , 0 , 1 );
Persistence_heat_maps q( "file_with_diagram_1" , filter , constant_function, false , 1000 , 0 , 1 );
Persistence_heat_maps r( "file_with_diagram_2" , filter , constant_function, false , 1000 , 0 , 1 );
std::vector< Persistence_heat_maps* > to_compute_percentage_of_active;
to_compute_percentage_of_active.push_back( &p );
to_compute_percentage_of_active.push_back( &q );
to_compute_percentage_of_active.push_back( &r );
Persistence_heat_maps percentage_of_active;
percentage_of_active.compute_percentage_of_active( to_compute_percentage_of_active , 0.1 );
percentage_of_active.print_to_file( "template_percentage_of_active_of_heat_maps" );
//percentage_of_active.plot( "template_percentage_of_active_of_heat_maps" );
*/
|
