9f4fdd051d5553765bb2ba113e42d5e67ddadc2f
1
module ParasitemiaCore.Classifier
4 open System.Collections.Generic
13 type private EllipseFlaggedKd (e
: Ellipse) =
14 inherit Ellipse (e
.Cx, e
.Cy, e
.A, e
.B, e
.Alpha)
16 member val Removed = false with get
, set
18 interface KdTree.I2DCoords with
19 member this
.X = this
.Cx
20 member this
.Y = this
.Cy
22 let findCells (ellipses
: Ellipse list) (parasites
: ParasitesMarker.Result) (img
: Image<Gray, float32
>) (config
: Config.Config) : Cell list =
27 let infection = parasites
.infection.Copy() // To avoid to modify the parameter.
29 // This is the minimum window size to check if other ellipses touch 'e'.
30 let searchRegion (e
: Ellipse) = { KdTree.minX
= e
.Cx - (e
.A + config
.RBCRadius.Max)
31 KdTree.maxX
= e
.Cx + (e
.A + config
.RBCRadius.Max)
32 KdTree.minY
= e
.Cy - (e
.A + config
.RBCRadius.Max)
33 KdTree.maxY
= e
.Cy + (e
.A + config
.RBCRadius.Max) }
35 // The minimum window to contain a given ellipse.
36 let ellipseWindow (e
: Ellipse) =
37 let cx, cy
= roundInt
e.Cx, roundInt
e.Cy
38 let a = int (e.A + 0.5f)
39 cx - a, cy
- a, cx + a, cy
+ a
46 // Return 'true' if the point 'p' is owned by e.
47 // The lines represents all intersections with other ellipses.
48 let pixelOwnedByE (p
: PointF) (e: Ellipse) (others
: (Ellipse * Line) list) =
51 let c = PointF(e.Cx, e.Cy)
53 for e', d1 in others do
54 let d2 = lineFromTwoPoints c p
55 let c' = PointF(e'.Cx, e'.Cy)
56 let v = pointFromTwoLines
d1 (lineFromTwoPoints
c c')
57 let case1 = sign (v.X - c.X) <> sign (v.X - c'.X) || Utils.squaredDistanceTwoPoints
v c > Utils.squaredDistanceTwoPoints
v c'
58 if not (Single.IsInfinity d2.A)
60 let p' = Utils.pointFromTwoLines
d1 d2
64 if abs d < 0.001f then c.Y - p.Y, c.Y - p'.Y else d, c.X - p'.X
66 // Yield 'false' when the point is owned by another ellipse.
69 yield sign delta <> sign delta' || Utils.squaredDistanceTwoPoints
c p' > Utils.squaredDistanceTwoPoints c p
71 yield sign delta = sign delta' && Utils.squaredDistanceTwoPoints
c p' < Utils.squaredDistanceTwoPoints c p
76 let ellipses = ellipses |> List.map EllipseFlaggedKd
78 // 1) Associate touching ellipses with each ellipses and remove ellipse with more than two intersections.
79 let tree = KdTree.Tree.BuildTree ellipses
80 let neighbors (e: EllipseFlaggedKd) : (EllipseFlaggedKd * PointF * PointF) list =
83 tree.Search (searchRegion e)
84 // We only keep the ellipses touching 'e'.
85 |> List.choose (fun otherE ->
88 match EEOver.EEOverlapArea e otherE with
89 | Some (_, px, _) when px.Length > 2 ->
90 otherE.Removed <- true
92 | Some (area, px, py) when area > 0.f && px.Length = 2 ->
93 Some (otherE, PointF(px.[0], py.[0]), PointF(px.[1], py.[1]))
101 // We reverse the list to get the lower score ellipses first.
102 let ellipsesWithNeigbors = ellipses |> List.map (fun e -> e, neighbors e) |> List.rev
104 // 2) Remove ellipses touching the edges.
106 if e.isOutside w_f h_f then e.Removed <- true
108 // 3) Remove ellipses with a high standard deviation (high contrast).
109 let imgData = img.Data
110 let globalStdDeviation = MathNet.Numerics.Statistics.Statistics.PopulationStandardDeviation(seq {
111 for y in 0 .. h - 1 do
112 for x in 0 .. w - 1 do
113 yield float imgData.[y, x, 0] })
118 let shrinkedE = e.Scale 0.9f
119 let minX, minY, maxX, maxY = ellipseWindow shrinkedE
121 let stdDeviation = MathNet.Numerics.Statistics.Statistics.StandardDeviation (seq {
122 for y in (if minY < 0 then 0 else minY) .. (if maxY >= h then h - 1 else maxY) do
123 for x in (if minX < 0 then 0 else minX) .. (if maxX >= w then w - 1 else maxX) do
124 if shrinkedE.Contains (float32 x) (float32 y)
126 yield float imgData.[y, x, 0] })
128 if stdDeviation > globalStdDeviation * config.Parameters.standardDeviationMaxRatio then
131 // 4) Remove ellipses with little area.
132 let minArea = config.RBCRadius.MinArea
133 for e, neighbors in ellipsesWithNeigbors do
136 let minX, minY, maxX, maxY = ellipseWindow e
139 for y in (if minY < 0 then 0 else minY) .. (if maxY >= h then h - 1 else maxY) do
140 for x in (if minX < 0 then 0 else minX) .. (if maxX >= w then w - 1 else maxX) do
141 let p = PointF(float32 x, float32 y)
142 if pixelOwnedByE p e (neighbors |> List.choose (fun (otherE, p1, p2) -> if otherE.Removed then None else Some (otherE :> Ellipse, Utils.lineFromTwoPoints p1 p2)))
146 if area < int minArea
150 // 5) Define pixels associated to each ellipse and create the cells.
152 |> List.choose (fun (e, neighbors) ->
157 let minX, minY, maxX, maxY = ellipseWindow e
159 let infectedPixels = List<Point>()
160 let mutable stainPixels = 0
161 let mutable darkStainPixels = 0
162 let mutable nbElement = 0
164 let elements = new Matrix<byte>(maxY - minY + 1, maxX - minX + 1)
165 for y in minY .. maxY do
166 for x in minX .. maxX do
167 let p = PointF(float32 x, float32 y)
168 if pixelOwnedByE p e (neighbors |> List.choose (fun (otherE, p1, p2) -> if otherE.Removed then None else Some (otherE :> Ellipse, Utils.lineFromTwoPoints p1 p2)))
170 elements.[y-minY, x-minX] <- 1uy
171 nbElement <- nbElement + 1
173 if infection.Data.[y, x, 0] > 0uy
175 infectedPixels.Add(Point(x, y))
177 if parasites.stain.Data.[y, x, 0] > 0uy
179 stainPixels <- stainPixels + 1
181 if parasites.darkStain.Data.[y, x, 0] > 0uy
183 darkStainPixels <- darkStainPixels + 1
186 if float darkStainPixels > config.Parameters.maxDarkStainRatio * (float nbElement) ||
187 float stainPixels > config.Parameters.maxStainRatio * (float nbElement)
190 elif infectedPixels.Count >= 1
192 let infectionToRemove = ImgTools.connectedComponents parasites.stain infectedPixels
193 for p in infectionToRemove do
194 infection.Data.[p.Y, p.X, 0] <- 0uy
199 Some { cellClass = cellClass
200 center = Point(roundInt e.Cx, roundInt e.Cy)
201 infectedArea = infectedPixels.Count
202 stainArea = stainPixels
203 elements = elements })