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

2022.02.11

More...
blank News flashes

News Flashes

New version of the European Patent Register – SPC proceedings information in the Unitary Patent Register.

2024-07-24

More...
blank Related links

Extract from the Register of European Patents

EP About this file: EP2823382

EP2823382 - EFFICIENT TOMOGRAPHIC PROCESSING FOR TOUCH DETERMINATION [Right-click to bookmark this link]
StatusNo opposition filed within time limit
Status updated on  09.08.2019
Database last updated on 29.10.2024
FormerThe patent has been granted
Status updated on  31.08.2018
FormerGrant of patent is intended
Status updated on  23.07.2018
FormerExamination is in progress
Status updated on  13.07.2018
Most recent event   Tooltip01.07.2022Lapse of the patent in a contracting state
New state(s): MK
published on 03.08.2022  [2022/31]
Applicant(s)For all designated states
FlatFrog Laboratories AB
Traktorvägen 11
226 60 Lund / SE
[2018/40]
Former [2015/03]For all designated states
FlatFrog Laboratories AB
Traktorvägen 11
226 60 Lund / SE
Inventor(s)01 / CHRISTIANSSON, Tomas
Prästvägen 8
S-247 45 Torna-hällestad / SE
02 / BJÖRKLUND, Andreas
Andjaktsvägen 16
S-226 53 Lund / SE
03 / WALLANDER, Mats Petter
Bankgatan 9 A
S-223 52 Lund / SE
04 / OHLSSON, Nicklas
Strandgårdsgränd 12
S-218 38 Bunkeflostrand / SE
 [2015/03]
Representative(s)Invent Horizon IP
Nordenskiöldsgatan 11A
211 19 Malmö / SE
[N/P]
Former [2018/40]Invent Horizon IP
Barometergatan 16B
211 17 Malmö / SE
Former [2015/03]Davies, Dominic Jack
FlatFrog Laboratories AB
Patent
Traktorvägen 11
226 60 Lund / SE
Application number, filing date13757203.807.03.2013
[2018/40]
WO2013SE50198
Priority number, dateSE2012005022009.03.2012         Original published format: SE 1250220
US201261608745P09.03.2012         Original published format: US 201261608745 P
[2015/03]
Filing languageEN
Procedural languageEN
PublicationType: A2 Application without search report
No.:WO2013133757
Date:12.09.2013
Language:EN
[2013/37]
Type: A2 Application without search report 
No.:EP2823382
Date:14.01.2015
Language:EN
The application published by WIPO in one of the EPO official languages on 12.09.2013 takes the place of the publication of the European patent application.
[2015/03]
Type: B1 Patent specification 
No.:EP2823382
Date:03.10.2018
Language:EN
[2018/40]
Search report(s)International search report - published on:SE19.12.2013
(Supplementary) European search report - dispatched on:EP22.09.2015
ClassificationIPC:G06F3/042, G06F17/14, G06F3/041
[2015/43]
CPC:
G06F3/04166 (EP,US); G06F3/0421 (EP,US); G06F3/046 (US);
G06F2203/04109 (EP,US)
Former IPC [2015/03]G06F3/042, G06F17/14
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 [2015/03]
Extension statesBANot yet paid
MENot yet paid
TitleGerman:EFFIZIENTE TOMOGRAPHISCHE VERARBEITUNG ZUR BERÜHRUNGSBESTIMMUNG[2015/03]
English:EFFICIENT TOMOGRAPHIC PROCESSING FOR TOUCH DETERMINATION[2015/03]
French:TOMOGRAPHIE EFFICACE POUR DÉTERMINATION DE CONTACT TACTILE[2015/03]
Entry into regional phase09.10.2014National basic fee paid 
09.10.2014Search fee paid 
09.10.2014Designation fee(s) paid 
11.09.2014Examination fee paid 
Examination procedure11.09.2014Examination requested  [2015/03]
09.04.2015Amendment by applicant (claims and/or description)
03.11.2015Despatch of a communication from the examining division (Time limit: M06)
11.05.2016Reply to a communication from the examining division
24.07.2018Communication of intention to grant the patent
27.08.2018Fee for grant paid
27.08.2018Fee for publishing/printing paid
27.08.2018Receipt of the translation of the claim(s)
Divisional application(s)The date of the Examining Division's first communication in respect of the earliest application for which a communication has been issued is  03.11.2015
Opposition(s)04.07.2019No opposition filed within time limit [2019/37]
Fees paidRenewal fee
31.03.2015Renewal fee patent year 03
31.03.2016Renewal fee patent year 04
14.03.2017Renewal fee patent year 05
12.03.2018Renewal fee patent year 06
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  TooltipHU07.03.2013
AL03.10.2018
AT03.10.2018
CY03.10.2018
CZ03.10.2018
DK03.10.2018
EE03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
IT03.10.2018
LT03.10.2018
LV03.10.2018
MC03.10.2018
MK03.10.2018
NL03.10.2018
PL03.10.2018
RO03.10.2018
RS03.10.2018
SE03.10.2018
SI03.10.2018
SK03.10.2018
SM03.10.2018
TR03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
PT03.02.2019
IE07.03.2019
LU07.03.2019
MT07.03.2019
BE31.03.2019
CH31.03.2019
LI31.03.2019
[2022/31]
Former [2021/32]HU07.03.2013
AL03.10.2018
AT03.10.2018
CY03.10.2018
CZ03.10.2018
DK03.10.2018
EE03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
IT03.10.2018
LT03.10.2018
LV03.10.2018
MC03.10.2018
NL03.10.2018
PL03.10.2018
RO03.10.2018
RS03.10.2018
SE03.10.2018
SI03.10.2018
SK03.10.2018
SM03.10.2018
TR03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
PT03.02.2019
IE07.03.2019
LU07.03.2019
MT07.03.2019
BE31.03.2019
CH31.03.2019
LI31.03.2019
Former [2021/26]AL03.10.2018
AT03.10.2018
CY03.10.2018
CZ03.10.2018
DK03.10.2018
EE03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
IT03.10.2018
LT03.10.2018
LV03.10.2018
MC03.10.2018
NL03.10.2018
PL03.10.2018
RO03.10.2018
RS03.10.2018
SE03.10.2018
SI03.10.2018
SK03.10.2018
SM03.10.2018
TR03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
PT03.02.2019
IE07.03.2019
LU07.03.2019
MT07.03.2019
BE31.03.2019
CH31.03.2019
LI31.03.2019
Former [2020/29]AL03.10.2018
AT03.10.2018
CZ03.10.2018
DK03.10.2018
EE03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
IT03.10.2018
LT03.10.2018
LV03.10.2018
MC03.10.2018
NL03.10.2018
PL03.10.2018
RO03.10.2018
RS03.10.2018
SE03.10.2018
SI03.10.2018
SK03.10.2018
SM03.10.2018
TR03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
PT03.02.2019
IE07.03.2019
LU07.03.2019
MT07.03.2019
BE31.03.2019
CH31.03.2019
LI31.03.2019
Former [2020/17]AL03.10.2018
AT03.10.2018
CZ03.10.2018
DK03.10.2018
EE03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
IT03.10.2018
LT03.10.2018
LV03.10.2018
MC03.10.2018
NL03.10.2018
PL03.10.2018
RO03.10.2018
RS03.10.2018
SE03.10.2018
SI03.10.2018
SK03.10.2018
SM03.10.2018
TR03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
PT03.02.2019
IE07.03.2019
LU07.03.2019
BE31.03.2019
CH31.03.2019
LI31.03.2019
Former [2020/11]AL03.10.2018
AT03.10.2018
CZ03.10.2018
DK03.10.2018
EE03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
IT03.10.2018
LT03.10.2018
LV03.10.2018
MC03.10.2018
NL03.10.2018
PL03.10.2018
RO03.10.2018
RS03.10.2018
SE03.10.2018
SI03.10.2018
SK03.10.2018
SM03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
PT03.02.2019
IE07.03.2019
LU07.03.2019
BE31.03.2019
CH31.03.2019
LI31.03.2019
Former [2020/09]AL03.10.2018
AT03.10.2018
CZ03.10.2018
DK03.10.2018
EE03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
IT03.10.2018
LT03.10.2018
LV03.10.2018
MC03.10.2018
NL03.10.2018
PL03.10.2018
RO03.10.2018
RS03.10.2018
SE03.10.2018
SI03.10.2018
SK03.10.2018
SM03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
PT03.02.2019
IE07.03.2019
LU07.03.2019
Former [2020/01]AL03.10.2018
AT03.10.2018
CZ03.10.2018
DK03.10.2018
EE03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
IT03.10.2018
LT03.10.2018
LV03.10.2018
MC03.10.2018
NL03.10.2018
PL03.10.2018
RO03.10.2018
RS03.10.2018
SE03.10.2018
SI03.10.2018
SK03.10.2018
SM03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
PT03.02.2019
LU07.03.2019
Former [2019/50]AL03.10.2018
AT03.10.2018
CZ03.10.2018
DK03.10.2018
EE03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
IT03.10.2018
LT03.10.2018
LV03.10.2018
MC03.10.2018
NL03.10.2018
PL03.10.2018
RO03.10.2018
RS03.10.2018
SE03.10.2018
SI03.10.2018
SK03.10.2018
SM03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
PT03.02.2019
Former [2019/46]AL03.10.2018
AT03.10.2018
CZ03.10.2018
DK03.10.2018
EE03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
IT03.10.2018
LT03.10.2018
LV03.10.2018
MC03.10.2018
NL03.10.2018
PL03.10.2018
RO03.10.2018
RS03.10.2018
SE03.10.2018
SK03.10.2018
SM03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
PT03.02.2019
Former [2019/40]AL03.10.2018
AT03.10.2018
CZ03.10.2018
DK03.10.2018
EE03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
IT03.10.2018
LT03.10.2018
LV03.10.2018
NL03.10.2018
PL03.10.2018
RO03.10.2018
RS03.10.2018
SE03.10.2018
SK03.10.2018
SM03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
PT03.02.2019
Former [2019/37]AL03.10.2018
AT03.10.2018
CZ03.10.2018
DK03.10.2018
EE03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
IT03.10.2018
LT03.10.2018
LV03.10.2018
NL03.10.2018
PL03.10.2018
RO03.10.2018
RS03.10.2018
SE03.10.2018
SM03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
PT03.02.2019
Former [2019/34]AL03.10.2018
AT03.10.2018
CZ03.10.2018
DK03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
IT03.10.2018
LT03.10.2018
LV03.10.2018
NL03.10.2018
PL03.10.2018
RS03.10.2018
SE03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
PT03.02.2019
Former [2019/26]AL03.10.2018
AT03.10.2018
CZ03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
LT03.10.2018
LV03.10.2018
NL03.10.2018
PL03.10.2018
RS03.10.2018
SE03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
PT03.02.2019
Former [2019/25]AT03.10.2018
CZ03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
LT03.10.2018
LV03.10.2018
NL03.10.2018
PL03.10.2018
RS03.10.2018
SE03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
Former [2019/24]AT03.10.2018
CZ03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
LT03.10.2018
LV03.10.2018
NL03.10.2018
PL03.10.2018
SE03.10.2018
BG03.01.2019
NO03.01.2019
GR04.01.2019
IS03.02.2019
Former [2019/23]AT03.10.2018
CZ03.10.2018
ES03.10.2018
FI03.10.2018
HR03.10.2018
LT03.10.2018
LV03.10.2018
NL03.10.2018
PL03.10.2018
BG03.01.2019
NO03.01.2019
IS03.02.2019
Former [2019/22]CZ03.10.2018
FI03.10.2018
LT03.10.2018
NL03.10.2018
PL03.10.2018
BG03.01.2019
NO03.01.2019
IS03.02.2019
Former [2019/21]FI03.10.2018
LT03.10.2018
NL03.10.2018
NO03.01.2019
IS03.02.2019
Former [2019/20]LT03.10.2018
NL03.10.2018
NO03.01.2019
Former [2019/17]NL03.10.2018
Documents cited:Search[A]  - Mathematical Methods in Image Reconstruction, Chapter 5: Reconstruction Algorithms ED - Frank Natterer; Frank Wübbeling, MATHEMATICAL METHODS IN IMAGE RECONSTRUCTION, SIAM BOOKS, PHILADELPHIA, USA, PAGE(S) 81 - 137, (20010101), ISBN 978-0-89871-622-1, XP002715809 [A] 1-15 * page 100 - page 102 *

DOI:   http://dx.doi.org/10.1137/1.9780898718324.ch5
 [A]  - Principles of computerized tomographic imaging, Chapter 6: Tomographic Imaging with Diffracting Sources ED - Avinash C Kak; Malcolm Slaney, PRINCIPLES OF COMPUTERIZED TOMOGRAPHIC IMAGING, IEEE PRESS, NEW YORK, NY, PAGE(S) 203 - 273, (19880101), ISBN 0-87942-198-3, XP002715808 [A] 1-15 * page 218 - page 242 *
 [A]  - AVERBUCH A ET AL, "Accurate and fast discrete polar fourier transform", CONFERENCE RECORD OF THE 37TH. ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, & COMPUTERS. PACIFIC GROOVE, CA, NOV. 9 - 12, 2003; [ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS], NEW YORK, NY : IEEE, US, (20031109), vol. 2, doi:10.1109/ACSSC.2003.1292319, ISBN 978-0-7803-8104-9, pages 1933 - 1937, XP010702602 [A] 1-15 * the whole document *

DOI:   http://dx.doi.org/10.1109/ACSSC.2003.1292319
 [A]  - Ofir Harari, "Ben-Gurion University of the Negev A New Nearly-Polar FFT and Analysis of Fourier-Radon Relations in Discrete Spaces", (20070615), URL: https://b38efb82-a-62cb3a1a-s-sites.googlegroups.com/site/ofirhararishomepage/OH MSc Thesis.pdf?attachauth=https://sites.google.com/site/ofirhararishomepage/OH%20MSc%20Thesis.pdf, (20150505), XP055187415 [A] 1-15 * the whole document *
 [A]  - NIGEL CHOU ET AL, "Generalized pseudo-polar Fourier grids and applications in registering ophthalmic optical coherence tomography images", SIGNALS, SYSTEMS AND COMPUTERS, 2009 CONFERENCE RECORD OF THE FORTY-THIRD ASILOMAR CONFERENCE ON, IEEE, PISCATAWAY, NJ, USA, (20091101), ISBN 978-1-4244-5825-7, pages 807 - 811, XP031679510 [A] 1-15 * the whole document *
 [A]  - ALEXANDER H DELANEY ET AL, "A Fast and Accurate Fourier Algorithm for Iterative Parallel-Beam Tomography", IEEE TRANSACTIONS ON IMAGE PROCESSING, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, (19960501), vol. 5, no. 5, ISSN 1057-7149, XP011025991 [A] 1-15 * the whole document *
 [A]  - KARSTEN FOURMONT, "Non-Equispaced Fast Fourier Transforms with Applications to Tomography", JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS, (20030901), vol. 9, no. 5, doi:10.1007/s00041-003-0021-1, ISSN 1069-5869, pages 431 - 450, XP055212808 [A] 1-15 * the whole document *

DOI:   http://dx.doi.org/10.1007/s00041-003-0021-1
 [A]  - FESSLER J A ET AL, "Iterative Tomographic Image Reconstruction Using Fourier-Based Forward and Back-Projectors", IEEE TRANSACTIONS ON MEDICAL IMAGING, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, (20040401), vol. 23, no. 4, doi:10.1109/TMI.2004.824233, ISSN 0278-0062, pages 401 - 412, XP011110219 [A] 1-15 * the whole document *

DOI:   http://dx.doi.org/10.1109/TMI.2004.824233
International search[A]US2009153519  (SUAREZ ROVERE VICTOR MANUEL [AR]);
 [A]WO2010064983  (FLATFROG LAB AB [SE], et al);
 [A]WO2011049512  (FLATFROG LAB AB [SE], et al);
 [A]WO2011139213  (FLATFROG LAB AB [SE], et al);
 [A]WO2011149149  (UNIVERSAL POWER KOREA INC [KR], et al)
by applicantUS2004252091
 US6972753
 US2006114237
 US2007075648
 US7432893
 WO2009048365
 US2009153519
 WO2010006882
 WO2010006883
 WO2010006884
 WO2010006885
 WO2010006886
 WO2010064983
 WO2010134865
 WO2011139213
    - K FOURMONT, "Non-Equispaced Fast Fourier Transforms with Applications to Tomography", JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS, (2003), vol. 9, no. 5, doi:doi:10.1007/s00041-003-0021-1, pages 431 - 450, XP055212808

DOI:   http://dx.doi.org/10.1007/s00041-003-0021-1
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.