Changes between Version 9 and Version 10 of barSoftwareGapFillDetails

Timestamp:

07/25/11 14:53:36 (13 years ago)

Author:

pmajka

Comment:

--

barSoftwareGapFillDetails

@@ -45 +45 @@
 The gap filling algorithm is applied individually for each seed label thus different regions may be processed with different value of `GrowLevel`. Information about which `GrowLevel` was used to trace a particular path is stored in its attributes.
 
-Exemplary result of the gap filling algorithm applied to 47 paths from 13th coronal section (2.1mm ant. from bregma) from Paxinos and Franklin ''The Mouse Brain In Stereotaxic Coordinates, third edition''.
-
-||= optimal grow level =||= number of paths =||
-||  0       ||  28  ||
-||  1       ||  9   ||
-||  2       ||  10  ||
-
 ==== Preconfiguration ====
 
@@ -61 +54 @@
 denote the number of dilation filter applications. 
 
-==== Algorithm performance ====
+==== Algorithm efficacy and limitations ====
+
+Exemplary result of the gap filling algorithm applied to 47 paths from 13th coronal section (2.1mm ant. from bregma) from Paxinos and Franklin ''The Mouse Brain In Stereotaxic Coordinates, third edition''.
+
+||= optimal grow level =||= number of paths =||
+||  0       ||  28  ||
+||  1       ||  9   ||
+||  2       ||  10  ||
 
 The performance of the algorithm depends on the initial size of the structure and on the resolution of input data but in practice, already for structures on the order of diameter around 10 pixels, gap detection works well. Intensive use of this algorithm may distort or even erase the some (particularly narrow) structures. There is no specific mechanism implemented against such behaviour but in practice we have not encountered problems of this type. If a very accurate reconstruction is required, the best policy is to prepare a precise contour slide so there is no need to apply gap filling.