| 摘要 |
[Problem to be solved] To allow obtaining an exact solution at high speed when classification into multiple classes is performed using a graph cut operation without limitation on an energy that can be handled. [Solution] When each pixel forming image data is classified into one of N labels (where N > 2) which are ordered from 0 to N-1, binary graph setting means (13) sets a binary graph where the i-th layer i is a boundary between the label i-1 and the label i of the N labels, a class to which a label equal to or higher than i is assigned corresponds to a virtual label 0, and a class to which a label equal to or smaller than i-1 is assigned corresponds to a virtual label 1, layer-by-layer labeling means (15) performs a graph cut operation on the binary graph of each layer, and then label determining means (16) determines which of the N labels each pixel belongs to based on the virtual labels assigned to all the binary graphs. |
