All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.scijava.ops.image.threshold.localNiblack.LocalNiblackThreshold Maven / Gradle / Ivy

The newest version!
/*
 * #%L
 * Image processing operations for SciJava Ops.
 * %%
 * Copyright (C) 2014 - 2024 SciJava developers.
 * %%
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 * 
 * 1. Redistributions of source code must retain the above copyright notice,
 *    this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 * #L%
 */

package org.scijava.ops.image.threshold.localNiblack;

import java.util.Arrays;
import java.util.function.Function;

import org.scijava.ops.image.threshold.ApplyLocalThresholdIntegral;
import net.imglib2.RandomAccessibleInterval;
import net.imglib2.algorithm.neighborhood.RectangleNeighborhood;
import net.imglib2.algorithm.neighborhood.RectangleShape;
import net.imglib2.algorithm.neighborhood.Shape;
import net.imglib2.outofbounds.OutOfBoundsFactory;
import net.imglib2.type.logic.BitType;
import net.imglib2.type.numeric.RealType;
import net.imglib2.type.numeric.real.DoubleType;
import net.imglib2.view.composite.Composite;

import org.scijava.function.Computers;
import org.scijava.ops.spi.Nullable;
import org.scijava.ops.spi.OpDependency;

/**
 * @implNote op names='threshold.localNiblack', priority='-100.'
 */
public class LocalNiblackThreshold> extends
	ApplyLocalThresholdIntegral implements
	Computers.Arity5, Shape, Double, Double, OutOfBoundsFactory>, //
			RandomAccessibleInterval> {

	private static final int INTEGRAL_IMAGE_ORDER_1 = 1;
	private static final int INTEGRAL_IMAGE_ORDER_2 = 2;

	@OpDependency(name = "threshold.localNiblack")
	private Computers.Arity4, T, Double, Double, BitType> computeThresholdNonIntegralOp;

	@OpDependency(name = "threshold.localNiblack")
	private Computers.Arity4>, T, Double, Double, BitType> computeThresholdIntegralOp;

	@OpDependency(name = "filter.applyCenterAware")
	private Computers.Arity4, Computers.Arity2, T, BitType>, Shape, OutOfBoundsFactory>, RandomAccessibleInterval> applyFilterOp;

	/**
	 * TODO
	 *
	 * @param input
	 * @param inputNeighborhoodShape
	 * @param c
	 * @param k
	 * @param outOfBoundsFactory
	 * @param output
	 */
	@Override
	public void compute(final RandomAccessibleInterval input,
		final Shape inputNeighborhoodShape, final Double c, final Double k,
		@Nullable OutOfBoundsFactory> outOfBoundsFactory,
		final RandomAccessibleInterval output)
	{
		// Use integral images for sufficiently large windows.
		RectangleShape rShape = inputNeighborhoodShape instanceof RectangleShape
			? (RectangleShape) inputNeighborhoodShape : null;
		if (rShape != null && rShape.getSpan() > 2 && !rShape.isSkippingCenter()) {
			// NB: under these conditions, the RectangleShape will produce
			// RectangleNeighborhoods (which is needed to perform the computations via
			// an IntegralImg).
			computeIntegral(input, rShape, c, k, outOfBoundsFactory,
				getIntegralImageOp(INTEGRAL_IMAGE_ORDER_1), getIntegralImageOp(
					INTEGRAL_IMAGE_ORDER_2), computeThresholdIntegralOp, output);
		}
		else {
			computeNonIntegral(input, inputNeighborhoodShape, c, k,
				outOfBoundsFactory, computeThresholdNonIntegralOp, output);
		}
	}

	public void computeNonIntegral(final RandomAccessibleInterval input,
		final Shape inputNeighborhoodShape, final Double c, final Double k,
		final OutOfBoundsFactory> outOfBoundsFactory,
		final Computers.Arity4, T, Double, Double, BitType> computeThresholdOp,
		final RandomAccessibleInterval output)
	{
		final Computers.Arity2, T, BitType> parameterizedComputeThresholdOp = //
			(i1, i2, o) -> computeThresholdOp.compute(i1, i2, c, k, o);
		applyFilterOp.compute(input, parameterizedComputeThresholdOp,
			inputNeighborhoodShape, outOfBoundsFactory, output);
	}

	public void computeIntegral(final RandomAccessibleInterval input,
		final RectangleShape inputNeighborhoodShape, final Double c, final Double k,
		final OutOfBoundsFactory> outOfBoundsFactory,
		final Function, RandomAccessibleInterval> integralImageOp,
		final Function, RandomAccessibleInterval> squareIntegralImageOp,
		final Computers.Arity4>, T, Double, Double, BitType> computeThresholdOp,
		final RandomAccessibleInterval output)
	{
		final Computers.Arity2>, T, BitType> parameterizedComputeThresholdOp = //
			(i1, i2, o) -> computeThresholdOp.compute(i1, i2, c, k, o);
		compute(input, inputNeighborhoodShape, outOfBoundsFactory, Arrays.asList(
			integralImageOp, squareIntegralImageOp), parameterizedComputeThresholdOp,
			output);
	}
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy