Multiplication on frequency domain after DFT
I have a 100 x 100 image and 5x5 Kernel and I want to apply this kernel to this image
1- I add borders (5-1)/2 to the image and take DFT of image
2- I create another matrix which is of the same size as the image's and fill it with 0s. Then I put my original kernel on the upper left hand side of this new matrix.I will call it as filter now
3- Then do the same for the filter
Now I have imaginary and real parts of the image and filter. I multiply them as follows
for i to 102
for j to 102
{
newReal = realImage * realKernel - imaginaryImage * imaginaryKernel
newImaginary = realImage * imaginaryKernel + imaginaryImage * realKernel
}
and do InverseFourierTransform(newReal, newImaginary)
4- and then it produces an almost black result which, I think, is because of this padding operation with 0s.
If i do not apply a filter and just take dft and inverseDftmy code works. What am i missing here?
image-processing filter dft
add a comment |
I have a 100 x 100 image and 5x5 Kernel and I want to apply this kernel to this image
1- I add borders (5-1)/2 to the image and take DFT of image
2- I create another matrix which is of the same size as the image's and fill it with 0s. Then I put my original kernel on the upper left hand side of this new matrix.I will call it as filter now
3- Then do the same for the filter
Now I have imaginary and real parts of the image and filter. I multiply them as follows
for i to 102
for j to 102
{
newReal = realImage * realKernel - imaginaryImage * imaginaryKernel
newImaginary = realImage * imaginaryKernel + imaginaryImage * realKernel
}
and do InverseFourierTransform(newReal, newImaginary)
4- and then it produces an almost black result which, I think, is because of this padding operation with 0s.
If i do not apply a filter and just take dft and inverseDftmy code works. What am i missing here?
image-processing filter dft
I think it's better to use Euler's formula to represent the DFT image here. This way we have a frequency image and a image of phase shift (angle). Then just multiply the frequency image with the frequency image of the filter, and add the phase shift image with the phase shift image of the filter. It's just a multiply of complex numbers. That's not the problem of padding with zeros.
– Kaiwen Chang
Nov 15 at 16:40
add a comment |
I have a 100 x 100 image and 5x5 Kernel and I want to apply this kernel to this image
1- I add borders (5-1)/2 to the image and take DFT of image
2- I create another matrix which is of the same size as the image's and fill it with 0s. Then I put my original kernel on the upper left hand side of this new matrix.I will call it as filter now
3- Then do the same for the filter
Now I have imaginary and real parts of the image and filter. I multiply them as follows
for i to 102
for j to 102
{
newReal = realImage * realKernel - imaginaryImage * imaginaryKernel
newImaginary = realImage * imaginaryKernel + imaginaryImage * realKernel
}
and do InverseFourierTransform(newReal, newImaginary)
4- and then it produces an almost black result which, I think, is because of this padding operation with 0s.
If i do not apply a filter and just take dft and inverseDftmy code works. What am i missing here?
image-processing filter dft
I have a 100 x 100 image and 5x5 Kernel and I want to apply this kernel to this image
1- I add borders (5-1)/2 to the image and take DFT of image
2- I create another matrix which is of the same size as the image's and fill it with 0s. Then I put my original kernel on the upper left hand side of this new matrix.I will call it as filter now
3- Then do the same for the filter
Now I have imaginary and real parts of the image and filter. I multiply them as follows
for i to 102
for j to 102
{
newReal = realImage * realKernel - imaginaryImage * imaginaryKernel
newImaginary = realImage * imaginaryKernel + imaginaryImage * realKernel
}
and do InverseFourierTransform(newReal, newImaginary)
4- and then it produces an almost black result which, I think, is because of this padding operation with 0s.
If i do not apply a filter and just take dft and inverseDftmy code works. What am i missing here?
image-processing filter dft
image-processing filter dft
asked Nov 11 at 2:37
Thunfische
1151313
1151313
I think it's better to use Euler's formula to represent the DFT image here. This way we have a frequency image and a image of phase shift (angle). Then just multiply the frequency image with the frequency image of the filter, and add the phase shift image with the phase shift image of the filter. It's just a multiply of complex numbers. That's not the problem of padding with zeros.
– Kaiwen Chang
Nov 15 at 16:40
add a comment |
I think it's better to use Euler's formula to represent the DFT image here. This way we have a frequency image and a image of phase shift (angle). Then just multiply the frequency image with the frequency image of the filter, and add the phase shift image with the phase shift image of the filter. It's just a multiply of complex numbers. That's not the problem of padding with zeros.
– Kaiwen Chang
Nov 15 at 16:40
I think it's better to use Euler's formula to represent the DFT image here. This way we have a frequency image and a image of phase shift (angle). Then just multiply the frequency image with the frequency image of the filter, and add the phase shift image with the phase shift image of the filter. It's just a multiply of complex numbers. That's not the problem of padding with zeros.
– Kaiwen Chang
Nov 15 at 16:40
I think it's better to use Euler's formula to represent the DFT image here. This way we have a frequency image and a image of phase shift (angle). Then just multiply the frequency image with the frequency image of the filter, and add the phase shift image with the phase shift image of the filter. It's just a multiply of complex numbers. That's not the problem of padding with zeros.
– Kaiwen Chang
Nov 15 at 16:40
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53245374%2fmultiplication-on-frequency-domain-after-dft%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53245374%2fmultiplication-on-frequency-domain-after-dft%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
I think it's better to use Euler's formula to represent the DFT image here. This way we have a frequency image and a image of phase shift (angle). Then just multiply the frequency image with the frequency image of the filter, and add the phase shift image with the phase shift image of the filter. It's just a multiply of complex numbers. That's not the problem of padding with zeros.
– Kaiwen Chang
Nov 15 at 16:40