org.scijava.ops.image.features.lbp2d.DefaultLBP2D 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
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.features.lbp2d;

import java.util.ArrayList;
import java.util.Iterator;
import java.util.function.BiFunction;

import net.imglib2.Cursor;
import net.imglib2.RandomAccess;
import net.imglib2.RandomAccessibleInterval;
import net.imglib2.histogram.Histogram1d;
import net.imglib2.type.Type;
import net.imglib2.type.numeric.RealType;
import net.imglib2.type.numeric.integer.LongType;
import net.imglib2.view.Views;

import org.scijava.function.Functions;
import org.scijava.ops.spi.OpDependency;

/**
 * Default implementation of 2d local binary patterns
 *
 * @author Andreas Graumann (University of Konstanz)
 * @param 
 * @implNote op names='features.lbp2d'
 */
public class DefaultLBP2D> implements
	Functions.Arity3, Integer, Integer, ArrayList>
{

	@OpDependency(name = "image.histogram")
	private BiFunction, Integer, Histogram1d> histOp;

	/**
	 * TODO
	 *
	 * @param input
	 * @param distance
	 * @param histogramSize
	 * @return the output
	 */
	@Override
	public ArrayList apply(RandomAccessibleInterval input,
		Integer distance, Integer histogramSize)
	{
		ArrayList output = new ArrayList<>();

		if (input.numDimensions() != 2) throw new IllegalArgumentException(
			"Only 2 dimensional images allowed!");
		ArrayList numberList = new ArrayList<>();
		RandomAccess raInput = Views.extendZero(input).randomAccess();
		final Cursor cInput = Views.flatIterable(input).cursor();
		final ClockwiseDistanceNeighborhoodIterator cNeigh =
			new ClockwiseDistanceNeighborhoodIterator<>(raInput, distance);

		while (cInput.hasNext()) {
			cInput.next();
			double centerValue = cInput.get().getRealDouble();

			int resultBinaryValue = 0;

			cNeigh.reset();
			while (cNeigh.hasNext()) {
				double nValue = cNeigh.next().getRealDouble();
				int pos = cNeigh.getIndex();
				if (nValue >= centerValue) {
					resultBinaryValue |= 1 << pos;
				}
			}
			numberList.add(new LongType(resultBinaryValue));
		}

		Histogram1d hist = histOp.apply(numberList, histogramSize);
		Iterator c = hist.iterator();
		while (c.hasNext()) {
			output.add(new LongType(c.next().get()));
		}

		return output;

	}

	final class ClockwiseDistanceNeighborhoodIterator>
		implements java.util.Iterator
	{

		final private RandomAccess m_ra;

		final private int m_distance;

		final private int[][] CLOCKWISE_OFFSETS = { { 0, -1 }, { 1, 0 }, { 1, 0 }, {
			0, 1 }, { 0, 1 }, { -1, 0 }, { -1, 0 }, { 0, -1 } };

		// index of offset to be executed at next next() call.
		private int m_curOffset = 0;

		private int m_startIndex = 8;

		public ClockwiseDistanceNeighborhoodIterator(final RandomAccess ra,
			final int distance)
		{
			m_ra = ra;
			m_distance = distance;
		}

		/**
		 * {@inheritDoc}
		 */
		@Override
		public final boolean hasNext() {
			return m_curOffset != m_startIndex;
		}

		/**
		 * {@inheritDoc}
		 */
		@Override
		public final T next() {
			m_ra.move(CLOCKWISE_OFFSETS[m_curOffset][0] * m_distance, 0);
			m_ra.move(CLOCKWISE_OFFSETS[m_curOffset][1] * m_distance, 1);

			m_curOffset++;// = (m_curOffset + 1) & 7; //<=> (m_curOffset+1) % 8

			return m_ra.get();
		}

		/**
		 * {@inheritDoc}
		 */
		@Override
		public final void remove() {
			throw new UnsupportedOperationException();
		}

		public final int getIndex() {
			return m_curOffset;
		}

		/**
		 * Reset the current offset index. This does not influence the RandomAccess.
		 */
		public final void reset() {
			m_curOffset = 0;
			m_startIndex = 8;
		}

	}

}