IP Library › Granted Patent US 10,121,233
Granted Patent B2
US 10,121,233 · App. 15/746,407 · Granted Nov 6, 2018

2D discrete fourier transform with simultaneous edge artifact removal for real-time applications

Inventors: Faisal Mahmood (Baltimore, MD); Märt Toots (Tallinn, EE); Lars-Göran Wallentin Öfverstedt (Okinawa, JP); Bo Ulf Skoglund (Okinawa, JP)
Assignee: OKINAWA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL CORPORATION
G06T5/10G06T5/002G06T2207/20056G06T2207/20192
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,121,233
App. No.
15/746,407
Granted
Nov 6, 2018
Kind
B2
Abstract

A method for performing 2-dimensional discrete Fourier transform of a subject image data to be performed in one or more digital processors includes performing 1-dimensional fast Fourier transform on each row of the subject image data and 1-dimensional fast Fourier transform on each column of the subject image, and performing a simplified fast Fourier transform processing on the extracted boundary image without performing column-by-column 1-dimensional fast Fourier transform by: performing 1-dimensional fast Fourier transform only on a first column vector in the extracted boundary image data, using scaled column vectors to derive fast Fourier transform of remaining columns of the extracted boundary image data, and performing 1-dimensional fast Fourier transform on each row of the extracted boundary image data. Then, fast Fourier transform of a periodic component of the subject image data with edge-artifacts removed and fast Fourier transform of a smooth component of the subject image data are derived from results of steps (b) and (c).

Claims (31)

1. A method for performing 2-dimensional discrete Fourier transform of a subject image data to be performed in one or more digital processors, the method comprising:

step (a) of extracting boundary image data from the subject image data;

step (b) of performing 2-dimensional fast Fourier transform of the subject image data by performing 1-dimensional fast Fourier transform on each row of the subject image data and performing 1-dimensional fast Fourier transform on each column of the subject image data;

step (c) of performing a simplified 2-dimensional fast Fourier transform processing on the extracted boundary image data without performing column-by-column 1-dimensional fast Fourier transform so as to derive fast Fourier transform of a smooth component, the step (c) including:

performing 1-dimensional fast Fourier transform only on a first column vector in the extracted boundary image data,

using scaled column vectors to derive fast Fourier transform of remaining columns of the extracted boundary image data, and

performing 1-dimensional fast Fourier transform on each row of the extracted boundary image data; and

step (d) of deriving fast Fourier transform of a periodic component of the subject image data with edge-artifacts removed by subtracting the fast Fourier transform of the smooth component derived in step (c) from the 2-dimensional fast Fourier transform of the subject image data performed by step (b).

2. The method according to claim 1 , wherein steps (b) and (c) are processed in parallel.

3. The method according to claim 1 ,

wherein said one or more processors include a host computer and one or more Field Programmable Gate Arrays (FPGAs) connected to the host computer, and

wherein steps (a) and (d) are performed by the host computer, and steps (b) and (c) are performed in parallel by one or more FPGAs.

4. A method for performing N-dimensional fast Fourier transform of an N-dimensional image data, where N is an integer greater than 2, the method comprising:

slicing said N-dimensional image data into a plurality of 2-dimensional image data; and

performing the method for performing 2-dimensional discrete Fourier transform of a subject image data as set forth in claim 1 on each of said plurality of 2-dimensional image data; and

deriving the N-dimensional fast Fourier transform of said N-dimensional image data from results of performing the method of claim 1 on each of said plurality of 2-dimensional image data.

5. A system for performing 2-dimensional discrete Fourier transform of a subject image data, comprising:

a host computer; and

one or more Field Programmable Gate Arrays (FPGAs) connected to the host computer by a bus,

wherein the host computer extracts boundary image data from the subject image data,

wherein said one or more FPGAs perform (i) 2-dimensional fast Fourier transform of the subject image data by performing 1-dimensional fast Fourier transform on each row of the subject image data and performing 1-dimensional fast Fourier transform on each column of the subject image data,

wherein said one or more FPGAs perform (ii) a simplified 2-dimensional fast Fourier transform processing on the extracted boundary image data without performing column-by-column 1-dimensional fast Fourier transform so as to derive fast Fourier transform of a smooth component, the processing including:

performing 1-dimensional fast Fourier transform only on a first column vector in the extracted boundary image data,

using scaled column vectors to derive fast Fourier transform of remaining columns of the extracted boundary image data, and

performing 1-dimensional fast Fourier transform on each row of the extracted boundary image data, and

wherein the host computer derives fast Fourier transform of a periodic component of the subject image data with edge-artifacts removed by subtracting the derived fast Fourier transform of the smooth component from the performed 2-dimensional fast Fourier transform of the subject image data.

6. The system according to claim 5 , wherein the host computer controls said one or more FPGAs such that (i) and (ii) are processed in parallel.

7. The system according to claim 6 ,

wherein the host computer is further configured to receive an N-dimensional image data, where N is an integer greater than 2, and slice said received N-dimensional image data into a plurality of 2-dimensional image data,

wherein said one or more FPGAs perform (i) and (ii) on each of said plurality of 2-dimensional image data, and

wherein the host computer derives N-dimensional Fourier transform of the N-dimensional image data from results of (i) and (ii) performed by said one or more FPGAs on each of said plurality of 2-dimensional image data.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 19, 2018
From: MAHMOOD, FAISAL; TOOTS, MÄRT; ÖFVERSTEDT, LARS-GÖRAN WALLENTIN; SKOGLUND, BO ULF
To: OKINAWA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL CORPORATION
Reel/Frame 044682/0441 →
Continuity (2)
Provisional Application 62194689 · Jul 20, 2015
Related Publication 20180204313A1 · Jul 19, 2018