Searcharxiv⌕ Search

arXiv subjects

Bin Zhang

Publications and source records attributed to Bin Zhang.

At least 217 records · Page 12Linked to original sources

Towards Adaptive Semantic Segmentation by Progressive Feature Refinement

As one of the fundamental tasks in computer vision, semantic segmentation plays an important role in real world applications. Although numerous deep learning models have made notable progress on several mainstream datasets with the rapid development of convolutional networks, they still encounter various challenges in practical scenarios. Unsupervised adaptive semantic segmentation aims to obtain a robust classifier trained with source domain data, which is able to maintain stable performance when deployed to a target domain with different data distribution. In this paper, we propose an innovative progressive feature refinement framework, along with domain adversarial learning to boost the transferability of segmentation networks. Specifically, we firstly align the multi-stage intermediate feature maps of source and target domain images, and then a domain classifier is adopted to discriminate the segmentation output. As a result, the segmentation models trained with source domain images can be transferred to a target domain without significant performance degradation. Experimental results verify the efficiency of our proposed method compared with state-of-the-art methods.

cs.CV↗

A Conservative High-Order Method Utilizing Dynamic Transfinite Mortar Elements for Flow Simulation on Curved Sliding Meshes

We present a high-order method for flow simulation on unstructured curved nonconforming sliding meshes. This method utilizes dynamic transfinite mortar elements to exchange flow information between the two sides of a sliding interface. The method is arbitrarily high-order accurate in space, provably conservative, and satisfies outflow condition. Moreover, it retains the accuracy of a time marching scheme, and thus allows substantial reduction of rotational speed effects when equipped with a high-order temporal scheme. The method's capability of simultaneously handling multiple rotational objects is also explored. Details on the implementation are provided as well.

math.NA↗

Computing Absolute Free Energy with Deep Generative Models

Fast and accurate evaluation of free energy has broad applications from drug design to material engineering. Computing the absolute free energy is of particular interest since it allows the assessment of the relative stability between states without the use of intermediates. In this letter, we introduce a general framework for calculating the absolute free energy of a state. A key step of the calculation is the definition of a reference state with tractable deep generative models using locally sampled configurations. The absolute free energy of this reference state is zero by design. The free energy for the state of interest can then be determined as the difference from the reference. We applied this approach to both discrete and continuous systems and demonstrated its effectiveness. It was found that the Bennett acceptance ratio method provides more accurate and efficient free energy estimations than approximate expressions based on work. We anticipate the method presented here to be a valuable strategy for computing free energy differences.

cond-mat.stat-mech↗

Better Than Reference In Low Light Image Enhancement: Conditional Re-Enhancement Networks

Low light images suffer from severe noise, low brightness, low contrast, etc. In previous researches, many image enhancement methods have been proposed, but few methods can deal with these problems simultaneously. In this paper, to solve these problems simultaneously, we propose a low light image enhancement method that can combined with supervised learning and previous HSV (Hue, Saturation, Value) or Retinex model based image enhancement methods. First, we analyse the relationship between the HSV color space and the Retinex theory, and show that the V channel (V channel in HSV color space, equals the maximum channel in RGB color space) of the enhanced image can well represent the contrast and brightness enhancement process. Then, a data-driven conditional re-enhancement network (denoted as CRENet) is proposed. The network takes low light images as input and the enhanced V channel as condition, then it can re-enhance the contrast and brightness of the low light image and at the same time reduce noise and color distortion. It should be noted that during the training process, any paired images with different exposure time can be used for training, and there is no need to carefully select the supervised images which will save a lot. In addition, it takes less than 20 ms to process a color image with the resolution 400*600 on a 2080Ti GPU. Finally, some comparative experiments are implemented to prove the effectiveness of the method. The results show that the method proposed in this paper can significantly improve the quality of the enhanced image, and by combining with other image contrast enhancement methods, the final enhancement result can even be better than the reference image in contrast and brightness. (Code will be available at https://github.com/hitzhangyu/image-enhancement-with-denoise)

eess.IV↗

Two-stage growth mode for lift-off mechanism in oblique shock-wave/jet interaction

The lift-off characteristics of supersonic streamwise vortex in oblique shock-wave/jet interaction (OS/JI for short), extracted from a wall-mount ramp injector in scramjet, is studied through Large-eddy simulation method. Shocked helium jet is deformed into a pair of streamwise vortex with a co-rotating companion vortex showing the lift-off characteristic immediately after shock. Based on the objective coordinate system in frame of oblique shock structure, it is found that the nature of three-dimensional lift-off structure of a shockinduced streamwise vortex is inherently and precisely controlled by a two-stage growth mode of structure kinetics of a shock bubble interaction (SBI for short). The striking similar structures between OS/JI and SBI support the proposition that the lift-off of streamwise vortex is the result of a underlying two-dimensional vortical motion. By considering the first stage impulsive linear growth rate, an improved vortex propagation model suitable for SBI is proposed and validated. The lift-off phenomena of both numerical OS/JI case in this paper and wall-mounted ramp injector cases in literature are well explained under the two-stage structure kinetics model of SBI. This model further predicts that for higher free stream Mach number (M > 5), increasing ramp compression shows little effect on elevating streamwise vortex while evident lift-off may occur for lower Mach number (M < 3.5), which offers the new way for preliminary design of streamwise vortex-based ramp injector in scramjet.

physics.flu-dyn↗

ACFD: Asymmetric Cartoon Face Detector

Cartoon face detection is a more challenging task than human face detection due to many difficult scenarios is involved. Aiming at the characteristics of cartoon faces, such as huge differences within the intra-faces, in this paper, we propose an asymmetric cartoon face detector, named ACFD. Specifically, it consists of the following modules: a novel backbone VoVNetV3 comprised of several asymmetric one-shot aggregation modules (AOSA), asymmetric bi-directional feature pyramid network (ABi-FPN), dynamic anchor match strategy (DAM) and the corresponding margin binary classification loss (MBC). In particular, to generate features with diverse receptive fields, multi-scale pyramid features are extracted by VoVNetV3, and then fused and enhanced simultaneously by ABi-FPN for handling the faces in some extreme poses and have disparate aspect ratios. Besides, DAM is used to match enough high-quality anchors for each face, and MBC is for the strong power of discrimination. With the effectiveness of these modules, our ACFD achieves the 1st place on the detection track of 2020 iCartoon Face Challenge under the constraints of model size 200MB, inference time 50ms per image, and without any pretrained models.

cs.CV↗

CL-ADMM: A Cooperative Learning Based Optimization Framework for Resource Management in MEC

We consider the problem of intelligent and efficient resource management framework in mobile edge computing (MEC), which can reduce delay and energy consumption, featuring distributed optimization and efficient congestion avoidance mechanism. In this paper, we present a Cooperative Learning framework for resource management in MEC from an Alternating Direction Method of Multipliers (ADMM) perspective, called CL-ADMM framework. First, in order to caching task efficiently in a group, a novel task popularity estimating scheme is proposed, which is based on semi-Markov process model, then a greedy task cooperative caching mechanism has been established, which can effectively reduce delay and energy consumption. Secondly, for addressing group congestion, a dynamic task migration scheme based on cooperative improved Q-learning is proposed, which can effectively reduce delay and alleviate congestion. Thirdly, for minimizing delay and energy consumption for resources allocation in a group, we formulate it as an optimization problem with a large number of variables, and then exploit a novel ADMM based scheme to address this problem, which can reduce the complexity of problem with a new set of auxiliary variables, these sub-problems are all convex problems, and can be solved by using a primal-dual approach, guaranteeing its convergences. Then we prove that the convergence by using Lyapunov theory. Numerical results demonstrate the effectiveness of the CL-ADMM and it can effectively reduce delay and energy consumption for MEC.

cs.NI↗

High-performance transmission of optical vortices through scattering media with opaque-lens field transformation theory

The applications of vortex beam in biomedical field are always hindered by light scattering of biological tissues. Recently wavefront shaping technology has shown the potential in focusing a structured light field through scattering media. Herein we have proposed a novel theory to describe the field transformation property of the opaque lens. This theory makes it possible to generate foci with specified amplitude and phase profiles by well-designing the incident field. We verify the validity of this theory by experimentally generating doughnut-shaped foci with various topological charges, and the foci match well with the theoretical predictions. Meanwhile, we have also analyzed the limitations of our approach, and it reveals that there is a trade-off between the thickness of the medium and the acceptance spatial bandwidth of the incident field. Our approach will inspire new research ideas for the deep-tissue applications of vortex beam in optics and dynamics, which is significant to numerous potential bio-photonics technologies.

physics.optics↗

ASFD: Automatic and Scalable Face Detector

In this paper, we propose a novel Automatic and Scalable Face Detector (ASFD), which is based on a combination of neural architecture search techniques as well as a new loss design. First, we propose an automatic feature enhance module named Auto-FEM by improved differential architecture search, which allows efficient multi-scale feature fusion and context enhancement. Second, we use Distance-based Regression and Margin-based Classification (DRMC) multi-task loss to predict accurate bounding boxes and learn highly discriminative deep features. Third, we adopt compound scaling methods and uniformly scale the backbone, feature modules, and head networks to develop a family of ASFD, which are consistently more efficient than the state-of-the-art face detectors. Extensive experiments conducted on popular benchmarks, e.g. WIDER FACE and FDDB, demonstrate that our ASFD-D6 outperforms the prior strong competitors, and our lightweight ASFD-D0 runs at more than 120 FPS with Mobilenet for VGA-resolution images.

cs.CV↗

OODT: Obstacle Aware Opportunistic Data Transmission for Cognitive Radio Ad Hoc Networks

In recent years, a large number of smart devices will be connected in Internet of Things (IoT) using an ad hoc network, which needs more frequency spectra. The cognitive radio (CR) technology can improve spectrum utilization in an opportunistic communication manner for IoT, forming a promising paradigm known as cognitive radio ad hoc networks,CRAHNs. However, dynamic spectrum availability and mobile devices/persons make it difficult to develop an efficient data transmission scheme for CRAHNs under an obstacle environment. Opportunistic routing can leverage the broadcast nature of wireless channels to enhance network performance. Inspired by this, in this paper, we propose an Obstacle aware Opportunistic Data Transmission scheme (OODT) in CRAHNs from a computational geometry perspective, considering energy efficiency and social features. In the proposed scheme, we exploit a new routing metric, which is based on an obstacle avoiding algorithm using a polygon boundary 1-searcher technology, and an auction model for selecting forwarding candidates. In addition, we prove that the candidate selection problem is NP-hard and propose a heuristic algorithm for candidate selection. The simulation results show that the proposed scheme can achieve better performance than existing schemes.

cs.NI↗

Enhancement of spontaneous entanglement generation via coherent quantum feedback

We investigate the entanglement dynamics of two two-level emitters (qubits) mediated by a semiinfinite, one-dimensional (1D) photonic waveguide. The coupling of each qubit to the waveguide is chiral, which depends on the propagation direction of light. The finite end of the waveguide is terminated by a perfect mirror, such that coherent quantum feedback is introduced to the system. We show that the chirally generated entanglement between the qubits can be preserved by controlling the time delay of the feedback. Moreover, when the time delay is negligible, the qubit-qubit reduced system evolves within the strong-coupling regime and the qubits can be almost maximally entangled. We also analyze the robustness of the protocol against variations of some relevant parameters.

quant-ph↗

Pulse reverse-engineering for strong field-matter interaction

We propose a scheme to control the evolution of a two-level quantum system in the strong coupling regime based on the idea of reverse-engineering. A coherent control field is designed to drive both closed and open two-level quantum systems along user predefined evolution trajectory without utilizing the rotating-wave approximation (RWA). As concrete examples, we show that complete population inversion, an equally weighted coherent superposition, and even oscillationlike dynamics can be achieved. As there are no limitations on the coupling strength between the control field and matter, the scheme is attractive for applications such as accelerating desired system dynamics and fast quantum information processing.

quant-ph↗

Self-supervised Image Enhancement Network: Training with Low Light Images Only

This paper proposes a self-supervised low light image enhancement method based on deep learning. Inspired by information entropy theory and Retinex model, we proposed a maximum entropy based Retinex model. With this model, a very simple network can separate the illumination and reflectance, and the network can be trained with low light images only. We introduce a constraint that the maximum channel of the reflectance conforms to the maximum channel of the low light image and its entropy should be largest in our model to achieve self-supervised learning. Our model is very simple and does not rely on any well-designed data set (even one low light image can complete the training). The network only needs minute-level training to achieve image enhancement. It can be proved through experiments that the proposed method has reached the state-of-the-art in terms of processing speed and effect.

cs.CV↗

Attention Mechanism Enhanced Kernel Prediction Networks for Denoising of Burst Images

Deep learning based image denoising methods have been extensively investigated. In this paper, attention mechanism enhanced kernel prediction networks (AME-KPNs) are proposed for burst image denoising, in which, nearly cost-free attention modules are adopted to first refine the feature maps and to further make a full use of the inter-frame and intra-frame redundancies within the whole image burst. The proposed AME-KPNs output per-pixel spatially-adaptive kernels, residual maps and corresponding weight maps, in which, the predicted kernels roughly restore clean pixels at their corresponding locations via an adaptive convolution operation, and subsequently, residuals are weighted and summed to compensate the limited receptive field of predicted kernels. Simulations and real-world experiments are conducted to illustrate the robustness of the proposed AME-KPNs in burst image denoising.

eess.IV↗

Cyber-Physical Microgrids: Toward Future Resilient Communities

Research in monitoring and control of microgrids has been ongoing for the last two decades to protect and enhance communities' socio-economic performance. However, of increasing concern are the possible cyber-physical threats that could disrupt the provision of macrogrids' energy services to critical infrastructure and consequently impact the resilience and sustainability of communities. As cyber-physical systems, microgrids are not immune to these threats. Advanced monitoring and control are critical for real-time operations of microgrids and, therefore, directly influence communities' resilience. Research trends in monitoring have recently shifted from normal situational awareness in forecasting, state estimation, and prediction to anomalies' analysis and cyber-physical attacks' detection to support resilient control systems. In addition, confounding the interpretation of research findings is the lack of a widely accepted definition, analytical methods, and metrics to consistently describe the resilience of power grids, especially for microgrids. This paper provides an overview of current research in microgrid resilience and presents an outlook for future trends.

math.OC↗

Maintaining Discrimination and Fairness in Class Incremental Learning

Deep neural networks (DNNs) have been applied in class incremental learning, which aims to solve common real-world problems of learning new classes continually. One drawback of standard DNNs is that they are prone to catastrophic forgetting. Knowledge distillation (KD) is a commonly used technique to alleviate this problem. In this paper, we demonstrate it can indeed help the model to output more discriminative results within old classes. However, it cannot alleviate the problem that the model tends to classify objects into new classes, causing the positive effect of KD to be hidden and limited. We observed that an important factor causing catastrophic forgetting is that the weights in the last fully connected (FC) layer are highly biased in class incremental learning. In this paper, we propose a simple and effective solution motivated by the aforementioned observations to address catastrophic forgetting. Firstly, we utilize KD to maintain the discrimination within old classes. Then, to further maintain the fairness between old classes and new classes, we propose Weight Aligning (WA) that corrects the biased weights in the FC layer after normal training process. Unlike previous work, WA does not require any extra parameters or a validation set in advance, as it utilizes the information provided by the biased weights themselves. The proposed method is evaluated on ImageNet-1000, ImageNet-100, and CIFAR-100 under various settings. Experimental results show that the proposed method can effectively alleviate catastrophic forgetting and significantly outperform state-of-the-art methods.

cs.CV↗

Information collection for fraud detection in P2P financial market

Fintech companies have been facing challenges from fraudulent behavior for a long time. Fraud rate in Chinese P2P financial market could go as high as 10%. It is crucial to collect sufficient information of the user as input to the anti-fraud process. Data collection framework for Fintech companies are different fro m conventional internet firms. With individual-based crawling request , we need to deal with new challenges negligible elsewhere . In this paper , we give an outline of how we collect data from the web to facilitate our anti-fraud process. We also overview the challenges and solutions to our problems. Our team at HC Financial Service Group is one of the few companies that are capable of developing full-fledged crawlers on our own.

cs.OH↗

Path-accelerated molecular dynamics: Parallel-in-time integration using path integrals

Massively parallel computer architectures create new opportunities for the performance of long-timescale molecular dynamics (MD) simulations. Here, we introduce the path-accelerated molecular dynamics (PAMD) method that takes advantage of distributed computing to reduce the wall-clock time of MD simulation via parallelization with respect to MD timesteps. The marginal distribution for the time evolution of a system is expressed in terms of a path integral, enabling the use of path sampling techniques to numerically integrate MD trajectories. By parallelizing the evaluation of the path action with respect to time and by initializing the path configurations from a non-equilibrium distribution, the algorithm enables significant speedups in terms of the length of MD trajectories that can be integrated in a given amount of wall-clock time. The method is demonstrated for Brownian dynamics, although it is generalizable to other stochastic equations of motion including open systems. We apply the method to two simple systems, a harmonic oscillator and a Lennard-Jones liquid, and we show that in comparison to the conventional Euler integration scheme for Brownian dynamics, the new method can reduce the wall-clock time for integrating trajectories of a given length by more than three orders of magnitude in the former system and more than two in the latter. This new method for parallelizing MD in the dimension of time can be trivially combined with algorithms for parallelizing the MD force evaluation to achieve further speedup.

physics.comp-ph↗