Searcharxiv⌕ Search

arXiv subjects

Ying Chen

Publications and source records attributed to Ying Chen.

At least 289 records · Page 16Linked to original sources

Snow Mask Guided Adaptive Residual Network for Image Snow Removal

Image restoration under severe weather is a challenging task. Most of the past works focused on removing rain and haze phenomena in images. However, snow is also an extremely common atmospheric phenomenon that will seriously affect the performance of high-level computer vision tasks, such as object detection and semantic segmentation. Recently, some methods have been proposed for snow removing, and most methods deal with snow images directly as the optimization object. However, the distribution of snow location and shape is complex. Therefore, failure to detect snowflakes / snow streak effectively will affect snow removing and limit the model performance. To solve these issues, we propose a Snow Mask Guided Adaptive Residual Network (SMGARN). Specifically, SMGARN consists of three parts, Mask-Net, Guidance-Fusion Network (GF-Net), and Reconstruct-Net. Firstly, we build a Mask-Net with Self-pixel Attention (SA) and Cross-pixel Attention (CA) to capture the features of snowflakes and accurately localized the location of the snow, thus predicting an accurate snow mask. Secondly, the predicted snow mask is sent into the specially designed GF-Net to adaptively guide the model to remove snow. Finally, an efficient Reconstruct-Net is used to remove the veiling effect and correct the image to reconstruct the final snow-free image. Extensive experiments show that our SMGARN numerically outperforms all existing snow removal methods, and the reconstructed images are clearer in visual contrast. All codes will be available.

cs.CV↗

Exploration of Artificial Intelligence-oriented Power System Dynamic Simulators

With the rapid development of artificial intelligence (AI), it is foreseeable that the accuracy and efficiency of dynamic analysis for future power system will be greatly improved by the integration of dynamic simulators and AI. To explore the interaction mechanism of power system dynamic simulations and AI, a general design of an AI-oriented power system dynamic simulator is proposed, which consists of a high-performance simulator with neural network supportability and flexible external and internal application programming interfaces (APIs). With the support of APIs, simulation-assisted AI and AI-assisted simulation form a comprehensive interaction mechanism between power system dynamic simulations and AI. A prototype of this design is implemented and made public based on a highly efficient electromechanical simulator. Tests of this prototype are carried out under four scenarios including sample generation, AI-based stability prediction, data-driven dynamic component modeling, and AI-aided stability control, which prove the validity, flexibility, and efficiency of the design and implementation of the AI-oriented power system dynamic simulator.

eess.SY↗

Feasibility Study of Neural ODE and DAE Modules for Power System Dynamic Component Modeling

In the context of high penetration of renewables, the need to build dynamic models of power system components based on accessible measurement data has become urgent. To address this challenge, firstly, a neural ordinary differential equations (ODE) module and a neural differential-algebraic equations (DAE) module are proposed to form a data-driven modeling framework that accurately captures components' dynamic characteristics and flexibly adapts to various interface settings. Secondly, analytical models and data-driven models learned by the neural ODE and DAE modules are integrated together and simulated simultaneously using unified transient stability simulation methods. Finally, the neural ODE and DAE modules are implemented with Python and made public on GitHub. Using the portal measurements, three simple but representative cases of excitation controller modeling, photovoltaic power plant modeling, and equivalent load modeling of a regional power network are carried out in the IEEE-39 system and 2383wp system. Neural dynamic model-integrated simulations are compared with the original model-based ones to verify the feasibility and potentiality of the proposed neural ODE and DAE modules.

eess.SY↗

Perceptual Quality Assessment for Fine-Grained Compressed Images

Recent years have witnessed the rapid development of image storage and transmission systems, in which image compression plays an important role. Generally speaking, image compression algorithms are developed to ensure good visual quality at limited bit rates. However, due to the different compression optimization methods, the compressed images may have different levels of quality, which needs to be evaluated quantificationally. Nowadays, the mainstream full-reference (FR) metrics are effective to predict the quality of compressed images at coarse-grained levels (the bit rates differences of compressed images are obvious), however, they may perform poorly for fine-grained compressed images whose bit rates differences are quite subtle. Therefore, to better improve the Quality of Experience (QoE) and provide useful guidance for compression algorithms, we propose a full-reference image quality assessment (FR-IQA) method for compressed images of fine-grained levels. Specifically, the reference images and compressed images are first converted to $YCbCr$ color space. The gradient features are extracted from regions that are sensitive to compression artifacts. Then we employ the Log-Gabor transformation to further analyze the texture difference. Finally, the obtained features are fused into a quality score. The proposed method is validated on the fine-grained compression image quality assessment (FGIQA) database, which is especially constructed for assessing the quality of compressed images with close bit rates. The experimental results show that our metric outperforms mainstream FR-IQA metrics on the FGIQA database. We also test our method on other commonly used compression IQA databases and the results show that our method obtains competitive performance on the coarse-grained compression IQA databases as well.

cs.CV↗

DuQM: A Chinese Dataset of Linguistically Perturbed Natural Questions for Evaluating the Robustness of Question Matching Models

In this paper, we focus on studying robustness evaluation of Chinese question matching. Most of the previous work on analyzing robustness issue focus on just one or a few types of artificial adversarial examples. Instead, we argue that it is necessary to formulate a comprehensive evaluation about the linguistic capabilities of models on natural texts. For this purpose, we create a Chinese dataset namely DuQM which contains natural questions with linguistic perturbations to evaluate the robustness of question matching models. DuQM contains 3 categories and 13 subcategories with 32 linguistic perturbations. The extensive experiments demonstrate that DuQM has a better ability to distinguish different models. Importantly, the detailed breakdown of evaluation by linguistic phenomenon in DuQM helps us easily diagnose the strength and weakness of different models. Additionally, our experiment results show that the effect of artificial adversarial examples does not work on the natural texts.

cs.CL↗

Two-party secure semiquantum summation against the collective-dephasing noise

In this paper, we propose a two-party semiquantum summation protocol, where two classical users can accomplish the summation of their private binary sequences with the assistance of a quantum semi-honest third party (TP). The term 'semi-honest' implies that TP cannot conspire with others but is able to implement all kinds oof attacks. This protocol employs logical qubits as traveling particles to overcome the negative influence of collective-dephasing noise and needn't make any two parties pre-share a random secret key. The security analysis turns out that this protocol can effectively prevent the outside attacks from Eve and the participant attacks from TP. Moreover, TP has no knowledge about the summation results.

quant-ph↗

Quantum dialogue based on quantum encryption with single photons in both polarization and spatial-mode degrees of freedom

In this paper, a novel information leakage resistant quantum dialogue (QD) protocol with single photons in both polarization and spatial-mode degrees of freedom is proposed, which utilizes quantum encryption technology to overcome the information leakage problem. In the proposed QD protocol, during the transmission process, the single photons in both polarization and spatial-mode degrees of freedom used for encoding two communicants' private classical bits are protected by both quantum encryption technology and decoy photon technology. For avoiding the information leakage problem, the initial states of the single photons in both polarization and spatial-mode degrees of freedom used for encoding two communicants' private classical bits are shared between two communicants through quantum key encryption and decryption. The information-theoretical efficiency of the proposed QD protocol is as high as 40%.

quant-ph↗

Spot-adaptive Knowledge Distillation

Knowledge distillation (KD) has become a well established paradigm for compressing deep neural networks. The typical way of conducting knowledge distillation is to train the student network under the supervision of the teacher network to harness the knowledge at one or multiple spots (i.e., layers) in the teacher network. The distillation spots, once specified, will not change for all the training samples, throughout the whole distillation process. In this work, we argue that distillation spots should be adaptive to training samples and distillation epochs. We thus propose a new distillation strategy, termed spot-adaptive KD (SAKD), to adaptively determine the distillation spots in the teacher network per sample, at every training iteration during the whole distillation period. As SAKD actually focuses on "where to distill" instead of "what to distill" that is widely investigated by most existing works, it can be seamlessly integrated into existing distillation methods to further improve their performance. Extensive experiments with 10 state-of-the-art distillers are conducted to demonstrate the effectiveness of SAKD for improving their distillation performance, under both homogeneous and heterogeneous distillation settings. Code is available at https://github.com/zju-vipa/spot-adaptive-pytorch

cs.CV↗

AdaInt: Learning Adaptive Intervals for 3D Lookup Tables on Real-time Image Enhancement

The 3D Lookup Table (3D LUT) is a highly-efficient tool for real-time image enhancement tasks, which models a non-linear 3D color transform by sparsely sampling it into a discretized 3D lattice. Previous works have made efforts to learn image-adaptive output color values of LUTs for flexible enhancement but neglect the importance of sampling strategy. They adopt a sub-optimal uniform sampling point allocation, limiting the expressiveness of the learned LUTs since the (tri-)linear interpolation between uniform sampling points in the LUT transform might fail to model local non-linearities of the color transform. Focusing on this problem, we present AdaInt (Adaptive Intervals Learning), a novel mechanism to achieve a more flexible sampling point allocation by adaptively learning the non-uniform sampling intervals in the 3D color space. In this way, a 3D LUT can increase its capability by conducting dense sampling in color ranges requiring highly non-linear transforms and sparse sampling for near-linear transforms. The proposed AdaInt could be implemented as a compact and efficient plug-and-play module for a 3D LUT-based method. To enable the end-to-end learning of AdaInt, we design a novel differentiable operator called AiLUT-Transform (Adaptive Interval LUT Transform) to locate input colors in the non-uniform 3D LUT and provide gradients to the sampling intervals. Experiments demonstrate that methods equipped with AdaInt can achieve state-of-the-art performance on two public benchmark datasets with a negligible overhead increase. Our source code is available at https://github.com/ImCharlesY/AdaInt.

cs.CV↗

NTIRE 2022 Challenge on Super-Resolution and Quality Enhancement of Compressed Video: Dataset, Methods and Results

This paper reviews the NTIRE 2022 Challenge on Super-Resolution and Quality Enhancement of Compressed Video. In this challenge, we proposed the LDV 2.0 dataset, which includes the LDV dataset (240 videos) and 95 additional videos. This challenge includes three tracks. Track 1 aims at enhancing the videos compressed by HEVC at a fixed QP. Track 2 and Track 3 target both the super-resolution and quality enhancement of HEVC compressed video. They require x2 and x4 super-resolution, respectively. The three tracks totally attract more than 600 registrations. In the test phase, 8 teams, 8 teams and 12 teams submitted the final results to Tracks 1, 2 and 3, respectively. The proposed methods and solutions gauge the state-of-the-art of super-resolution and quality enhancement of compressed video. The proposed LDV 2.0 dataset is available at https://github.com/RenYang-home/LDV_dataset. The homepage of this challenge (including open-sourced codes) is at https://github.com/RenYang-home/NTIRE22_VEnh_SR.

cs.CV↗

Pyramid Frequency Network with Spatial Attention Residual Refinement Module for Monocular Depth Estimation

Deep-learning-based approaches to depth estimation are rapidly advancing, offering superior performance over existing methods. To estimate the depth in real-world scenarios, depth estimation models require the robustness of various noise environments. In this work, a Pyramid Frequency Network(PFN) with Spatial Attention Residual Refinement Module(SARRM) is proposed to deal with the weak robustness of existing deep-learning methods. To reconstruct depth maps with accurate details, the SARRM constructs a residual fusion method with an attention mechanism to refine the blur depth. The frequency division strategy is designed, and the frequency pyramid network is developed to extract features from multiple frequency bands. With the frequency strategy, PFN achieves better visual accuracy than state-of-the-art methods in both indoor and outdoor scenes on Make3D, KITTI depth, and NYUv2 datasets. Additional experiments on the noisy NYUv2 dataset demonstrate that PFN is more reliable than existing deep-learning methods in high-noise scenes.

cs.CV↗

Efficient semiquantum key distribution based on single photons in both polarization and spatial-mode degrees of freedom

In this paper, we propose an efficient semiquantum key distribution (SQKD) protocol which is based on single photons in both polarization and spatial-mode degrees of freedom. This protocol is feasible for a quantum communicant distributing a random private key to a classical communicant. This protocol needn't require the classical communicant to use any quantum memory or unitary operation equipment. We validate the complete robustness of the transmissions of single photons between two communicants. It turns out that during these transmissions, if Eve wants not to be detected by two communicants, she will obtain nothing useful about the final shared key bits. Compared with Boyer et al.'s famous pioneering SQKD protocol (Phys Rev Lett, 2007, 99:140501), this protocol has double quantum communication capacity, as one single photon with two degrees of freedom for generating the key bits can carry two private bits; and this protocol has higher quantum communication efficiency, as it consumes less qubits for establishing a private key of the same length. Compared with the only existing SQKD protocol with single photons in two degrees of freedom (Int J Theor Phys, 2020, 59: 2807), this protocol has higher quantum communication efficiency.

quant-ph↗

Annihilation diagram contribution to charmonium masses

In this work, we generate gauge configurations with $N_f=2$ dynamical charm quarks on anisotropic lattices. The mass shift of $1S$ and $1P$ charmonia owing to the charm quark annihilation effect can be investigated directly in a manner of unitary theory. The distillation method is adopted to treat the charm quark annihilation diagrams at a very precise level. For $1S$ charmonia, the charm quark annihilation effect almost does not change the $J/ψ$ mass, but lifts the $η_c$ mass by approximately 3-4 MeV. For $1P$ charmonia, this effect results in positive mass shifts of approximately 1 MeV for $χ_{c1}$ and $h_c$, but decreases the $χ_{c2}$ mass by approximately 3 MeV. We have not obtain a reliable result for the mass shift of $χ_{c0}$. In addition, it is observed that the spin averaged mass of the spin-triplet $1P$ charmonia is in a good agreement with the $h_c$, as expected by the non-relativistic quark model and measured by experiments.

hep-lat↗

The Glueball content of $η_c$

We carry out the first lattice QCD derivation of the mixing energy and the mixing angle of the pseudoscalar charmonium and glueball on two gauge ensembles with $N_f=2$ degenerate dynamical charm quarks. The mixing energy is determined to be $49(6)$ MeV on the near physical charm ensemble, which seems insensitive to charm quark mass. By the assumption that $X(2370)$ is predominantly a pseudoscalar glueball, the mixing angle is determined to be approximately $4.6(6)^\circ$, which results in a $+3.9(9)$ MeV mass shift of the ground state pseudoscalar charmonium. In the mean time, the mixing can raise the total width of the pseudoscalar charmonium by 7.2(8) MeV, which explains to some extent the relative large total width of the $η_c$ meson. As a result, the branching fraction of $η_c\to γγ$ can be understood in this $c\bar{c}$-glueball mixing framework. On the other hand, the possible discrepancy of the theoretical predictions and the experimental results of the partial width of $J/ψ\toγη_c$ cannot be alleviated by the $c\bar{c}$-glueball mixing picture yet, which demands future precise experimental measurements of this partial width.

hep-lat↗

Guide Local Feature Matching by Overlap Estimation

Local image feature matching under large appearance, viewpoint, and distance changes is challenging yet important. Conventional methods detect and match tentative local features across the whole images, with heuristic consistency checks to guarantee reliable matches. In this paper, we introduce a novel Overlap Estimation method conditioned on image pairs with TRansformer, named OETR, to constrain local feature matching in the commonly visible region. OETR performs overlap estimation in a two-step process of feature correlation and then overlap regression. As a preprocessing module, OETR can be plugged into any existing local feature detection and matching pipeline, to mitigate potential view angle or scale variance. Intensive experiments show that OETR can boost state-of-the-art local feature matching performance substantially, especially for image pairs with small shared regions. The code will be publicly available at https://github.com/AbyssGaze/OETR.

cs.CV↗

The Astrometric Performance Test of 80-cm Telescope at Yaoan Station and Precise CCD Positions of Apophis

The 80-cm azimuthal telescope is newly mounted at Yaoan Station, Purple Mountain Observatory in 2018. The astrometric performance of the telescope is tested in the following three aspects. (a) The geometric distortion of its CCD attached. It is stable in both a single epoch and multi epochs. Eight distortion solutions are derived over about one year. The maximum values range from 0.75 to 0.79 pixel and the median values range from 0.14 to 0.16 pixel. (b) The limit magnitude of stars. About 20.5 magnitude (Gaia-G) stars can be detected with Johnson-V filter exposured in 300 seconds. The astrometric error of about 20.5 magnitude stars is estimated at 0.14 arcsec using the fitted sigmoidal function. (c) The astrometric accuracy and the precision of stacked fast-moving faint object. 24 stacked frames of the potentially hazardous asteroid (PHA) (99942) Apophis are derived on April 14 and 15, 2021 (fainter than 18 mag) based on the ephemeris shifts. During data reduction, the newest Gaia EDR3 Catalog and Jet Propulsion Laboratory Horizons ephemeris are referenced as theoretical positions of stars and Apophis, respectively. Our results show that the mean (O-C)s (observed minus computed) of Apophis are -0.018 and 0.020 arcsec in right ascention and declination, and the dispersions are estimated at 0.094 and 0.085 arcsec, respectively, which show the consistency of the stacked results by Astrometrica.

astro-ph.IM↗

Applications of blockchain and artificial intelligence technologies for enabling prosumers in smart grids: A review

Governments' net zero emission target aims at increasing the share of renewable energy sources as well as influencing the behaviours of consumers to support the cost-effective balancing of energy supply and demand. These will be achieved by the advanced information and control infrastructures of smart grids which allow the interoperability among various stakeholders. Under this circumstance, increasing number of consumers produce, store, and consume energy, giving them a new role of prosumers. The integration of prosumers and accommodation of incurred bidirectional flows of energy and information rely on two key factors: flexible structures of energy markets and intelligent operations of power systems. The blockchain and artificial intelligence (AI) are innovative technologies to fulfil these two factors, by which the blockchain provides decentralised trading platforms for energy markets and the AI supports the optimal operational control of power systems. This paper attempts to address how to incorporate the blockchain and AI in the smart grids for facilitating prosumers to participate in energy markets. To achieve this objective, first, this paper reviews how policy designs price carbon emissions caused by the fossil-fuel based generation so as to facilitate the integration of prosumers with renewable energy sources. Second, the potential structures of energy markets with the support of the blockchain technologies are discussed. Last, how to apply the AI for enhancing the state monitoring and decision making during the operations of power systems is introduced.

cs.IT↗

Entanglement generation for uniformly accelerated atoms assisted by environment-induced interatomic interaction and the loss of the anti-Unruh effect

We study the influence of the environment-induced interatomic interaction, which is usually neglected, on the entanglement dynamics of two uniformly accelerated atoms coupled with fluctuating massless scalar fields in the Minkowski vacuum. When the two-atom system is initially prepared in a separable state such that the two atoms are in the ground and excited states respectively, the environment-induced interatomic interaction assists entanglement generation, in the sense that the parameter space of acceleration and interatomic separation that allows entanglement generation is enlarged, the rate of entanglement generation at the initial time is enhanced, and the maximum of concurrence generated during evolution is increased compared with when the environment-induced interaction is neglected. Remarkably, the rate of entanglement generation at the initial time and the maximal concurrence generated during evolution decrease monotonically with the acceleration, in contrast to that they exhibit a nonmonotonic behavior as the acceleration varies when the environment-induced interatomic interaction is neglected. In other words, the anti-Unruh phenomenon in terms of the entanglement generation is deprived of by the consideration of the environment-induced interatomic interaction.

quant-ph↗