[Boost.GIL] GSoC 2020 - FFT implementation

From: deb (mandaldebabrata123_at_[hidden])
Date: 2020-02-04 14:18:09

Hi, I am a third year undergrad from IIT Bombay. I am interested in PROJECT
1: Image Processing Algorithms for BOOST.GIL . I have gone through the
Getting started with Boost, Modular Boost Overview and Contributing page(on
git repository for boost.gil) to get a fair idea of how Boost works. 
I went over the boost Gil library looking for an implementation of FFT(Fast
Fourier transform) but could not find one . Since it is listed as a
suggested project topic for the GSoC 2020 ,  I was hoping to implement it as
part of my GSoC competency test. I have a few questions though:-

a. Should I try and implement 1D-DFT(using FFT) independent from 2D-DFT
(which is the more popular among image processing algorithms) ?

b. Should I submit the above mentioned algorithms as separate PRs or as a
single one? 

I am choosing FFT over other topics since it is an essential part of many
image processing algorithms like Wiener filters, tomographic reconstructions
etc. I have worked with image processing algorithms before on college
projects and I think that I will be able to pull it off as a GSoC competency
test.
Thank You.
Debabrata Mandal
CSE undergrad, IIT Bombay

--
Sent from: http://boost.2283326.n4.nabble.com/Boost-Dev-f2600599.html