Abstract In response to the inadequate utilization of prior information in current mural inpainting processes, leading to issues such as semantically unreliable inpaintings and the presence of artifacts in the inpainting area, a Dunhuang mural inpainting method based on reference guidance and multi‐scale feature fusion is proposed. First, the simulated broken mural, the mask image, and the reference mural are input into the model to complete the multi‐level embedding of patches and align the multi‐scale fine‐grained features of damaged murals and reference murals. Following the patch embedding module, a hybrid residual module is added based on hybrid attention to fully extract mural features. In addition, by continuing the residual concatenation of outputs of the hierarchical embedding module improves the ability of the model to represent deeper features, and improves the robustness and generalisation of the model. Second, the encoded features are fed into the decoder to generate decoded features. Finally, the convolutional tail is employed to propagate them and complete the mural painting. Experimental validation on the Dunhuang mural dataset demonstrates that, compared to other algorithms, this model exhibits higher evaluation metrics in the inpainting of extensively damaged murals and demonstrates overall robustness. In terms of visual effects, the results of this model in the inpainting process exhibit finer textures, richer semantic information, more coherent edge structures, and a closer resemblance to authentic murals.

Emerging viral infections seriously threaten human health globally. Several challenges exist in identifying effective compounds against viral infections: (1) at the initial stage of a new virus outbreak, little information, except for its genome information, may be available; (2) although the identified compounds may be effective, they may be toxic in vivo and (3) cytokine release syndrome (CRS) triggered by viral infections is the primary cause of mortality. Currently, an integrative tool that takes all those aspects into consideration for identifying effective compounds to prevent viral infections is absent. In this study, we developed iDMer, as an integrative and mechanism-driven response system for addressing these challenges during the sudden virus outbreaks. iDMer comprises three mechanism-driven compound identification modules, that is, a virus-host interaction-oriented module, an autophagy-oriented module and a CRS-oriented module. As a one-stop integrative platform, iDMer incorporates compound toxicity evaluation and compound combination identification for virus treatment with clear mechanisms. iDMer was successfully tested on five viruses, including the current severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). Our results indicated that, for all five tested viruses, compounds that were reported in the literature or experimentally validated for virus treatment were enriched at the top, demonstrating the generalized effectiveness of iDMer. Finally, we demonstrated that combinations of the individual modules successfully identified combinations of compounds effective for virus intervention with clear mechanisms.

Summary This paper presents an efficient metric for evaluation the effect of the inpainted Thangka images. In contrast to standard image quality metrics, the proposed one takes into account some constraints and characteristics related to the specific goals of inpainting techniques. The key is that we proposed a method to decompose the reference and distorted image and to compare the intensity of fuzzy edge for structure component and similarity for texture component. By comparative analyzing the experimental results with other metrics, the proposed image inpainting quality index delivers high consistency with subjective evaluation results, which will help the selecting algorithm in image restoration and could be also applied to most of inpainting image approaches.

Chromosomes are essential genomic information carriers. Chromosome classification constitutes an important part of routine clinical and cancer cytogenetics analysis. Cytogeneticists perform visual interpretation of banded chromosome images according to the diagrammatic models of various chromosome types known as the ideograms, which mimic artists' depiction of the chromosomes. In this paper, we present a subspace-based approach for automated prototyping and classification of chromosome images. We show that 1) prototype chromosome images can be quantitatively synthesized from a subspace to objectively represent the chromosome images of a given type or population, and 2) the transformation coefficients (or projected coordinate values of sample chromosomes) in the subspace can be utilized as the extracted feature measurements for classification purposes. We examine in particular the formation of three well-known subspaces, namely the ones derived from principal component analysis (PCA), Fisher's linear discriminant analysis, and the discrete cosine transform (DCT). These subspaces are implemented and evaluated for prototyping two-dimensional (2-D) images and for classification of both 2-D images and one-dimensional profiles of chromosomes. Experimental results show that previously unseen prototype chromosome images of high visual quality can be synthesized using the proposed subspace-based method, and that PCA and the DCT significantly outperform the well-known benchmark technique of weighted density distribution functions in classifying 2-D chromosome images.

This paper presents a unified framework for addressing progressive image transmission over both memoryless and fading channels based on finite-state Markov channels (FSMC) models. The main advantage of using FSMC models is that they allow analytical derivation of optimal joint source-channel coding solutions in the form of unequal error protection without the burden of simulating wireless channels. Our analyses and experiments confirm that 1) FSMC models work for fading channels and 2) PSNR results obtained with FSMC models compare favorably with those published in the literature.

This paper presents Microarray BASICA: an integrated image processing tool for background adjustment, segmentation, image compression and analysis of microarray images. BASICA uses the fast Mann-Whitney test-based algorithm introduced in J. Hua et al., (2002) to segment microarray images, and post-processing to eliminate the segmentation irregularities. The segmentation results, along with the foreground and background intensities obtained with background adjustment, are then used for the independent compression of foreground and background. We introduce a new distortion measure for microarray image compression and devise a coding scheme by modifying the object-based embedded block coding with optimized truncation (object-based EBCOT) algorithm J. Hua et al., (2002) to achieve optimal rate-distortion performance in lossy coding while still maintaining outstanding lossless compression performance. Experimental results show that BASICA can extract sufficiently accurate genetic information at bitrates as low as 43bpp.

Image interpolation has been extensively studied. In this paper, we present a fast filter bank algorithm for interpolating images at any scales. The proposed algorithm is a generalization of [1] and [2], which handles only either integer or dyadic scale magnification of images. The details of the algorithm and implementation are described in the paper. In particular, we show that several image interpolation algorithms are the special cases of our proposed algorithm. The comparison with other interpolating bases are also discussed. The proposed algorithm is of practical use for enlargement in display and printing applications.

On the subject of optimal subspaces for appearance-based object recognition, it is generally believed that algorithms based on LDA (linear discriminant analysis) are superior to those based on PCA (principal components analysis), provided that relatively large training data sets are available. In this paper, we show that while this is generally true for classification with the nearest-neighbor classifier, it is not always the case with a maximum-likelihood classifier. We support our claim by presenting both intuitively plausible arguments and actual results on a large data set of human chromosomes. Our conjecture is that perhaps only when the underlying object classes are linearly separable would LDA be truly superior to other known subspaces of equal dimensionality.

This paper presents a joint source-channel coding framework based on layered source coding and Reed-Solomon channel coding for unequal error protection. An iterative procedure is described to search for the best source coding rate and the optimal UEP of layered bitstreams. We apply our JSCC technique to transmission of JPEG-2000 coded images over binary symmetric channels. Compared to results reported in the literature, our UEP based approach gives better results while having lower complexity.