Uses of Class net.sourceforge.jiu.color.quantization.MedianCutNode

Uses in package net.sourceforge.jiu.color.quantization

Constructors with parameter type net.sourceforge.jiu.color.quantization.MedianCutNode
MedianCutNode.MedianCutNode(MedianCutNode parent, int index1, int index2) Creates a node for a Median Cut tree of nodes with index values for some external color array and the parent node.

Fields of type net.sourceforge.jiu.color.quantization.MedianCutNode
MedianCutNode	MedianCutNode.leftSuccessor
MedianCutNode	MedianCutNode.parent
MedianCutNode	MedianCutNode.rightSuccessor
MedianCutNode	MedianCutQuantizer.root

Methods with parameter type net.sourceforge.jiu.color.quantization.MedianCutNode
void	MedianCutQuantizer.addNodes(MedianCutNode[] nodeList, MedianCutNode node)
double	MedianCutNode.computeRgbDistance(MedianCutNode node) Computes the distance in RGB color space between the representative color of this node and the argument node and returns it as non-negative value.
MedianCutNode	MedianCutQuantizer.findLeafToBeSplit(MedianCutNode node) Traverses tree given by argument node and returns leaf with largest distribution of samples for any of its three components.
int	MedianCutQuantizer.findNearestNeighbor(MedianCutNode[] nodes, int red, int green, int blue) For each node in the argument array computes the distance between the representative color of that node and the color given by the three argument samples.
void	MedianCutQuantizer.findRepresentativeColors(MedianCutNode node) Calls findRepresentativeColor with node if node is a leaf.
int	MedianCutQuantizer.setPaletteIndexValues(MedianCutNode node, int index) Recursively visits node and its descendants, assigning ascending palette index values to leaves via MedianCutNode.setPaletteIndex(int).
void	MedianCutNode.setSuccessors(MedianCutNode left, MedianCutNode right) Sets the successor nodes for this node.
void	MedianCutQuantizer.splitNode(MedianCutNode node)

Methods with return type net.sourceforge.jiu.color.quantization.MedianCutNode
MedianCutNode[]	MedianCutQuantizer.createLeafList() Creates a linear list of leaf nodes.
MedianCutNode	MedianCutQuantizer.findLeafToBeSplit(MedianCutNode node) Traverses tree given by argument node and returns leaf with largest distribution of samples for any of its three components.
MedianCutNode	MedianCutQuantizer.findNearestNeighbor(int[] rgb) For a given RGB value, searches the node in the internal node tree whose representative color is closest to this color.
MedianCutNode	MedianCutNode.getLeftSuccessor() Returns left successor node (or null if this node is a leaf).
MedianCutNode	MedianCutNode.getParentNode() Returns parent node (or null if this node is the root node).
MedianCutNode	MedianCutNode.getRightSuccessor() Returns right successor node (or null if this node is a leaf).
MedianCutNode	MedianCutNode.getSuccessor(int[] rgb)