image-js 1.0.0-alpha.2 → 1.0.0

package/lib-esm/utils/getOutputImage.js

@@ -1,35 +0,0 @@
-import { Image } from '../Image';
-/**
- * Use this function to support getting the output image of an algorithm from
- * user-supplied options.
- * @private
- * @param thisImage - Current image on which the algorithm is applied.
- * @param options - Options object received by the algorithm.
- * @param internalOptions - Some additional private options.
- */
-export function getOutputImage(thisImage, options = {}, internalOptions = {}) {
-    const { out } = options;
-    const { newParameters } = internalOptions;
-    if (out === undefined) {
-        return Image.createFrom(thisImage, newParameters);
-    }
-    else {
-        if (!(out instanceof Image)) {
-            throw new TypeError('out must be an Image object');
-        }
-        const requirements = Object.assign({
-            width: thisImage.width,
-            height: thisImage.height,
-            depth: thisImage.depth,
-            kind: thisImage.kind
-        }, newParameters);
-        for (const property in requirements) {
-            const prop = property;
-            if (out[prop] !== requirements[prop]) {
-                throw new RangeError(`cannot use out. Its ${property} property must be ${requirements[prop]}. Found ${out[prop]}`);
-            }
-        }
-        return out;
-    }
-}
-//# sourceMappingURL=getOutputImage.js.map

package/lib-esm/utils/getOutputImage.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"getOutputImage.js","sourceRoot":"","sources":["../../src/utils/getOutputImage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAoB,MAAM,UAAU,CAAC;AAkBnD;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAC5B,SAAgB,EAChB,UAAuB,EAAE,EACzB,kBAAuC,EAAE;IAEzC,MAAM,EAAE,GAAG,EAAE,GAAG,OAAO,CAAC;IACxB,MAAM,EAAE,aAAa,EAAE,GAAG,eAAe,CAAC;IAC1C,IAAI,GAAG,KAAK,SAAS,EAAE;QACrB,OAAO,KAAK,CAAC,UAAU,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;KACnD;SAAM;QACL,IAAI,CAAC,CAAC,GAAG,YAAY,KAAK,CAAC,EAAE;YAC3B,MAAM,IAAI,SAAS,CAAC,6BAA6B,CAAC,CAAC;SACpD;QACD,MAAM,YAAY,GAAqB,MAAM,CAAC,MAAM,CAClD;YACE,KAAK,EAAE,SAAS,CAAC,KAAK;YACtB,MAAM,EAAE,SAAS,CAAC,MAAM;YACxB,KAAK,EAAE,SAAS,CAAC,KAAK;YACtB,IAAI,EAAE,SAAS,CAAC,IAAI;SACrB,EACD,aAAa,CACd,CAAC;QAEF,KAAK,MAAM,QAAQ,IAAI,YAAY,EAAE;YACnC,MAAM,IAAI,GAAG,QAAgB,CAAC;YAC9B,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,YAAY,CAAC,IAAI,CAAC,EAAE;gBACpC,MAAM,IAAI,UAAU,CAClB,uBAAuB,QAAQ,qBAC7B,YAAY,CAAC,IAAI,CACnB,WAAW,GAAG,CAAC,IAAI,CAAC,EAAE,CACvB,CAAC;aACH;SACF;QACD,OAAO,GAAG,CAAC;KACZ;AACH,CAAC"}

package/lib-esm/utils/interpolateBorder.d.ts

@@ -1,3 +0,0 @@
-import { BorderType } from '../types';
-export declare function interpolateBorder(point: number, length: number, type: BorderType): number;
-//# sourceMappingURL=interpolateBorder.d.ts.map

package/lib-esm/utils/interpolateBorder.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"interpolateBorder.d.ts","sourceRoot":"","sources":["../../src/utils/interpolateBorder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AAEtC,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,UAAU,GACf,MAAM,CA4CR"}

package/lib-esm/utils/interpolateBorder.js

@@ -1,48 +0,0 @@
-import { BorderType } from '../types';
-export function interpolateBorder(point, length, type) {
-    if (point >= 0 && point < length) {
-        return point;
-    }
-    if (type === BorderType.CONSTANT) {
-        return -1;
-    }
-    if (point > 0 - length && point < length + length - 1) {
-        if (type === BorderType.REPLICATE) {
-            if (point < 0) {
-                return 0;
-            }
-            else {
-                return length - 1;
-            }
-        }
-        if (type === BorderType.REFLECT) {
-            if (point < 0) {
-                return -1 - point;
-            }
-            else {
-                return length + length - 1 - point;
-            }
-        }
-        if (type === BorderType.WRAP) {
-            if (point < 0) {
-                return length + point;
-            }
-            else {
-                return point - length;
-            }
-        }
-        if (type === BorderType.REFLECT_101) {
-            if (point < 0) {
-                return 0 - point;
-            }
-            else {
-                return length + length - 2 - point;
-            }
-        }
-        throw new Error(`interpolateBorder cannot be used with border type ${type}`);
-    }
-    else {
-        throw new RangeError('interpolateBorder only supports borders smaller than the original image');
-    }
-}
-//# sourceMappingURL=interpolateBorder.js.map

package/lib-esm/utils/interpolateBorder.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"interpolateBorder.js","sourceRoot":"","sources":["../../src/utils/interpolateBorder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AAEtC,MAAM,UAAU,iBAAiB,CAC/B,KAAa,EACb,MAAc,EACd,IAAgB;IAEhB,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,MAAM,EAAE;QAChC,OAAO,KAAK,CAAC;KACd;IACD,IAAI,IAAI,KAAK,UAAU,CAAC,QAAQ,EAAE;QAChC,OAAO,CAAC,CAAC,CAAC;KACX;IACD,IAAI,KAAK,GAAG,CAAC,GAAG,MAAM,IAAI,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG,CAAC,EAAE;QACrD,IAAI,IAAI,KAAK,UAAU,CAAC,SAAS,EAAE;YACjC,IAAI,KAAK,GAAG,CAAC,EAAE;gBACb,OAAO,CAAC,CAAC;aACV;iBAAM;gBACL,OAAO,MAAM,GAAG,CAAC,CAAC;aACnB;SACF;QACD,IAAI,IAAI,KAAK,UAAU,CAAC,OAAO,EAAE;YAC/B,IAAI,KAAK,GAAG,CAAC,EAAE;gBACb,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC;aACnB;iBAAM;gBACL,OAAO,MAAM,GAAG,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC;aACpC;SACF;QACD,IAAI,IAAI,KAAK,UAAU,CAAC,IAAI,EAAE;YAC5B,IAAI,KAAK,GAAG,CAAC,EAAE;gBACb,OAAO,MAAM,GAAG,KAAK,CAAC;aACvB;iBAAM;gBACL,OAAO,KAAK,GAAG,MAAM,CAAC;aACvB;SACF;QACD,IAAI,IAAI,KAAK,UAAU,CAAC,WAAW,EAAE;YACnC,IAAI,KAAK,GAAG,CAAC,EAAE;gBACb,OAAO,CAAC,GAAG,KAAK,CAAC;aAClB;iBAAM;gBACL,OAAO,MAAM,GAAG,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC;aACpC;SACF;QACD,MAAM,IAAI,KAAK,CACb,qDAAqD,IAAI,EAAE,CAC5D,CAAC;KACH;SAAM;QACL,MAAM,IAAI,UAAU,CAClB,yEAAyE,CAC1E,CAAC;KACH;AACH,CAAC"}

package/lib-esm/utils/interpolatePixel.d.ts

@@ -1,7 +0,0 @@
-import { Image } from '../Image';
-import { BorderType, InterpolationType } from '../types';
-declare type InterpolationFunction = (image: Image, x: number, y: number, channel: number, borderType: BorderType, borderValue: number) => number;
-export declare function getInterpolationFunction(interpolationType: InterpolationType): InterpolationFunction;
-export declare function interpolateNearest(image: Image, x: number, y: number, channel: number, borderType: BorderType, borderValue: number): number;
-export {};
-//# sourceMappingURL=interpolatePixel.d.ts.map

package/lib-esm/utils/interpolatePixel.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"interpolatePixel.d.ts","sourceRoot":"","sources":["../../src/utils/interpolatePixel.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,UAAU,CAAC;AAIzD,aAAK,qBAAqB,GAAG,CAC3B,KAAK,EAAE,KAAK,EACZ,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,OAAO,EAAE,MAAM,EACf,UAAU,EAAE,UAAU,EACtB,WAAW,EAAE,MAAM,KAChB,MAAM,CAAC;AAEZ,wBAAgB,wBAAwB,CACtC,iBAAiB,EAAE,iBAAiB,GACnC,qBAAqB,CASvB;AAED,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,KAAK,EACZ,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,OAAO,EAAE,MAAM,EACf,UAAU,EAAE,UAAU,EACtB,WAAW,EAAE,MAAM,GAClB,MAAM,CAUR"}

package/lib-esm/utils/interpolatePixel.js

@@ -1,23 +0,0 @@
-import { InterpolationType } from '../types';
-import { interpolateBorder } from './interpolateBorder';
-export function getInterpolationFunction(interpolationType) {
-    switch (interpolationType) {
-        case InterpolationType.NEAREST: {
-            return interpolateNearest;
-        }
-        default: {
-            throw new Error(`interpolation ${interpolationType} not implemented`);
-        }
-    }
-}
-export function interpolateNearest(image, x, y, channel, borderType, borderValue) {
-    x = Math.round(x);
-    y = Math.round(y);
-    const px = interpolateBorder(x, image.width, borderType);
-    const py = interpolateBorder(y, image.height, borderType);
-    if (px < 0 || py < 0) {
-        return borderValue;
-    }
-    return image.getValue(py, px, channel);
-}
-//# sourceMappingURL=interpolatePixel.js.map

package/lib-esm/utils/interpolatePixel.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"interpolatePixel.js","sourceRoot":"","sources":["../../src/utils/interpolatePixel.ts"],"names":[],"mappings":"AACA,OAAO,EAAc,iBAAiB,EAAE,MAAM,UAAU,CAAC;AAEzD,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAWxD,MAAM,UAAU,wBAAwB,CACtC,iBAAoC;IAEpC,QAAQ,iBAAiB,EAAE;QACzB,KAAK,iBAAiB,CAAC,OAAO,CAAC,CAAC;YAC9B,OAAO,kBAAkB,CAAC;SAC3B;QACD,OAAO,CAAC,CAAC;YACP,MAAM,IAAI,KAAK,CAAC,iBAAiB,iBAAiB,kBAAkB,CAAC,CAAC;SACvE;KACF;AACH,CAAC;AAED,MAAM,UAAU,kBAAkB,CAChC,KAAY,EACZ,CAAS,EACT,CAAS,EACT,OAAe,EACf,UAAsB,EACtB,WAAmB;IAEnB,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAElB,MAAM,EAAE,GAAG,iBAAiB,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IACzD,MAAM,EAAE,GAAG,iBAAiB,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAC1D,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;QACpB,OAAO,WAAW,CAAC;KACpB;IACD,OAAO,KAAK,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;AACzC,CAAC"}

package/lib-esm/utils/kinds.d.ts

@@ -1,9 +0,0 @@
-interface IKindDefinitions {
-    [key: string]: {
-        channels: number;
-        alpha: boolean;
-    };
-}
-export declare const kindDefinitions: IKindDefinitions;
-export {};
-//# sourceMappingURL=kinds.d.ts.map

package/lib-esm/utils/kinds.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"kinds.d.ts","sourceRoot":"","sources":["../../src/utils/kinds.ts"],"names":[],"mappings":"AAEA,UAAU,gBAAgB;IACxB,CAAC,GAAG,EAAE,MAAM,GAAG;QACb,QAAQ,EAAE,MAAM,CAAC;QACjB,KAAK,EAAE,OAAO,CAAC;KAChB,CAAC;CACH;AAED,eAAO,MAAM,eAAe,EAAE,gBAiB7B,CAAC"}

package/lib-esm/utils/kinds.js

@@ -1,20 +0,0 @@
-import { ImageKind } from '../Image';
-export const kindDefinitions = {
-    [ImageKind.GREY]: {
-        channels: 1,
-        alpha: false
-    },
-    [ImageKind.GREYA]: {
-        channels: 2,
-        alpha: true
-    },
-    [ImageKind.RGB]: {
-        channels: 3,
-        alpha: false
-    },
-    [ImageKind.RGBA]: {
-        channels: 4,
-        alpha: true
-    }
-};
-//# sourceMappingURL=kinds.js.map

package/lib-esm/utils/kinds.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"kinds.js","sourceRoot":"","sources":["../../src/utils/kinds.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AASrC,MAAM,CAAC,MAAM,eAAe,GAAqB;IAC/C,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;QAChB,QAAQ,EAAE,CAAC;QACX,KAAK,EAAE,KAAK;KACb;IACD,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;QACjB,QAAQ,EAAE,CAAC;QACX,KAAK,EAAE,IAAI;KACZ;IACD,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE;QACf,QAAQ,EAAE,CAAC;QACX,KAAK,EAAE,KAAK;KACb;IACD,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;QAChB,QAAQ,EAAE,CAAC;QACX,KAAK,EAAE,IAAI;KACZ;CACF,CAAC"}

package/lib-esm/utils/round.d.ts

@@ -1,2 +0,0 @@
-export declare function round(value: number): number;
-//# sourceMappingURL=round.d.ts.map

package/lib-esm/utils/round.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"round.d.ts","sourceRoot":"","sources":["../../src/utils/round.ts"],"names":[],"mappings":"AAEA,wBAAgB,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAQ3C"}

package/lib-esm/utils/round.js

@@ -1,11 +0,0 @@
-const { isInteger } = Number;
-export function round(value) {
-    if (isInteger(value)) {
-        return value;
-    }
-    if (value % 0.5 !== 0) {
-        return Math.round(value);
-    }
-    return Math.floor(value) % 2 === 0 ? Math.floor(value) : Math.ceil(value);
-}
-//# sourceMappingURL=round.js.map

package/lib-esm/utils/round.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"round.js","sourceRoot":"","sources":["../../src/utils/round.ts"],"names":[],"mappings":"AAAA,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC;AAE7B,MAAM,UAAU,KAAK,CAAC,KAAa;IACjC,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE;QACpB,OAAO,KAAK,CAAC;KACd;IACD,IAAI,KAAK,GAAG,GAAG,KAAK,CAAC,EAAE;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;KAC1B;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC5E,CAAC"}

package/lib-esm/utils/validators.d.ts

@@ -1,7 +0,0 @@
-import { Image } from '../Image';
-export declare function validateChannel(channel: number, image: Image): void;
-/**
- * Validates that a value passed by the user is smaller than the image's maxValue.
- */
-export declare function validateValue(value: number, image: Image): void;
-//# sourceMappingURL=validators.d.ts.map

package/lib-esm/utils/validators.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"validators.d.ts","sourceRoot":"","sources":["../../src/utils/validators.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AAEjC,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CAQnE;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CAO/D"}

package/lib-esm/utils/validators.js

@@ -1,15 +0,0 @@
-export function validateChannel(channel, image) {
-    if (!Number.isInteger(channel) || channel >= image.channels || channel < 0) {
-        throw new RangeError(`invalid channel: ${channel}. It must be a positive integer smaller than ${image.channels}`);
-    }
-}
-/**
- * Validates that a value passed by the user is smaller than the image's maxValue.
- */
-export function validateValue(value, image) {
-    if (!Number.isInteger(value) || value > image.maxValue || value < 0) {
-        throw new RangeError(`invalid value: ${value}. It must be a positive integer smaller than ${image.maxValue +
-            1}`);
-    }
-}
-//# sourceMappingURL=validators.js.map

package/lib-esm/utils/validators.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"validators.js","sourceRoot":"","sources":["../../src/utils/validators.ts"],"names":[],"mappings":"AAEA,MAAM,UAAU,eAAe,CAAC,OAAe,EAAE,KAAY;IAC3D,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,OAAO,IAAI,KAAK,CAAC,QAAQ,IAAI,OAAO,GAAG,CAAC,EAAE;QAC1E,MAAM,IAAI,UAAU,CAClB,oBAAoB,OAAO,gDACzB,KAAK,CAAC,QACR,EAAE,CACH,CAAC;KACH;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa,EAAE,KAAY;IACvD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,KAAK,CAAC,QAAQ,IAAI,KAAK,GAAG,CAAC,EAAE;QACnE,MAAM,IAAI,UAAU,CAClB,kBAAkB,KAAK,gDAAgD,KAAK,CAAC,QAAQ;YACnF,CAAC,EAAE,CACN,CAAC;KACH;AACH,CAAC"}

package/src/load/checkHeader.ts

@@ -1,20 +0,0 @@
-/**
- * Check the presence of a header in a byte array.
- * @private
- * @param arr - The array to check.
- * @param header - The header to check the presence of.
- */
-export default function checkHeader(
-  arr: Uint8Array,
-  header: number[]
-): boolean {
-  if (arr.length < header.length) {
-    return false;
-  }
-  for (let i = 0; i < header.length; i++) {
-    if (header[i] !== arr[i]) {
-      return false;
-    }
-  }
-  return true;
-}

package/src/operations/convertDepth.ts

@@ -1,43 +0,0 @@
-import { Image, ColorDepth } from '../Image';
-
-export function convertDepth(image: Image, newDepth: ColorDepth): Image {
-  if (image.depth === newDepth) {
-    throw new Error('cannot convert image to same depth');
-  }
-
-  if (newDepth === ColorDepth.UINT16) {
-    return convertToUint16(image);
-  } else {
-    return convertToUint8(image);
-  }
-}
-
-function convertToUint16(image: Image): Image {
-  const newImage = new Image({
-    width: image.width,
-    height: image.height,
-    depth: ColorDepth.UINT16,
-    kind: image.kind
-  });
-
-  for (let i = 0; i < image.data.length; i++) {
-    newImage.data[i] = image.data[i] << 8;
-  }
-
-  return newImage;
-}
-
-function convertToUint8(image: Image): Image {
-  const newImage = new Image({
-    width: image.width,
-    height: image.height,
-    depth: ColorDepth.UINT8,
-    kind: image.kind
-  });
-
-  for (let i = 0; i < image.data.length; i++) {
-    newImage.data[i] = image.data[i] >> 8;
-  }
-
-  return newImage;
-}

package/src/operations/thresholds/huang.js

@@ -1,80 +0,0 @@
-/*
- *
- * see http://rsb.info.nih.gov/ij/developer/source/ij/process/AutoThresholder.java.html.
- * Huang: Implements Huang's fuzzy thresholding method: Huang, L-K & Wang, M-J J (1995),
- * "Image thresholding by minimizing the measure of fuzziness", Pattern Recognition 28(1): 41-51
- *
- */
-
-export default function huang(histogram) {
-  /* Determine the first non-zero bin */
-  let firstBin = 0;
-  for (let ih = 0; ih < histogram.length; ih++) {
-    if (histogram[ih] !== 0) {
-      firstBin = ih;
-      break;
-    }
-  }
-
-  /* Determine the last non-zero bin */
-  let lastBin = histogram.length - 1;
-  for (let ih = histogram.length - 1; ih >= firstBin; ih--) {
-    if (histogram[ih] !== 0) {
-      lastBin = ih;
-      break;
-    }
-  }
-
-  const term = 1.0 / (lastBin - firstBin);
-  const mu0 = new Array(histogram.length);
-  let sumPix = 0;
-  let numPix = 0;
-  for (let ih = firstBin; ih < histogram.length; ih++) {
-    sumPix += ih * histogram[ih];
-    numPix += histogram[ih];
-    mu0[ih] = sumPix / numPix;
-  }
-
-  const mu1 = new Array(histogram.length);
-  sumPix = numPix = 0;
-  for (let ih = lastBin; ih > 0; ih--) {
-    sumPix += ih * histogram[ih];
-    numPix += histogram[ih];
-    mu1[ih - 1] = sumPix / numPix;
-  }
-
-  /* Determine the threshold that minimizes the fuzzy entropy*/
-  let threshold = -1;
-  let minEnt = Number.MAX_VALUE;
-  for (let it = 0; it < histogram.length; it++) {
-    let ent = 0;
-    let muX;
-    for (let ih = 0; ih <= it; ih++) {
-      /* Equation (4) in Ref. 1 */
-      muX = 1 / (1 + term * Math.abs(ih - mu0[it]));
-      if (!(muX < 1e-6 || muX > 0.999999)) {
-        /* Equation (6) & (8) in Ref. 1 */
-        ent +=
-          histogram[ih] *
-          (-muX * Math.log(muX) - (1 - muX) * Math.log(1 - muX));
-      }
-    }
-
-    for (let ih = it + 1; ih < histogram.length; ih++) {
-      /* Equation (4) in Ref. 1 */
-      muX = 1 / (1 + term * Math.abs(ih - mu1[it]));
-      if (!(muX < 1e-6 || muX > 0.999999)) {
-        /* Equation (6) & (8) in Ref. 1 */
-        ent +=
-          histogram[ih] *
-          (-muX * Math.log(muX) - (1 - muX) * Math.log(1 - muX));
-      }
-    }
-
-    if (ent < minEnt) {
-      minEnt = ent;
-      threshold = it;
-    }
-  }
-  return threshold;
-}

package/src/operations/thresholds/intermodes.js

@@ -1,56 +0,0 @@
-/*
- *
- * see https://github.com/fiji/Auto_Threshold/blob/master/src/main/java/fiji/threshold/Auto_Threshold.java
- * Intermodes: This assumes a bimodal histogram. Implements the thresholding Prewitt, JMS & Mendelsohn, ML (1966),
- * "The analysis of cell images", Annals of the NewYork Academy of Sciences 128: 1035-1053
- *
- */
-
-export default function intermodes(histogram) {
-  const iHisto = histogram.slice();
-  let iter = 0;
-  while (!bimodalTest(iHisto)) {
-    // smooth with a 3 point running mean filter
-    let previous = 0;
-    let current = 0;
-    let next = iHisto[0];
-    for (let i = 0; i < histogram.length - 1; i++) {
-      previous = current;
-      current = next;
-      next = iHisto[i + 1];
-      iHisto[i] = (previous + current + next) / 3;
-    }
-    iHisto[histogram.length - 1] = (current + next) / 3;
-    iter++;
-    if (iter > 10000) {
-      throw new Error('Intermodes Threshold not found after 10000 iterations');
-    }
-  }
-
-  // The threshold is the mean between the two peaks.
-  let tt = 0;
-  for (let i = 1; i < histogram.length - 1; i++) {
-    if (iHisto[i - 1] < iHisto[i] && iHisto[i + 1] < iHisto[i]) {
-      tt += i;
-    }
-  }
-  return Math.floor(tt / 2.0);
-}
-
-function bimodalTest(iHisto) {
-  let b = false;
-  let modes = 0;
-
-  for (let k = 1; k < iHisto.length - 1; k++) {
-    if (iHisto[k - 1] < iHisto[k] && iHisto[k + 1] < iHisto[k]) {
-      modes++;
-      if (modes > 2) {
-        return false;
-      }
-    }
-  }
-  if (modes === 2) {
-    b = true;
-  }
-  return b;
-}

package/src/operations/thresholds/isodata.js

@@ -1,47 +0,0 @@
-/*
- * see https://github.com/fiji/Auto_Threshold/blob/master/src/main/java/fiji/threshold/Auto_Threshold.java
- * Isodata: Ridler, TW & Calvard, S (1978), "Picture thresholding using an iterative selection method"
- * IEEE Transactions on Systems, Man and Cybernetics 8: 630-632.
- *
- */
-export default function isodata(histogram) {
-  let l; // the average grey value of pixels with intensities < g
-  let toth; // the the average grey value of pixels with intensities > g
-  let totl; // the total the average grey value of pixels with intensities < g
-  let h; // the average grey value of pixels with intensities > g
-  let g = 0; // threshold value
-
-  for (let i = 1; i < histogram.length; i++) {
-    if (histogram[i] > 0) {
-      g = i + 1;
-      break;
-    }
-  }
-
-  while (true) {
-    l = 0;
-    totl = 0;
-    for (let i = 0; i < g; i++) {
-      totl = totl + histogram[i];
-      l = l + histogram[i] * i;
-    }
-    h = 0;
-    toth = 0;
-    for (let i = g + 1; i < histogram.length; i++) {
-      toth += histogram[i];
-      h += histogram[i] * i;
-    }
-    if (totl > 0 && toth > 0) {
-      l /= totl;
-      h /= toth;
-      if (g === Math.round((l + h) / 2.0)) {
-        break;
-      }
-    }
-    g++;
-    if (g > histogram.length - 2) {
-      throw new Error('Threshold not found');
-    }
-  }
-  return g;
-}

package/src/operations/thresholds/li.js

@@ -1,74 +0,0 @@
-/*
- * see http://rsb.info.nih.gov/ij/developer/source/ij/process/AutoThresholder.java.html
- * The method is present in: Implements Li's Minimum Cross Entropy thresholding method
- * This implementation is based on the iterative version (Ref. 2nd reference below) of the algorithm.
- *  1) Li, CH & Lee, CK (1993), "Minimum Cross Entropy Thresholding", Pattern Recognition 26(4): 61 625
- *  2) Li, CH & Tam, PKS (1998), "An Iterative Algorithm for Minimum Cross Entropy Thresholding",
- *     Pattern Recognition Letters 18(8): 771-776
- *  3) Sezgin, M & Sankur, B (2004), "Survey over Image Thresholding Techniques and Quantitative Performance
- *     Evaluation",Journal of Electronic Imaging 13(1): 146-165
- * @param histogram - the histogram of the image
- * @param total - the number of pixels in the image
- * @returns {number} - the threshold
- */
-
-export default function li(histogram, total) {
-  let threshold;
-  let sumBack; /* sum of the background pixels at a given threshold */
-  let sumObj; /* sum of the object pixels at a given threshold */
-  let numBack; /* number of background pixels at a given threshold */
-  let numObj; /* number of object pixels at a given threshold */
-  let oldThresh;
-  let newThresh;
-  let meanBack; /* mean of the background pixels at a given threshold */
-  let meanObj; /* mean of the object pixels at a given threshold */
-  let mean; /* mean gray-level in the image */
-  const tolerance = 0.5; /* threshold tolerance */
-  let temp;
-
-  /* Calculate the mean gray-level */
-  mean = 0.0;
-  for (let ih = 0; ih < histogram.length; ih++) {
-    mean += ih * histogram[ih];
-  }
-
-  mean /= total;
-  /* Initial estimate */
-  newThresh = mean;
-
-  do {
-    oldThresh = newThresh;
-    threshold = (oldThresh + 0.5) | 0; /* range */
-
-    /* Calculate the means of background and object pixels */
-    /* Background */
-    sumBack = 0;
-    numBack = 0;
-
-    for (let ih = 0; ih <= threshold; ih++) {
-      sumBack += ih * histogram[ih];
-      numBack += histogram[ih];
-    }
-    meanBack = numBack === 0 ? 0.0 : sumBack / numBack;
-
-    /* Object */
-    sumObj = 0;
-    numObj = 0;
-    for (let ih = threshold + 1; ih < histogram.length; ih++) {
-      sumObj += ih * histogram[ih];
-      numObj += histogram[ih];
-    }
-    meanObj = numObj === 0 ? 0.0 : sumObj / numObj;
-    temp = (meanBack - meanObj) / (Math.log(meanBack) - Math.log(meanObj));
-
-    if (temp < -Number.EPSILON) {
-      newThresh = (temp - 0.5) | 0;
-    } else {
-      newThresh = (temp + 0.5) | 0;
-    }
-    /*  Stop the iterations when the difference between the
-         new and old threshold values is less than the tolerance */
-  } while (Math.abs(newThresh - oldThresh) > tolerance);
-
-  return threshold;
-}

package/src/operations/thresholds/maxEntropy.js

@@ -1,79 +0,0 @@
-/*
- * see http://rsb.info.nih.gov/ij/developer/source/ij/process/AutoThresholder.java.html
- * The method is present in: Implements Kapur-Sahoo-Wong (Maximum Entropy) thresholding method:
- * Kapur, JN; Sahoo, PK & Wong, ACK (1985), "A New Method for Gray-Level Picture Thresholding Using the Entropy of the Histogram",
- * Graphical Models and Image Processing 29(3): 273-285
- * @param histogram - the histogram of the image
- *        total - the number of pixels in the image
- * @returns {number} - the threshold
- */
-
-export default function maxEntropy(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 totEnt; // total entropy
-  let maxEnt = Number.MIN_VALUE; // max 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;
-    for (let ih = 0; ih <= it; ih++) {
-      if (histogram[ih] !== 0) {
-        entBack -= (normHisto[ih] / P1[it]) * Math.log(normHisto[ih] / P1[it]);
-      }
-    }
-
-    /* Entropy of the object pixels */
-    entObj = 0.0;
-    for (let ih = it + 1; ih < histogram.length; ih++) {
-      if (histogram[ih] !== 0) {
-        entObj -= (normHisto[ih] / P2[it]) * Math.log(normHisto[ih] / P2[it]);
-      }
-    }
-
-    /* Total entropy */
-    totEnt = entBack + entObj;
-
-    if (maxEnt < totEnt) {
-      maxEnt = totEnt;
-      threshold = it;
-    }
-  }
-  return threshold;
-}

package/src/operations/thresholds/mean.js

@@ -1,16 +0,0 @@
-/*
- * The method is present in: Uses the mean of grey levels as the threshold. It is described in:
- * Glasbey, CA (1993), "An analysis of histogram-based thresholding algorithms",
- * CVGIP: Graphical Models and Image Processing 55: 532-537
- * @param histogram - the histogram of the image
- * @param total - the number of pixels in the image
- * @returns {number} - the threshold
- */
-
-export default function mean(histogram, total) {
-  let sum = 0;
-  for (let i = 0; i < histogram.length; i++) {
-    sum += i * histogram[i];
-  }
-  return Math.floor(sum / total);
-}