-
Notifications
You must be signed in to change notification settings - Fork 0
/
LSDIndexChannelTree.cpp
1304 lines (1093 loc) · 48.2 KB
/
LSDIndexChannelTree.cpp
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
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
//
// LSDIndexChannelTree
// Land Surface Dynamics IndexChannelTree
//
// An object within the University
// of Edinburgh Land Surface Dynamics group topographic toolbox
// for retaining information of channel trees.
//
// Data is a collection of pointers to LSDIndexChannels
//
// Developed by:
// Simon M. Mudd
// Martin D. Hurst
// David T. Milodowski
// Stuart W.D. Grieve
// Declan A. Valters
// Fiona Clubb
//
// Copyright (C) 2013 Simon M. Mudd 2013
//
// Developer can be contacted by simon.m.mudd _at_ ed.ac.uk
//
// Simon Mudd
// University of Edinburgh
// School of GeoSciences
// Drummond Street
// Edinburgh, EH8 9XP
// Scotland
// United Kingdom
//
// 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 2 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, write to:
// Free Software Foundation, Inc.,
// 51 Franklin Street, Fifth Floor,
// Boston, MA 02110-1301
// USA
//
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
//
// LSDIndexChannelTree.cpp
// source code for the LSDIndexChannelTree object
// this object spawns vectors of LSDIndexChannels
// they can be indexed by the LSDCahnnel network, but can also be independant of the
// channel network, storing longest channels from sources, for example
// This object is designed to be flexible, it can be used either with the
// LSDFlowInfo or LSDJunctionNetwork object
// LSD stands for Land Surface Dynamics
//
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
//
// This object is written by
// Simon M. Mudd, University of Edinburgh
// David Milodowski, University of Edinburgh
// Martin D. Hurst, British Geological Survey
//
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
//
// Version 1.0 03/09/2013
//
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
//-----------------------------------------------------------------
//DOCUMENTATION URL: http://www.geos.ed.ac.uk/~s0675405/LSD_Docs/
//-----------------------------------------------------------------
#include <vector>
#include <string>
#include <fstream>
#include "TNT/tnt.h"
#include "LSDStatsTools.hpp"
#include "LSDFlowInfo.hpp"
#include "LSDRaster.hpp"
#include "LSDIndexChannel.hpp"
#include "LSDChannel.hpp"
#include "LSDIndexChannelTree.hpp"
#include "LSDFlowInfo.hpp"
#include "LSDJunctionNetwork.hpp"
using namespace std;
using namespace TNT;
#ifndef LSDIndexChannelTree_CPP
#define LSDIndexChannelTree_CPP
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
//
// Create function. Start from a starting junction (generated by the LSDJunctionNetwork object)
//
// SMM 01/09/2012
//
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
void LSDIndexChannelTree::create(LSDFlowInfo& FlowInfo, LSDJunctionNetwork& ChannelNetwork, int starting_junction)
{
NRows = FlowInfo.get_NRows();
NCols = FlowInfo.get_NCols();
DataResolution = FlowInfo.get_DataResolution();
XMinimum = FlowInfo.get_XMinimum();
YMinimum = FlowInfo.get_YMinimum();
NoDataValue = ChannelNetwork.get_NoDataValue();
organization_switch = 0;
// get the upstream junctions
upstream_junction_list = ChannelNetwork.get_upslope_junctions(starting_junction);
// get the number of upstream junctions
int n_us_junctions = upstream_junction_list.size();
int this_junction;
outlet_junction = starting_junction;
outlet_node = ChannelNetwork.get_Node_of_Junction(starting_junction);
for(int i = 0; i< n_us_junctions; i++)
{
this_junction = upstream_junction_list[i];
IndexChannelVector.push_back( ChannelNetwork.generate_link_index_channel_from_junction(this_junction,FlowInfo) );
}
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
//Create function. Start from a starting junction (generated by the LSDJunctionNetwork object)
// This has an organization switch that allows the user to organize based on
// either a junction network (as in LSDJunctionNetwork) or from a mainstem
//
// SMM 01/09/2012
//
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
void LSDIndexChannelTree::create(LSDFlowInfo& FlowInfo, LSDJunctionNetwork& ChannelNetwork,
int starting_junction, int org_switch, LSDRaster& DistanceFromOutlet)
{
NRows = FlowInfo.get_NRows();
NCols = FlowInfo.get_NCols();
DataResolution = FlowInfo.get_DataResolution();
XMinimum = FlowInfo.get_XMinimum();
YMinimum = FlowInfo.get_YMinimum();
NoDataValue = ChannelNetwork.get_NoDataValue();
organization_switch = org_switch;
if (organization_switch == 0)
{
// get the upstream junctions
upstream_junction_list = ChannelNetwork.get_upslope_junctions(starting_junction);
// get the number of upstream junctions
int n_us_junctions = upstream_junction_list.size();
int this_junction;
outlet_junction = starting_junction;
outlet_node = ChannelNetwork.get_Node_of_Junction(starting_junction);
for(int i = 0; i< n_us_junctions; i++)
{
this_junction = upstream_junction_list[i];
IndexChannelVector.push_back( ChannelNetwork.generate_link_index_channel_from_junction(this_junction,FlowInfo) );
}
}
else if (organization_switch == 1)
{
int nodes_in_channel;
// initiate the main stem
LSDIndexChannel main_stem = ChannelNetwork.generate_longest_index_channel_in_basin(starting_junction,
FlowInfo, DistanceFromOutlet);
// truncate the final node so the tributary algorithm does not pick up a bigger channel as a 'tributary'
main_stem.truncate_final_node();
nodes_in_channel = main_stem.get_n_nodes_in_channel();
IndexChannelVector.push_back(main_stem);
receiver_channel.push_back(0);
node_on_receiver_channel.push_back(nodes_in_channel-1);
// now get the tributaries for the main stem
vector<int> tributary_junctions;
vector<int> node_of_tributaries;
ChannelNetwork.extract_tributary_junctions_to_main_stem(main_stem, FlowInfo, tributary_junctions, node_of_tributaries);
// get the number of main stem tributaries
int n_main_stem_tributaries = tributary_junctions.size();
//cout << "number main_stem trib: " << n_main_stem_tributaries << endl;
// now loop through the tributaries, getting the longest channel for each, and linking them to the main stem
for (int trib = 0; trib<n_main_stem_tributaries; trib++)
{
//cout << "trib junction: " << tributary_junctions[trib] << " node on main stem: "
// << node_of_tributaries[trib] << endl;
LSDIndexChannel main_stem_tributary= ChannelNetwork.generate_longest_index_channel_in_basin(tributary_junctions[trib],
FlowInfo, DistanceFromOutlet);
IndexChannelVector.push_back(main_stem_tributary);
// in this case the receiver is the main stem (index 0) so push back zero
receiver_channel.push_back(0);
node_on_receiver_channel.push_back(node_of_tributaries[trib]);
}
}
else
{
cout << "LINE 1xx LSDIndexChannelTree Invalid ortganization switch!" << endl;
exit(EXIT_FAILURE);
}
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
// this is the same create function as above except it includes a pruning method that rejects
// some of the subbasins based on various criteria set by an integer called pruning switch
// pruning_switch == 0 channels are only added if they exceed a threshold drainage area
// pruning_switch == 1 channels are only added if the ratio between them and the mainstem
// exceeds a certain value (pruning_threshold)
// pruning_switch == 2 channels are only added if the ratio between them and the area of the
// mainstem _at the junction_ exceeds a certain value
//
// SMM 01/09/2012
//
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
void LSDIndexChannelTree::create(LSDFlowInfo& FlowInfo, LSDJunctionNetwork& ChannelNetwork,
int starting_junction, int org_switch, LSDRaster& DistanceFromOutlet,
int pruning_switch, float pruning_threshold)
{
NRows = FlowInfo.get_NRows();
NCols = FlowInfo.get_NCols();
DataResolution = FlowInfo.get_DataResolution();
XMinimum = FlowInfo.get_XMinimum();
YMinimum = FlowInfo.get_YMinimum();
NoDataValue = ChannelNetwork.get_NoDataValue();
float pixel_area = DataResolution*DataResolution;
organization_switch = org_switch;
if (organization_switch == 0)
{
// get the upstream junctions
upstream_junction_list = ChannelNetwork.get_upslope_junctions(starting_junction);
// get the number of upstream junctions
int n_us_junctions = upstream_junction_list.size();
int this_junction;
outlet_junction = starting_junction;
outlet_node = ChannelNetwork.get_Node_of_Junction(starting_junction);
for(int i = 0; i< n_us_junctions; i++)
{
this_junction = upstream_junction_list[i];
IndexChannelVector.push_back( ChannelNetwork.generate_link_index_channel_from_junction(this_junction,FlowInfo) );
}
}
else if (organization_switch == 1)
{
int nodes_in_channel;
// initiate the main stem
LSDIndexChannel main_stem = ChannelNetwork.generate_longest_index_channel_in_basin(starting_junction,
FlowInfo, DistanceFromOutlet);
// truncate the final node so the tributary algorithm does not pick up a bigger channel as a 'tributary'
main_stem.truncate_final_node();
nodes_in_channel = main_stem.get_n_nodes_in_channel();
IndexChannelVector.push_back(main_stem);
receiver_channel.push_back(0);
node_on_receiver_channel.push_back(nodes_in_channel-1);
float main_stem_drainage_area = float(main_stem.get_contributing_pixels_at_outlet(FlowInfo))*pixel_area;
float contributing_pixel_area;
// now get the tributaries for the main stem
vector<int> tributary_junctions;
vector<int> node_of_tributaries;
ChannelNetwork.extract_tributary_junctions_to_main_stem(main_stem, FlowInfo, tributary_junctions, node_of_tributaries);
// get the number of main stem tributaries
int n_main_stem_tributaries = tributary_junctions.size();
//cout << "number main_stem trib: " << n_main_stem_tributaries << endl;
// now loop through the tributaries, getting the longest channel for each, and linking them to the main stem
for (int trib = 0; trib<n_main_stem_tributaries; trib++)
{
LSDIndexChannel main_stem_tributary= ChannelNetwork.generate_longest_index_channel_in_basin(tributary_junctions[trib],
FlowInfo, DistanceFromOutlet);
contributing_pixel_area = pixel_area*float(main_stem_tributary.get_contributing_pixels_at_penultimate_node(FlowInfo));
// enter pruning logic
if (pruning_switch == 0)
{
if (contributing_pixel_area >pruning_threshold)
{
IndexChannelVector.push_back(main_stem_tributary);
// in this case the receiver is the main stem (index 0) so push back zero
receiver_channel.push_back(0);
node_on_receiver_channel.push_back(node_of_tributaries[trib]);
}
}
else if (pruning_switch == 1)
{
//cout << "tributary number: " << trib << " ratio: " << contributing_pixel_area/main_stem_drainage_area << endl;
if (contributing_pixel_area/main_stem_drainage_area >pruning_threshold)
{
IndexChannelVector.push_back(main_stem_tributary);
// in this case the receiver is the main stem (index 0) so push back zero
receiver_channel.push_back(0);
node_on_receiver_channel.push_back(node_of_tributaries[trib]);
}
}
else if (pruning_switch == 2)
{
float main_stem_junc_area = float(main_stem.get_contributing_pixels_at_node(node_of_tributaries[trib], FlowInfo))*
pixel_area;
if ( contributing_pixel_area/main_stem_junc_area > pruning_threshold)
{
IndexChannelVector.push_back(main_stem_tributary);
// in this case the receiver is the main stem (index 0) so push back zero
receiver_channel.push_back(0);
node_on_receiver_channel.push_back(node_of_tributaries[trib]);
}
}
else
{
IndexChannelVector.push_back(main_stem_tributary);
// in this case the receiver is the main stem (index 0) so push back zero
receiver_channel.push_back(0);
node_on_receiver_channel.push_back(node_of_tributaries[trib]);
}
}
}
else
{
cout << "LINE 1xx LSDIndexChannelTree Invalid ortganization switch!" << endl;
exit(EXIT_FAILURE);
}
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
// this function calculates the chi value starting from the bottom node of the channel tree and working its way up
// note that junctions are the top of the channel
//
// It only works with the 0 organization switch (that is, organized on the basis of the LSDJunctionNetwork object)
//
// SMM 01/09/2012
//
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
vector< vector<float> > LSDIndexChannelTree::calculate_chi_from_channel_tree(LSDFlowInfo& FlowInfo, LSDJunctionNetwork& ChannelNetwork,
float m_over_n, float A_0)
{
if(organization_switch != 0)
{
cout << "LSDIndexChannelTree you can't run LSDIndexChannelTree::calculate_chi_from_channel_tree with this channel organization" << endl;
exit(EXIT_FAILURE);
}
float root2 = 1.41421356;
float diag_length = root2*DataResolution;
float dx;
float pixel_area = DataResolution*DataResolution;
int curr_node;
//cout << "diag length:" << diag_length << " and data resolution: " << DataResolution << endl;
vector< vector<float> > chi_vectors;
int n_channels = IndexChannelVector.size();
// read through the tree
cout << "the number of channels is: " << n_channels << endl;
if (n_channels == 0)
{
cout << "LINE 70 LSDIndexChannelTree, empty channel network" << endl;
exit(EXIT_FAILURE);
}
int n_nodes_in_link;
//int current_node_index;
// the junctions are at the top of the channel segment.
// this will get the channel downslope of the starting junction
// on the first channel you need to assign a chi value of 0
n_nodes_in_link = IndexChannelVector[0].get_n_nodes_in_channel();
// the bottom node is at chi of zero
// initiate the chi vector
vector<float> empty_vec;
vector<float> chi_temp(n_nodes_in_link,0.0);
// now loop up through the channel, adding chi values
// note, the channel index are arranges with upstream element first, so you need to go through the channel
// in reverse order
//cout << "YOYOMA nodes in channel: " << n_nodes_in_link << endl;
for (int ChIndex = n_nodes_in_link-2; ChIndex>=0; ChIndex--)
{
//cout << "ChIndex is: " << ChIndex << endl;
curr_node = IndexChannelVector[0].get_node_in_channel(ChIndex);
if (FlowInfo.retrieve_flow_length_code_of_node(curr_node) == 2)
{
dx = diag_length;
}
else
{
dx = DataResolution;
}
//cout << "dx is: " << dx << endl;
chi_temp[ChIndex] = dx*(pow( (A_0/ (float(
FlowInfo.retrieve_contributing_pixels_of_node(curr_node))*pixel_area) ),
m_over_n))
+ chi_temp[ChIndex+1];
}
// add the chi_vector to the vector of vecotrs
chi_vectors.push_back(chi_temp);
int junction_of_this_link;
int receiver_junction_of_this_link;
int receiver_channel_index;
// the chi iterator
vector< vector<float> >::iterator chi_iter;
// loop through the rest of the channels, calcualting chi as you go
for (int i = 1; i<n_channels; i++)
{
n_nodes_in_link = IndexChannelVector[i].get_n_nodes_in_channel();
// reset chi_temp
chi_temp = empty_vec;
chi_temp.resize(n_nodes_in_link,-99);
//cout << endl << "link number: " << " this link has " << n_nodes_in_link << " nodes" <<endl;
// within this loop all channels are upstream of the source junction.
// the end node of a channel (its downstream node) is the start node (its upstream node)
// if its receiver channel. So you need to find the reciever vector. To do this you need to
// know the index of the channel in the IndexChannelVector that is the downstream junction
junction_of_this_link = upstream_junction_list[i];
// get index in the upslope_junctions_list of the reciever junction
// because of the fastscape ordering, this should already have a chi vector assigned
receiver_junction_of_this_link = ChannelNetwork.get_Receiver_of_Junction(junction_of_this_link);
receiver_channel_index = ChannelNetwork.map_junction_to_upslope_junction_list(upstream_junction_list, receiver_junction_of_this_link);
//cout << " the reciever_junc is " << receiver_junction_of_this_link
// << " which is indexed at " << receiver_channel_index << endl;
// now get the most uplsope chi of the reciever channel
chi_iter = chi_vectors.begin();
for (int j = 0; j<receiver_channel_index; j++)
{
chi_iter++;
}
chi_temp[n_nodes_in_link-1] = (*chi_iter)[0];
cout << "the downstream chi is " << chi_temp[n_nodes_in_link-1] << endl;
// now loop upslope through the channel. The chi values increment
// from the channel pixel immediately downslope.
for (int ChIndex = n_nodes_in_link-2; ChIndex>=0; ChIndex--)
{
curr_node = IndexChannelVector[i].get_node_in_channel(ChIndex);
if (FlowInfo.retrieve_flow_length_code_of_node(curr_node) == 2)
{
dx = diag_length;
}
else
{
dx = DataResolution;
}
chi_temp[ChIndex] = dx*(pow( (A_0/ (float(
FlowInfo.retrieve_contributing_pixels_of_node(curr_node))*pixel_area) ),
m_over_n))
+ chi_temp[ChIndex+1];
//cout << "link " << i<<", node " << curr_node << " and chi: " << chi_temp[ChIndex] << " and chi_temp+1: " << chi_temp[ChIndex+1] << endl;
}
chi_vectors.push_back(chi_temp);
}
return chi_vectors;
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
// this function prints chi values. It is used on the channel tree when channels are organized by links
// (that is organization switch == 0
//
// SMM 01/09/2012
//
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
void LSDIndexChannelTree::print_chi_vs_elevation_from_channel_tree(LSDRaster& Elevation, LSDFlowInfo& FlowInfo, LSDJunctionNetwork& ChannelNetwork,
float m_over_n, float A_0, string chi_vs_elev_fname)
{
if(organization_switch != 0)
{
cout << "LSDIndexChannelTree you can't run LSDIndexChannelTree::print_chi_vs_elevation_from_channel_tree with this channel organization" << endl;
exit(EXIT_FAILURE);
}
int n_channels = IndexChannelVector.size();
int n_nodes_in_link,current_node_index;
vector< vector<float> > chi_vectors = calculate_chi_from_channel_tree(FlowInfo, ChannelNetwork,
m_over_n, A_0);
// the chi iterator
vector< vector<float> >::iterator chi_iter;
chi_iter = chi_vectors.begin();
float current_chi;
float current_elev;
int curr_row,curr_col;
ofstream chi_elev_out;
chi_elev_out.open(chi_vs_elev_fname.c_str());
for (int i = 0; i<n_channels; i++)
{
n_nodes_in_link = IndexChannelVector[i].get_n_nodes_in_channel();
for (int this_node = 0; this_node<n_nodes_in_link; this_node++)
{
current_node_index = IndexChannelVector[i].get_node_in_channel(this_node);
current_chi = (*chi_iter)[this_node];
FlowInfo.retrieve_current_row_and_col(current_node_index,curr_row,curr_col);
current_elev = Elevation.get_data_element(curr_row,curr_col);
//cout << "current_node: " << current_node_index << " and chi: " << current_chi << endl;
//chi_elev_out << current_chi << " " << current_elev << endl;
}
chi_iter++;
}
chi_elev_out.close();
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
// this function minimizes the R^2 of the main stem channel assuming it is in steady state
// that is assuming the entire main stem is undergoing the same uplift
//
// SMM 01/09/2012
//
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
float LSDIndexChannelTree::fit_m_over_n_mainstem(vector<float>& m_over_n_values, vector<float>& R_squared,
float A_0, LSDFlowInfo& FlowInfo, LSDRaster& Elevation_Raster,
float start_movn, float increment_movn, int n_movn)
{
float downslope_chi = 0.0;
// we loop through m_over_n values getting R_2 for each
vector<float> R_squared_local;
vector<float> m_over_n_values_local;
float this_movn;
float max_r2 = 0;
float max_movn = 0;
//cout << "LSDIndexChannelTree::fit_m_over_n_mainstem n_movn is: " << n_movn << endl;
for(int i = 0; i<n_movn; i++)
{
this_movn = start_movn+ float(i)*increment_movn;
m_over_n_values_local.push_back(this_movn);
LSDChannel MainStem(downslope_chi, this_movn, A_0, IndexChannelVector[0], FlowInfo, Elevation_Raster);
vector<float> chi = MainStem.get_Chi();
vector<float> elev = MainStem.get_Elevation();
vector<float> residuals;
// do least squares regression
vector<float> results = simple_linear_regression(chi, elev, residuals);
//cout << "LSDIndexChannelTree::fit_m_over_n_mainstem m_ov_n: " << this_movn << " and R2: " << results[2] << endl;
// replace max_r2 if it is the maximum r2 value
if(results[2] > max_r2)
{
max_r2 = results[2];
max_movn = this_movn;
}
R_squared_local.push_back(results[2]);
}
//cout << "The best fit m over n ratio is:" <<max_movn << endl;
return max_movn;
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
// this function works on organiation_switch == 1, where you have a main stem channel and the longest
// tributaries to this channel.
// It takes these Index channels and then turns them into channels with full drainage area,
// chi and elevation data
//
// SMM 01/09/2012
//
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
vector<LSDChannel> LSDIndexChannelTree::retrieve_LSDChannels_from_tree(float m_over_n, float A_0, LSDFlowInfo& FlowInfo,
LSDRaster& Elevation_Raster)
{
if (organization_switch != 1)
{
cout << "LSDIndexChannelTree you can't run LSDIndexChannelTree::retrieve_LSDChannels_from_tree" << endl;
cout << "with this channel organization, organization switch: " << organization_switch << endl;
exit(EXIT_FAILURE);
}
vector<LSDChannel> vector_of_channels;
int receiver_chann;
// get the main stem chi
float downslope_chi = 0.0;
LSDChannel MainStem(downslope_chi, m_over_n, A_0, IndexChannelVector[0], FlowInfo, Elevation_Raster);
vector_of_channels.push_back(MainStem);
// now loop through the tributaries
int n_tributaries = IndexChannelVector.size();
if (n_tributaries > 1)
{
for(int trib = 1; trib<n_tributaries; trib++)
{
// figure out what channel this drains to
receiver_chann = receiver_channel[trib];
// get the chi value at the tributary
downslope_chi = vector_of_channels[receiver_chann].retrieve_chi_at_channel_node(node_on_receiver_channel[trib]);
// make the new channel
LSDChannel TempTrib(downslope_chi, m_over_n, A_0, IndexChannelVector[trib], FlowInfo, Elevation_Raster);
// add it to the vector
vector_of_channels.push_back(TempTrib);
}
}
return vector_of_channels;
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
// this function uses the segment fitting tool to look for the best fit values of m over n
//
// SMM 01/09/2012
//
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
float LSDIndexChannelTree::search_for_best_fit_m_over_n(float A_0, int n_movern, float d_movern,float start_movern,
int minimum_segment_length, float sigma, int target_nodes,
LSDFlowInfo& FlowInfo, LSDRaster& Elevation_Raster, string fname)
{
float m_over_n;
int n_channels = IndexChannelVector.size();
// data structures to hold information about segments from all channels
// these are the best fit data for individual channels
vector< vector<float> > b_vecvec(n_channels);
vector< vector<float> > m_vecvec(n_channels);
vector< vector<float> > DW_vecvec(n_channels);
vector< vector<float> > r2_vecvec(n_channels);
vector< vector<float> > thinned_chi_vecvec(n_channels);
vector< vector<float> > thinned_elev_vecvec(n_channels);
vector< vector<float> > fitted_elev_vecvec(n_channels);
vector< vector<int> > node_ref_thinned_vecvec(n_channels);
vector<vector<int> > these_segment_lengths_vecvec(n_channels);
vector<float> MLE_vec(n_channels);
vector<int> n_segments_vec(n_channels);
vector<int> n_data_nodes_vec(n_channels);
vector<float> AICc_vec(n_channels, 9999);
vector<float> best_m_over_n(n_channels);
// data structures to hold information about segments from all channels
// these are the best fit data for the cumulative channels
vector< vector<float> > cum_b_vecvec(n_channels);
vector< vector<float> > cum_m_vecvec(n_channels);
vector< vector<float> > cum_DW_vecvec(n_channels);
vector< vector<float> > cum_r2_vecvec(n_channels);
vector< vector<float> > cum_thinned_chi_vecvec(n_channels);
vector< vector<float> > cum_thinned_elev_vecvec(n_channels);
vector< vector<float> > cum_fitted_elev_vecvec(n_channels);
vector< vector<int> > cum_node_ref_thinned_vecvec(n_channels);
vector<vector<int> > cum_these_segment_lengths_vecvec(n_channels);
// these data are for the cumulative AICs
vector<float> AICc_combined_vec(n_movern);
vector<float> m_over_n_vec(n_movern);
// these are from the individual channels, which are replaced each time a new channel is analyzed
vector<float> m_vec;
vector<float> b_vec;
vector<float> r2_vec;
vector<float> DW_vec;
vector<float> fitted_y;
int n_data_nodes;
int this_n_segments;
float this_MLE, this_AIC, this_AICc;
vector<int> these_segment_lengths;
vector<float> chi_thinned;
vector<float> elev_thinned;
vector<float> elev_fitted;
vector<int> node_ref_thinned;
// some data about the AICc
// loop through m_over_n values
for(int movn = 0; movn< n_movern; movn++)
{
m_over_n = float(movn)*d_movern+start_movern;
// get the vector of channels for this m_over_n
vector<LSDChannel> vector_of_channels = retrieve_LSDChannels_from_tree(m_over_n, A_0, FlowInfo,
Elevation_Raster);
vector<float> MLEs_thischan(n_channels);
vector<int> n_segs_thischan(n_channels);
vector<int> n_datanodes_thischan(n_channels);
// now loop through channels
for (int chan = 0; chan<n_channels; chan++)
{
// get the channels for this m over n ratio
vector_of_channels[chan].find_most_likeley_segments(minimum_segment_length, sigma, target_nodes,
b_vec, m_vec, r2_vec,DW_vec,chi_thinned, elev_thinned,
elev_fitted, node_ref_thinned,these_segment_lengths,
this_MLE, this_n_segments, n_data_nodes,
this_AIC, this_AICc );
// check to see if the AICc value is the smallest
// if so add the data to the best fit data elements
if (this_AICc < AICc_vec[chan])
{
b_vecvec[chan] = b_vec;
m_vecvec[chan] = m_vec;
DW_vecvec[chan] = DW_vec;
r2_vecvec[chan] = r2_vec;
thinned_chi_vecvec[chan] = chi_thinned;
thinned_elev_vecvec[chan] = elev_thinned;
fitted_elev_vecvec[chan] = elev_fitted;
node_ref_thinned_vecvec[chan] = node_ref_thinned;
these_segment_lengths_vecvec[chan] = these_segment_lengths;
MLE_vec[chan] = this_MLE;
n_segments_vec[chan] = this_n_segments;
n_data_nodes_vec[chan] = n_data_nodes;
AICc_vec[chan] = this_AICc;
best_m_over_n[chan] = m_over_n;
}
// add the data from this channel to the vectors that will be used to calcualte cumulative AICc
MLEs_thischan[chan] = this_MLE;
n_segs_thischan[chan] = this_n_segments;
n_datanodes_thischan[chan] = n_data_nodes;
}
//now calculate the cumulative AICc for this m over n
float thismn_AIC;
float thismn_AICc;
int n_total_segments = 0;
int n_total_nodes = 0;
float cumulative_MLE = 1;
for (int chan = 0; chan<n_channels; chan++)
{
//cout << "JUMBO m_ov_n node: " << movn << " chan: " << chan << " MLE: " << MLEs_thischan[chan] << endl;
n_total_segments += n_segs_thischan[chan];
n_total_nodes += n_datanodes_thischan[chan];
cumulative_MLE = MLEs_thischan[chan]*cumulative_MLE;
}
// these AIC and AICc values are cumualtive for a given m_over_n
thismn_AIC = 4*n_total_segments-2*log(cumulative_MLE); // the 4 comes from the fact that
// for each segment there are 2 parameters
thismn_AICc = thismn_AIC + 2*n_total_segments*(n_total_segments+1)/(n_total_nodes-n_total_segments-1);
AICc_combined_vec[movn] = thismn_AICc;
m_over_n_vec[movn] = m_over_n;
//cout << endl << endl <<"m_over_n: " << m_over_n << " and combined AICc: " << thismn_AICc << endl;
//cout << "this cumulative MLE: " << cumulative_MLE << " n_segs: " << n_total_segments << " and n_nodes: " << n_total_nodes << endl;
}
//cout << "and the cumulative m_over n values"<< endl;
float min_cum_AICc = 9999;
float bf_cum_movn = start_movern;
for (int mn = 0; mn< int(m_over_n_vec.size()); mn++)
{
//cout << "m over n: " << m_over_n_vec[mn] << " and AICc: " << AICc_combined_vec[mn] << endl;
// if this is the minimum, store the m over n value
if(AICc_combined_vec[mn] < min_cum_AICc)
{
min_cum_AICc = AICc_combined_vec[mn];
bf_cum_movn = m_over_n_vec[mn];
}
}
// now get the cumulative best fit channels
vector<LSDChannel> cum_bf_vector_of_channels = retrieve_LSDChannels_from_tree(bf_cum_movn, A_0, FlowInfo,
Elevation_Raster);
// now loop through channels
for (int chan = 0; chan<n_channels; chan++)
{
// get the channels for this m over n ratio
cum_bf_vector_of_channels[chan].find_most_likeley_segments(minimum_segment_length, sigma, target_nodes,
b_vec, m_vec, r2_vec,DW_vec,chi_thinned, elev_thinned,
elev_fitted, node_ref_thinned,these_segment_lengths,
this_MLE, this_n_segments, n_data_nodes,
this_AIC, this_AICc );
cum_b_vecvec[chan] = b_vec;
cum_m_vecvec[chan] = m_vec;
cum_DW_vecvec[chan] = DW_vec;
cum_r2_vecvec[chan] = r2_vec;
cum_thinned_chi_vecvec[chan] = chi_thinned;
cum_thinned_elev_vecvec[chan] = elev_thinned;
cum_fitted_elev_vecvec[chan] = elev_fitted;
cum_node_ref_thinned_vecvec[chan] = node_ref_thinned;
cum_these_segment_lengths_vecvec[chan] = these_segment_lengths;
}
// write a file
ofstream best_fit_info;
best_fit_info.open(fname.c_str());
best_fit_info << "N_channels: " << n_channels << endl;
best_fit_info << "m_over_n_for_channels ";
for (int ch = 0; ch<n_channels; ch++)
{
best_fit_info << " " << best_m_over_n[ch];
}
best_fit_info << endl << "m_over_n_values ";
for (int mn = 0; mn< int(m_over_n_vec.size()); mn++)
{
best_fit_info << " " << m_over_n_vec[mn];
}
best_fit_info << endl << "cumulative_AICc: ";
for (int mn = 0; mn< int(m_over_n_vec.size()); mn++)
{
best_fit_info << " " << AICc_combined_vec[mn];
}
best_fit_info << endl;
cout << "The_best_fit_cumulative_m_over_n_is: " << bf_cum_movn << endl;
for (int chan = 0; chan<n_channels; chan++)
{
vector<int> seglength = cum_these_segment_lengths_vecvec[chan];
vector<float> m_val = cum_m_vecvec[chan];
vector<float> b_val = cum_b_vecvec[chan];
vector<float> DW_val = cum_DW_vecvec[chan];
vector<float> r2_val = cum_r2_vecvec[chan];
int n_segs_this_channel = seglength.size();
best_fit_info << "Channel " << chan << " segment_length";
for (int i = 0; i<n_segs_this_channel; i++)
{
best_fit_info << " " << seglength[i];
}
best_fit_info << endl;
best_fit_info << "Channel " << chan << " segment_gradient";
for (int i = 0; i<n_segs_this_channel; i++)
{
best_fit_info << " " << m_val[i];
}
best_fit_info << endl;
best_fit_info << "Channel " << chan << " segment_intercept";
for (int i = 0; i<n_segs_this_channel; i++)
{
best_fit_info << " " << b_val[i];
}
best_fit_info << endl;
best_fit_info << "Channel " << chan << " segment_DW_stat";
for (int i = 0; i<n_segs_this_channel; i++)
{
best_fit_info << " " << DW_val[i];
}
best_fit_info << endl;
best_fit_info << "Channel " << chan << " segment_r2";
for (int i = 0; i<n_segs_this_channel; i++)
{
best_fit_info << " " << r2_val[i];
}
best_fit_info << endl;
}
for (int chan = 0; chan<n_channels; chan++)
{
chi_thinned = thinned_chi_vecvec[chan];
elev_thinned = thinned_elev_vecvec[chan];
elev_fitted = fitted_elev_vecvec[chan];
// print the cumulative best fit profiles
int thin_n_nodes = chi_thinned.size();
for(int i = 0; i<thin_n_nodes; i++)
{
best_fit_info << chan << " " << chi_thinned[i] << " " << elev_thinned[i] << " " << elev_fitted[i] << endl;
}
}
return bf_cum_movn;
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=---=-=-=-=-=-=-=-=-=-=-=-=-
// this function prints chi and elevation, along with flow distance and the
// number of the tributary it all goes to one file
//
// the file format is
// channel_number node_index row column flow_dist chi elevation drainage_area
//
// SMM 01/09/2012
//
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
void LSDIndexChannelTree::print_LSDChannels_from_tree(float m_over_n, float A_0, LSDFlowInfo& FlowInfo,
LSDRaster& Elevation_Raster, LSDRaster& FlowDistance, string fname)
{
if (organization_switch != 1)
{
cout << "LSDIndexChannelTree you can't run LSDIndexChannelTree::retrieve_LSDChannels_from_tree" << endl;
cout << "with this channel organization, organization switch: " << organization_switch << endl;
exit(EXIT_FAILURE);
}
// open the outfile
ofstream channelfile_out;
channelfile_out.open(fname.c_str());
// get the vector of channels
vector<LSDChannel> vector_of_channels = retrieve_LSDChannels_from_tree(m_over_n, A_0, FlowInfo,Elevation_Raster);
int n_channels = vector_of_channels.size();
int n_nodes_in_channel;
int node,row,col;
float elev,chi,drain_area,flow_dist;
//loop through the channels
for (int i = 0; i< n_channels; i++)
{
// get the number of nodes in the channel
n_nodes_in_channel =IndexChannelVector[i].get_n_nodes_in_channel();
// now loop through the channel, printing out the data.
for(int ch_node= 0; ch_node<n_nodes_in_channel; ch_node++)
{
IndexChannelVector[i].get_node_row_col_in_channel(ch_node, node, row, col);
vector_of_channels[i].retrieve_node_information(ch_node, elev, chi, drain_area);
flow_dist = FlowDistance.get_data_element(row,col);
// print data to file
channelfile_out << i << " " << node << " " << row << " " << col << " " << flow_dist << " "
<< chi << " " << elev << " " << drain_area << endl;
}
}
channelfile_out.close();
}
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=---=-=-=-=-=-=-=-=-=-=-=-=-
// this function prints chi and elevation, along with flow distance and the
// number of the tributary, it all goes to one file
//
// the file format is
// channel_number node_index node_on_reciever row column flow_dist elevation drainage_area
//
// SMM 01/02/2013
//
//=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
void LSDIndexChannelTree::print_LSDChannels_for_chi_network_ingestion(LSDFlowInfo& FlowInfo,
LSDRaster& Elevation_Raster, LSDRaster& FlowDistance, string fname)
{
if (organization_switch != 1)
{
cout << "LSDIndexChannelTree you can't run LSDIndexChannelTree::retrieve_LSDChannels_from_tree" << endl;
cout << "with this channel organization, organization switch: " << organization_switch << endl;