diff options
author | pdlotko <pdlotko@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2016-10-11 07:43:50 +0000 |
---|---|---|
committer | pdlotko <pdlotko@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2016-10-11 07:43:50 +0000 |
commit | 7a6ebbd6c26306bca806bbc8c08f74a13c63fca6 (patch) | |
tree | 63e331cd19aa72f81808c61c44f3f8add99e8bcb /src/Gudhi_stat/utilities/persistence_heat_maps/compute_distance_of_persistence_heat_maps.cpp | |
parent | 28b6b1eb52920b495a73f4713d9a6ae78a997f6e (diff) |
adding answert to Vincent's comments
git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/gudhi_stat@1688 636b058d-ea47-450e-bf9e-a15bfbe3eedb
Former-commit-id: 3e90519425010bfedae7af946238188fee6cf420
Diffstat (limited to 'src/Gudhi_stat/utilities/persistence_heat_maps/compute_distance_of_persistence_heat_maps.cpp')
-rw-r--r-- | src/Gudhi_stat/utilities/persistence_heat_maps/compute_distance_of_persistence_heat_maps.cpp | 107 |
1 files changed, 107 insertions, 0 deletions
diff --git a/src/Gudhi_stat/utilities/persistence_heat_maps/compute_distance_of_persistence_heat_maps.cpp b/src/Gudhi_stat/utilities/persistence_heat_maps/compute_distance_of_persistence_heat_maps.cpp new file mode 100644 index 00000000..e462f009 --- /dev/null +++ b/src/Gudhi_stat/utilities/persistence_heat_maps/compute_distance_of_persistence_heat_maps.cpp @@ -0,0 +1,107 @@ +/* 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/abstract_classes/Abs_Topological_data.h> +#include <gudhi/concretizations/Persistence_heat_maps.h> + + + +using namespace Gudhi; +using namespace Gudhi::Gudhi_stat; + +#include <iostream> +#include <sstream> + + +int main( int argc , char** argv ) +{ + std::cout << "This program compute dsitance of persistence landscapes stored in a file (the file needs to be created beforehand). \n"; + std::cout << "The first parameter of a program is an interger p. The program compute L^p distance of the two landscapes. For L^infty distance choose p = -1. \n"; + std::cout << "The remaining parameters of this programs are names of files with persistence landscapes.\n"; + + if ( argc < 3 ) + { + std::cout << "Wrong number of parameters, the program will now terminate \n"; + return 1; + } + + int p = atoi( argv[1] ); + + std::vector< const char* > filenames; + for ( int i = 2 ; i < argc ; ++i ) + { + filenames.push_back( argv[i] ); + } + std::vector< Abs_Topological_data_with_distances* > maps; + maps.reserve( filenames.size() ); + for ( size_t file_no = 0 ; file_no != filenames.size() ; ++file_no ) + { + Persistence_heat_maps* l = new Persistence_heat_maps; + l->load_from_file( filenames[file_no] ); + maps.push_back( (Abs_Topological_data_with_distances*)l ); + } + + //and now we will compute the scalar product of landscapes. + + //first we prepare an array: + std::vector< std::vector< double > > distance( filenames.size() ); + for ( size_t i = 0 ; i != filenames.size() ; ++i ) + { + std::vector< double > v( filenames.size() , 0 ); + distance[i] = v; + } + + //and now we can compute the distnaces: + for ( size_t i = 0 ; i != filenames.size() ; ++i ) + { + for ( size_t j = i ; j != filenames.size() ; ++j ) + { + distance[i][j] = distance[j][i] = ((Persistence_heat_maps*)maps[i])->distance( maps[j] , p ) ; + } + } + + //and now output the result to the screen and a file: + ofstream out; + out.open( "distance" ); + for ( size_t i = 0 ; i != distance.size() ; ++i ) + { + for ( size_t j = 0 ; j != distance.size() ; ++j ) + { + cout << distance[i][j] << " "; + out << distance[i][j] << " "; + } + cout << endl; + out << endl; + } + out.close(); + + return 0; +} + + + + + + + |