2022 Jul. 15 \Accepted2022 Aug. 22 \Publishedpublication date \SetRunningHeadK.Murata & T.T.TakeuchiDeblurring galaxy images
methods: data analysis — techniques: image processing — galaxies: structure
Deblurring galaxy images with Tikhonov regularization on magnitude domain
Abstract
We propose a regularization-based deblurring method that works efficiently for galaxy images. The spatial resolution of a ground-based telescope is generally limited by seeing conditions and much worse than space-based telescopes. This circumstance has generated considerable research interest in restoration of spatial resolution. Since image deblurring is a typical inverse problem and often ill-posed, solutions tend to be unstable. To obtain a stable solution, much research has adopted regularization-based methods for image deblurring, but the regularization term is not necessarily appropriate for galaxy images. Although galaxies have an exponential or Sérsic profile, the conventional regularization assumes the image profiles to behave linear in space. The significant deviation between the assumption and real situation leads to blurring the images and smoothing out the detailed structures. Clearly, regularization on logarithmic, i.e. magnitude domain, should provide a more appropriate assumption, which we explore in this study. We formulate a problem of deblurring galaxy images by an objective function with a Tikhonov regularization term on magnitude domain. We introduce an iterative algorithm minimizing the objective function with a primal-dual splitting method. We investigate the feasibility of the proposed method using simulation and observation images. In the simulation, we blur galaxy images with a realistic point spread function and add both Gaussian and Poisson noises. For the evaluation with the observed images, we use galaxy images taken by the Subaru HSC-SSP. Both of these evaluations show that our method successfully recovers the spatial resolution of the images and significantly outperforms the conventional methods. The code is publicly available from the GitHub(https://github.com/kzmurata-astro/PSFdeconv_amag).
1 Introduction
Images with high spatial resolution have brought significant impacts into astronomical research. Sharp images provided by the Hubble Space Telescope (HST) enable detailed analyses such as the morphological classification of galaxies, size measurement, and spatially resolved analysis (e.g. Shibuya et al. 2015, Suess et al. 2019ab). Further, higher resolution images provided by forthcoming space missions would also revolutionize studies of galaxy evolution and formation.
In contrast to these space telescopes, the spacial resolution of ground-based telescopes is severely limited by the sky-seeing. The atmospheric turbulence leads to a large point spread function (PSF) and degrades the spatial resolution. Nonetheless, the large ground-based telescopes such as Subaru still have many advantages such as obtaining a large amount of photons and providing wide field surveys (e.g. Subaru HSC-SSP; Aihara \yearcite2018PASJ…70S…4A, \yearcite2019PASJ…71..114A). Clearly, improvements of the spatial resolution of the ground-based telescopes would also provide significant impacts in astronomy.
In this study, we focus on a software based method, i.e. PSF deconvolution. While a hardware based technique such as adoptive optics (AO) has provided significantly sharp images (e.g. Suzuki et al. \yearcite2019PASJ…71…69S), the seeing effects could not be completely corrected in general. Furthermore, even AO imaging is limited by the diffraction limit and has a PSF. As a consequence, the spatial resolution of even AO imaging can be improved by a PSF deconvolution technique.
The PSF deconvolution is a technique that restores images degraded by a PSF and significantly improves the spatial resolution. There has been much research investigating deconvolution methods (Starck et al., 2002; Anconelli et al., 2007; Rydbeck, 2008; Chung et al., 2021; Shibuya et al., 2022), including blind deconvolution (Shi et al., 2017; Fétick et al., 2020; Hope et al., 2022) and machine-learning based methods (Schawinski et al., 2017; Sureau et al., 2020; Gan et al., 2021; Nammour et al., 2022). The most famous and classical method is the Richardson-Lucy algorithm (RL; Richardson \yearcite1972JOSA…62…55R, Lucy \yearcite1974AJ…..79..745L), which assumes the pixel values to follow a Poisson distribution and would provide a maximum likelihood solution.
The PSF deconvolution is an inverse problem and often ill-posed, leading to unstable solutions. Especially in case of restoration of noisy images, the noise would be significantly amplified. Hence, when using the RL algorithm, the iteration must be stopped at a suitable step, where the number of iterations can be interpreted as a hyper-parameter. In contrast, introducing a regularization term into the objective function allows a stable and more appropriate solution. Widely known regularization terms are, Tikhonov regularization (quadratic norm with a linear operator), total variation (TV; Rudin et al.\yearcite1992PhyD…60..259R), maximum entropy method (MEM; Narayan & Nityananda \yearcite1986ARA&A..24..127N), and sparsity in wavelet transformation (Starck et al., 2007). These regularization-based methods significantly contribute to the astronomical field, and recent research from the event horizon telescope (EHT) project reports reconstruction of black hole shadow images (Honma et al., 2014; Akiyama et al., 2017; Event Horizon Telescope Collaboration et al., 2019, Akiyama et al. 2022).
Nonetheless, these regularization terms are not necessarily appropriate for galaxy images. Although regularization such as the TV and Tikhonov adopts a linear operator when calculating the norm, galaxy profiles are much steeper than linear and generally expressed by an exponential function or Sérsic profile (Sérsic, 1963). In other words, the image gradient is so steep that the conventional regularization smooths out the high-contrast structures. As a natural consequence, regularization on logarithm (i.e. magnitude) image domain should alleviate the problem.
In this work, we propose a PSF deconvolution method with an appropriate regularization term for deblurring galaxy images. We introduce an objective function with a Tikhonov regularization term on magnitude domain, and optimize it via a primal-dual splitting method (Condat, 2013). Evaluations with simulation and observation images show that our method outperforms the conventional methods. The rest of this paper is organized as follows. In section 2, we provide the objective function to be solved, the optimization method, and comparison methods. In section 3, we evaluate our methods with both simulation and observation images. In section 4, we show the effectiveness of our methods and discuss some limitation and future prospects. Finally, we conclude our contribution in section 5.
2 Methods
In general, PSF deconvolution is an ill-posed problem due to observational noises, which lead to unstable solutions. The most basic way to restore an original image from an observational image is a least- method:
(1) |
(2) |
where is a diagonal matrix whose elements are variances at the corresponding position and is a system matrix to convolve the PSF with the original image. The positivity constraint is added because pixel values should not be negative.
However, this method is highly sensitive to observational noise. To address this problem, many previous studies adopt a regularization term to the objective function (Idier, 2008);
(3) |
where is a regularization function and is the regularization parameter to balance the data fidelity term ( term in this case) and the regularization term. The regularization term works as a priori probability distribution function in the framework of Bayesian inference, and should be appropriately chosen for images to be restored.
The quality of the restored images strongly depends on the regularization term in equation 3. In the following, we propose a regularization term appropriate for galaxy images.
2.1 Tikhonov regularization on magnitude domain
Natural images such as astronomical images are known to have smooth structures. In other words, values of adjacent pixels are similar to each other and norms of the image gradient should be small. This knowledge can be a priori information and often adopted as regularization terms, e.g. TV and Tikhonov regularization. The Tikhonov regularization is a quadratic norm with a linear operator;
(4) | |||||
(5) |
where we adopt L as a differential operator for both horizontal and vertical directions, and indicates the Euclidean norm.
Although the Tikhonov regularization successfully improves the image quality in astronomy (e.g. Kuramochi et al. \yearcite2018ApJ…858…56K111They call this term total squared variation.), it is not necessarily optimal for galaxy images. This is because the Tikhonov regularization linearly calculates the image gradients despite the fact that galaxies have a super linear profile such as a Sérsic profile. As a natural consequence, the image gradients in logarithmic space can be more appropriate for the regularization. Hence, we suggest a Tikhonov regularization term on magnitude-image domain. One problem in the use of magnitude is a divergence when pixel values are zero or close to zero. To avoid this problem, we apply asinh magnitudes suggested in Lupton et al. (1999).
(6) |
where = = 1.08574, and b is an arbitrary parameter to determine the linearity behaviour. While is linear in for , it shows logarithmic behaviour for . Although it is natural to choose to be an flux uncertainty as discussed in Lupton et al. (1999), we discuss the optimal choice of in section 4.3.
In summary, we propose the following formulation for a galaxy-image deblurring problem,
(7) |
2.2 Optimization
The difficulty in solving the problem (7) is the handling of the second term. It has three functions to be calculated; the linear operator , Euclidean norm, and asinh magnitude. To address this issue, we take a strategy that divides the variable into two terms, and , and updates them separately. Furthermore, the updates are conducted via a primal-dual splitting method (Condat, 2013), with which the calculations of linear operator and norm can be separated. This method has also another advantage that it can avoid an inner loop caused by a sub-problem, which is often appeared in the alternating direction method of multipliers (Boyd et al., 2011). In the following, we describe our strategy in detail.
Dividing the variable into flux and magnitude terms, we modify the problem (7) as the following.
(8) |
In the modified problem, the non-linear function (6), is removed from the objective function.
We solve the problem (2.2) via the primal-dual splitting method. To adopt the primal-dual splitting to our problem, here we define some variables and functions. We define the primal variable , which have flux and magnitude parts,
(9) |
To match the dimension, we also modify the observed image, dual variable, PSF matrix, and linear differential operator as, , , , and . Using these definitions, we also introduce data fidelity term F, regularization term H, and constraints G.
(10) | |||
(11) | |||
(12) | |||
(15) | |||
(18) |
With the above definitions, the problem(2.2) can be expressed as the following.
(19) |
This minimization problem is equivalent to a problem finding the saddle point of a Lagrangian,
(20) |
where is the dual variable of , and is the convex conjugate of . As can be seen, the linear operator and the function (corresponds to Euclidean norm) are separated in equation (20), and they can be easily calculated. This is the greatest advantage of the primal-dual splitting method.
The primal and dual variables can be updated as the following.
(21) | |||
(22) | |||
(23) |
where , , and are the update parameters described later, and prox indicates the proximal operator calculated as follows. The proximal operator with calculates the positivity constraint,
(24) |
The proximal operator with calculates the consistency between and ,
(25) | |||
(26) | |||
(27) |
where equation (22) indicates the weighted average of flux and magnitude with the weight vector , calculated as follows.
(28) | |||||
The proximal operation of Euclidean norm can be calculated as follows.
(29) | |||||
where we used Moreau’s identity (e.g. Bauschke & Combettes (2011)) in the first equality and defined in the last equality.
Initial estimation of is arbitrary but we choose the observed image . We confirmed that images with zero or random values lead to the same restoration results although more iterations are required for convergence. It indicates that our method is not sensitive to the initial estimation.
There are three tuning parameters in the primal-dual splitting, , , and . All of these parameters are mainly related to convergence speed, and not sensitive to the resultant image quality. The parameters and are related to updates of the primal and dual variables, and should be and , where is the Lipschitz constant of the equation (10),
(30) |
Although the choice of and is arbitrary, we define them as the following.
(31) |
(32) | |||||
With the above definition, these parameters always satisfy their constraint. The parameter is an update rate and can be modified during the iteration. The optimal choice of may accelerate the convergence, making use of the previous iteration. Nonetheless, we simply adopt of one, that is, we do not use the information from the previous update.
With the above setting, we can solve the problem (20). Nonetheless, the convergence might be very slow, depending on the parameters and . This is because, if , in equation (29) converges to 1 and not sensitive to the regularization parameter . This means that many iterations are required to reflect the regularization into the restored image. To avoid this situation, we scale the image and the variance beforehand. The scaling parameter is as follows.
(33) |
This scaling leads to and . Although is independent of , the primal variable strongly depends on because the scaling factor is proportional to . This scaling as a pre-processing significantly accelerates the convergence of our problem.
2.3 Comparison methods
The main objective of this paper is to investigate the feasibility of Tikhonov regularization on magnitude domain. For this purpose, we compare our method with a widely applied RL method and a method with conventional Tikhonov regularization on flux domain. We explain these methods in the following.
2.3.1 Richardson-Lucy algorithm
The RL method is a maximum-likelihood method assuming pixel values to follow a Poisson distribution. A given initial estimated image is iteratively updated to increase the likelihood and the positivity constraint is automatically satisfied. The update at the nth iteration is conducted as follows.
(34) | |||||
where and stand for multiplication and division of the same elements. Since the iteration should monotonically increase the likelihood, the infinite number of iterations would lead to a maximum likelihood solution. However, the iteration should stop at some time to avoid the divergence, i.e. the noise amplification. The stopping criterion is somewhat arbitrary and can be regarded as a hyper parameter. We choose the number of iterations to maximize the restored image quality although it is impossible to determine it in reality because we do not have the ground-truth. This choice leads to an overestimation of the RL performance, but our method still outperforms the RL method as shown in later.
2.3.2 Tikhonov regularization on flux domain
Conventional Tikhonov regularization methods adopt a regularization on flux domain. Hence, the objective function is very similar to ours and the only difference is asinh magnitude in equation (7). Hereafter we simply refer this method as the Tikhonov method. For a fare comparison, we perform the same optimization method as the proposed method, the primal-dual splitting method.
3 Evaluation
We evaluate the capability of the proposed method using simulation and observation images. In the following, we describe our evaluation methods and quantitative metrics.
3.1 Simulation
Simulation studies are suitable for a principle demonstration of our method because we have ground-truth images and perfect PSFs. The former can be directly compared with the reconstructed images, and owing to the latter we can also directly evaluate our method without uncertainty in PSFs.
We retrieved one spiral and one elliptical galaxies from the Subaru HSC-SSP DR2 (Aihara et al., 2019) observed with the i band. Hereafter we call them Spiral-1 and Elliptical-1, respectively. The use of different morphologies is suitable for performance verification. We visually chose the galaxies using the HSC map222https://hsc-release.mtk.nao.ac.jp/doc/index.php/tools-2/ and show their coordinates and redshifts in the upper side of Table 3.3. The galaxies have moderate redshifts, so that we can ignore the PSF blurring and avoid saturation. We resampled and shrank the images to images with 6464 pixels. The magnification factors of the pixel scales were 4.2 and 2.1 for Spiral-1 and Elliptical-1, respectively333It corresponds to pixel scales of 0.7 and 0.35 arcsec/pixel while the original is 0.168 arcsec/pixel.. Figures 1a and 2a show their resampled images.
The images were blurred with a realistic PSF. While Gaussian functions are often applied as a PSF, they are clearly distinct from realistic ones. We used a more realistic PSF. We combined the PSFs for Spiral-1 and Elliptical-1, which were provided by the HSC project444https://hsc-release.mtk.nao.ac.jp/psf/pdr2/. The FWHM of the combined PSF was 3 pixel. Because the images were shrank as mentioned in the previous paragraph, the convolution with the combined PSFs significantly blurred the images.
We added noises to the blurred images. To represent photon noises from both the background and objects, we applied Gaussian and Poisson distributions, respectively. We note that the sky background had been subtracted from the images and were assumed to be uniform across the images, and the sky noise was able to be expressed as a Gaussian distribution. We set the standard deviation of the Gaussian noise to 1.0% of the peak signal, whereas we produced two Poisson noises: the standard deviations of 1.0% and 5.0% of the peak signal. Hereafter the noise levels are referred to as 1.0% and 5.0% despite the additional 1.0% Gaussian noise. The procedure of the noise production is the same for both Spiral-1 and Elliptical-1. Panels (b) and (f) in figures 1 and 2 show the blurred Spiral-1 and Elliptical-1 images with 1.0% and 5.0% noises, respectively. The S/N at the centres are about 70 and 20 for both morphologies, respectively.
We adopted our deblurring method to the images. We set the hyper parameter to 2.0 for Spiral-1 while 16.0 and 4.0 for Elliptical-1 with 1.0% and 5.0% noises, respectively. The other parameter b was set to 1.0, where is the median flux uncertainty in the blurred image. The number of iterations was 1000 unless otherwise stated. We discuss the appropriate parameter values in section 4.3.
3.2 Application on real images
To evaluate our method with more realistic situations, we applied it on real observation images. In contrast to the simulation, observation images could have unknown and/or systematic errors so that PSF deconvolution becomes a more difficult problem. We chose one spiral and one elliptical galaxies from the HSC-SSP DR2 as listed in the lower side of Table 3.3. Hereafter we call them Spiral-2 and Elliptical-2. They have an appropriate size to fit to 6464 pixel images as shown in panels (b) and (f) of figures 3 and 4. We obtained the images, the variances, and the PSFs of each galaxy from the public data release site555https://hsc-release.mtk.nao.ac.jp/doc/index.php/tools-2/. We retrieved the images from both HSC-DUD and HSC-Wide surveys to obtain deep and shallow images, respectively. The S/N at the centres of Spiral-2 and Elliptical-2 were 409 and 178 for HSC-DUD, and 105 and 53 for HSC-Wide, respectively. We used only i-band images since other band images have no reference HST images as described later. The typical seeing at the i-band was 0.6 arcsec (Aihara et al., 2019). We did not use mask information because the images were produced with a sufficient number of observations and no noticeable artefacts were found.
These observed images were deblurred with our method. We set to 2.0 and b to 1.0 for both Spiral-2 and Elliptical-2. We discuss the appropriate parameter values in section 4.3.
Since we did not have ground-truth images, we instead used images taken with the HST. The HST has the F814W filter, whose wavelength coverage is similar to the i-band, so that the images can be used as a proxy of the ground-truth. The pixel scale was 0.05 arcsec, which were resampled to 0.168 arcsec to match the pixel scale of the Subaru/HSC. To avoid uncertainties in the flux calibration and sky subtraction, we scaled the images and added offsets to them to match the restored HSC i-band images. The HST images were obtained from the Hubble Legacy Archive (Jenkner et al., 2006; Whitmore et al., 2008, 2016).
3.3 Metrics
For quantitative image evaluation, we applied two widely applied metrics, the peak signal to noise ratio (PSNR) and structural similarity (SSIM; Wang et al. (2004)). The PSNR of image is defined as
(35) | |||||
MSE | (36) |
where is the number of elements, and the subscript indicates the ground-truth image. By definition, images similar to the ground-truth have a high PSNR.
The definition of SSIM is the following.
(37) |
(38) | |||||
(39) | |||||
(40) | |||||
(41) | |||||
(42) | |||||
(43) |
where is the average value, is the standard deviation, is the covariance, is the dynamic range of the image, and and are arbitrary small values, where we adopted 0.001, following Wang et al. (2004). The terms , , and correspond to comparisons between the image and reference in terms of the luminance, contrast, and structure, respectively. When the image and reference are similar, these terms should be close to one, and the SSIM should also be close to one.
Since our simulation has a reference image for each galaxy, these metrics can be appropriate for our evaluation. On the other hand, the HST images are not perfect ground-truth ones for the observational evaluation. For example, when the restored HSC images have better image quality, the HST images do not work as the ground-truth. Hence, a care must be taken for the evaluation results.
Target galaxies used for the evaluation with simulation and observation. Name R.A. Dec. z Simulation Spiral-1 150.746077 2.342989 0.044 Elliptical-1 150.8170172 3.4772409 0.106 Observation Spiral-2 150.1728195 2.6090672 0.265 Elliptical-2 150.687837 2.61864322 0.860a
-
a
photometric redshift from Tanaka et al. (2018).
4 Results & Discussion
4.1 Image quality
Figures 1 and 2 show the image-restoration results for Spiral-1 and Elliptical-1, respectively. While all the three methods (RL, Tikhonov, and this work) successfully restore the blurred and noisy images (panels b and f), our method shows the best performance. Remarkable distinction can be seen especially in noisier images (bottom panels). We show the quantitative comparison in table 1. In the following, we discuss the image qualities in detail.
Reconstructed images with the RL method (panels c and g) show higher noise despite the higher spatial resolution than the blurred ones (panels b and f). This is because the iteration of the RL method amplifies the noise while improving the resolution. Owing to the trade-off, the number of iterations should be optimized. We determined the number to maximize the PSNR. While the best numbers of iterations were slightly different for PSNR and SSIM, we show the maximum values of them in table 1. Whereas we can determine the best number of iterations in a simulation study, we could not in general, so that the use of the best numbers leads to unfair comparisons. Nonetheless, the restored images with our method still show higher image qualities than those from the RL method. For example, for the Spiral-1 and Elliptical-1 images with 1% noises, the RL method provides the PSNRs of 40.39 and 43.98 dB whereas ours show 43.07 and 57.11 dB, respectively. These results strongly suggest that our method outperforms the RL method. We have to note that the image quality is affected by the number of iterations even in our method, which we discuss in subsection 4.2. Since the increase of the number of iterations after exceeding 1000 affects only a few central pixels, which could not be seen visually, we show only images with the 1000 iterations in the figures 1 and 2.
Panels (d) and (h) in figures 1 and 2 show the Spiral-1 and Elliptical-1 images that have 1 and 5% noises and are restored with the Tikhonov regularization. Compared with the results from the RL method, high frequency components caused by noises are reduced owing to the regularization, but the images are blurred. This results in lower PSNRs and SSIMs as shown in table 1. The low image qualities resulted from the regularization suggest that the assumed prior is not appropriate. Since both spiral and elliptical galaxies tend to have intensity profiles that exponentially change with the position, minimizing the gradients in linear space leads to blurring detailed structures, as mentioned in the introduction. In contrast, images restored with our method (panels e and i) are appropriately smoothed but remarkably reproduce the galaxy structures. The quantitative comparison in table 1 also shows that our method leads to the best qualities. These results suggest that the proposed regularization, a quadratic norm of the differential image in magnitude space (i.e. log space), is appropriate.
Since the elliptical galaxies are compact and the intensity profiles rapidly change, the difference of the restored images may not be obvious. To see the difference more clearly, we plot in figure 5a the horizontal profiles at the centre of the Elliptical-1 images, where the added noise level is 5.0%. At the first look, any de-blurring method produces sharper profiles than the blurred one (grey). Among them, our method (bright cyan) shows the most similar profile to the original (black).
Figures 3 and 4 show the results on real images (Spiral-2 and Elliptical-2, respectively). Similar to the simulation results, our method best restores the detailed structures in the galaxies. The quantitative evaluation in table 2 also shows that our method basically produces the highest PSNRs and SSIMs. The only case our method leads to lower PSNR than the RL is for Elliptical-2 in HSC-DUD. This is because the S/N exceeds 170 as mentioned in section 3.2. Although the RL method is sensitive to a noise, it can work for high S/N images. On the other hand, the lower S/N case, i.e. in the HSC-Wide, our method produces a higher PSNR than the RL. It indicates that our method can work even for low S/N images.
4.2 Convergence
Here we discuss the optimal number of iterations for our method. It is generally difficult to determine the number of iterations. While increasing the number of iterations decreases the objective function, it directly leads to a high computational cost and does not necessarily improve the quality of restored images. Hence, the number of iterations should be optimized by balancing the computational costs with the resulting image quality.
The left panels of figure 6 show objective functions with the components against the number of iterations for the four galaxies. In all cases, the total cost and its components seem to converge at about 100 iterations. On the other hand, the PSNR for our method continues to increase until the number of iterations reaches to 100010000, as shown in the black lines in the right panels of figure 6.
The result that the PSNRs continues to increase despite the convergence of the objective function can be interpreted as the PSNR is sensitive to a small difference in the restored image. This is because the PSNR is expressed with a logarithmic of the MSE as shown in equation (35). In other words, the PSNR is sensitive to the detailed structures after the objective function almost converges and global structures are reproduced. It may lead to an idea of including a logarithmic function into the objective function to accelerate the convergence speed. However, it makes the calculation of the Lipschitz constant difficult and may also make the convergence unstable. Fortunately, our analysis shows that even the moderate number of iterations (i.e. 1000) produces a good image quality as shown in figure 6 and tables 1–2. Hence, the conclusion that our regularization method is effective for deblurring galaxy images is robust.
We apply the RL method with the optimal number of iterations that leads to the highest PSNR and SSIM. As mentioned earlier, it is usually not possible to know the optimal number, and one has to stop the iteration at some time. However, the optimal number of iterations for the RL method significantly depends on cases. As shown in the red lines in the right panels of figure 6, it was 23, 34, 127, and 35 for Spiral-1 with 5.0% noise, Elliptical-1 with 1.0% noise, Spiral-2 from the HSC-DUD, and Elliptical-2 from the HSC-Wide, respectively. The serious problem is an over-optimization, which leads to a significantly low PSNR and degrades the image as shown in figure 7a and 7c.
In contrast, our method is stable during the iterations. As shown in figure 7b and 7d, the large number of iteration does not degrade the restored images. We note that the PSNR of our method decreases with the number of iterations for real observation images as shown in figure 6g and 6h. It suggests that the best number of iterations is 572 for Elliptical-2 from HSC-Wide, and the adopted number of 1000 is too large. Although PSNRs from both RL and our methods decrease with increasing the iterations, the causes are different as indicated from figure 7. To explore the cause of the decrease in PSNR, we show the horizontal profile of Elliptical-2 from the HSC-Wide in figure 5b. It shows that, in our method, increasing the number of iterations leads to a sharper profile than the HST image. One possible interpretation is that the PSF is slightly fatter than the reality because this behaviour is only seen in case of real images. If this is the case, the optimization leads to too sharp images and it might be better to adopt a moderate number of iterations. Nonetheless, as indicated in figure 7b and 7d, too many iterations do not lead to noise amplification. Hence, we conclude that our method can produce stable solutions.
4.3 Dependence on hyper-parameters
The qualities of restored images depend on hyper parameters and our method have four parameters: , , and . The latter two parameters, and , are the step lengths of the primal-dual splitting method and, in this study, they are automatically determined by equations (31) and (32). In the following, we discuss the general characteristics of the former parameters, and , and investigate the dependence of our method on these parameters.
The parameter is used in the definition of asinh magnitude which is proportional to and when and , respectively. The concept of using asinh magnitude is to appropriately treat pixels having zero or negative flux caused by a noise. In this context, it is natural to choose to be related to flux uncertainty as suggested in Lupton et al. (1999). In the regularization point of view, the parameter should be less than the brightness which fine structures to be restored would have. As discussed in section 2, galaxies have much steeper profiles than linear and this is why we apply asinh magnitude in our regularization. Nonetheless, galaxy structures fainter than is calculated in linear space and they can be smoothed out if is inappropriately large. In the optimization point of view, it is favourable that is proportional to the flux uncertainty. In this case, both the data-fidelity and regularization terms in our objective function (7) include the square of flux uncertainty in the denominator and balancing these terms becomes less sensitive to S/N of the measurements.
The parameter is used to balance the data fidelity and regularization terms in equation (7). In general, a higher leads to smoothing out detailed structures while reducing noises, and this parameter should be chosen to balance these two effects. As mentioned in the previous paragraph, both terms in our cost function include the square of flux uncertainty in the denominator. In this case, the balance between the data fidelity and regularization terms is less sensitive to . Exception is the case where some structures have a remarkably high S/N. The asinh magnitude in our regularization shows a logarithmic behaviour at higher S/N regions, leading to less weight to the regularization than the data fidelity. That is, high S/N images may favour high , contrary to intuition.
We investigated the dependence of restored image quality on the two hyper parameters, and , via simulations. We used Spiral-1 and Elliptical-1 with noises of 1% and 5%, the same as in section 4.1. The images were restored with our method with and . The number of iterations was fixed to 10000. Figure 8 shows the PSNRs at various values of and for the above galaxies.
It can be seen that the PSNR is not sensitive to b at while a higher b leads to lower PSNRs. The latter indicates that fainter structures than b are smoothed out owing to unsuitable b as they can be treated in linear space as previously mentioned. From these results, we chose throughout this paper.
Next, we discuss the dependence on , which is not as simple as . The figure 8 shows that the best is typically , i.e. the lower and higher lead to noisy and blurred images, respectively. On the other hand, for Elliptical-1 with 1% noises, leads to the highest PSNR. It can be interpreted as this galaxy has a steep profile and high S/N regions, which leads to less weight in the regularization term owing to the asinh magnitude. In this case, despite using flux uncertainty in the regularization term, the best regularization parameter still depends on the S/N.
On the other hand, the use of could mitigate the problem. Figure 9 shows the PSNR against . A higher corresponds to lower weights in the data-fidelity term due to higher . We can see that the PSNR achieves the highest value at of slightly lower than 1.0, regardless of the galaxy type and the noise level. Hence, can be chosen to obtain of slightly less than 1.

(a)Original

(b)Blurred()

(c)RL

(d)Tikhonov

(e)This work

(f)Blurred()

(g)RL

(h)Tikhonov

(i)This work

(a)Original

(b)Blurred()

(c)RL

(d)Tikhonov

(e)This work

(f)Blurred()

(g)RL

(h)Tikhonov

(i)This work

(a)HST

(b)HSC-DUD

(c)RL

(d)Tikhonov

(e)This work

(f)HSC-Wide

(g)RL

(h)Tikhonov

(i)This work

(a)HST

(b)HSC-DUD

(c)RL

(d)Tikhonov

(e)This work

(f)HSC-Wide

(g)RL

(h)Tikhonov

(i)This work











(a) RL
(N=1000)

(b) This work
(N=10000)

(c) RL
(N=10000)

(d) This work
(N=10000)





Spiral-1 | ||||
---|---|---|---|---|
PSNR | SSIM | PSNR | SSIM | |
Blurred | 35.47 | 0.850 | 35.28 | 0.845 |
RL(max) | 40.39 | 0.962 | 38.74 | 0.943 |
Tikhonov | 38.90 | 0.946 | 37.09 | 0.915 |
This work | 43.07 | 0.980 | 39.55 | 0.952 |
Elliptical-1 | ||||
PSNR | SSIM | PSNR | SSIM | |
Blurred | 34.14 | 0.836 | 34.06 | 0.833 |
RL(max) | 43.98 | 0.986 | 42.20 | 0.979 |
Tikhonov | 41.69 | 0.979 | 38.15 | 0.948 |
This work | 57.11 | 0.999 | 45.47 | 0.991 |
Spiral-2 | HSC-DUD | HSC-Wide | ||
---|---|---|---|---|
PSNR | SSIM | PSNR | SSIM | |
Observed | 34.00 | 0.939 | 35.51 | 0.959 |
RL(max) | 40.98 | 0.990 | 39.69 | 0.986 |
Tikhonov | 40.21 | 0.988 | 38.16 | 0.981 |
This work | 41.07 | 0.990 | 40.25 | 0.988 |
Elliptical-2 | HSC-DUD | HSC-Wide | ||
PSNR | SSIM | PSNR | SSIM | |
Observed | 34.75 | 0.420 | 35.64 | 0.554 |
RL(max) | 44.25 | 0.962 | 41.69 | 0.872 |
Tikhonov | 38.59 | 0.824 | 40.17 | 0.886 |
This work | 41.38 | 0.920 | 42.92 | 0.951 |
4.4 Limitation and future prospect
In section 4.1, we demonstrated that the proposed regularization, which minimizes image gradients in magnitude domain, leads to the best restored image quality. Nonetheless, our method still has some limitations, which we discuss in the following.
The most considerable drawback of our method is the slow convergence; our method often requires a large number of iterations to obtain the best image quality, as discussed in section 4.2. Although images with a high quality can still be obtained with a moderate number of iterations, N=100-1000, more iterations are required to obtain the highest PSNR (figure 6 e-h). Calculation time under KM’s computer setup (Intel Core i5, quad-core 1.1 GHz) was 15s and 180s for 1000 and 10000 iterations, respectively. One thing to be considered is the rapid decrease of the cost function (figure 6 a-d). It indicates that the global structures are rapidly reproduced while the local detailed structures are not because it is less sensitive to the objective function, as discussed in section 4.2. Modifying the cost function to be sensitive to the detailed structures may accelerate the convergence, which could be a future work.
As in many other deblurring methods, our method provides only maximum-point estimation of the posterior probability distribution and no covariance matrix, although astronomical analysis usually requires uncertainty in pixel values. Besides, the variance could not be estimated from the restored image, since the pixel values are not independent of each other. Hence, some artefacts might be regarded as a “significant detection”. To address this problem, a Monte-Carlo technique or a bootstrap method with a different set of raw images could be a solution. A variational Bayes method could also be useful (e.g. Babacan et al. (2008), Ruiz et al. (2015), Sonogashira et al. (2017), \yearciteSonogashira18). In this method, not only the best point in each pixel value, but also the probability distribution can be simultaneously estimated. Although both the cost function and optimization method should be changed and the computational cost increases, this method is worth devising in a future work.
Finally, simultaneous restoration of multi-band images can be considered to produce resolution-matched images. To produce such data set, sharper images are usually blurred to match with the worst case, which leads to a loss of information and is not appropriate. However, deblurring all the images does not guarantee spatial resolution matching, especially in case of a different PSF size and/or S/N. To address this problem, the fact that galaxy structures are very similar in different band images can be used as a priori information. Of course the structures are not identical between different band images, but the colour gradients (in magnitude domain) should be smooth. If this is the case, our method can naturally be extended towards the colour space, which could also be a future work.
5 Conclusion
In this paper, we demonstrated the performance of Tikhonov regularization on magnitude domain for deblurring galaxy images. The regularization on magnitude domain was a natural consequence of handling galaxy images, which have an exponential or Sérsic intensity profile. The objective function with images on both flux and magnitude domain was optimized by updating them separately. We investigated the capability of our method via simulation and real observation images. The results showed that our method remarkably restored the spatial resolution of significantly blurred galaxy images. The quantitative evaluation confirmed that the proposed method was superior to both the classical RL method and conventional regularization-based method.
This work has been supported by the Japan Society for the Promotion of Science (JSPS) Grants-in-Aid for Scientific Research (19H05076 and 21H01128). This work has also been supported in part by the Sumitomo Foundation Fiscal 2018 Grant for Basic Science Research Projects (180923), and the Collaboration Funding of the Institute of Statistical Mathematics “New Development of the Studies on Galaxy Evolution with a Method of Data Science”.
We thank Prof. Shiro Ikeda for helpful discussions on this research.
The Hyper Suprime-Cam (HSC) collaboration includes the astronomical communities of Japan and Taiwan, and Princeton University. The HSC instrumentation and software were developed by the National Astronomical Observatory of Japan (NAOJ), the Kavli Institute for the Physics and Mathematics of the Universe (Kavli IPMU), the University of Tokyo, the High Energy Accelerator Research Organization (KEK), the Academia Sinica Institute for Astronomy and Astrophysics in Taiwan (ASIAA), and Princeton University. Funding was contributed by the FIRST program from Japanese Cabinet Office, the Ministry of Education, Culture, Sports, Science and Technology (MEXT), the Japan Society for the Promotion of Science (JSPS), Japan Science and Technology Agency (JST), the Toray Science Foundation, NAOJ, Kavli IPMU, KEK, ASIAA, and Princeton University.
The Pan-STARRS1 Surveys (PS1) have been made possible through contributions of the Institute for Astronomy, the University of Hawaii, the Pan-STARRS Project Office, the Max-Planck Society and its participating institutes, the Max Planck Institute for Astronomy, Heidelberg and the Max Planck Institute for Extraterrestrial Physics, Garching, The Johns Hopkins University, Durham University, the University of Edinburgh, Queen’s University Belfast, the Harvard-Smithsonian Center for Astrophysics, the Las Cumbres Observatory Global Telescope Network Incorporated, the National Central University of Taiwan, the Space Telescope Science Institute, the National Aeronautics and Space Administration under Grant No. NNX08AR22G issued through the Planetary Science Division of the NASA Science Mission Directorate, the National Science Foundation under Grant No. AST-1238877, the University of Maryland, and Eotvos Lorand University (ELTE) and the Los Alamos National Laboratory.
References
- Aihara et al. (2019) Aihara, H., et al. 2019, PASJ, 71, 114
- Aihara et al. (2018) Aihara, H., et al. 2018, PASJ, 70, S4
- Akiyama et al. (2017) Akiyama, K. et al. 2017, AJ, 153, 159
- Anconelli et al. (2007) Anconelli, B., Bertero, M., Boccacci, P., Carbillet, M., & Lanterib, H. 2007, Journal of Computational and Applied Mathematics, 198, 321
- Babacan et al. (2008) Babacan, S. D., Molina, R., & Katsaggelos, A. K. 2008, IEEE Transactions on Image Processing, 17, 326
- Bauschke & Combettes (2011) Bauschke, H. H. & Combettes, P. L. 2011, Convex Analysis and Monotone Operator Theory in Hilbert Spaces (New York: Springer), chap. 14 and 23
- Boyd et al. (2011) Boyd, S., Parikh. N., Chu, E., Peleato B., & Eckstein J., 2011, Foundations and Trends in Machine Learning, 3, 1
- Chung et al. (2021) Chung, H., Park, C., & Park, Y.-S. 2021, ApJS, 257, 66
- Condat (2013) Condat, L. 2013, J. Optimization Theory and Applications, 158, 460
- Event Horizon Telescope Collaboration et al. (2019) Event Horizon Telescope Collaboration, et al. 2019, ApJ, 875, L1
- Fétick et al. (2020) Fétick, R. J. L., Mugnier, L. M., Fusco, T., & Neichel, B. 2020, MNRAS, 496, 4209
- Gan et al. (2021) Gan, F. K., Bekki, K., & Hashemizadeh, A. 2021, arXiv e-prints, arXiv:2103.09711
- Honma et al. (2014) Honma, M., Akiyama, K., Uemura, M., & Ikeda, S. 2014, PASJ, 66, 95
- Hope et al. (2022) Hope, D. A., Jefferies, S. M., Li Causi, G., Landoni, M., Stangalini, M. and Pedichini, F. & Antoniucci, S. 2022, ApJ, 926, 88
- Idier (2008) Idier, J. 2008, Bayesian Approach to Inverse Problems (Wiley)
- Jenkner et al. (2006) Jenkner, H., Doxsey, R. E., Hanisch, R. J., Lubow, S. H., Miller, W. W., III, & White, R. L., 2006, in Astronomical Society of the Pacific Conference Series, Vol. 351, Astronomical Data Analysis Software and Systems XV, ed. C. Gabriel, C. Arviset, D. Ponz, & S. Enrique, 406
- Kuramochi et al. (2018) Kuramochi, K., Akiyama, K., Ikeda, S., Tazaki, F., Fish, V. L., Pu, H., Asada, K. & Honma, M. 2018, ApJ, 858, 56
- Lucy (1974) Lucy, L. B. 1974, AJ, 79, 745
- Lupton et al. (1999) Lupton, R. H., Gunn, J. E., & Szalay, A. S. 1999, AJ, 118, 1406
- Nammour et al. (2022) Nammour, F., Akhaury, U., Girard, J. N., Lanusse, F. and Sureau, F. and Ben Ali, C. & Starck, J. -L. 2022, arXiv e-prints, arXiv:2203.07412
- Narayan & Nityananda (1986) Narayan, R. & Nityananda, R. 1986, ARA&A, 24, 127
- Richardson (1972) Richardson, W. H. 1972, Journal of the Optical Society of America (1917-1983), 62, 55
- Rudin et al. (1992) Rudin, L. I., Osher, S., & Fatemi, E. 1992, Physica D Nonlinear Phenomena, 60, 259
- Ruiz et al. (2015) Ruiz, P., Zhou, X., Mateos, J., Molina, R., & Katsaggelos, A. K. 2015, Digital Signal Processing, 47, 116
- Rydbeck (2008) Rydbeck, G. 2008, ApJ, 675, 1304
- Schawinski et al. (2017) Schawinski, K., Zhang, C., Zhang, H., Fowler, L., & Santhanam, G. K. 2017, MNRAS, 467, L110
- Sérsic (1963) Sérsic, J. L. 1963, Boletin de la Asociacion Argentina de Astronomia La Plata Argentina, 6, 41
- Shi et al. (2017) Shi, X., Guo, R., Zhu, Y., & Wang, Z. 2017, Journal of Systems Engineering and Electronics, 28, 1236
- Shibuya et al. (2022) Shibuya, T., Miura, N., Iwadate, K., Fujimoto, S., Harikane, Y., Toba, Y., Umayahara, T. & Ito, Y. 2022, PASJ, 74, 73
- Sonogashira et al. (2017) Sonogashira, M., Funatomi, T., Iiyama, M., & Michihiko, M. 2017, IEEE Transactions on Image Processing, 26
- Sonogashira et al. (2018) Sonogashira, M., Funatomi, T., Iiyama, M., & Michihiko, M. 2018, IPSJ SIG Technical Report, 2018-CVIM-212
- Starck et al. (2007) Starck, J.-L., Fadili, J., & Murtagh, F. 2007, IEEE Transactions on Image Processing, 16, 297
- Starck et al. (2002) Starck, J. L., Pantin, E., & Murtagh, F. 2002, PASP, 114, 1051
- Sureau et al. (2020) Sureau, F., Lechat, A., & Starck, J. L. 2020, A&A, 641, A67
- Suzuki et al. (2019) Suzuki, T. L., Minowa, Y., Koyama, Y., Kodama, T. Hayashi, M.. Shimakawa, R., Tanaka, I. & Tadaki, K. 2019, PASJ, 71, 69
- Tanaka et al. (2018) Tanaka, M., et al. 2018, PASJ, 70, S9
- Wang et al. (2004) Wang, Z., Bovik, A. C., Sheikh, H. R., & Simoncelli, E. P. 2004, IEEE Transactions on Image Processing, 13, 600
- Whitmore et al. (2008) Whitmore, B., Lindsay, K., & Stankiewicz, M. 2008, in Astronomical Society of the Pacific Conference Series, Vol. 394, Astronomical Data Analysis Software and Systems XVII, ed. R. W. Argyle, P. S. Bunclark, & J. R. Lewis, 481
- Whitmore et al. (2016) Whitmore, B. C., et al. 2016, AJ, 151, 134