blank Quick help
blank Maintenance news

Scheduled maintenance

Regular maintenance outages:
between 05.00 and 05.15 hrs CET (Monday to Sunday).

Other outages
Availability
Register Forum

2022.02.11

More...
blank News flashes

News flashes

New version of the European Patent Register - SPC information for Unitary Patents.

2024-03-06

More...
blank Related links

Extract from the Register of European Patents

EP About this file: EP3506200

EP3506200 - IMAGE SEGMENTATION METHOD, APPARATUS, AND FULLY CONVOLUTIONAL NETWORK SYSTEM [Right-click to bookmark this link]
StatusNo opposition filed within time limit
Status updated on  08.04.2022
Database last updated on 24.04.2024
FormerThe patent has been granted
Status updated on  30.04.2021
FormerGrant of patent is intended
Status updated on  16.12.2020
FormerRequest for examination was made
Status updated on  31.05.2019
FormerThe international publication has been made
Status updated on  03.03.2018
Most recent event   Tooltip14.07.2023Lapse of the patent in a contracting state
New state(s): HU
published on 16.08.2023  [2023/33]
Applicant(s)For all designated states
Hangzhou Hikvision Digital Technology Co., Ltd.
No.555 Qianmo Road
Binjiang District
Hangzhou, Zhejiang 310051 / CN
[2019/27]
Inventor(s)01 / SUN, Haiming
No.555 Qianmo Road
Binjiang District
Hangzhou Zhejiang 310051 / CN
02 / XIE, Di
No.555 Qianmo Road
Binjiang District
Hangzhou Zhejiang 310051 / CN
03 / PU, Shiliang
No.555 Qianmo Road
Binjiang District
Hangzhou Zhejiang 310051 / CN
 [2019/27]
Representative(s)Epping - Hermann - Fischer
Patentanwaltsgesellschaft mbH
Schloßschmidstraße 5
80639 München / DE
[2019/27]
Application number, filing date17842716.712.07.2017
[2019/27]
WO2017CN92614
Priority number, dateCN20161073416826.08.2016         Original published format: CN201610734168
[2019/27]
Filing languageZH
Procedural languageEN
PublicationType: A1 Application with search report
No.:WO2018036293
Date:01.03.2018
Language:ZH
[2018/09]
Type: A1 Application with search report 
No.:EP3506200
Date:03.07.2019
Language:EN
[2019/27]
Type: B1 Patent specification 
No.:EP3506200
Date:02.06.2021
Language:EN
[2021/22]
Search report(s)International search report - published on:CN01.03.2018
(Supplementary) European search report - dispatched on:EP17.04.2019
ClassificationIPC:G06T7/11, G06T7/143
[2019/27]
CPC:
G06T7/11 (EP,US); G06F18/24 (CN,US); G06F18/214 (CN,US);
G06N3/04 (CN,US); G06N3/08 (US); G06N3/084 (CN);
G06T7/143 (EP,US); G06T2207/10024 (EP,US); G06T2207/20081 (EP,CN,US);
G06T2207/20084 (EP,CN,US) (-)
Designated contracting statesAL,   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 [2019/27]
Extension statesBANot yet paid
MENot yet paid
Validation statesMANot yet paid
MDNot yet paid
TitleGerman:BILDSEGMENTIERUNGSVERFAHREN, VORRICHTUNG UND VOLLSTÄNDIG KONVOLUTIONALES NETZWERKSYSTEM[2019/27]
English:IMAGE SEGMENTATION METHOD, APPARATUS, AND FULLY CONVOLUTIONAL NETWORK SYSTEM[2019/27]
French:PROCÉDÉ DE SEGMENTATION D'IMAGE, APPAREIL ET SYSTÈME DE RÉSEAU ENTIÈREMENT CONVOLUTIF[2019/27]
Entry into regional phase05.03.2019Translation filed 
05.03.2019National basic fee paid 
05.03.2019Search fee paid 
05.03.2019Designation fee(s) paid 
05.03.2019Examination fee paid 
Examination procedure05.03.2019Examination requested  [2019/27]
06.11.2019Amendment by applicant (claims and/or description)
17.12.2020Communication of intention to grant the patent
26.04.2021Fee for grant paid
26.04.2021Fee for publishing/printing paid
26.04.2021Receipt of the translation of the claim(s)
Opposition(s)03.03.2022No opposition filed within time limit [2022/19]
Fees paidRenewal fee
05.03.2019Renewal fee patent year 03
25.06.2020Renewal fee patent year 04
Opt-out from the exclusive  Tooltip
competence of the Unified
Patent Court
See the Register of the Unified Patent Court for opt-out data
Responsibility for the accuracy, completeness or quality of the data displayed under the link provided lies entirely with the Unified Patent Court.
Lapses during opposition  TooltipHU12.07.2017
AL02.06.2021
AT02.06.2021
CY02.06.2021
CZ02.06.2021
DK02.06.2021
EE02.06.2021
ES02.06.2021
FI02.06.2021
HR02.06.2021
IT02.06.2021
LT02.06.2021
LV02.06.2021
MC02.06.2021
NL02.06.2021
PL02.06.2021
RO02.06.2021
RS02.06.2021
SE02.06.2021
SI02.06.2021
SK02.06.2021
SM02.06.2021
IE12.07.2021
LU12.07.2021
BE31.07.2021
CH31.07.2021
LI31.07.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
IS02.10.2021
PT04.10.2021
[2023/33]
Former [2023/30]AL02.06.2021
AT02.06.2021
CY02.06.2021
CZ02.06.2021
DK02.06.2021
EE02.06.2021
ES02.06.2021
FI02.06.2021
HR02.06.2021
IT02.06.2021
LT02.06.2021
LV02.06.2021
MC02.06.2021
NL02.06.2021
PL02.06.2021
RO02.06.2021
RS02.06.2021
SE02.06.2021
SI02.06.2021
SK02.06.2021
SM02.06.2021
IE12.07.2021
LU12.07.2021
BE31.07.2021
CH31.07.2021
LI31.07.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
IS02.10.2021
PT04.10.2021
Former [2022/36]AL02.06.2021
AT02.06.2021
CZ02.06.2021
DK02.06.2021
EE02.06.2021
ES02.06.2021
FI02.06.2021
HR02.06.2021
IT02.06.2021
LT02.06.2021
LV02.06.2021
MC02.06.2021
NL02.06.2021
PL02.06.2021
RO02.06.2021
RS02.06.2021
SE02.06.2021
SI02.06.2021
SK02.06.2021
SM02.06.2021
IE12.07.2021
LU12.07.2021
BE31.07.2021
CH31.07.2021
LI31.07.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
IS02.10.2021
PT04.10.2021
Former [2022/35]AL02.06.2021
AT02.06.2021
CZ02.06.2021
DK02.06.2021
EE02.06.2021
ES02.06.2021
FI02.06.2021
HR02.06.2021
LT02.06.2021
LV02.06.2021
MC02.06.2021
NL02.06.2021
PL02.06.2021
RO02.06.2021
RS02.06.2021
SE02.06.2021
SI02.06.2021
SK02.06.2021
SM02.06.2021
IE12.07.2021
LU12.07.2021
BE31.07.2021
CH31.07.2021
LI31.07.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
IS02.10.2021
PT04.10.2021
Former [2022/34]AL02.06.2021
AT02.06.2021
CZ02.06.2021
DK02.06.2021
EE02.06.2021
ES02.06.2021
FI02.06.2021
HR02.06.2021
LT02.06.2021
LV02.06.2021
MC02.06.2021
NL02.06.2021
PL02.06.2021
RO02.06.2021
RS02.06.2021
SE02.06.2021
SI02.06.2021
SK02.06.2021
SM02.06.2021
LU12.07.2021
BE31.07.2021
CH31.07.2021
LI31.07.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
IS02.10.2021
PT04.10.2021
Former [2022/29]AL02.06.2021
AT02.06.2021
CZ02.06.2021
DK02.06.2021
EE02.06.2021
ES02.06.2021
FI02.06.2021
HR02.06.2021
LT02.06.2021
LV02.06.2021
MC02.06.2021
NL02.06.2021
PL02.06.2021
RO02.06.2021
RS02.06.2021
SE02.06.2021
SI02.06.2021
SK02.06.2021
SM02.06.2021
LU12.07.2021
CH31.07.2021
LI31.07.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
IS02.10.2021
PT04.10.2021
Former [2022/26]AL02.06.2021
AT02.06.2021
CZ02.06.2021
DK02.06.2021
EE02.06.2021
ES02.06.2021
FI02.06.2021
HR02.06.2021
LT02.06.2021
LV02.06.2021
MC02.06.2021
NL02.06.2021
PL02.06.2021
RO02.06.2021
RS02.06.2021
SE02.06.2021
SK02.06.2021
SM02.06.2021
LU12.07.2021
CH31.07.2021
LI31.07.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
IS02.10.2021
PT04.10.2021
Former [2022/24]AT02.06.2021
CZ02.06.2021
DK02.06.2021
EE02.06.2021
ES02.06.2021
FI02.06.2021
HR02.06.2021
LT02.06.2021
LV02.06.2021
MC02.06.2021
NL02.06.2021
PL02.06.2021
RO02.06.2021
RS02.06.2021
SE02.06.2021
SK02.06.2021
SM02.06.2021
LU12.07.2021
CH31.07.2021
LI31.07.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
IS02.10.2021
PT04.10.2021
Former [2022/21]AT02.06.2021
CZ02.06.2021
DK02.06.2021
EE02.06.2021
ES02.06.2021
FI02.06.2021
HR02.06.2021
LT02.06.2021
LV02.06.2021
MC02.06.2021
NL02.06.2021
PL02.06.2021
RO02.06.2021
RS02.06.2021
SE02.06.2021
SK02.06.2021
SM02.06.2021
CH31.07.2021
LI31.07.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
IS02.10.2021
PT04.10.2021
Former [2022/18]AT02.06.2021
CZ02.06.2021
EE02.06.2021
ES02.06.2021
FI02.06.2021
HR02.06.2021
LT02.06.2021
LV02.06.2021
MC02.06.2021
NL02.06.2021
PL02.06.2021
RO02.06.2021
RS02.06.2021
SE02.06.2021
SK02.06.2021
SM02.06.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
IS02.10.2021
PT04.10.2021
Former [2022/10]AT02.06.2021
CZ02.06.2021
EE02.06.2021
ES02.06.2021
FI02.06.2021
HR02.06.2021
LT02.06.2021
LV02.06.2021
NL02.06.2021
PL02.06.2021
RO02.06.2021
RS02.06.2021
SE02.06.2021
SK02.06.2021
SM02.06.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
IS02.10.2021
PT04.10.2021
Former [2022/09]AT02.06.2021
CZ02.06.2021
ES02.06.2021
FI02.06.2021
HR02.06.2021
LT02.06.2021
LV02.06.2021
NL02.06.2021
PL02.06.2021
RO02.06.2021
RS02.06.2021
SE02.06.2021
SK02.06.2021
SM02.06.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
PT04.10.2021
Former [2022/08]AT02.06.2021
CZ02.06.2021
ES02.06.2021
FI02.06.2021
HR02.06.2021
LT02.06.2021
LV02.06.2021
NL02.06.2021
PL02.06.2021
RS02.06.2021
SE02.06.2021
SM02.06.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
Former [2022/07]AT02.06.2021
FI02.06.2021
HR02.06.2021
LT02.06.2021
LV02.06.2021
NL02.06.2021
PL02.06.2021
RS02.06.2021
SE02.06.2021
SM02.06.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
Former [2021/52]FI02.06.2021
HR02.06.2021
LT02.06.2021
LV02.06.2021
PL02.06.2021
RS02.06.2021
SE02.06.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
Former [2021/51]FI02.06.2021
HR02.06.2021
LT02.06.2021
LV02.06.2021
RS02.06.2021
SE02.06.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
Former [2021/49]FI02.06.2021
HR02.06.2021
LT02.06.2021
LV02.06.2021
SE02.06.2021
BG02.09.2021
NO02.09.2021
GR03.09.2021
Former [2021/47]FI02.06.2021
LT02.06.2021
BG02.09.2021
Former [2021/46]FI02.06.2021
LT02.06.2021
Documents cited:Search[XAI]  - Fisher Yu ET AL, "Multi-Scale Context Aggregation by Dilated Convolutions", (20160430), URL: https://arxiv.org/pdf/1511.07122, (20190409), XP055579352 [X] 1,2,7,8 * abstract * * sections 2-4 * * Table 1 * * figure 3 * [A] 3-5,9-11,13-15 [I] 6,12
 [XA]  - LIANG-CHIEH CHEN ET AL, "DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFs", ARXIV.ORG, CORNELL UNIVERSITY LIBRARY, 201 OLIN LIBRARY CORNELL UNIVERSITY ITHACA, NY 14853, (20160602), XP080705599 [X] 1,2,6-8,12 * abstract * * figures 1,4,7,612,13 * * sections 2,3 * [A] 3-5,9-11,13-15
 [A]  - JONATHAN LONG ET AL, "Fully convolutional networks for semantic segmentation", 2015 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), (20150601), doi:10.1109/CVPR.2015.7298965, ISBN 978-1-4673-6964-0, pages 3431 - 3440, XP055573743 [A] 1-15 * the whole document *

DOI:   http://dx.doi.org/10.1109/CVPR.2015.7298965
 [A]  - MARK EVERINGHAM ET AL, "The Pascal Visual Object Classes (VOC) Challenge", INTERNATIONAL JOURNAL OF COMPUTER VISION., US, (20090909), vol. 88, no. 2, doi:10.1007/s11263-009-0275-4, ISSN 0920-5691, pages 303 - 338, XP055536602 [A] 1-15 * section 3 *

DOI:   http://dx.doi.org/10.1007/s11263-009-0275-4
International search[Y]CN104067314  (CHINESE ACAD INST AUTOMATION) [Y] 1, 17, 16, 17 * , description, paragraphs [0018]-[0036], and figures 1-2 *;
 [A]US2015117760  (WANG XIAOYU [US], et al) [A] 1-17* , entire document *;
 [Y]CN104700100  (HARBIN INST OF TECHNOLOGY) [Y] 1, 17, 16, 17 * , description, paragraphs [0020]-[0033], and figure 1 *;
 [A]CN105389584  (UNIV NORTHWESTERN POLYTECHNICAL) [A] 1-17 * , entire document *;
 [A]CN105528575  (UNIV CAPITAL NORMAL) [A] 1-17 * , entire document *
The EPO accepts no responsibility for the accuracy of data originating from other authorities; in particular, it does not guarantee that it is complete, up to date or fit for specific purposes.