A significant volume of analog information, i.e., documents and images, have been digitized in the form of scanned copies for storing, sharing, and/or analyzing in the digital world. However, the quality of such contents is severely degraded by various distortions caused by printing, storing, and scanning processes in the physical world. Although restoring high-quality content from scanned copies has become an indispensable task for many products, it has not been systematically explored, and to the best of our knowledge, no public datasets are available. In this paper, we define this problem as Descanning and introduce a new high-quality and large-scale dataset named DESCAN-18K. It contains 18K pairs of original and scanned images collected in the wild containing multiple complex degradations. In order to eliminate such complex degradations, we propose a new image restoration model called DescanDiffusion consisting of a color encoder that corrects the global color degradation and a conditional denoising diffusion probabilistic model (DDPM) that removes local degradations. To further improve the generalization ability of DescanDiffusion, we also design a synthetic data generation scheme by reproducing prominent degradations in scanned images. We demonstrate that our DescanDiffusion outperforms other baselines including commercial restoration products, objectively and subjectively, via comprehensive experiments and analyses.

Filter Decomposition (FD) methods have gained traction in compressing large neural networks by dividing weights into basis and coefficients. Recent advancements have focused on reducing weight redundancy by sharing either basis or coefficients stage-wise. However, traditional sharing approaches have overlooked the potential of sharing basis on a network-wide scale. In this study, we introduce an FD technique called G-SharP that elevates performance by using globally shared kernels throughout the network. To bolster the efficacy of G-SharP, we unveil a novel batch normalization-based co-efficient pruning strategy aiming to boost computational efficiency. Comprehensive evaluations show that our method notably diminishes computational demands and model size while incurring only a slight decline in performance. On benchmarks like CIFAR-10, ImageNet, PASCAL-VOC, and MS-COCO, G-SharP achieves significant reductions in model dimensions and FLOPs yet maintains accuracy levels akin to the original uncompressed models. Notably, G-SharP surpasses numerous leading lightweight models, striking a commendable balance between precision and efficiency.

Generative Adversarial Networks (GANs) are hindered from real-world applications due to their high computational cost and memory requirements. Model compression techniques, such as quantization, pruning, and knowledge distillation, can compress neural networks, lower memory requirements, and model size. However, quantizing generators often leads to a suboptimal solution. In this paper, we propose a novel method to stabilize GAN quantization by quantizing the generator and discriminator with different bit precision. Our method maximizes the quantization efficiency by jointly quantizing the generator and discriminator, which we found to be dependent on each other’s quantization. Specifically, quantizing the discriminator enhances the performance of the quantized generator, while the discriminator’s optimal quantization bit depends on the generator’s quantization bit and architectural type. We conducted extensive experiments on various GAN models, including BigGAN, SAGAN, and SNGAN, using different quantization methods, such as LSQ, PACT, and DoReFa, on benchmark dataset (CIFAR10). The experimental results demonstrate that our joint quantization method achieves higher compression rates while offering better performance in Frechet Inception Distance (FID) and Inception Score (IS).