image-js 0.0.0-next-e30968a2d8

package/lib/operations/thresholds/minError.js

@@ -0,0 +1,90 @@
+"use strict";
+/*
+ * see http://rsb.info.nih.gov/ij/developer/source/ij/process/AutoThresholder.java.html
+ * The method is present in: An iterative implementation of Kittler and Illingworth's Minimum Error
+ * thresholding:Kittler, J & Illingworth, J (1986), "Minimum error thresholding", Pattern Recognition 19: 41-47
+ * @param histogram - the histogram of the image
+ * @param total - the number of pixels in the image
+ * @returns {number} - the threshold
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Return a threshold for a histogram using Li algorithm.
+ *
+ * @param histogram - Image histogram.
+ * @param total - Number of pixels in the image.
+ * @returns The threshold.
+ */
+function minError(histogram, total) {
+    let threshold;
+    let Tprev = -2;
+    let mu, nu, p, q, sigma2, tau2, w0, w1, w2, sqterm, temp;
+    /* Calculate the mean gray-level */
+    let mean = 0.0;
+    for (let ih = 0; ih < histogram.length; ih++) {
+        mean += ih * histogram[ih];
+    }
+    mean /= total;
+    threshold = mean;
+    while (threshold !== Tprev) {
+        // Calculate some statistics.
+        const sumA1 = sumA(histogram, threshold);
+        const sumA2 = sumA(histogram, histogram.length - 1);
+        const sumB1 = sumB(histogram, threshold);
+        const sumB2 = sumB(histogram, histogram.length - 1);
+        const sumC1 = sumC(histogram, threshold);
+        const sumC2 = sumC(histogram, histogram.length - 1);
+        mu = sumB1 / sumA1;
+        nu = (sumB2 - sumB1) / (sumA2 - sumA1);
+        p = sumA1 / sumA2;
+        q = (sumA2 - sumA1) / sumA2;
+        sigma2 = sumC1 / sumA1 - mu * mu;
+        tau2 = (sumC2 - sumC1) / (sumA2 - sumA1) - nu * nu;
+        // The terms of the quadratic equation to be solved.
+        w0 = 1.0 / sigma2 - 1.0 / tau2;
+        w1 = mu / sigma2 - nu / tau2;
+        w2 =
+            (mu * mu) / sigma2 -
+                (nu * nu) / tau2 +
+                Math.log10((sigma2 * (q * q)) / (tau2 * (p * p)));
+        // If the next threshold would be imaginary, return with the current one.
+        sqterm = w1 * w1 - w0 * w2;
+        if (sqterm < 0) {
+            return threshold;
+        }
+        // The updated threshold is the integer part of the solution of the quadratic equation.
+        Tprev = threshold;
+        temp = (w1 + Math.sqrt(sqterm)) / w0;
+        if (isNaN(temp)) {
+            threshold = Tprev;
+        }
+        else {
+            threshold = Math.floor(temp);
+        }
+    }
+    return threshold;
+}
+exports.default = minError;
+// aux func
+function sumA(y, j) {
+    let x = 0;
+    for (let i = 0; i <= j; i++) {
+        x += y[i];
+    }
+    return x;
+}
+function sumB(y, j) {
+    let x = 0;
+    for (let i = 0; i <= j; i++) {
+        x += i * y[i];
+    }
+    return x;
+}
+function sumC(y, j) {
+    let x = 0;
+    for (let i = 0; i <= j; i++) {
+        x += i * i * y[i];
+    }
+    return x;
+}
+//# sourceMappingURL=minError.js.map

package/lib/operations/thresholds/minError.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"minError.js","sourceRoot":"","sources":["../../../src/operations/thresholds/minError.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;AAEH;;;;;;GAMG;AACH,SAAwB,QAAQ,CAC9B,SAAsB,EACtB,KAAa;IAEb,IAAI,SAAS,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC;IAEzD,mCAAmC;IACnC,IAAI,IAAI,GAAG,GAAG,CAAC;IACf,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;QAC5C,IAAI,IAAI,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;KAC5B;IAED,IAAI,IAAI,KAAK,CAAC;IAEd,SAAS,GAAG,IAAI,CAAC;IAEjB,OAAO,SAAS,KAAK,KAAK,EAAE;QAC1B,6BAA6B;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEpD,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC;QACnB,EAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;QACvC,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC;QAClB,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;QAC5B,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,EAAE,GAAG,EAAE,CAAC;QACjC,IAAI,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QAEnD,oDAAoD;QACpD,EAAE,GAAG,GAAG,GAAG,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC;QAC/B,EAAE,GAAG,EAAE,GAAG,MAAM,GAAG,EAAE,GAAG,IAAI,CAAC;QAC7B,EAAE;YACA,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM;gBAClB,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI;gBAChB,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpD,yEAAyE;QACzE,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAC3B,IAAI,MAAM,GAAG,CAAC,EAAE;YACd,OAAO,SAAS,CAAC;SAClB;QAED,uFAAuF;QACvF,KAAK,GAAG,SAAS,CAAC;QAClB,IAAI,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC;QAErC,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE;YACf,SAAS,GAAG,KAAK,CAAC;SACnB;aAAM;YACL,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;SAC9B;KACF;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AA3DD,2BA2DC;AAED,WAAW;AAEX,SAAS,IAAI,CAAC,CAAc,EAAE,CAAS;IACrC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;KACX;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,IAAI,CAAC,CAAc,EAAE,CAAS;IACrC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;KACf;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,IAAI,CAAC,CAAc,EAAE,CAAS;IACrC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;KACnB;IACD,OAAO,CAAC,CAAC;AACX,CAAC"}

package/lib/operations/thresholds/minimum.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Return a threshold for a histogram.
+ *
+ * @param histogram - Image histogram.
+ * @returns The threshold.
+ */
+export default function minimum(histogram: Uint32Array): number;
+//# sourceMappingURL=minimum.d.ts.map

package/lib/operations/thresholds/minimum.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"minimum.d.ts","sourceRoot":"","sources":["../../../src/operations/thresholds/minimum.ts"],"names":[],"mappings":"AAQA;;;;;GAKG;AACH,MAAM,CAAC,OAAO,UAAU,OAAO,CAAC,SAAS,EAAE,WAAW,GAAG,MAAM,CAiC9D"}

package/lib/operations/thresholds/minimum.js

@@ -0,0 +1,78 @@
+"use strict";
+// see https://github.com/fiji/Auto_Threshold/blob/master/src/main/java/fiji/threshold/Auto_Threshold.java
+// J. M. S. Prewitt and M. L. Mendelsohn, "The analysis of cell images," in
+// Annals of the New York Academy of Sciences, vol. 128, pp. 1035-1053, 1966.
+// ported to ImageJ plugin by G.Landini from Antti Niemisto's Matlab code (GPL)
+// Original Matlab code Copyright (C) 2004 Antti Niemisto
+// See http://www.cs.tut.fi/~ant/histthresh/ for an excellent slide presentation
+// and the original Matlab code
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Return a threshold for a histogram.
+ *
+ * @param histogram - Image histogram.
+ * @returns The threshold.
+ */
+function minimum(histogram) {
+    if (histogram.length < 2) {
+        // validate that the histogram has at least two color values
+        return 0;
+    }
+    let iterations = 0; // number of iterations of the smoothing process
+    let threshold = -1;
+    let max = -1; // maximum color value with a greater number of pixels to 0
+    let histogramCopy = new Array(histogram.length); // a copy of the histogram
+    for (let i = 0; i < histogram.length; i++) {
+        histogramCopy[i] = histogram[i];
+        if (histogram[i] > 0) {
+            max = i;
+        }
+    }
+    while (!bimodalTest(histogramCopy)) {
+        histogramCopy = smoothed(histogramCopy);
+        iterations++;
+        if (iterations > 10000) {
+            // if they occur more than 10000 iterations it returns -1
+            return threshold;
+        }
+    }
+    for (let i = 1; i < max; i++) {
+        if (histogramCopy[i - 1] > histogramCopy[i] &&
+            histogramCopy[i + 1] >= histogramCopy[i]) {
+            threshold = i;
+            break;
+        }
+    }
+    return threshold;
+}
+exports.default = minimum;
+function smoothed(histogram) {
+    // Smooth with a 3 point running mean filter
+    const auHistogram = new Array(histogram.length); // a copy of the histograma for the smoothing process
+    for (let i = 1; i < histogram.length - 1; i++) {
+        auHistogram[i] = (histogram[i - 1] + histogram[i] + histogram[i + 1]) / 3;
+    }
+    auHistogram[0] = (histogram[0] + histogram[1]) / 3;
+    auHistogram[histogram.length - 1] =
+        (histogram[histogram.length - 2] + histogram[histogram.length - 1]) / 3;
+    return auHistogram;
+}
+function bimodalTest(histogram) {
+    // It is responsible for determining if a histogram is bimodal
+    const len = histogram.length;
+    let isBimodal = false;
+    let peaks = 0;
+    for (let k = 1; k < len - 1; k++) {
+        if (histogram[k - 1] < histogram[k] && histogram[k + 1] < histogram[k]) {
+            peaks++;
+            if (peaks > 2) {
+                return false;
+            }
+        }
+    }
+    if (peaks === 2) {
+        isBimodal = true;
+    }
+    return isBimodal;
+}
+//# sourceMappingURL=minimum.js.map

package/lib/operations/thresholds/minimum.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"minimum.js","sourceRoot":"","sources":["../../../src/operations/thresholds/minimum.ts"],"names":[],"mappings":";AAAA,0GAA0G;AAC1G,2EAA2E;AAC3E,6EAA6E;AAC7E,+EAA+E;AAC/E,yDAAyD;AACzD,gFAAgF;AAChF,+BAA+B;;AAE/B;;;;;GAKG;AACH,SAAwB,OAAO,CAAC,SAAsB;IACpD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;QACxB,4DAA4D;QAC5D,OAAO,CAAC,CAAC;KACV;IACD,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,gDAAgD;IACpE,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;IACnB,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,2DAA2D;IACzE,IAAI,aAAa,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,0BAA0B;IAC3E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACzC,aAAa,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;YACpB,GAAG,GAAG,CAAC,CAAC;SACT;KACF;IACD,OAAO,CAAC,WAAW,CAAC,aAAa,CAAC,EAAE;QAClC,aAAa,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC;QACxC,UAAU,EAAE,CAAC;QACb,IAAI,UAAU,GAAG,KAAK,EAAE;YACtB,yDAAyD;YACzD,OAAO,SAAS,CAAC;SAClB;KACF;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QAC5B,IACE,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC;YACvC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,EACxC;YACA,SAAS,GAAG,CAAC,CAAC;YACd,MAAM;SACP;KACF;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAjCD,0BAiCC;AACD,SAAS,QAAQ,CAAC,SAAmB;IACnC,4CAA4C;IAC5C,MAAM,WAAW,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,qDAAqD;IACtG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QAC7C,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;KAC3E;IACD,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACnD,WAAW,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/B,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC1E,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,SAAS,WAAW,CAAC,SAAmB;IACtC,8DAA8D;IAC9D,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC;IAC7B,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QAChC,IAAI,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE;YACtE,KAAK,EAAE,CAAC;YACR,IAAI,KAAK,GAAG,CAAC,EAAE;gBACb,OAAO,KAAK,CAAC;aACd;SACF;KACF;IACD,IAAI,KAAK,KAAK,CAAC,EAAE;QACf,SAAS,GAAG,IAAI,CAAC;KAClB;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/lib/operations/thresholds/moments.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Return a threshold for a histogram.
+ *
+ * @param histogram - Image histogram.
+ * @param total - Number of pixels in the image.
+ * @returns The threshold.
+ */
+export default function moments(histogram: Uint32Array, total: number): number;
+//# sourceMappingURL=moments.d.ts.map

package/lib/operations/thresholds/moments.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"moments.d.ts","sourceRoot":"","sources":["../../../src/operations/thresholds/moments.ts"],"names":[],"mappings":"AASA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,OAAO,CAAC,SAAS,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CA2C7E"}

package/lib/operations/thresholds/moments.js

@@ -0,0 +1,62 @@
+"use strict";
+// see https://github.com/fiji/Auto_Threshold/blob/master/src/main/java/fiji/threshold/Auto_Threshold.java
+// W. Tsai, "Moment-preserving thresholding: a new approach," Computer Vision,
+// Graphics, and Image Processing, vol. 29, pp. 377-393, 1985.
+// Ported to ImageJ plugin by G.Landini from the the open source project FOURIER 0.8
+// by M. Emre Celebi , Department of Computer Science, Louisiana State University in Shreveport
+// Shreveport, LA 71115, USA
+// http://sourceforge.net/projects/fourier-ipal
+// http://www.lsus.edu/faculty/~ecelebi/fourier.htm
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Return a threshold for a histogram.
+ *
+ * @param histogram - Image histogram.
+ * @param total - Number of pixels in the image.
+ * @returns The threshold.
+ */
+function moments(histogram, total) {
+    // moments
+    const m0 = 1.0;
+    let m1 = 0.0;
+    let m2 = 0.0;
+    let m3 = 0.0;
+    let sum = 0.0;
+    let threshold = -1;
+    const histogramLength = histogram.length;
+    const normalizedHistogram = new Array(histogramLength);
+    for (let i = 0; i < histogramLength; i++) {
+        normalizedHistogram[i] = histogram[i] / total;
+    }
+    /* Calculate the first, second, and third order moments */
+    for (let i = 0; i < histogramLength; i++) {
+        m1 += i * normalizedHistogram[i];
+        m2 += i * i * normalizedHistogram[i];
+        m3 += i * i * i * normalizedHistogram[i];
+    }
+    /*
+       First 4 moments of the gray-level image should match the first 4 moments
+       of the target binary image. This leads to 4 equalities whose solutions
+       are given in the Appendix of Ref. 1
+       */
+    const cd = m0 * m2 - m1 * m1; // determinant of the matriz of hankel for moments 2x2
+    const c0 = (-m2 * m2 + m1 * m3) / cd;
+    const c1 = (m0 * -m3 + m2 * m1) / cd;
+    // new two gray values where z0<z1
+    const z0 = 0.5 * (-c1 - Math.sqrt(c1 * c1 - 4.0 * c0));
+    const z1 = 0.5 * (-c1 + Math.sqrt(c1 * c1 - 4.0 * c0));
+    const p0 = (z1 - m1) /
+        (z1 -
+            z0); /* Fraction of the object pixels in the target binary image (p0z0+p1z1=m1) */
+    // The threshold is the gray-level closest to the p0-tile of the normalized histogram
+    for (let i = 0; i < histogramLength; i++) {
+        sum += normalizedHistogram[i];
+        if (sum > p0) {
+            threshold = i;
+            break;
+        }
+    }
+    return threshold;
+}
+exports.default = moments;
+//# sourceMappingURL=moments.js.map

package/lib/operations/thresholds/moments.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"moments.js","sourceRoot":"","sources":["../../../src/operations/thresholds/moments.ts"],"names":[],"mappings":";AAAA,0GAA0G;AAC1G,8EAA8E;AAC9E,8DAA8D;AAC9D,oFAAoF;AACpF,+FAA+F;AAC/F,4BAA4B;AAC5B,+CAA+C;AAC/C,mDAAmD;;AAEnD;;;;;;GAMG;AACH,SAAwB,OAAO,CAAC,SAAsB,EAAE,KAAa;IACnE,UAAU;IACV,MAAM,EAAE,GAAG,GAAG,CAAC;IACf,IAAI,EAAE,GAAG,GAAG,CAAC;IACb,IAAI,EAAE,GAAG,GAAG,CAAC;IACb,IAAI,EAAE,GAAG,GAAG,CAAC;IACb,IAAI,GAAG,GAAG,GAAG,CAAC;IACd,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;IACnB,MAAM,eAAe,GAAG,SAAS,CAAC,MAAM,CAAC;IACzC,MAAM,mBAAmB,GAAG,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;IACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE;QACxC,mBAAmB,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;KAC/C;IACD,0DAA0D;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE;QACxC,EAAE,IAAI,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;QACjC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;QACrC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;KAC1C;IACD;;;;SAIK;IACL,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,sDAAsD;IACpF,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;IACrC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;IACrC,kCAAkC;IAClC,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;IACvD,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;IACvD,MAAM,EAAE,GACN,CAAC,EAAE,GAAG,EAAE,CAAC;QACT,CAAC,EAAE;YACD,EAAE,CAAC,CAAC,CAAC,6EAA6E;IACtF,qFAAqF;IACrF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE;QACxC,GAAG,IAAI,mBAAmB,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,GAAG,GAAG,EAAE,EAAE;YACZ,SAAS,GAAG,CAAC,CAAC;YACd,MAAM;SACP;KACF;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AA3CD,0BA2CC"}

package/lib/operations/thresholds/otsu.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Return a threshold for a histogram using Otsu algorithm.
+ *
+ * @param histogramCounts - The image histogram.
+ * @param total - Total number of pixels of the image.
+ * @returns The threshold.
+ */
+export declare function otsu(histogramCounts: Uint32Array, total: number): number;
+//# sourceMappingURL=otsu.d.ts.map

package/lib/operations/thresholds/otsu.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"otsu.d.ts","sourceRoot":"","sources":["../../../src/operations/thresholds/otsu.ts"],"names":[],"mappings":"AAOA;;;;;;GAMG;AACH,wBAAgB,IAAI,CAAC,eAAe,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CA2BxE"}

package/lib/operations/thresholds/otsu.js

@@ -0,0 +1,43 @@
+"use strict";
+/*
+ * The method is present in: Otsu, N (1979), "A threshold selection method from gray-level histograms", IEEE Trans. Sys., Man., Cyber. 9: 62-66
+ * The Otsu implementation is based on: https://en.wikipedia.org/wiki/Otsu's_method
+ * @param histogram - the histogram of the image
+ * @returns {number} - the threshold
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.otsu = void 0;
+/**
+ * Return a threshold for a histogram using Otsu algorithm.
+ *
+ * @param histogramCounts - The image histogram.
+ * @param total - Total number of pixels of the image.
+ * @returns The threshold.
+ */
+function otsu(histogramCounts, total) {
+    let sumB = 0;
+    let wB = 0;
+    let maximum = 0;
+    let level = 0;
+    let sum1 = 0;
+    for (let i = 0; i < histogramCounts.length; i++) {
+        sum1 += i * histogramCounts[i];
+    }
+    for (let ii = 0; ii < histogramCounts.length; ii++) {
+        wB = wB + histogramCounts[ii];
+        const wF = total - wB;
+        if (wB === 0 || wF === 0) {
+            continue;
+        }
+        sumB = sumB + ii * histogramCounts[ii];
+        const mF = (sum1 - sumB) / wF;
+        const between = wB * wF * (sumB / wB - mF) * (sumB / wB - mF);
+        if (between >= maximum) {
+            level = ii;
+            maximum = between;
+        }
+    }
+    return level;
+}
+exports.otsu = otsu;
+//# sourceMappingURL=otsu.js.map

package/lib/operations/thresholds/otsu.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"otsu.js","sourceRoot":"","sources":["../../../src/operations/thresholds/otsu.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAEH;;;;;;GAMG;AACH,SAAgB,IAAI,CAAC,eAA4B,EAAE,KAAa;IAC9D,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC/C,IAAI,IAAI,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;KAChC;IAED,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,eAAe,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;QAClD,EAAE,GAAG,EAAE,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,GAAG,EAAE,CAAC;QACtB,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;YACxB,SAAS;SACV;QACD,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC9D,IAAI,OAAO,IAAI,OAAO,EAAE;YACtB,KAAK,GAAG,EAAE,CAAC;YACX,OAAO,GAAG,OAAO,CAAC;SACnB;KACF;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AA3BD,oBA2BC"}

package/lib/operations/thresholds/percentile.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Return a threshold for a histogram using percentiles.
+ *
+ * @param histogram - Image histogram.
+ * @returns The threshold.
+ */
+export default function percentile(histogram: Uint32Array): number;
+//# sourceMappingURL=percentile.d.ts.map

package/lib/operations/thresholds/percentile.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"percentile.d.ts","sourceRoot":"","sources":["../../../src/operations/thresholds/percentile.ts"],"names":[],"mappings":"AAQA;;;;;GAKG;AACH,MAAM,CAAC,OAAO,UAAU,UAAU,CAAC,SAAS,EAAE,WAAW,GAAG,MAAM,CAiBjE"}

package/lib/operations/thresholds/percentile.js

@@ -0,0 +1,39 @@
+"use strict";
+// See http://imagej.nih.gov/ij/download/tools/source/ij/process/AutoThresholder.java
+// W. Doyle, "Operation useful for similarity-invariant pattern recognition,"
+// Journal of the Association for Computing Machinery, vol. 9,pp. 259-267, 1962.
+// ported to ImageJ plugin by G.Landini from Antti Niemisto's Matlab code (GPL)
+// Original Matlab code Copyright (C) 2004 Antti Niemisto
+// See http://www.cs.tut.fi/~ant/histthresh/ for an excellent slide presentation
+// and the original Matlab code.
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Return a threshold for a histogram using percentiles.
+ *
+ * @param histogram - Image histogram.
+ * @returns The threshold.
+ */
+function percentile(histogram) {
+    let threshold = -1;
+    const percentile = 0.5; // default fraction of foreground pixels
+    const avec = new Array(histogram.length);
+    const total = partialSum(histogram, histogram.length - 1);
+    let temp = 1.0;
+    for (let i = 0; i < histogram.length; i++) {
+        avec[i] = Math.abs(partialSum(histogram, i) / total - percentile);
+        if (avec[i] < temp) {
+            temp = avec[i];
+            threshold = i;
+        }
+    }
+    return threshold;
+}
+exports.default = percentile;
+function partialSum(histogram, endIndex) {
+    let x = 0;
+    for (let i = 0; i <= endIndex; i++) {
+        x += histogram[i];
+    }
+    return x;
+}
+//# sourceMappingURL=percentile.js.map

package/lib/operations/thresholds/percentile.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"percentile.js","sourceRoot":"","sources":["../../../src/operations/thresholds/percentile.ts"],"names":[],"mappings":";AAAA,qFAAqF;AACrF,6EAA6E;AAC7E,gFAAgF;AAChF,+EAA+E;AAC/E,yDAAyD;AACzD,gFAAgF;AAChF,gCAAgC;;AAEhC;;;;;GAKG;AACH,SAAwB,UAAU,CAAC,SAAsB;IACvD,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;IACnB,MAAM,UAAU,GAAG,GAAG,CAAC,CAAC,wCAAwC;IAChE,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAEzC,MAAM,KAAK,GAAG,UAAU,CAAC,SAAS,EAAE,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1D,IAAI,IAAI,GAAG,GAAG,CAAC;IAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACzC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC,GAAG,KAAK,GAAG,UAAU,CAAC,CAAC;QAClE,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE;YAClB,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,SAAS,GAAG,CAAC,CAAC;SACf;KACF;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAjBD,6BAiBC;AAED,SAAS,UAAU,CAAC,SAAsB,EAAE,QAAgB;IAC1D,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE;QAClC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;KACnB;IACD,OAAO,CAAC,CAAC;AACX,CAAC"}

package/lib/operations/thresholds/renyiEntropy.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Return a threshold for a histogram using its entropy.
+ *
+ * @param histogram - The image histogram.
+ * @param total - Total number of pixels of the image.
+ * @returns The threshold.
+ */
+export default function renyiEntropy(histogram: Uint32Array, total: number): number;
+//# sourceMappingURL=renyiEntropy.d.ts.map

package/lib/operations/thresholds/renyiEntropy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"renyiEntropy.d.ts","sourceRoot":"","sources":["../../../src/operations/thresholds/renyiEntropy.ts"],"names":[],"mappings":"AAQA;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,YAAY,CAAC,SAAS,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,UAoIzE"}

package/lib/operations/thresholds/renyiEntropy.js

@@ -0,0 +1,133 @@
+"use strict";
+// see https://github.com/fiji/Auto_Threshold/blob/master/src/main/java/fiji/threshold/Auto_Threshold.java
+// Kapur J.N., Sahoo P.K., and Wong A.K.C. (1985) "A New Method for
+// Gray-Level Picture Thresholding Using the Entropy of the Histogram"
+// Graphical Models and Image Processing, 29(3): 273-285
+// M. Emre Celebi
+// 06.15.2007
+// Ported to ImageJ plugin by G.Landini from E Celebi's fourier_0.8 routines
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Return a threshold for a histogram using its entropy.
+ *
+ * @param histogram - The image histogram.
+ * @param total - Total number of pixels of the image.
+ * @returns The threshold.
+ */
+function renyiEntropy(histogram, total) {
+    let firstBin; // First non-zero bin
+    let lastBin; // last non-zero bin
+    const normHisto = new Array(histogram.length); // normalized histogram
+    const P1 = new Array(histogram.length); // accumulative normalized histogram
+    const P2 = new Array(histogram.length); // accumulative normalized histogram
+    // Entropy Variables
+    let threshold1 = 0;
+    let threshold2 = 0;
+    let threshold3 = 0;
+    let maxEnt1 = 0.0;
+    let maxEnt2 = 0.0;
+    let maxEnt3 = 0.0;
+    const alpha2 = 0.5;
+    const term2 = 1.0 / (1.0 - alpha2);
+    const alpha3 = 2.0;
+    const term3 = 1.0 / (1.0 - alpha3);
+    for (let ih = 0; ih < histogram.length; ih++) {
+        normHisto[ih] = histogram[ih] / total;
+    }
+    P1[0] = normHisto[0];
+    P2[0] = 1.0 - P1[0];
+    for (let ih = 1; ih < histogram.length; ih++) {
+        P1[ih] = P1[ih - 1] + normHisto[ih];
+        P2[ih] = 1.0 - P1[ih];
+    }
+    /* Determine the first non-zero bin */
+    firstBin = 0;
+    for (let ih = 0; ih < histogram.length; ih++) {
+        if (Math.abs(P1[ih]) >= Number.EPSILON) {
+            firstBin = ih;
+            break;
+        }
+    }
+    /* Determine the last non-zero bin */
+    lastBin = histogram.length - 1;
+    for (let ih = histogram.length - 1; ih >= firstBin; ih--) {
+        if (Math.abs(P2[ih]) >= Number.EPSILON) {
+            lastBin = ih;
+            break;
+        }
+    }
+    /* Maximum Entropy Thresholding - BEGIN */
+    /* ALPHA = 1.0 */
+    /* Calculate the total entropy each gray-level
+       and find the threshold that maximizes it
+       */
+    for (let it = firstBin; it <= lastBin; it++) {
+        /* Entropy of the background pixels */
+        let entBack1 = 0.0;
+        let entBack2 = 0.0;
+        let entBack3 = 0.0;
+        for (let ih = 0; ih <= it; ih++) {
+            if (histogram[ih] !== 0) {
+                entBack1 -= (normHisto[ih] / P1[it]) * Math.log(normHisto[ih] / P1[it]);
+            }
+            entBack2 += Math.sqrt(normHisto[ih] / P1[it]);
+            entBack3 += (normHisto[ih] * normHisto[ih]) / (P1[it] * P1[it]);
+        }
+        /* Entropy of the object pixels */
+        let entObj1 = 0.0;
+        let entObj2 = 0.0;
+        let entObj3 = 0.0;
+        for (let ih = it + 1; ih < histogram.length; ih++) {
+            if (histogram[ih] !== 0) {
+                entObj1 -= (normHisto[ih] / P2[it]) * Math.log(normHisto[ih] / P2[it]);
+            }
+            entObj2 += Math.sqrt(normHisto[ih] / P2[it]);
+            entObj3 += (normHisto[ih] * normHisto[ih]) / (P2[it] * P2[it]);
+        }
+        /* Total entropy */
+        const totEnt1 = entBack1 + entObj1;
+        const totEnt2 = term2 * (entBack2 * entObj2 > 0.0 ? Math.log(entBack2 * entObj2) : 0.0);
+        const totEnt3 = term3 * (entBack3 * entObj3 > 0.0 ? Math.log(entBack3 * entObj3) : 0.0);
+        if (totEnt1 > maxEnt1) {
+            maxEnt1 = totEnt1;
+            threshold1 = it;
+        }
+        if (totEnt2 > maxEnt2) {
+            maxEnt2 = totEnt2;
+            threshold2 = it;
+        }
+        if (totEnt3 > maxEnt3) {
+            maxEnt3 = totEnt3;
+            threshold3 = it;
+        }
+    }
+    /* End Maximum Entropy Thresholding */
+    const tStars = new Uint32Array([threshold1, threshold2, threshold3]);
+    tStars.sort();
+    let betas;
+    /* Adjust beta values */
+    if (Math.abs(tStars[0] - tStars[1]) <= 5) {
+        if (Math.abs(tStars[1] - tStars[2]) <= 5) {
+            betas = [1, 2, 1];
+        }
+        else {
+            betas = [0, 1, 3];
+        }
+    }
+    else {
+        if (Math.abs(tStars[1] - tStars[2]) <= 5) {
+            betas = [3, 1, 0];
+        }
+        else {
+            betas = [1, 2, 1];
+        }
+    }
+    /* Determine the optimal threshold value */
+    const omega = P1[tStars[2]] - P1[tStars[0]];
+    const optThreshold = Math.round(tStars[0] * (P1[tStars[0]] + 0.25 * omega * betas[0]) +
+        0.25 * tStars[1] * omega * betas[1] +
+        tStars[2] * (P2[tStars[2]] + 0.25 * omega * betas[2]));
+    return optThreshold;
+}
+exports.default = renyiEntropy;
+//# sourceMappingURL=renyiEntropy.js.map

package/lib/operations/thresholds/renyiEntropy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"renyiEntropy.js","sourceRoot":"","sources":["../../../src/operations/thresholds/renyiEntropy.ts"],"names":[],"mappings":";AAAA,0GAA0G;AAC1G,mEAAmE;AACnE,sEAAsE;AACtE,wDAAwD;AACxD,iBAAiB;AACjB,aAAa;AACb,4EAA4E;;AAE5E;;;;;;GAMG;AACH,SAAwB,YAAY,CAAC,SAAsB,EAAE,KAAa;IACxE,IAAI,QAAQ,CAAC,CAAC,qBAAqB;IACnC,IAAI,OAAO,CAAC,CAAC,oBAAoB;IAEjC,MAAM,SAAS,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,uBAAuB;IACtE,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,oCAAoC;IAC5E,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,oCAAoC;IAE5E,oBAAoB;IACpB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,OAAO,GAAG,GAAG,CAAC;IAClB,IAAI,OAAO,GAAG,GAAG,CAAC;IAClB,IAAI,OAAO,GAAG,GAAG,CAAC;IAClB,MAAM,MAAM,GAAG,GAAG,CAAC;IACnB,MAAM,KAAK,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC;IACnC,MAAM,MAAM,GAAG,GAAG,CAAC;IACnB,MAAM,KAAK,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC;IAEnC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;QAC5C,SAAS,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;KACvC;IAED,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACrB,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACpB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;QAC5C,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;QACpC,EAAE,CAAC,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;KACvB;IAED,sCAAsC;IACtC,QAAQ,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;QAC5C,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE;YACtC,QAAQ,GAAG,EAAE,CAAC;YACd,MAAM;SACP;KACF;IAED,qCAAqC;IACrC,OAAO,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;IAC/B,KAAK,IAAI,EAAE,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,IAAI,QAAQ,EAAE,EAAE,EAAE,EAAE;QACxD,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE;YACtC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM;SACP;KACF;IAED,0CAA0C;IAC1C,iBAAiB;IACjB;;SAEK;IACL,KAAK,IAAI,EAAE,GAAG,QAAQ,EAAE,EAAE,IAAI,OAAO,EAAE,EAAE,EAAE,EAAE;QAC3C,sCAAsC;QACtC,IAAI,QAAQ,GAAG,GAAG,CAAC;QACnB,IAAI,QAAQ,GAAG,GAAG,CAAC;QACnB,IAAI,QAAQ,GAAG,GAAG,CAAC;QACnB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE;YAC/B,IAAI,SAAS,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE;gBACvB,QAAQ,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;aACzE;YACD,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9C,QAAQ,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;SACjE;QAED,kCAAkC;QAClC,IAAI,OAAO,GAAG,GAAG,CAAC;QAClB,IAAI,OAAO,GAAG,GAAG,CAAC;QAClB,IAAI,OAAO,GAAG,GAAG,CAAC;QAClB,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;YACjD,IAAI,SAAS,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE;gBACvB,OAAO,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;aACxE;YACD,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,OAAO,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;SAChE;QAED,mBAAmB;QACnB,MAAM,OAAO,GAAG,QAAQ,GAAG,OAAO,CAAC;QACnC,MAAM,OAAO,GACX,KAAK,GAAG,CAAC,QAAQ,GAAG,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1E,MAAM,OAAO,GACX,KAAK,GAAG,CAAC,QAAQ,GAAG,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAE1E,IAAI,OAAO,GAAG,OAAO,EAAE;YACrB,OAAO,GAAG,OAAO,CAAC;YAClB,UAAU,GAAG,EAAE,CAAC;SACjB;QAED,IAAI,OAAO,GAAG,OAAO,EAAE;YACrB,OAAO,GAAG,OAAO,CAAC;YAClB,UAAU,GAAG,EAAE,CAAC;SACjB;QAED,IAAI,OAAO,GAAG,OAAO,EAAE;YACrB,OAAO,GAAG,OAAO,CAAC;YAClB,UAAU,GAAG,EAAE,CAAC;SACjB;KACF;IACD,sCAAsC;IAEtC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,UAAU,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC;IACrE,MAAM,CAAC,IAAI,EAAE,CAAC;IAEd,IAAI,KAAK,CAAC;IAEV,wBAAwB;IACxB,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;QACxC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;YACxC,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;SACnB;aAAM;YACL,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;SACnB;KACF;SAAM;QACL,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;YACxC,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;SACnB;aAAM;YACL,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;SACnB;KACF;IAED,2CAA2C;IAC3C,MAAM,KAAK,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAC7B,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnD,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CACxD,CAAC;IAEF,OAAO,YAAY,CAAC;AACtB,CAAC;AApID,+BAoIC"}

package/lib/operations/thresholds/shanbhag.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Return a threshold for a histogram using Shanbhag algorithm.
+ *
+ * @param histogram - The image histogram.
+ * @param histogrami
+ * @param total - Total number of pixels of the image.
+ * @returns The threshold.
+ */
+export default function shanbhag(histogram: Uint32Array, total: number): number;
+//# sourceMappingURL=shanbhag.d.ts.map

package/lib/operations/thresholds/shanbhag.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shanbhag.d.ts","sourceRoot":"","sources":["../../../src/operations/thresholds/shanbhag.ts"],"names":[],"mappings":"AAKA;;;;;;;GAOG;AACH,MAAM,CAAC,OAAO,UAAU,QAAQ,CAAC,SAAS,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,UAoErE"}

package/lib/operations/thresholds/shanbhag.js

@@ -0,0 +1,77 @@
+"use strict";
+// see https://github.com/fiji/Auto_Threshold/blob/master/src/main/java/fiji/threshold/Auto_Threshold.java
+// Shanhbag A.G. (1994) "Utilization of Information Measure as a Means of
+// Image Thresholding" Graphical Models and Image Processing, 56(5): 414-419
+// Ported to ImageJ plugin by G.Landini from E Celebi's fourier_0.8 routines
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Return a threshold for a histogram using Shanbhag algorithm.
+ *
+ * @param histogram - The image histogram.
+ * @param histogrami
+ * @param total - Total number of pixels of the image.
+ * @returns The threshold.
+ */
+function shanbhag(histogram, total) {
+    const normHisto = new Array(histogram.length); // normalized histogram
+    for (let ih = 0; ih < histogram.length; ih++) {
+        normHisto[ih] = histogram[ih] / total;
+    }
+    const P1 = new Array(histogram.length); // cumulative normalized histogram
+    const P2 = new Array(histogram.length);
+    P1[0] = normHisto[0];
+    P2[0] = 1.0 - P1[0];
+    for (let ih = 1; ih < histogram.length; ih++) {
+        P1[ih] = P1[ih - 1] + normHisto[ih];
+        P2[ih] = 1.0 - P1[ih];
+    }
+    /* Determine the first non-zero bin */
+    let firstBin = 0;
+    for (let ih = 0; ih < histogram.length; ih++) {
+        if (Math.abs(P1[ih]) >= Number.EPSILON) {
+            firstBin = ih;
+            break;
+        }
+    }
+    /* Determine the last non-zero bin */
+    let lastBin = histogram.length - 1;
+    for (let ih = histogram.length - 1; ih >= firstBin; ih--) {
+        if (Math.abs(P2[ih]) >= Number.EPSILON) {
+            lastBin = ih;
+            break;
+        }
+    }
+    // Calculate the total entropy each gray-level
+    // and find the threshold that maximizes it
+    let threshold = -1;
+    let minEnt = Number.MAX_VALUE; // min entropy
+    let term;
+    let totEnt; // total entropy
+    let entBack; // entropy of the background pixels at a given threshold
+    let entObj; // entropy of the object pixels at a given threshold
+    for (let it = firstBin; it <= lastBin; it++) {
+        /* Entropy of the background pixels */
+        entBack = 0.0;
+        term = 0.5 / P1[it];
+        for (let ih = 1; ih <= it; ih++) {
+            entBack -= normHisto[ih] * Math.log(1.0 - term * P1[ih - 1]);
+        }
+        entBack *= term;
+        /* Entropy of the object pixels */
+        entObj = 0.0;
+        term = 0.5 / P2[it];
+        for (let ih = it + 1; ih < histogram.length; ih++) {
+            entObj -= normHisto[ih] * Math.log(1.0 - term * P2[ih]);
+        }
+        entObj *= term;
+        /* Total entropy */
+        totEnt = Math.abs(entBack - entObj);
+        if (totEnt < minEnt) {
+            minEnt = totEnt;
+            threshold = it;
+        }
+    }
+    return threshold;
+}
+exports.default = shanbhag;
+//# sourceMappingURL=shanbhag.js.map