-
Notifications
You must be signed in to change notification settings - Fork 10
/
tracingfuncs.py
1259 lines (1046 loc) · 42 KB
/
tracingfuncs.py
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
"""Miscellaneous tracing functions."""
import numpy as np
import numpy.typing as npt
import matplotlib.pyplot as plt
import math
class getSkeleton:
"""
Skeltonisation : "A Fast Parallel Algorithm for Thinning Digital Patterns" by Zhang et al., 1984.
Parameters
----------
image_data : npt.NDArray
Image to be traced.
binary_map : npt.NDArray
Image mask.
number_of_columns : int
Number of columns.
number_of_rows : int
Number of rows.
pixel_size : float
Pixel to nm scaling.
"""
def __init__(
self,
image_data: npt.NDArray,
binary_map: npt.NDArray,
number_of_columns: int,
number_of_rows: int,
pixel_size: float,
) -> None:
"""
Initialise the class.
Parameters
----------
image_data : npt.NDArray
Image to be traced.
binary_map : npt.NDArray
Image mask.
number_of_columns : int
Number of columns.
number_of_rows : int
Number of rows.
pixel_size : float
Pixel to nm scaling.
"""
self.image_data = image_data
self.binary_map = binary_map
self.number_of_columns = number_of_columns
self.number_of_rows = number_of_rows
self.pixel_size = pixel_size
self.p2 = 0
self.p3 = 0
self.p4 = 0
self.p5 = 0
self.p6 = 0
self.p7 = 0
self.p8 = 0
# skeletonising variables
self.mask_being_skeletonised = []
self.output_skeleton = []
self.skeleton_converged = False
self.pruning = True
# Height checking variables
self.average_height = 0
# self.cropping_dict = self._initialiseHeightFindingDict()
self.highest_points = {}
self.search_window = int(3 / (pixel_size * 1e9))
# Check that the search window is bigger than 0:
if self.search_window < 2:
self.search_window = 3
self.dir_search = int(0.75 / (pixel_size * 1e9))
if self.dir_search < 3:
self.dir_search = 3
self.getDNAmolHeightStats()
self.doSkeletonising()
def getDNAmolHeightStats(self):
"""Get molecule heights."""
coordinates = np.argwhere(self.binary_map == 1)
flat_indices = np.ravel_multi_index(coordinates.T, self.image_data.shape)
heights = self.image_data.flat[flat_indices]
self.average_height = np.average(heights)
def doSkeletonising(self):
"""Check if the skeletonising is finished."""
self.mask_being_skeletonised = self.binary_map
while not self.skeleton_converged:
self._doSkeletonisingIteration()
# When skeleton converged do an additional iteration of thinning to remove hanging points
self.finalSkeletonisationIteration()
self.pruning = True
while self.pruning:
self.pruneSkeleton()
self.output_skeleton = np.argwhere(self.mask_being_skeletonised == 1)
def _doSkeletonisingIteration(self):
"""
Do an iteration of skeletonisation.
Check for the local binary pixel environment and assess the local height values to decide whether to delete a
point.
"""
number_of_deleted_points = 0
pixels_to_delete = []
# Sub-iteration 1 - binary check
mask_coordinates = np.argwhere(self.mask_being_skeletonised == 1).tolist()
for point in mask_coordinates:
if self._deletePixelSubit1(point):
pixels_to_delete.append(point)
# Check the local height values to determine if pixels should be deleted
# pixels_to_delete = self._checkHeights(pixels_to_delete)
for x, y in pixels_to_delete:
number_of_deleted_points += 1
self.mask_being_skeletonised[x, y] = 0
pixels_to_delete = []
# Sub-iteration 2 - binary check
mask_coordinates = np.argwhere(self.mask_being_skeletonised == 1).tolist()
for point in mask_coordinates:
if self._deletePixelSubit2(point):
pixels_to_delete.append(point)
# Check the local height values to determine if pixels should be deleted
# pixels_to_delete = self._checkHeights(pixels_to_delete)
for x, y in pixels_to_delete:
number_of_deleted_points += 1
self.mask_being_skeletonised[x, y] = 0
if number_of_deleted_points == 0:
self.skeleton_converged = True
def _deletePixelSubit1(self, point: npt.NDArray) -> bool:
"""
Check whether a point should be deleted based on local binary environment and local height values.
Parameters
----------
point : npt.NDArray
Point to be checked.
Returns
-------
bool
Whether the point should be deleted.
"""
self.p2, self.p3, self.p4, self.p5, self.p6, self.p7, self.p8, self.p9 = genTracingFuncs.getLocalPixelsBinary(
self.mask_being_skeletonised, point[0], point[1]
)
if (
self._binaryThinCheck_a()
and self._binaryThinCheck_b()
and self._binaryThinCheck_c()
and self._binaryThinCheck_d()
):
return True
else:
return False
def _deletePixelSubit2(self, point: npt.NDArray) -> bool:
"""
Check whether a point should be deleted based on local binary environment and local height values.
Parameters
----------
point : npt.NDArray
Point to be checked.
Returns
-------
bool
Whether the point should be deleted.
"""
self.p2, self.p3, self.p4, self.p5, self.p6, self.p7, self.p8, self.p9 = genTracingFuncs.getLocalPixelsBinary(
self.mask_being_skeletonised, point[0], point[1]
)
# Add in generic code here to protect high points from being deleted
if (
self._binaryThinCheck_a()
and self._binaryThinCheck_b()
and self._binaryThinCheck_csharp()
and self._binaryThinCheck_dsharp()
):
return True
else:
return False
"""These functions are ripped from the Zhang et al. paper and do the basic
skeletonisation steps
I can use the information from the c,d,c' and d' tests to determine a good
direction to search for higher height values """
def _binaryThinCheck_a(self) -> bool:
"""
Binary thin check A.
Returns
-------
bool:
Whether the condition is met.
"""
# Condition A protects the endpoints (which will be > 2) - add in code here to prune low height points
if 2 <= self.p2 + self.p3 + self.p4 + self.p5 + self.p6 + self.p7 + self.p8 + self.p9 <= 6:
return True
else:
return False
def _binaryThinCheck_b(self) -> bool:
"""
Binary thin check B.
Returns
-------
bool:
Whether the condition is met."""
count = 0
if [self.p2, self.p3] == [0, 1]:
count += 1
if [self.p3, self.p4] == [0, 1]:
count += 1
if [self.p4, self.p5] == [0, 1]:
count += 1
if [self.p5, self.p6] == [0, 1]:
count += 1
if [self.p6, self.p7] == [0, 1]:
count += 1
if [self.p7, self.p8] == [0, 1]:
count += 1
if [self.p8, self.p9] == [0, 1]:
count += 1
if [self.p9, self.p2] == [0, 1]:
count += 1
if count == 1:
return True
else:
return False
def _binaryThinCheck_c(self) -> bool:
"""
Binary thin check C.
Returns
-------
bool:
Whether the condition is met.
"""
if self.p2 * self.p4 * self.p6 == 0:
return True
else:
return False
def _binaryThinCheck_d(self) -> bool:
"""
Binary thin check D.
Returns
-------
bool:
Whether the condition is met.
"""
if self.p4 * self.p6 * self.p8 == 0:
return True
else:
return False
def _binaryThinCheck_csharp(self) -> bool:
"""
Binary thin check C#.
Returns
-------
bool:
Whether the condition is met.
"""
if self.p2 * self.p4 * self.p8 == 0:
return True
else:
return False
def _binaryThinCheck_dsharp(self) -> bool:
"""
Binary thin check D#
Returns
-------
bool:
Whether the condition is met.
"""
if self.p2 * self.p6 * self.p8 == 0:
return True
else:
return False
def _checkHeights(self, candidate_points: npt.NDArray) -> npt.NDArray:
"""Check heights.
Parameters
----------
candidate_points : npt.NDArray) - > npt.NDArra
Candidate points to be checked.
Returns
-------
npt.NDArray
Candidate points.
"""
try:
candidate_points = candidate_points.tolist()
except AttributeError:
pass
for x, y in candidate_points:
# if point is basically at background don't bother assessing height and just delete:
if self.image_data[x, y] < 1e-9:
continue
# Check if the point has already been identified as a high point
try:
self.highest_points[(x, y)]
candidate_points.pop(candidate_points.index([x, y]))
# print(x,y)
continue
except KeyError:
pass
(
self.p2,
self.p3,
self.p4,
self.p5,
self.p6,
self.p7,
self.p8,
self.p9,
) = genTracingFuncs.getLocalPixelsBinary(self.mask_being_skeletonised, x, y)
print([self.p9, self.p2, self.p3], [self.p8, 1, self.p4], [self.p7, self.p6, self.p5])
height_points_to_check = self._checkWhichHeightPoints()
height_points = np.around(self.cropping_dict[height_points_to_check](x, y), decimals=11)
test_value = np.around(self.image_data[x, y], decimals=11)
# print(height_points_to_check, [x,y], self.image_data[x,y], height_points)
# if the candidate points is the highest local point don't delete it
if test_value >= sorted(height_points)[-1]:
print([self.p9, self.p2, self.p3], [self.p8, 1, self.p4], [self.p7, self.p6, self.p5])
print(height_points_to_check, [x, y], self.image_data[x, y], height_points)
self.highest_points[(x, y)] = height_points_to_check
candidate_points.pop(candidate_points.index([x, y]))
print(height_points_to_check, (x, y))
else:
x_n, y_n = self._identifyHighestPoint(x, y, height_points_to_check, height_points)
self.highest_points[(x_n, y_n)] = height_points_to_check
pass
return candidate_points
def _checkWhichHeightPoints(self):
"""Check which height points."""
# Is the point on the left hand edge?
# if (self.p8 == 1 and self.p4 == 0 and self.p2 == self.p6):
if self.p7 + self.p8 + self.p9 == 3 and self.p3 + self.p4 + self.p5 == 0 and self.p2 == self.p6:
"""e.g. [1, 1, 0]
[1, 1, 0]
[1, 1, 0]"""
return "horiz_left"
# elif (self.p8 == 0 and self.p4 == 1 and self.p2 == self.p6):
elif self.p7 + self.p8 + self.p9 == 0 and self.p3 + self.p4 + self.p5 == 3 and self.p2 == self.p6:
"""e.g. [0, 1, 1]
[0, 1, 1]
[0, 1, 1]"""
return "horiz_right"
# elif (self.p2 == 1 and self.p6 == 0 and self.p4 == self.p8):
elif self.p9 + self.p2 + self.p3 == 3 and self.p5 + self.p6 + self.p7 == 0 and self.p4 == self.p8:
"""e.g. [1, 1, 1]
[1, 1, 1]
[0, 0, 0]"""
return "vert_up"
# elif (self.p2 == 0 and self.p6 == 1 and self.p4 == self.p8):
elif (
self.p9 + self.p2 + self.p3 == 0 and self.p5 + self.p6 + self.p7 == 3 and self.p4 == self.p8
): # and self.p4 == self.p8):
"""e.g. [0, 0, 0]
[1, 1, 1]
[1, 1, 1]"""
return "vert_down"
elif self.p2 + self.p8 <= 1 and self.p4 + self.p5 + self.p6 >= 2:
"""e.g. [0, 0, 1] [0, 0, 0]
[0, 1, 1] [0, 1, 1]
[1, 1, 1] or [0, 1, 1]"""
return "diagright_down"
elif self.p4 + self.p6 <= 1 and self.p8 + self.p9 + self.p2 >= 2:
"""e.g. [1, 1, 1] [1, 1, 0]
[1, 1, 0] [1, 1, 0]
[1, 0, 0] or [0, 0, 0]"""
return "diagright_up"
elif self.p2 + self.p4 <= 1 and self.p8 + self.p7 + self.p6 >= 2:
"""e.g. [1, 0, 0] [0, 0, 0]
[1, 1, 0] [1, 1, 0]
[1, 1, 1] or [1, 1, 0]"""
return "diagleft_down"
elif self.p8 + self.p6 <= 1 and self.p2 + self.p3 + self.p4 >= 2:
"""e.g. [1, 1, 1] [0, 1, 1]
[0, 1, 1] [0, 1, 1]
[0, 0, 1] or [0, 0, 0]"""
return "diagleft_up"
# else:
# return 'save'
def _initialiseHeightFindingDict(self):
height_cropping_funcs = {}
height_cropping_funcs["horiz_left"] = self._getHorizontalLeftHeights
height_cropping_funcs["horiz_right"] = self._getHorizontalRightHeights
height_cropping_funcs["vert_up"] = self._getVerticalUpwardHeights
height_cropping_funcs["vert_down"] = self._getVerticalDonwardHeights
height_cropping_funcs["diagleft_up"] = self._getDiaganolLeftUpwardHeights
height_cropping_funcs["diagleft_down"] = self._getDiaganolLeftDownwardHeights
height_cropping_funcs["diagright_up"] = self._getHorizontalRightHeights
height_cropping_funcs["diagright_down"] = self._getHorizontalRightHeights
height_cropping_funcs["save"] = self._savePoint
return height_cropping_funcs
def _getHorizontalLeftHeights(self, x: int, y: int) -> float:
"""
Calculate heights left (west).
Parameters
----------
x: int
X coordinate.
y: int
Y coordinate.
Returns
-------
float
Height left (west).
"""
heights = [] # [self.image_data[x,y]]
for i in range(-self.search_window, self.search_window):
if i == 0:
continue
heights.append(self.image_data[x - i, y])
return heights
def _getHorizontalRightHeights(self, x, y):
"""
Calculate heights right (east).
Parameters
----------
x: int
X coordinate.
y: int
Y coordinate.
Returns
-------
float
Height right (east).
"""
heights = [] # [self.image_data[x,y]]
for i in range(-self.search_window, self.search_window):
if i == 0:
continue
heights.append(self.image_data[x + i, y])
return heights
def _getVerticalUpwardHeights(self, x, y):
"""
Calculate heights upwards (north).
Parameters
----------
x: int
X coordinate.
y: int
Y coordinate.
Returns
-------
float
Height upwards (north).
"""
heights = [] # [self.image_data[x,y]]
for i in range(-self.search_window, self.search_window):
if i == 0:
continue
heights.append(self.image_data[x, y + i])
return heights
def _getVerticalDonwardHeights(self, x, y):
"""
Calculate heights downwards (south).
Parameters
----------
x: int
X coordinate.
y: int
Y coordinate.
Returns
-------
float
Height downwards (south).
"""
heights = [] # [self.image_data[x,y]]
for i in range(-self.search_window, self.search_window):
if i == 0:
continue
heights.append(self.image_data[x, y - i])
return heights
def _getDiaganolLeftUpwardHeights(self, x, y):
"""
Calculate heights diagonal left upwards (north east).
Parameters
----------
x: int
X coordinate.
y: int
Y coordinate.
Returns
-------
float
Height to diagonal left upwards (north east).
"""
heights = [] # [self.image_data[x,y]]
for i in range(-self.search_window, self.search_window):
if i == 0:
continue
heights.append(self.image_data[x + i, y + i])
return heights
def _getDiaganolLeftDownwardHeights(self, x, y):
"""
Calculate heights diagonal left downwards (south west).
Parameters
----------
x: int
X coordinate.
y: int
Y coordinate.
Returns
-------
float
Height diagonal left downwards (south west).
"""
heights = [] # [self.image_data[x,y]]
for i in range(-self.search_window, self.search_window):
if i == 0:
continue
heights.append(self.image_data[x - i, y - i])
return heights
def _getDiaganolRightUpwardHeights(self, x: int, y: int) -> float:
"""
Calculate heights diagonal right upwards (north east).
Parameters
----------
x: int
X coordinate.
y: int
Y coordinate.
Returns
-------
float
Height diagonal right upwards (north east).
"""
heights = [] # [self.image_data[x,y]]
for i in range(-self.search_window, self.search_window):
if i == 0:
continue
heights.append(self.image_data[x - i, y + i])
return heights
def _getDiaganolRightDownwardHeights(self, x, y):
"""
Calculate heights diagonal right downwards (south east).
Parameters
----------
x: int
X coordinate.
y: int
Y coordinate.
Returns
-------
float
Height heights diagonal right downwards (south east).
"""
heights = [] # [self.image_data[x,y]]
for i in range(-self.search_window, self.search_window):
if i == 0:
continue
heights.append(self.image_data[x + i, y - i])
return heights
def _condemnPoint(self, x: int, y: int) -> float:
"""
Condemn a point.
Parameters
----------
x: int
X coordinate.
y: int
Y coordinate.
Returns
-------
float
Height to be condemned.
"""
heights = [] # [self.image_data[x,y]]
for i in range(1, self.search_window):
heights.append(10)
return heights
def _identifyHighestPoint(self, x, y, index_direction, indexed_heights):
highest_value = 0
offset = len(indexed_heights) / 2
for num, height_value in enumerate(indexed_heights):
if height_value > highest_value:
highest_point = height_value
index_position = (num + 1) - offset
if index_direction == "horiz_left":
return x - num, y
elif index_direction == "horiz_right":
return x + num, y
elif index_direction == "vert_up":
return x, y + num
elif index_direction == "vert_down":
return x, y - num
elif index_direction == "diagleft_up":
return x + num, y + num
elif index_direction == "diagleft_down":
return x + num, y - num
elif index_direction == "diagright_up":
return x - num, y + num
elif index_direction == "diagright_down":
return x - num, y - num
def finalSkeletonisationIteration(self):
"""A final skeletonisation iteration that removes "hanging" pixels.
Examples of such pixels are:
[0, 0, 0] [0, 1, 0] [0, 0, 0]
[0, 1, 1] [0, 1, 1] [0, 1, 1]
case 1: [0, 1, 0] or case 2: [0, 1, 0] or case 3: [1, 1, 0]
This is useful for the future functions that rely on local pixel environment
to make assessments about the overall shape/structure of traces"""
remaining_coordinates = np.argwhere(self.mask_being_skeletonised).tolist()
for x, y in remaining_coordinates:
(
self.p2,
self.p3,
self.p4,
self.p5,
self.p6,
self.p7,
self.p8,
self.p9,
) = genTracingFuncs.getLocalPixelsBinary(self.mask_being_skeletonised, x, y)
# Checks for case 1 pixels
if self._binaryThinCheck_b_returncount() == 2 and self._binaryFinalThinCheck_a():
self.mask_being_skeletonised[x, y] = 0
# Checks for case 2 pixels
elif self._binaryThinCheck_b_returncount() == 3 and self._binaryFinalThinCheck_b():
self.mask_being_skeletonised[x, y] = 0
def _binaryFinalThinCheck_a(self):
"""Binary final thin check A."""
if self.p2 * self.p4 == 1:
return True
elif self.p4 * self.p6 == 1:
return True
elif self.p6 * self.p8 == 1:
return True
elif self.p8 * self.p2 == 1:
return True
def _binaryFinalThinCheck_b(self):
"""Binary final thin check B."""
if self.p2 * self.p4 * self.p6 == 1:
return True
elif self.p4 * self.p6 * self.p8 == 1:
return True
elif self.p6 * self.p8 * self.p2 == 1:
return True
elif self.p8 * self.p2 * self.p4 == 1:
return True
def _binaryThinCheck_b_returncount(self):
"""Binary final thin check B return count."""
count = 0
if [self.p2, self.p3] == [0, 1]:
count += 1
if [self.p3, self.p4] == [0, 1]:
count += 1
if [self.p4, self.p5] == [0, 1]:
count += 1
if [self.p5, self.p6] == [0, 1]:
count += 1
if [self.p6, self.p7] == [0, 1]:
count += 1
if [self.p7, self.p8] == [0, 1]:
count += 1
if [self.p8, self.p9] == [0, 1]:
count += 1
if [self.p9, self.p2] == [0, 1]:
count += 1
return count
def pruneSkeleton(self):
"""Function to remove the hanging branches from the skeletons.
These are a persistent problem in the overall tracing process."""
number_of_branches = 0
coordinates = np.argwhere(self.mask_being_skeletonised == 1).tolist()
# The branches are typically short so if a branch is longer than a quarter
# of the total points its assumed to be part of the real data
length_of_trace = len(coordinates)
max_branch_length = int(length_of_trace * 0.15)
# _deleteSquareEnds(coordinates)
# first check to find all the end coordinates in the trace
potential_branch_ends = self._findBranchEnds(coordinates)
# Now check if its a branch - and if it is delete it
for x_b, y_b in potential_branch_ends:
branch_coordinates = [[x_b, y_b]]
branch_continues = True
temp_coordinates = coordinates[:]
temp_coordinates.pop(temp_coordinates.index([x_b, y_b]))
count = 0
while branch_continues:
no_of_neighbours, neighbours = genTracingFuncs.countandGetNeighbours(x_b, y_b, temp_coordinates)
# If branch continues
if no_of_neighbours == 1:
x_b, y_b = neighbours[0]
branch_coordinates.append([x_b, y_b])
temp_coordinates.pop(temp_coordinates.index([x_b, y_b]))
# If the branch reaches the edge of the main trace
elif no_of_neighbours > 1:
branch_coordinates.pop(branch_coordinates.index([x_b, y_b]))
branch_continues = False
is_branch = True
# Weird case that happens sometimes
elif no_of_neighbours == 0:
is_branch = True
branch_continues = False
if len(branch_coordinates) > max_branch_length:
branch_continues = False
is_branch = False
if is_branch:
number_of_branches += 1
for x, y in branch_coordinates:
self.mask_being_skeletonised[x, y] = 0
remaining_coordinates = np.argwhere(self.mask_being_skeletonised)
if number_of_branches == 0:
self.pruning = False
def _findBranchEnds(self, coordinates):
potential_branch_ends = []
# Most of the branch ends are just points with one neighbour
for x, y in coordinates:
if genTracingFuncs.countNeighbours(x, y, coordinates) == 1:
potential_branch_ends.append([x, y])
# Find the ends that are 3/4 neighbouring points
return potential_branch_ends
def _deleteSquareEnds(self, coordinates):
for x, y in coordinates:
pass
class reorderTrace:
@staticmethod
def linearTrace(trace_coordinates):
"""My own function to order the points from a linear trace.
This works by checking the local neighbours for a given pixel (starting
at one of the ends). If this pixel has only one neighbour in the array
of unordered points, this must be the next pixel in the trace -- and it
is added to the ordered points trace and removed from the
remaining_unordered_coords array.
If there is more than one neighbouring pixel, a fairly simple function
(checkVectorsCandidatePoints) finds which pixel incurs the smallest
change in angle compared with the rest of the trace and chooses that as
the next point.
This process is repeated until all the points are placed in the ordered
trace array or the other end point is reached."""
try:
trace_coordinates = trace_coordinates.tolist()
except AttributeError: # array is already a python list
pass
# Find one of the end points
for i, (x, y) in enumerate(trace_coordinates):
if genTracingFuncs.countNeighbours(x, y, trace_coordinates) == 1:
ordered_points = [[x, y]]
trace_coordinates.pop(i)
break
remaining_unordered_coords = trace_coordinates[:]
while remaining_unordered_coords:
if len(ordered_points) > len(trace_coordinates):
break
x_n, y_n = ordered_points[-1] # get the last point to be added to the array and find its neighbour
no_of_neighbours, neighbour_array = genTracingFuncs.countandGetNeighbours(
x_n, y_n, remaining_unordered_coords
)
if (
no_of_neighbours == 1
): # if there's only one candidate - its the next point add it to array and delete from candidate points
ordered_points.append(neighbour_array[0])
remaining_unordered_coords.pop(remaining_unordered_coords.index(neighbour_array[0]))
continue
elif no_of_neighbours > 1:
best_next_pixel = genTracingFuncs.checkVectorsCandidatePoints(x_n, y_n, ordered_points, neighbour_array)
ordered_points.append(best_next_pixel)
remaining_unordered_coords.pop(remaining_unordered_coords.index(best_next_pixel))
continue
elif no_of_neighbours == 0:
# nn, neighbour_array_all_coords = genTracingFuncs.countandGetNeighbours(x_n, y_n, trace_coordinates)
# best_next_pixel = genTracingFuncs.checkVectorsCandidatePoints(x_n, y_n, ordered_points, neighbour_array_all_coords)
best_next_pixel = genTracingFuncs.findBestNextPoint(
x_n, y_n, ordered_points, remaining_unordered_coords
)
if not best_next_pixel:
return np.array(ordered_points)
ordered_points.append(best_next_pixel)
# If the tracing has reached the other end of the trace then its finished
if genTracingFuncs.countNeighbours(x_n, y_n, trace_coordinates) == 1:
break
return np.array(ordered_points)
@staticmethod
def circularTrace(trace_coordinates):
"""An alternative implementation of the linear tracing algorithm but
with some adaptations to work with circular dna molecules"""
try:
trace_coordinates = trace_coordinates.tolist()
except AttributeError: # array is already a python list
pass
remaining_unordered_coords = trace_coordinates[:]
# Find a sensible point to start of the end points
for i, (x, y) in enumerate(trace_coordinates):
if genTracingFuncs.countNeighbours(x, y, trace_coordinates) == 2:
ordered_points = [[x, y]]
remaining_unordered_coords.pop(i)
break
# Randomly choose one of the neighbouring points as the next point
x_n = ordered_points[0][0]
y_n = ordered_points[0][1]
no_of_neighbours, neighbour_array = genTracingFuncs.countandGetNeighbours(x_n, y_n, remaining_unordered_coords)
ordered_points.append(neighbour_array[0])
remaining_unordered_coords.pop(remaining_unordered_coords.index(neighbour_array[0]))
count = 0
while remaining_unordered_coords:
x_n, y_n = ordered_points[-1] # get the last point to be added to the array and find its neighbour
no_of_neighbours, neighbour_array = genTracingFuncs.countandGetNeighbours(
x_n, y_n, remaining_unordered_coords
)
if (
no_of_neighbours == 1
): # if there's only one candidate - its the next point add it to array and delete from candidate points
ordered_points.append(neighbour_array[0])
remaining_unordered_coords.pop(remaining_unordered_coords.index(neighbour_array[0]))
continue
elif no_of_neighbours > 1:
best_next_pixel = genTracingFuncs.checkVectorsCandidatePoints(x_n, y_n, ordered_points, neighbour_array)
ordered_points.append(best_next_pixel)
remaining_unordered_coords.pop(remaining_unordered_coords.index(best_next_pixel))
continue
elif len(ordered_points) > len(trace_coordinates):
vector_start_end = abs(
math.hypot(
ordered_points[0][0] - ordered_points[-1][0], ordered_points[0][1] - ordered_points[-1][1]
)
)
if vector_start_end > 5: # Checks if trace has basically finished i.e. is close to where it started
ordered_points.pop(-1)
return np.array(ordered_points), False
else:
break
elif no_of_neighbours == 0:
# Check if the tracing is finished
nn, neighbour_array_all_coords = genTracingFuncs.countandGetNeighbours(x_n, y_n, trace_coordinates)
if ordered_points[0] in neighbour_array_all_coords:
break
# Checks for bug that happens when tracing messes up
if ordered_points[-1] == ordered_points[-3]:
ordered_points = ordered_points[:-6]
return np.array(ordered_points), False
# Maybe at a crossing with all neighbours deleted - this is crucially a point where errors often occur
else:
# best_next_pixel = genTracingFuncs.checkVectorsCandidatePoints(x_n, y_n, ordered_points, remaining_unordered_coords)
best_next_pixel = genTracingFuncs.findBestNextPoint(
x_n, y_n, ordered_points, remaining_unordered_coords
)
if not best_next_pixel:
return np.array(ordered_points), False
vector_to_new_point = abs(math.hypot(best_next_pixel[0] - x_n, best_next_pixel[1] - y_n))
if vector_to_new_point > 5: # arbitrary distinction but mostly valid probably
return np.array(ordered_points), False