You are here |
blog.georgeshakan.com | ||
| | | |
toaster.llc
|
|
| | | | ||
| | | |
bartwronski.com
|
|
| | | | In this blog post, I explore separable convolutional image filters: how can we check if a 2D filter is separable, and how to compute separable approximations to any arbitrary 2D filter represented in a numerical / matrix form using SVD. | |
| | | |
nickhar.wordpress.com
|
|
| | | | 1. Low-rank approximation of matrices Let $latex {A}&fg=000000$ be an arbitrary $latex {n \times m}&fg=000000$ matrix. We assume $latex {n \leq m}&fg=000000$. We consider the problem of approximating $latex {A}&fg=000000$ by a low-rank matrix. For example, we could seek to find a rank $latex {s}&fg=000000$ matrix $latex {B}&fg=000000$ minimizing $latex { \lVert A - B... | |
| | | |
web.navan.dev
|
|
| | Tutorial on creating an image classifier model using TensorFlow which detects malaria |