CNF:Weighted Mesh To Image: Difference between revisions
Jump to navigation
Jump to search
Spyridon97 (talk | contribs) |
Spyridon97 (talk | contribs) |
||
| Line 17: | Line 17: | ||
Comparison Metrics: | Comparison Metrics: | ||
# | # Let a and b be the sets of pixel values of input and output image, then the mean weighted pixel difference value is: | ||
## [[File:MeanWeightedPixelValueFormula.png|300px|File:MeanWeightedPixelValueFormula.png]] | ## [[File:MeanWeightedPixelValueFormula.png|300px|File:MeanWeightedPixelValueFormula.png]] | ||
# Average Hausdorff Distance (itk filter) | # Average Hausdorff Distance (itk filter) | ||
Revision as of 17:27, 10 June 2020
Repository
Code
Summer 2020
Create a new image using the weights of:
- k-nearest-neighbors points as values in a weighted-mean, were weight[i] = 1 / distance(pixel-point, neighbor-point[i]) ^ power.
- cell points as values in a weighted-mean, were weight[i] = 1 / distance(pixel-point, cell-point[i]) ^ power.
- Note: If the pixel point is not inside a cell, then the algorithm `1` will be used.
- the intersection set of k-nearest-neighbors points and cell points as values in a weighted-mean, were weight[i] = 1 / distance(pixel-point, intersection-point[i]) ^ power.
- Note 1: If the Intersection set is empty, then the algorithm `2` will be used.
- Note 2: If the pixel point is not inside a cell, then the algorithm `1` will be used.
- cell points as values in a weighted-mean, were weight[i] = probe-value[i] based on the location of each pixel point inside a cell. Probing values are result of FindCell function.
- Note: If the pixel point is not inside a cell, then the algorithm `1` will be used.
Comparison Metrics:
- Let a and b be the sets of pixel values of input and output image, then the mean weighted pixel difference value is:
- Average Hausdorff Distance (itk filter)
- Similarity Index (itk filter)
Comparison Examples
Summer 2020
Left: Mesh, Middle: Algorithm Result. Right: Image
KNN, number of points = 4, power = 1.5
- Mean Weighted pixel value difference: 0.000395461
- Average Hausdorff Distance: 0.030885
- Similarity Index: 0.986463
Cell Points, number of points = 4, power = 1.5
- Mean Weighted pixel value difference: 0.0002258
- Average Hausdorff Distance: 0.030885
- Similarity Index: 0.986463
Intersection of KNN and Cell points, number of points = 5, power = 1.5
- Mean Weighted pixel value difference: 0.000273839
- Average Hausdorff Distance: 0.030885
- Similarity Index: 0.986463
Cell points with probing weights, number of points = 4, power = 1.5
- Mean Weighted pixel value difference: 9.17551e-05
- Average Hausdorff Distance: 0.030885
- Similarity Index: 0.986463
Best Algorithm
Evidently, the best algorithm both visually and by looking into the metrics is algorithm 4.
Changed Weights Examples
Summer 2020
Inverted weighted abs(weight[i] - maxWeight)
Algorithm 4 will be used