Eduardo S. L. Gastal eslgastal@inf.ufrgs.br |
and |
Manuel M. Oliveira oliveira@inf.ufrgs.br |
ACM Transactions on Graphics.
Volume 36 (2017), Number 4, Proceedings of SIGGRAPH 2017, Article 145.
This is the supplementary material for our Spectral Remapping paper (SIGGRAPH 2017). If you wish to compute the following examples in your machine, go to our Project Website and look for our Julia source code.
As mentioned in the paper, Spectral Remapping is performed at the original image resolution, transforming the input image s onto its spectrally-remapped counterpart s̊ (note the small circle ∘ on top of s). Subsequently, a suitable resampling strategy may be employed to downscale the image, without the risk of introducing aliasing or losing high-frequency structured detail. The captions of the figures below follow the standard used in the paper, where each resampling algorithm is denoted by a specific letter:
Thus, for example, Z(s) indicates Lanczos downscaling applied to the original image s, while Z(s̊) indicates Lanczos downscaling applied to its spectrally-remapped counterpart s̊.
Important: the images below are best viewed in Google's Chrome or Chromium web browsers, as Internet Explorer (IE) cannot resize the images properly, and the zoom buttons do not work in Mozilla's Firefox.
Synthetic circular test patterns with spatial frequency increasing towards the center present a challenge for all downscaling algorithms. This is illustrated in the starchart figure. For this example, the original image on the left was reduced from 4,725 x 4,725 to 236 x 236 pixels (R=20 and \sigma=20). Previous approaches either discard high-frequency information (D(s) and W(s)), and/or introduce aliasing artifacts (O(s) and K(s)). Our wave alignment, as described in Section 4.3 of our paper, also fails in this case due to the impossibility of properly aligning such a circular wave of constant remapped frequency 0.4/R. However, by manually introducing a cut in the graph topology illustrated in Figure 5 of our paper, our wave alignment system returns a solution that retains the convergence of the stripes at the cost of a visual discontinuity, as shown by the results in the starchartcut example. Neither our spectral-remapping nor existing approaches produce optimal results for this challenging example.
The two illustrations below show the graph topology for the two cited examples. On the image to the right, note the absence of an edge connecting the following pairs of wave sets: W_32 to W_33, W_42 to W_43, and W_52 to W_53. Thus, two waves, each belonging to one of these non-connected sets, will not be aligned by the wave-alignment linear system.