X-Git-Url: http://git.euphorik.ch/?p=master-thesis.git;a=blobdiff_plain;f=Parasitemia%2FParasitemia%2FMatchingEllipses.fs;h=21961226684b1669e7087a0191cad1f1ee2b9f6c;hp=da74c65655c396bba8a4bd241ccee4ddf2283ddb;hb=84fdf7404133803fdf0dc867a4da68a144975191;hpb=10afa9a402eb88c8e073fe8b0d607faa25230eef diff --git a/Parasitemia/Parasitemia/MatchingEllipses.fs b/Parasitemia/Parasitemia/MatchingEllipses.fs index da74c65..2196122 100644 --- a/Parasitemia/Parasitemia/MatchingEllipses.fs +++ b/Parasitemia/Parasitemia/MatchingEllipses.fs @@ -9,8 +9,11 @@ open Types open Utils +// Do not take in account matching score below this when two ellipses are matched. let matchingScoreThreshold1 = 0.6 -let matchingScoreThreshold2 = 1. + +// All ellipsee with a score below this is removed. +let matchingScoreThreshold2 = 2. type private EllipseScoreFlaggedKd (matchingScore: float, e: Ellipse) = let mutable matchingScore = matchingScore @@ -18,6 +21,7 @@ type private EllipseScoreFlaggedKd (matchingScore: float, e: Ellipse) = member this.Ellipse = e member this.MatchingScore = matchingScore + member this.AddMatchingScore(score: float) = matchingScore <- matchingScore + score @@ -38,6 +42,7 @@ type MatchingEllipses (radiusMin: float) = member this.Ellipses : Ellipse list = List.ofSeq ellipses |> List.map (fun e -> e.Ellipse) + // Process all ellipses and return ellipses ordered from the best score to the worst. member this.PrunedEllipses : Ellipse list = if ellipses.Count = 0 then @@ -93,7 +98,7 @@ type MatchingEllipses (radiusMin: float) = for other in tree.Search window do if not other.Removed && other.MatchingScore < e.MatchingScore then - if e.Ellipse.Contains other.Ellipse.Cx other.Ellipse.Cy + if e.Ellipse.Scale(0.8).Contains other.Ellipse.Cx other.Ellipse.Cy then other.Removed <- true ellipses.RemoveAll(fun e -> e.Removed) |> ignore