You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
No, there is no caffe version of the low-rank bilinear method. There are
several reasons in providing demo 1 --
1. Caffe runs a little faster than matconvnet, so simply applying PCA to do
dimensionality reduction and the bilinear training using caffe is a fast
combo to play with.
2. It seems combining our low-rank theory plus other kernel methods
achieves faster training and better performance.
On Fri, May 19, 2017 at 2:43 AM, iFighting ***@***.***> wrote:
so you did not implement the Low-Rank-Bilinear-Pooling model in the
paper(cvpr 2017) using Caffe?
so,i have i problem, what is the demo 1 mean?
—
You are receiving this because you are subscribed to this thread.
Reply to this email directly, view it on GitHub
<#1>, or mute
the thread
<https://github.com/notifications/unsubscribe-auth/AGKZJHY1UTqBqKCaVR61sND83iPY80ADks5r7WRUgaJpZM4NgTha>
.
so you did not implement the Low-Rank-Bilinear-Pooling model in the paper(cvpr 2017) using Caffe?
so,i have i problem, what is the demo 1 mean?
The text was updated successfully, but these errors were encountered: