• Home
• net.haesleinhuepf
• clicy
• 2.5.0.1
• source code
• CLIJ2_AverageDistanceOfNClosestPointsBlock.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

plugins.haesleinhuepf.implementations.generated.CLIJ2_AverageDistanceOfNClosestPointsBlock Maven / Gradle / Ivy

package plugins.haesleinhuepf.implementations.generated;
import plugins.haesleinhuepf.AbstractCLIJ2Block;
import net.haesleinhuepf.clij2.plugins.AverageDistanceOfNClosestPoints;
// this is generated code. See src/test/java/net/haesleinhuepf/clicy/codegenerator for details
public class CLIJ2_AverageDistanceOfNClosestPointsBlock extends AbstractCLIJ2Block {
   
    /**
     * Determines the average of the n closest points for every point in a distance matrix.
     * 
     * This corresponds to the average of the n minimum values (rows) for each column of the distance matrix.
     * 
     * Parameters
     * ----------
     * distance_matrix : Image
     *     The a distance matrix to be processed.
     * distance_list_destination : Image
     *     A vector image with the same width as the distance matrix and height=1, depth=1.
     *     Determined average distances will be written into this vector.
     * n_closest_points_to_find : Number
     *     Number of smallest distances which should be averaged.
     * 
     */
    public CLIJ2_AverageDistanceOfNClosestPointsBlock() {
        super(new AverageDistanceOfNClosestPoints());
    }

}