|
71 | 71 | * {@code phi_t = g (alpha kappa + c) |grad phi| + beta grad g . grad phi}. The |
72 | 72 | * edge stopping function is {@code g = 1 / (1 + (|grad u_sigma| / |
73 | 73 | * lambda)^2)}, where {@code u_sigma} is the image rescaled to [0, 1] and |
74 | | - * smoothed by a |
75 | | - * Gaussian of standard deviation {@code sigma} and {@code lambda} is a tenth |
| 74 | + * smoothed by a Gaussian of standard deviation {@code sigma} and |
| 75 | + * {@code lambda} is a tenth |
76 | 76 | * of the largest gradient magnitude, so that {@code g} is close to 0 on the |
77 | 77 | * strongest edges and to 1 in flat regions. The contour expands ({@code c > |
78 | 78 | * 0}) or shrinks ({@code c < 0}) until it is stopped and attracted by |
|
88 | 88 | * of the unit normals between adjacent pixels for the curvature (which thus |
89 | 89 | * also removes isolated pixels). The time step is chosen for stability and, |
90 | 90 | * for Chan-Vese, so that the contour moves by at most half a pixel per |
91 | | - * iteration. Every five iterations, the level-set function is reinitialized to a signed distance function: pixels next |
92 | | - * to the zero level set keep their sub-pixel distance estimate {@code phi / |
93 | | - * |grad phi|}, and all others get the signed distance of the current mask. |
| 91 | + * iteration. Every five iterations, the level-set function is reinitialized |
| 92 | + * to a signed distance function: pixels next to the zero level set keep |
| 93 | + * their sub-pixel distance estimate {@code phi / |grad phi|}, and all others |
| 94 | + * get the signed distance of the current mask. |
94 | 95 | * The evolution stops after {@code maxIterations} iterations, or earlier when, |
95 | 96 | * between two reinitializations, at most {@code tolerance} times the number of |
96 | 97 | * inside pixels have changed sides. The computation works in any number of |
97 | 98 | * dimensions, with anisotropic calibration. |
98 | 99 | * </p> |
99 | 100 | * <p> |
100 | | - * Both models are implemented from the cited papers. The level-set framework |
| 101 | + * Both models are implemented from the cited papers; the code of the Fiji |
| 102 | + * Level Sets plugin was not consulted, and its parameters do not carry over. |
| 103 | + * The level-set framework |
101 | 104 | * is that of S. Osher and J. A. Sethian ("Fronts propagating with |
102 | 105 | * curvature-dependent speed", <i>J. Comput. Phys.</i> 79(1): 12–49, |
103 | 106 | * 1988). |
|
0 commit comments