News for hackers. Stuff that matters.
Re:Deep Laplacian Pyramid Networks for Fast and Accurate Sup... by bjornsing on Monday April 17, 2017 @07:18AM (#14130258)
As far as I can see there's only other kinds of Bs there (B = cubic(A), B = some_other_super_resolution_menthod(A), etc, etc). Can't find the real As... :P
Re:Deep Laplacian Pyramid Networks for Fast and Accurate Sup... by MagnumOpus on Monday April 17, 2017 @08:09AM (#14130386)
The left-most item in the examples is labeled "ground truth". That is your "A" unless we misunderstand you.
Re:Deep Laplacian Pyramid Networks for Fast and Accurate Sup... by x1798DE on Monday April 17, 2017 @08:47AM (#14130536)
I think that the parent means that the "Ground Truth" is the high resolution original, and they never show a "low resolution" original.

Presumably the process goes:

High res. (A') --(Downsample)--> Low res. (A) -- (Upscale) --> Reconstructed (B)

The sets show A' and B, but not A (unless I'm way off on what's happening in this process).

Re:Deep Laplacian Pyramid Networks for Fast and Accurate Sup... by bjornsing on Monday April 17, 2017 @03:12PM (#14133603)
Yes, that's what I meant!

If the Ground Truth where the A then I'd implement my very own "optimal super-resolution" like this:

def optimal_super_resolution(A): return A

It would be a huge breakthrough. :P

Re:Deep Laplacian Pyramid Networks for Fast and Accurate Sup... by ClassyJacket on Monday April 17, 2017 @11:42AM (#14131719)
They don't appear to show the input anywhere.