| 摘要 |
PROBLEM TO BE SOLVED: To obtain an accurate solution at a high speed without any limit imposed on treatable energy when multiple classes are classified by graph cut processing.SOLUTION: When each pixel constituting image data is classified into one of N (>2) labels set in order, by binary graph setting means 13, with an i-th layer i classifying a label i-1 and a label i of N labels set as a boundary, a binary graph where a class to which a label of i or higher is allocated corresponds to a virtual label 0 and a class to which a label of i-1 or lower is allocated corresponds to a virtual label 1 is set. By each layer labeling means 15, graph cut processing is executed for the binary graph of each layer. Then, by label determination means 16, which of N labels each pixel belongs to is determined based on the virtual labels allocated to all binary graphs.SELECTED DRAWING: Figure 1 |
