Timeline for Apply Singular Value Decomposition on Gabor filters
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2017 at 12:41 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Jan 21, 2014 at 22:14 | comment | added | lennon310 | you are very welcome! | |
| Jan 21, 2014 at 22:08 | comment | added | Christina | Okay Thank you so much. You are really an expert:) Que dios te bendiga!!:):) | |
| Jan 21, 2014 at 22:06 | comment | added | lennon310 | they select the first K singular values to approximate the equation. You can also use for i=1:K in the loop after svd | |
| Jan 21, 2014 at 21:38 | comment | added | Christina | But in the paper, they told that K is <4, so in your code, firstly K is equal to 7, secondly to 9 etc. ? | |
| Jan 21, 2014 at 21:28 | vote | accept | Christina | ||
| Jan 21, 2014 at 21:23 | comment | added | lennon310 | for i = -filtSizeL:filtSizeR means the size of f is filtSizeR+filtsizeL+1. v(i,:) is the ith row of v, and v(:,i)' is the ith row of v'. I don't think svd is better in time complexity, even if it is, the space complexity is very high: if size(f) is large, svd will be very slow, or even cannot finish due to OUT OF MEMORY error | |
| Jan 21, 2014 at 21:17 | comment | added | Christina | And please can you tell me why you took K as i=1:filtSizeR+filtsizeL+1 ? ah what is the difference between v(i,:) and v(:.i) ? finally, in the paper, they demonstrated that this method is more optimal than separable Gabor in terms of time complexity, so what is your opinion :) | |
| Jan 21, 2014 at 21:14 | comment | added | lennon310 | T is the transpose symbol, I used v(:,i)' in the code | |
| Jan 21, 2014 at 21:13 | comment | added | Christina | I would like to thank you so much for your response! Ok so you applied firstly the SVD, but what is the T in USV (shown in the formula of my question) ?.advance! | |
| Jan 21, 2014 at 20:58 | history | answered | lennon310 | CC BY-SA 3.0 |