public static void recoverNearest(Path dir)
Recover all images in the given dir. The passed directory contains a set of
images each corresponding to a specific date. The algorithm works in
iterations. In the first iteration, each image is used to recover holes in
the image that directly follows it. For example, the valid points in the
image of day 1 is used to recover missing points in the image of day 2. In
the second iteration, each image is used to recover missing points in the
preceding day. All odd numbered iterations work like the first iteration
while all even numbered iterations work like the second one. The algorithm
works like this until either all images are recovered or we run n iterations
where n is the total number of all images (time points).
public static void recoverInterpolationDir(Path dir)
Recover all images in the given directory by performing an interpolation
on each missing point from the two nearest points on each side on its
horizontal line (the nearest left and right points).
To determine which points should be interpolated (e.g., under cloud) and
which points should remain blank (e.g., in sea), we first overlay all
images on top of each other. If a point is missing from all images, it
indicates with very high probability that it should remain blank.
public static void addDate(Path dir)
public static void main(java.lang.String args)