
org.scijava.ops.image.stats.DefaultMinMax Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of scijava-ops-image Show documentation
Show all versions of scijava-ops-image Show documentation
Image processing operations for SciJava Ops.
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.stats;
import java.util.List;
import java.util.function.Function;
import net.imglib2.RandomAccessibleInterval;
import net.imglib2.loops.LoopBuilder;
import net.imglib2.type.numeric.RealType;
import net.imglib2.util.Pair;
import net.imglib2.util.Util;
import net.imglib2.util.ValuePair;
import org.scijava.ops.spi.Op;
/**
* Op to calculate the {@code stats.minMax}.
*
* @author Daniel Seebacher (University of Konstanz)
* @author Christian Dietz (University of Konstanz)
* @param input type
* @implNote op names='stats.minMax', priority='100.'
*/
public class DefaultMinMax> implements
Function, Pair>
{
/**
* TODO
*
* @param input the {@link RandomAccessibleInterval} to iterate over
* @return the minimum and the maximum of the input data
*/
@Override
public Pair apply(final RandomAccessibleInterval input) {
// set minVal to the largest possible value and maxVal to the smallest
// possible.
final I minVal = Util.getTypeFromInterval(input).createVariable();
minVal.setReal(minVal.getMinValue());
final I maxVal = minVal.createVariable();
maxVal.setReal(maxVal.getMaxValue());
List> minMaxes = LoopBuilder.setImages(input).multiThreaded()
.forEachChunk(chunk -> {
final I min = maxVal.copy();
final I max = minVal.copy();
chunk.forEachPixel((in) -> {
if (in.compareTo(min) < 0) min.set(in);
if (in.compareTo(max) > 0) max.set(in);
});
return new ValuePair<>(min, max);
});
final I raiMin = minMaxes.parallelStream() //
.map(pair -> pair.getA()) //
.reduce(maxVal, (result, min) -> min.compareTo(result) < 0 ? min
: result);
final I raiMax = minMaxes.parallelStream() //
.map(pair -> pair.getB()) //
.reduce(minVal, (result, max) -> max.compareTo(result) > 0 ? max
: result);
return new ValuePair<>(raiMin, raiMax);
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy