arXiv subjects

Xin Jin

Publications and source records attributed to Xin Jin.

At least 361 records · Page 20Linked to original sources

arXiv2021

Learned Block-based Hybrid Image Compression

Recent works on learned image compression perform encoding and decoding processes in a full-resolution manner, resulting in two problems when deployed for practical applications. First, parallel acceleration of the autoregressive entropy model cannot be achieved due to serial decoding. Second, full-resolution inference often causes the out-of-memory(OOM) problem with limited GPU resources, especially for high-resolution images. Block partition is a good design choice to handle the above issues, but it brings about new challenges in reducing the redundancy between blocks and eliminating block effects. To tackle the above challenges, this paper provides a learned block-based hybrid image compression (LBHIC) framework. Specifically, we introduce explicit intra prediction into a learned image compression framework to utilize the relation among adjacent blocks. Superior to context modeling by linear weighting of neighbor pixels in traditional codecs, we propose a contextual prediction module (CPM) to better capture long-range correlations by utilizing the strip pooling to extract the most relevant information in neighboring latent space, thus achieving effective information prediction. Moreover, to alleviate blocking artifacts, we further propose a boundary-aware postprocessing module (BPM) with the edge importance taken into account. Extensive experiments demonstrate that the proposed LBHIC codec outperforms the VVC, with a bit-rate conservation of 4.1%, and reduces the decoding time by approximately 86.7% compared with that of state-of-the-art learned image compression methods.

eess.IV↗

arXiv2021

Investigation of meson-meson interaction

In the framework of the quark delocalization color screening model, we investigate the meson-meson interaction in the fully light four-quark system . The calculation of the effective potentials of all the $S-$wave states shows that for most states the interaction between two vector mesons is attractive; the one between a pseudoscalar meson and a vector meson is repulsive or weakly attractive; and the one between two pseudoscalar mesons is always repulsive. However, there is still some exception. The interaction of the $IJ=00$ $ππ$ channel is attractive, while the one of the $IJ=02$ $ϕϕ$ channel is repulsive. So it is difficult to use the $S-$wave $ϕϕ$ state to explain the $X(2239)$ at present calculation. The $S-$wave $ρρ$ states are more likely to be resonance states, which are worthy of investigating in future work. The study of the contribution of each interaction term shows that both the one-gluon exchange and the kinetic energy interaction are important in the interaction between two mesons. The study of the variation of the delocalization parameter indicates that the contribution of the kinetic energy relates to the intermediate-range attraction mechanism in QDCSM, which is achieved by the quark delocalization.

hep-ph↗

arXiv2021

Homological Mirror Symmetry for the universal centralizers I: The adjoint group case

We prove homological mirror symmetry for the universal centralizer $J_G$ (a.k.a Toda space), associated to any complex semisimple Lie group $G$. The A-side is a partially wrapped Fukaya category on $J_G$, and the B-side is the category of coherent sheaves on the categorical quotient of a dual maximal torus by the Weyl group action (with some modification if $G$ has a nontrivial center). This is the first and the main part of a two-part series, dealing with $G$ of adjoint type. The general case will be proved in the forthcoming second part [Jin2].

math.SG↗

arXiv2021

Band-Notched Frequency-Selective Absorber with Polarization Rotation Function

This paper presents the theoretical analysis, design, simulations, and experimental verification of a novel band-notched frequency-selective absorber (BFSA) with polarization rotation function and absorption out-of-band. The BFSA consists of multiple layers including one lossy layer, one polarization-rotary layer and an air layer. The lossy layer is loaded with lumped resistances for obtaining a wide absorption band. A new four-port equivalent circuit model (ECM) with lossy layer is developed for providing theoretical analysis. The BFSA realizes -0.41dB cross-polarization reflection at 4.5GHz. In the upper and lower bands, the BFSA realizes a broad absorption function from 2.2GHz to 4.1GHz and 5.03GHz to 6.5GHz. The fractional bandwidth of co-polarization reflection is 98.8% with 10dB reflection reduction. The full-wave simulation, ECM, and experimental measurements are conducted to validate the polarization conversion of the band-notched absorbers, and good agreement between theory and measurement results is observed.

physics.app-ph↗

arXiv2021

FFR_FD: Effective and Fast Detection of DeepFakes Based on Feature Point Defects

The internet is filled with fake face images and videos synthesized by deep generative models. These realistic DeepFakes pose a challenge to determine the authenticity of multimedia content. As countermeasures, artifact-based detection methods suffer from insufficiently fine-grained features that lead to limited detection performance. DNN-based detection methods are not efficient enough, given that a DeepFake can be created easily by mobile apps and DNN-based models require high computational resources. For the first time, we show that DeepFake faces have fewer feature points than real ones, especially in certain facial regions. Inspired by feature point detector-descriptors to extract discriminative features at the pixel level, we propose the Fused Facial Region_Feature Descriptor (FFR_FD) for effective and fast DeepFake detection. FFR_FD is only a vector extracted from the face, and it can be constructed from any feature point detector-descriptors. We train a random forest classifier with FFR_FD and conduct extensive experiments on six large-scale DeepFake datasets, whose results demonstrate that our method is superior to most state of the art DNN-based models.

cs.CV↗

arXiv2021

Dense Interaction Learning for Video-based Person Re-identification

Video-based person re-identification (re-ID) aims at matching the same person across video clips. Efficiently exploiting multi-scale fine-grained features while building the structural interaction among them is pivotal for its success. In this paper, we propose a hybrid framework, Dense Interaction Learning (DenseIL), that takes the principal advantages of both CNN-based and Attention-based architectures to tackle video-based person re-ID difficulties. DenseIL contains a CNN encoder and a Dense Interaction (DI) decoder. The CNN encoder is responsible for efficiently extracting discriminative spatial features while the DI decoder is designed to densely model spatial-temporal inherent interaction across frames. Different from previous works, we additionally let the DI decoder densely attends to intermediate fine-grained CNN features and that naturally yields multi-grained spatial-temporal representation for each video clip. Moreover, we introduce Spatio-TEmporal Positional Embedding (STEP-Emb) into the DI decoder to investigate the positional relation among the spatial-temporal inputs. Our experiments consistently and significantly outperform all the state-of-the-art methods on multiple standard video-based person re-ID datasets.

cs.CV↗

arXiv2021

Focusing on Persons: Colorizing Old Images Learning from Modern Historical Movies

In industry, there exist plenty of scenarios where old gray photos need to be automatically colored, such as video sites and archives. In this paper, we present the HistoryNet focusing on historical person's diverse high fidelity clothing colorization based on fine grained semantic understanding and prior. Colorization of historical persons is realistic and practical, however, existing methods do not perform well in the regards. In this paper, a HistoryNet including three parts, namely, classification, fine grained semantic parsing and colorization, is proposed. Classification sub-module supplies classifying of images according to the eras, nationalities and garment types; Parsing sub-network supplies the semantic for person contours, clothing and background in the image to achieve more accurate colorization of clothes and persons and prevent color overflow. In the training process, we integrate classification and semantic parsing features into the coloring generation network to improve colorization. Through the design of classification and parsing subnetwork, the accuracy of image colorization can be improved and the boundary of each part of image can be more clearly. Moreover, we also propose a novel Modern Historical Movies Dataset (MHMD) containing 1,353,166 images and 42 labels of eras, nationalities, and garment types for automatic colorization from 147 historical movies or TV series made in modern time. Various quantitative and qualitative comparisons demonstrate that our method outperforms the state-of-the-art colorization methods, especially on military uniforms, which has correct colors according to the historical literatures.

cs.CV↗

arXiv2021

Re-energizing Domain Discriminator with Sample Relabeling for Adversarial Domain Adaptation

Many unsupervised domain adaptation (UDA) methods exploit domain adversarial training to align the features to reduce domain gap, where a feature extractor is trained to fool a domain discriminator in order to have aligned feature distributions. The discrimination capability of the domain classifier w.r.t the increasingly aligned feature distributions deteriorates as training goes on, thus cannot effectively further drive the training of feature extractor. In this work, we propose an efficient optimization strategy named Re-enforceable Adversarial Domain Adaptation (RADA) which aims to re-energize the domain discriminator during the training by using dynamic domain labels. Particularly, we relabel the well aligned target domain samples as source domain samples on the fly. Such relabeling makes the less separable distributions more separable, and thus leads to a more powerful domain classifier w.r.t. the new data distributions, which in turn further drives feature alignment. Extensive experiments on multiple UDA benchmarks demonstrate the effectiveness and superiority of our RADA.

cs.CV↗

arXiv2021

Computational diffraction reveals long-range strains, disorder and crystalline domains in atomic scale simulations

Atomic scale simulations are a key element of modern science in that they allow to understand, and even predict, complex physical or chemical phenomena on the basis of the fundamental laws of nature. Among the different existing atomic scale simulation approaches, molecular dynamics (MD) has imposed itself as the method of choice to model the behavior of the structure of materials under the action of external stimuli, say temperature, strain or stress, irradiation, etc. Despite the widespread use of MD in condensed matter science, some basic material characteristics remain difficult to determine. This is for instance the case of the long-range strain tensor in heavily disordered materials, or the quantification of rotated crystalline domains lacking clearly defined boundaries. In this work, we introduce computational diffraction as a fast and reliable structural characterization tool of atomic scale simulation cells. As compared to usual direct-space methods, computational diffraction operates in the reciprocal-space and is therefore highly sensitive to long-range spatial correlations. With the example of defective UO2, it is demonstrated that the homogeneous strain tensor, the heterogeneous strain tensor, the disorder, as well as rotated crystallites are straightforwardly and unambiguously determined. Computational diffraction can be applied to any type of atomic scale simulation and can be performed in real time, in parallel with other analysis tools. In experimental workflows, diffraction and microscopy are almost systematically used together in order to benefit from their complementarity. Computational diffraction, used together with computational microscopy, can potentially play a major role in the future of atomic scale simulations.

cond-mat.mtrl-sci↗

arXiv2021

Multi-Objective Congestion Control

Decades of research on Internet congestion control (CC) has produced a plethora of algorithms that optimize for different performance objectives. Applications face the challenge of choosing the most suitable algorithm based on their needs, and it takes tremendous efforts and expertise to customize CC algorithms when new demands emerge. In this paper, we explore a basic question: can we design a single CC algorithm to satisfy different objectives? We propose MOCC, the first multi-objective congestion control algorithm that attempts to address this challenge. The core of MOCC is a novel multi-objective reinforcement learning framework for CC that can automatically learn the correlations between different application requirements and the corresponding optimal control policies. Under this framework, MOCC further applies transfer learning to transfer the knowledge from past experience to new applications, quickly adapting itself to a new objective even if it is unforeseen. We provide both user-space and kernel-space implementation of MOCC. Real-world experiments and extensive simulations show that MOCC well supports multi-objective, competing or outperforming the best existing CC algorithms on individual objectives, and quickly adapting to new applications (e.g., 14.2x faster than prior work) without compromising old ones.

cs.NI↗

arXiv2021

Membraneless organelles formed by liquid-liquid phase separation increase bacterial fitness

Liquid-liquid phase separation is emerging as a crucial phenomenon in several fundamental cell processes. A range of eukaryotic systems exhibit liquid condensates. However, their function in bacteria, which in general lack membrane-bound compartments, remains less clear. Here, we used high-resolution optical microscopy to observe single bacterial aggresomes, nanostructured intracellular assemblies of proteins, to undercover their role in cell stress. We find that proteins inside aggresomes are mobile and undergo dynamic turnover, consistent with a liquid state. Our observations are in quantitative agreement with phase-separated liquid droplet formation driven by interacting proteins under thermal equilibrium that nucleate following diffusive collisions in the cytoplasm. We have discovered aggresomes in multiple species of bacteria, and show that these emergent, metastable liquid-structured protein assemblies increase bacterial fitness by enabling cells to tolerate environmental stresses.

q-bio.BM↗

arXiv2021

Database Construction for Two-Dimensional Material-Substrate Interfaces

The interfacial structures and interactions of two-dimensional (2D) materials on solid substrates are of fundamental importance for the fabrication and application of 2D materials. However, selection of a suitable solid substrate to grow 2D material, determination and control of the 2D material-substrate interface remain a big challenge due to the large diversity of possible configurations. Here, we propose a computational framework to select an appropriate substrate for epitaxial growth of 2D material and to predict possible 2D material-substrate interface structures and orientations using density functional theory calculations performed for all non-equivalent atomic structures satisfying the symmetry constraints. The approach was validated by the correct prediction of three experimentally reported 2D material-substrate interface systems with only the given information of two parent materials. Several possible interface configurations are also proposed based on this approach. We therefore construct a database that contains these interface systems and has been continuously expanding. This database serves as preliminary guidance for epitaxial growth and stabilization of new materials in experiments.

cond-mat.mtrl-sci↗

arXiv2021

Hyperbolicity of asymmetric lemon billiards

Asymmetric lemon billiards was introduced in [CMZZ], where the billiard table $Q(r,b,R)$ is the intersection of two round disks with radii $r\le R$, respectively, and $b$ measures the distance between the two centers. It is conjectured [BZZ] that the asymmetric lemon billiards is hyperbolic when the arc $Γ_r$ is a major arc and $R$ is large. In this paper we prove this conjecture for sufficiently large $R$.

math.DS↗

arXiv2021

Analysis of external and internal disorder to understand band-like transport in n-type organic semiconductors

Charge transport in organic semiconductors is notoriously extremely sensitive to the presence of disorder, both internal and external (i.e. related to the interactions with the dielectric layer), especially for n-type materials. Internal dynamic disorder stems from large thermal fluctuations both in intermolecular transfer integrals and (molecular) site energies in weakly interacting van der Waals solids and sources transient localization of the charge carriers. The molecular vibrations that drive transient localization typically operate at low-frequency (< a-few-hundred cm-1), which renders it difficult to assess them experimentally. Hitherto, this has prevented the identification of clear molecular design rules to control and reduce dynamic disorder. In addition, the disorder can also be external, being controlled by the gate insulator dielectric properties. Here we report on a comprehensive study of charge transport in two closely related n-type molecular organic semiconductors using a combination of temperature-dependent inelastic neutron scattering and photoelectron spectroscopy corroborated by electrical measurements, theory and simulations. We provide unambiguous evidence that ad hoc molecular design enables to free the electron charge carriers from both internal and external disorder to ultimately reach band-like electron transport.

cond-mat.mtrl-sci↗

arXiv2021

Representing the big tilting sheaves as holomorphic Morse branes

We introduce Morse branes in the Fukaya category of a holomorphic symplectic manifold, with the goal of constructing tilting objects in the category. We give a construction of a class of Morse branes in the cotangent bundles, and apply it to give the holomorphic branes that represent the big tilting sheaves on flag varieties.

math.SG↗

arXiv2021

FAST: FPGA-based Subgraph Matching on Massive Graphs

Subgraph matching is a basic operation widely used in many applications. However, due to its NP-hardness and the explosive growth of graph data, it is challenging to compute subgraph matching, especially in large graphs. In this paper, we aim at scaling up subgraph matching on a single machine using FPGAs. Specifically, we propose a CPU-FPGA co-designed framework. On the CPU side, we first develop a novel auxiliary data structure called candidate search tree (CST) which serves as a complete search space of subgraph matching. CST can be partitioned and fully loaded into FPGAs' on-chip memory. Then, a workload estimation technique is proposed to balance the load between the CPU and FPGA. On the FPGA side, we design and implement the first FPGA-based subgraph matching algorithm, called FAST. To take full advantage of the pipeline mechanism on FPGAs, task parallelism optimization and task generator separation strategy are proposed for FAST, achieving massive parallelism. Moreover, we carefully develop a BRAM-only matching process to fully utilize FPGA's on-chip memory, which avoids the expensive intermediate data transfer between FPGA's BRAM and DRAM. Comprehensive experiments show that FAST achieves up to 462.0x and 150.0x speedup compared with the state-of-the-art algorithm DAF and CECI, respectively. In addition, FAST is the only algorithm that can handle the billion-scale graph using one machine in our experiments.

cs.DB↗

arXiv2021

Learning Omni-frequency Region-adaptive Representations for Real Image Super-Resolution

Traditional single image super-resolution (SISR) methods that focus on solving single and uniform degradation (i.e., bicubic down-sampling), typically suffer from poor performance when applied into real-world low-resolution (LR) images due to the complicated realistic degradations. The key to solving this more challenging real image super-resolution (RealSR) problem lies in learning feature representations that are both informative and content-aware. In this paper, we propose an Omni-frequency Region-adaptive Network (ORNet) to address both challenges, here we call features of all low, middle and high frequencies omni-frequency features. Specifically, we start from the frequency perspective and design a Frequency Decomposition (FD) module to separate different frequency components to comprehensively compensate the information lost for real LR image. Then, considering the different regions of real LR image have different frequency information lost, we further design a Region-adaptive Frequency Aggregation (RFA) module by leveraging dynamic convolution and spatial attention to adaptively restore frequency components for different regions. The extensive experiments endorse the effective, and scenario-agnostic nature of our OR-Net for RealSR.

cs.CV↗

arXiv2020

Confused Modulo Projection based Somewhat Homomorphic Encryption -- Cryptosystem, Library and Applications on Secure Smart Cities

With the development of cloud computing, the storage and processing of massive visual media data has gradually transferred to the cloud server. For example, if the intelligent video monitoring system cannot process a large amount of data locally, the data will be uploaded to the cloud. Therefore, how to process data in the cloud without exposing the original data has become an important research topic. We propose a single-server version of somewhat homomorphic encryption cryptosystem based on confused modulo projection theorem named CMP-SWHE, which allows the server to complete blind data processing without \emph{seeing} the effective information of user data. On the client side, the original data is encrypted by amplification, randomization, and setting confusing redundancy. Operating on the encrypted data on the server side is equivalent to operating on the original data. As an extension, we designed and implemented a blind computing scheme of accelerated version based on batch processing technology to improve efficiency. To make this algorithm easy to use, we also designed and implemented an efficient general blind computing library based on CMP-SWHE. We have applied this library to foreground extraction, optical flow tracking and object detection with satisfactory results, which are helpful for building smart cities. We also discuss how to extend the algorithm to deep learning applications. Compared with other homomorphic encryption cryptosystems and libraries, the results show that our method has obvious advantages in computing efficiency. Although our algorithm has some tiny errors ($10^{-6}$) when the data is too large, it is very efficient and practical, especially suitable for blind image and video processing.

cs.CR↗