{'fraction_non_alphanumeric': 0.0142602495543672, 'fraction_numerical': 0.0017825311942959, 'mean_word_length': 5.684523809523809, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A criterion for automatic image deconvolution with L0‐norm regularization

Automatic penalty adjustment in sparse deconvolution with penalized least squares is required for improved reliability and broader applicability. In sparse deconvolution with an L0‐norm penalty, the latent signal is by nature discontinuous, and the magnitudes of the residuals and sparsity regularization terms are of different order of magnitude. This makes approaches such as generalized cross validation or L‐curve unsuitable in practice. The criterion proposed in this paper is based on the representation of the sum of the normalized residuals and regularization terms (SNT) as a function of the penalty parameter. We observed that the minimum of the SNT corresponds to the optimal value of the penalty parameter. This approach was tested in the context of super‐resolution fluorescence microscopy imaging. Both simulated and real live‐cell images characterized by different complexities and emitter densities were analyzed to assess the performance of the developed optimization strategy and to demonstrate its usefulness over manual tuning.