Search arXiv⌕ Search

arXiv subjects

Jie Li

Publications and source records attributed to Jie Li.

At least 577 records · Page 32Linked to original sources

Interpretable Detail-Fidelity Attention Network for Single Image Super-Resolution

Benefiting from the strong capabilities of deep CNNs for feature representation and nonlinear mapping, deep-learning-based methods have achieved excellent performance in single image super-resolution. However, most existing SR methods depend on the high capacity of networks which is initially designed for visual recognition, and rarely consider the initial intention of super-resolution for detail fidelity. Aiming at pursuing this intention, there are two challenging issues to be solved: (1) learning appropriate operators which is adaptive to the diverse characteristics of smoothes and details; (2) improving the ability of model to preserve the low-frequency smoothes and reconstruct the high-frequency details. To solve them, we propose a purposeful and interpretable detail-fidelity attention network to progressively process these smoothes and details in divide-and-conquer manner, which is a novel and specific prospect of image super-resolution for the purpose on improving the detail fidelity, instead of blindly designing or employing the deep CNNs architectures for merely feature representation in local receptive fields. Particularly, we propose a Hessian filtering for interpretable feature representation which is high-profile for detail inference, a dilated encoder-decoder and a distribution alignment cell to improve the inferred Hessian features in morphological manner and statistical manner respectively. Extensive experiments demonstrate that the proposed methods achieve superior performances over the state-of-the-art methods quantitatively and qualitatively. Code is available at https://github.com/YuanfeiHuang/DeFiAN.

cs.CV↗

An Attention-Guided Deep Regression Model for Landmark Detection in Cephalograms

Cephalometric tracing method is usually used in orthodontic diagnosis and treatment planning. In this paper, we propose a deep learning based framework to automatically detect anatomical landmarks in cephalometric X-ray images. We train the deep encoder-decoder for landmark detection, and combine global landmark configuration with local high-resolution feature responses. The proposed frame-work is based on 2-stage u-net, regressing the multi-channel heatmaps for land-mark detection. In this framework, we embed attention mechanism with global stage heatmaps, guiding the local stage inferring, to regress the local heatmap patches in a high resolution. Besides, the Expansive Exploration strategy improves robustness while inferring, expanding the searching scope without increasing model complexity. We have evaluated our framework in the most widely-used public dataset of landmark detection in cephalometric X-ray images. With less computation and manually tuning, our framework achieves state-of-the-art results.

eess.IV↗

Effect of Stark shift on low-energy interference structure in strong-field ionization

An improved quantum trajectory Monte Carlo method involving the Stark shift of the initial state, Coulomb potential, and multielectron polarization-induced dipole potential is used to revisit the origin of the low-energy interference structure in the photoelectron momentum distribution of the xenon atom subjected to an intense laser field, and resolve the different contributions of these three effects. In addition to the well-studied radial finger-like interference structure, a ring-like interference structure induced by interference among electron wave packets emitted from multi-cycle time windows of the laser field is found in the low energy part of the photoelectron momentum spectrum. It is attributed to the combined effect of the Coulomb potential and Stark shift. Our finding provides new insight into the imaging of electron dynamics of atoms and molecules with intense laser fields.

physics.atom-ph↗

Inertia and feedback parameters adaptive control of virtual synchronous generator

The virtual synchronous generator technology analogs the characteristics of the synchronous generator via the controller design. It improved the stability of the grid systems which include the new energy. At the same time, according to the adjustable characteristics of the virtual synchronous generator parameters, the parameter adaptive adjustment is used to improve the dynamic performance of the system. However, the traditional virtual synchronous generator adaptive control technology still has two drawbacks: on the one hand, the large-scale adjustment of the damping droop coefficient and the virtual moment of inertia requires the system having a high energy storage margin; On the other hand, there is a power overshoot phenomenon in the transient regulation process, which is disadvantageous to the power equipment. First, this paper provides a convenient adjustment method for improving the transient stability of the system, the system damping is adjusted by introducing the output speed feedback. Second, according to the transient power-angle characteristics of the system, a parameter adaptive control strategy is proposed, which shortens the transient adjustment time and ensures that the deviation of the system frequency in the transient adjustment process is within the allowable range, and improves the transient performance of the grid frequency adjustment, at the same time, the power overshoot is suppressed. Finally, the experimental results show that the proposed control strategy is superior to the existing adaptive control strategy.

eess.SY↗

Grid-Forming Converters control based on DC voltage feedback

The renewable energy is connected to the power grid through power electronic converters, which are lack of make the inertia of synchronous generator/machine (SM) be lost. The increasing penetration of renewable energy in power system weakens the frequency and voltage stability. The Grid-Forming Converters (GFCs) simulate the function of synchronous motor through control method in order to improve the stability of power grid by providing inertia and stability regulation mechanism. This kind of converter control methods include virtual synchronous machine, schedulable virtual oscillator control and so on. These control method mainly use AC side state feedback and do not monitor the DC side state. This paper analyzes the control strategy of GFC considering power grid stability, including Frequency Droop Control, Virtual Synchronous Machine Control and dispatchable Virtual Oscillator Control. The DC side voltage collapse problem is found when a large load disturbance occurs. The control methods of GFC considering DC side voltage feedback are proposed, which can ensure the synchronization characteristics of grid connection and solve the problem of DC side voltage collapse. The proposed method is verified by IEEE-9 bus system, which shows the effectiveness of the proposed method.

eess.SY↗

Progressive Perception-Oriented Network for Single Image Super-Resolution

Recently, it has been demonstrated that deep neural networks can significantly improve the performance of single image super-resolution (SISR). Numerous studies have concentrated on raising the quantitative quality of super-resolved (SR) images. However, these methods that target PSNR maximization usually produce blurred images at large upscaling factor. The introduction of generative adversarial networks (GANs) can mitigate this issue and show impressive results with synthetic high-frequency textures. Nevertheless, these GAN-based approaches always have a tendency to add fake textures and even artifacts to make the SR image of visually higher-resolution. In this paper, we propose a novel perceptual image super-resolution method that progressively generates visually high-quality results by constructing a stage-wise network. Specifically, the first phase concentrates on minimizing pixel-wise error, and the second stage utilizes the features extracted by the previous stage to pursue results with better structural retention. The final stage employs fine structure features distilled by the second phase to produce more realistic results. In this way, we can maintain the pixel, and structural level information in the perceptual image as much as possible. It is useful to note that the proposed method can build three types of images in a feed-forward process. Also, we explore a new generator that adopts multi-scale hierarchical features fusion. Extensive experiments on benchmark datasets show that our approach is superior to the state-of-the-art methods. Code is available at https://github.com/Zheng222/PPON.

cs.CV↗

Extending Label Smoothing Regularization with Self-Knowledge Distillation

Inspired by the strong correlation between the Label Smoothing Regularization(LSR) and Knowledge distillation(KD), we propose an algorithm LsrKD for training boost by extending the LSR method to the KD regime and applying a softer temperature. Then we improve the LsrKD by a Teacher Correction(TC) method, which manually sets a constant larger proportion for the right class in the uniform distribution teacher. To further improve the performance of LsrKD, we develop a self-distillation method named Memory-replay Knowledge Distillation (MrKD) that provides a knowledgeable teacher to replace the uniform distribution one in LsrKD. The MrKD method penalizes the KD loss between the current model's output distributions and its copies' on the training trajectory. By preventing the model learning so far from its historical output distribution space, MrKD can stabilize the learning and find a more robust minimum. Our experiments show that LsrKD can improve LSR performance consistently at no cost, especially on several deep neural networks where LSR is ineffectual. Also, MrKD can significantly improve single model training. The experiment results confirm that the TC can help LsrKD and MrKD to boost training, especially on the networks they are failed. Overall, LsrKD, MrKD, and their TC variants are comparable to or outperform the LSR method, suggesting the broad applicability of these KD methods.

cs.LG↗

A Light-Weight Object Detection Framework with FPA Module for Optical Remote Sensing Imagery

With the development of remote sensing technology, the acquisition of remote sensing images is easier and easier, which provides sufficient data resources for the task of detecting remote sensing objects. However, how to detect objects quickly and accurately from many complex optical remote sensing images is a challenging hot issue. In this paper, we propose an efficient anchor free object detector, CenterFPANet. To pursue speed, we use a lightweight backbone and introduce the asymmetric revolution block. To improve the accuracy, we designed the FPA module, which links the feature maps of different levels, and introduces the attention mechanism to dynamically adjust the weights of each level of feature maps, which solves the problem of detection difficulty caused by large size range of remote sensing objects. This strategy can improve the accuracy of remote sensing image object detection without reducing the detection speed. On the DOTA dataset, CenterFPANet mAP is 64.00%, and FPS is 22.2, which is close to the accuracy of the anchor-based methods currently used and much faster than them. Compared with Faster RCNN, mAP is 6.76% lower but 60.87% faster. All in all, CenterFPANet achieves a balance between speed and accuracy in large-scale optical remote sensing object detection.

cs.CV↗

Proposal for optomechanical quantum teleportation

We present a novel discrete-variable quantum teleportation scheme using pulsed optomechanics. In our proposal, we demonstrate how an unknown optical input state can be transferred onto the joint state of a pair of mechanical oscillators, without physically interacting with one another. We further analyze how experimental imperfections will affect the fidelity of the teleportation and highlight how our scheme can be realized in current state-of-the-art optomechanical systems.

quant-ph↗

PillarFlow: End-to-end Birds-eye-view Flow Estimation for Autonomous Driving

In autonomous driving, accurately estimating the state of surrounding obstacles is critical for safe and robust path planning. However, this perception task is difficult, particularly for generic obstacles/objects, due to appearance and occlusion changes. To tackle this problem, we propose an end-to-end deep learning framework for LIDAR-based flow estimation in bird's eye view (BeV). Our method takes consecutive point cloud pairs as input and produces a 2-D BeV flow grid describing the dynamic state of each cell. The experimental results show that the proposed method not only estimates 2-D BeV flow accurately but also improves tracking performance of both dynamic and static objects.

cs.CV↗

Phone2Cloud: Exploiting Computation Offloading for Energy Saving on Smartphones in Mobile Cloud Computing

With prosperity of applications on smartphones, energy saving for smartphones has drawn increasing attention. In this paper we devise Phone2Cloud, a computation offloading-based system for energy saving on smartphones in the context of mobile cloud computing. Phone2Cloud offloads computation of an application running on smartphones to the cloud. The objective is to improve energy efficiency of smartphones and at the same time, enhance the application's performance through reducing its execution time. In this way, the user's experience can be improved. We implement the prototype of Phone2Cloud on Android and Hadoop environment. Two sets of experiments, including application experiments and scenario experiments, are conducted to evaluate the system. The experimental results show that Phone2Cloud can effectively save energy for smartphones and reduce the application's execution time.

cs.DC↗

Data Dissemination Using Interest Tree in Socially Aware Networking

Socially aware networking (SAN) exploits social characteristics of mobile users to streamline data dissemination protocols in opportunistic environments. Existing protocols in this area utilized various social features such as user interests, social similarity, and community structure to improve the performance of data dissemination. However, the interrelationship between user interests and its impact on the efficiency of data dissemination has not been explored sufficiently. In this paper, we analyze various kinds of relationships between user interests and model them using a layer-based structure in order to form social communities in SAN paradigm. We propose Int-Tree, an Interest-Tree based scheme which uses the relationship between user interests to improve the performance of data dissemination. The core of Int-Tree is the interest-tree, a tree-based community structure that combines two social features, i.e. density of a community and social tie, to support data dissemination. The simulation results show that Int-Tree achieves higher delivery ratio, lower overhead, in comparison to two benchmark protocols, PROPHET and Epidemic routing. In addition, Int-Tree can perform with 1.36 hop counts in average, and tolerable latency in terms of buffer size, time to live (TTL) and simulation duration. Finally, Int-Tree keeps stable performance with various parameters.

cs.SI↗

Reinforcement Solver for H-infinity Filter with Bounded Noise

H-infinity filter has been widely applied in engineering field, but copping with bounded noise is still an open problem and difficult to solve. This paper considers the H-infinity filtering problem for linear system with bounded process and measurement noise. The problem is first formulated as a zero-sum game where the dynamic of estimation error is non-affine with respect to filter gain and measurement noise. A nonquadratic Hamilton-Jacobi-Isaacs (HJI) equation is then derived by employing a nonquadratic cost to characterize bounded noise, which is extremely difficult to solve due to its non-affine and nonlinear properties. Next, a reinforcement learning algorithm based on gradient descent method which can handle nonlinearity is proposed to update the gain of reinforcement filter, where measurement noise is fixed to tackle non-affine property and increase the convexity of Hamiltonian. Two examples demonstrate the convergence and effectiveness of the proposed algorithm.

eess.SY↗

Temperature-dependent properties of liquid-vapour coexistence system with many-body dissipative particle dynamics with energy conservation

The dynamic properties of fluid, including density, surface tension, diffusivity and viscosity, are temperature-dependent and can significantly influence the flow dynamics of mesoscopic non-isothermal systems. To capture the correct temperature-dependence of a fluid, a many-body dissipative particle dynamics model with energy conservation (mDPDe) is developed by combining the temperature-dependent coefficient of the conservative force and weighting terms of the dissipative and random forces. The momentum and thermal diffusivity, viscosity, and surface tension of liquid water at various temperatures ranging from 273 K to 373 K are used as examples for verifying the proposed model. Simulations of a periodic Poiseuille flow driven by body forces and heat sources are carried out to validate the diffusivity of the present model. Also, a steady case of heat conduction for reproducing the Fourier law is used to validate the thermal boundary conditions. By using this mDPDe simulations, the thermocapillary motion of liquid water nanodroplets on hydrophobic substrates with thermal gradients is investigated. The migration of the droplet is observed on flat substrates with gradient temperature. The velocity of the migration becomes larger for higher temperature difference, which is in agreement with the present theoretical analysis and DVDWT simulations. The results illustrate that the modified model can be used to study Marangoni effect on a nanodroplet and other heat and mass transfer problems with free interface.

physics.comp-ph↗

Ternary Policy Iteration Algorithm for Nonlinear Robust Control

The uncertainties in plant dynamics remain a challenge for nonlinear control problems. This paper develops a ternary policy iteration (TPI) algorithm for solving nonlinear robust control problems with bounded uncertainties. The controller and uncertainty of the system are considered as game players, and the robust control problem is formulated as a two-player zero-sum differential game. In order to solve the differential game, the corresponding Hamilton-Jacobi-Isaacs (HJI) equation is then derived. Three loss functions and three update phases are designed to match the identity equation, minimization and maximization of the HJI equation, respectively. These loss functions are defined by the expectation of the approximate Hamiltonian in a generated state set to prevent operating all the states in the entire state set concurrently. The parameters of value function and policies are directly updated by diminishing the designed loss functions using the gradient descent method. Moreover, zero-initialization can be applied to the parameters of the control policy. The effectiveness of the proposed TPI algorithm is demonstrated through two simulation studies. The simulation results show that the TPI algorithm can converge to the optimal solution for the linear plant, and has high resistance to disturbances for the nonlinear plant.

eess.SY↗

Giant magnetic anisotropy energy and long coherence time of uranium substitution on defected Al2O3(0001)

Nanomagnets with giant magnetic anisotropy energy and long coherence time are desired for various technological innovations such as quantum information procession and storage. Based on the first-principles calculations and model analyses, we demonstrate that a single uranium atom substituting Al on the Al2O3(0001) surface may have high structural stability and large magnetic anisotropy energy up to 48 meV per uranium atom. As the magnetization resides in the localized f-shell and is not much involved in chemical bonding with neighbors, long coherence time up to ~1.6 mS can be achieved for the quantum spin states. These results suggest a new strategy for the search of ultrasmall magnetic units for diverse applications in the quantum information era.

cond-mat.mtrl-sci↗

Weakly Supervised Temporal Action Localization with Segment-Level Labels

Temporal action localization presents a trade-off between test performance and annotation-time cost. Fully supervised methods achieve good performance with time-consuming boundary annotations. Weakly supervised methods with cheaper video-level category label annotations result in worse performance. In this paper, we introduce a new segment-level supervision setting: segments are labeled when annotators observe actions happening here. We incorporate this segment-level supervision along with a novel localization module in the training. Specifically, we devise a partial segment loss regarded as a loss sampling to learn integral action parts from labeled segments. Since the labeled segments are only parts of actions, the model tends to overfit along with the training process. To tackle this problem, we first obtain a similarity matrix from discriminative features guided by a sphere loss. Then, a propagation loss is devised based on the matrix to act as a regularization term, allowing implicit unlabeled segments propagation during training. Experiments validate that our method can outperform the video-level supervision methods with almost same the annotation time.

cs.CV↗

Balanced Symmetric Cross Entropy for Large Scale Imbalanced and Noisy Data

Deep convolution neural network has attracted many attentions in large-scale visual classification task, and achieves significant performance improvement compared to traditional visual analysis methods. In this paper, we explore many kinds of deep convolution neural network architectures for large-scale product recognition task, which is heavily class-imbalanced and noisy labeled data, making it more challenged. Extensive experiments show that PNASNet achieves best performance among a variety of convolutional architectures. Together with ensemble technology and negative learning loss for noisy labeled data, we further improve the model performance on online test data. Finally, our proposed method achieves 0.1515 mean top-1 error on online test data.

cs.CV↗