EP 2902968 A4 20151209 - CLASSIFICATION DEVICE, CLASSIFICATION PROGRAMME, AND OPERATING METHOD FOR CLASSIFICATION DEVICE
Title (en)
CLASSIFICATION DEVICE, CLASSIFICATION PROGRAMME, AND OPERATING METHOD FOR CLASSIFICATION DEVICE
Title (de)
KLASSIFIZIERUNGSVORRICHTUNG, KLASSIFIZIERUNGSPROGRAMM UND BETRIEBSVERFAHREN FÜR DIE KLASSIFIZIERUNGSVORRICHTUNG
Title (fr)
DISPOSITIF DE CLASSIFICATION, PROGRAMME DE CLASSIFICATION ET PROCÉDÉ DE FONCTIONNEMENT POUR DISPOSITIF DE CLASSIFICATION
Publication
Application
Priority
- JP 2012217956 A 20120928
- JP 2013005752 W 20130927
Abstract (en)
[origin: EP2902968A1] [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.
IPC 8 full level
CPC (source: EP US)
G06F 18/24 (2023.01 - US); G06T 7/11 (2016.12 - EP US); G06T 7/162 (2016.12 - EP US); G06T 7/62 (2016.12 - EP US); G06T 11/206 (2013.01 - US); G06T 2207/10081 (2013.01 - EP US); G06T 2207/10088 (2013.01 - EP US); G06T 2207/10116 (2013.01 - EP US); G06T 2207/30048 (2013.01 - EP US); G06T 2207/30096 (2013.01 - EP US); G06T 2207/30101 (2013.01 - EP US); G06T 2207/30172 (2013.01 - EP US)
Citation (search report)
- [A] KOLMOGOROV V ET AL: "What energy functions can be minimized via graph cuts?", IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, IEEE COMPUTER SOCIETY, USA, vol. 26, no. 2, 1 February 2004 (2004-02-01), pages 147 - 159, XP011105986, ISSN: 0162-8828, DOI: 10.1109/TPAMI.2004.1262177
- [A] BOYKOV Y ET AL: "Graph cuts and efficient N-D image segmentation", INTERNATIONAL JOURNAL OF COMPUTER VISION, KLUWER ACADEMIC PUBLISHERS, NORWELL, US, vol. 70, no. 2, 1 November 2006 (2006-11-01), pages 109 - 131, XP002513244, ISSN: 0920-5691, DOI: 10.1007/S11263-006-7934-5
- See references of WO 2014050130A1
Designated contracting state (EPC)
AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR
Designated extension state (EPC)
BA ME
DOCDB simple family (publication)
EP 2902968 A1 20150805; EP 2902968 A4 20151209; EP 2902968 B1 20181128; JP 2014071715 A 20140421; JP 5897445 B2 20160330; US 2015199593 A1 20150716; US 9483715 B2 20161101; WO 2014050130 A1 20140403
DOCDB simple family (application)
EP 13840370 A 20130927; JP 2012217956 A 20120928; JP 2013005752 W 20130927; US 201514669518 A 20150326