orientation algorithm (1)
TRANSCRIPT
![Page 1: Orientation algorithm (1)](https://reader035.vdocuments.mx/reader035/viewer/2022062515/55cabe8cbb61eb9f6e8b47ef/html5/thumbnails/1.jpg)
An algorithm for segmentation of images containing non-overlapping fibrilar domains
Nils PerssonDalar Nazarian
![Page 2: Orientation algorithm (1)](https://reader035.vdocuments.mx/reader035/viewer/2022062515/55cabe8cbb61eb9f6e8b47ef/html5/thumbnails/2.jpg)
Determination of Fiber Orientation
Fiber angles range from -90° to +90°
Low-confidence (amorphous) regions show as -180°
![Page 3: Orientation algorithm (1)](https://reader035.vdocuments.mx/reader035/viewer/2022062515/55cabe8cbb61eb9f6e8b47ef/html5/thumbnails/3.jpg)
Notice how fibers of the same orientation tend to come in clumps…I think this is due to the entanglement of the tie-chains between fibers.
Determination of Fiber Orientation
![Page 4: Orientation algorithm (1)](https://reader035.vdocuments.mx/reader035/viewer/2022062515/55cabe8cbb61eb9f6e8b47ef/html5/thumbnails/4.jpg)
How?
Threshold: 0.4 0.6
θ
For every threshold,Two matrices are constructed:
Orientation…
θθθ θ
θθ θθθ
0.4φ
0.6
θθ
θφ φφφ
![Page 5: Orientation algorithm (1)](https://reader035.vdocuments.mx/reader035/viewer/2022062515/55cabe8cbb61eb9f6e8b47ef/html5/thumbnails/5.jpg)
How?
Threshold: 0.4 0.6
And Confidence
where conf ~ Mi / mi
(major / minor axis)
222 2
22 222
0.4 0.6
1.51.5
13 333
M1
m1
![Page 6: Orientation algorithm (1)](https://reader035.vdocuments.mx/reader035/viewer/2022062515/55cabe8cbb61eb9f6e8b47ef/html5/thumbnails/6.jpg)
How?
222 2
22 222
0.4 0.6
1.51.5
13 333
Now we find the maximum confidence across all thresholds…
θθθ θ
θθ θθθ
θθ
θφ φφφ
Orient.
Conf.
![Page 7: Orientation algorithm (1)](https://reader035.vdocuments.mx/reader035/viewer/2022062515/55cabe8cbb61eb9f6e8b47ef/html5/thumbnails/7.jpg)
How?
222 2
22 222
0.4 0.6
1.51.5
13 333
Now we find the maximum confidence across all thresholds…
And take their corresponding angles.
θθθ θ
θθ θθθ
θθ
θφ φφφ
222 2
23 333
Orient.
Conf.
![Page 8: Orientation algorithm (1)](https://reader035.vdocuments.mx/reader035/viewer/2022062515/55cabe8cbb61eb9f6e8b47ef/html5/thumbnails/8.jpg)
How?
222 2
22 222
0.4 0.6
1.51.5
13 333
Now we find the maximum confidence across all thresholds…
And take their corresponding angles.
θθθ θ
θθ θθθ
θθ
θφ φφφ
222 2
23 333
Orient.
Conf.
![Page 9: Orientation algorithm (1)](https://reader035.vdocuments.mx/reader035/viewer/2022062515/55cabe8cbb61eb9f6e8b47ef/html5/thumbnails/9.jpg)
How?
222 2
22 222
0.4 0.6
1.51.5
13 333
θθθ θ
θθ θθθ
θθ
θφ φφφ
222 2
23 333
θθ
φ φφφ
θθ
θ
Orient.
Conf.
Max
![Page 10: Orientation algorithm (1)](https://reader035.vdocuments.mx/reader035/viewer/2022062515/55cabe8cbb61eb9f6e8b47ef/html5/thumbnails/10.jpg)
Minor complications
Threshold: 0.4 0.6
Since the borders of the lower segment got “thresholded out” when it split from the main, their highest confidence was back when the two were connected.
This is rare and should not significantly affect spatial stats.
![Page 11: Orientation algorithm (1)](https://reader035.vdocuments.mx/reader035/viewer/2022062515/55cabe8cbb61eb9f6e8b47ef/html5/thumbnails/11.jpg)
But it works on noisy images with gradients in intensity across fibers…