D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D Rank & Sort Based on what ? brightest pixel? danfm.ca/thresher
D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D ∝ λ D Rank & Sort Based on what ? brightest pixel? * this actually does work surprisingly well... Seriously? * danfm.ca/thresher
part of cereal grain from the scaly, inedible chaff that surrounds it ... Threshing does not remove the bran from the grain. — Wikipedia part of a complete breakfast danfm.ca/thresher
get The PSF 1 Use TLIto roughly align the data get an initialization for the scene & for one randomly selected image 3 Solve the sparse least-squares problem to get The Scene for the same image iterate with a new image danfm.ca/thresher
get The PSF 1 Use TLIto roughly align the data get an initialization for the scene & for one randomly selected image 3 Solve the sparse least-squares problem to get The Scene for the same image iterate with a new image Online! i.e. You can work with REALLY big DAtasets danfm.ca/thresher