Searcharxiv⌕ Search

arXiv subjects

Hong Wang

Publications and source records attributed to Hong Wang.

At least 181 records · Page 10Linked to original sources

Road Traffic Law Adaptive Decision-making for Self-Driving Vehicles

Self-driving vehicles have their own intelligence to drive on open roads. However, vehicle managers, e.g., government or industrial companies, still need a way to tell these self-driving vehicles what behaviors are encouraged or forbidden. Unlike human drivers, current self-driving vehicles cannot understand the traffic laws, thus rely on the programmers manually writing the corresponding principles into the driving systems. It would be less efficient and hard to adapt some temporary traffic laws, especially when the vehicles use data-driven decision-making algorithms. Besides, current self-driving vehicle systems rarely take traffic law modification into consideration. This work aims to design a road traffic law adaptive decision-making method. The decision-making algorithm is designed based on reinforcement learning, in which the traffic rules are usually implicitly coded in deep neural networks. The main idea is to supply the adaptability to traffic laws of self-driving vehicles by a law-adaptive backup policy. In this work, the natural language-based traffic laws are first translated into a logical expression by the Linear Temporal Logic method. Then, the system will try to monitor in advance whether the self-driving vehicle may break the traffic laws by designing a long-term RL action space. Finally, a sample-based planning method will re-plan the trajectory when the vehicle may break the traffic rules. The method is validated in a Beijing Winter Olympic Lane scenario and an overtaking case, built in CARLA simulator. The results show that by adopting this method, the self-driving vehicles can comply with new issued or updated traffic laws effectively. This method helps self-driving vehicles governed by digital traffic laws, which is necessary for the wide adoption of autonomous driving.

cs.RO↗

Inverse design of artificial skins

Mimicking the perceptual functions of human cutaneous mechanoreceptors, artificial skins or flexible pressure sensors can transduce tactile stimuli to quantitative electrical signals. Conventional methods to design such devices follow a forward structure-to-property routine based on trial-and-error experiments/simulations, which take months or longer to determine one solution valid for one specific material. Target-oriented inverse design that shows far higher output efficiency has proven effective in other fields, but is still absent for artificial skins because of the difficulties in acquiring big data. Here, we report a property-to-structure inverse design of artificial skins based on small dataset machine learning, exhibiting a comprehensive efficiency at least four orders of magnitude higher than the conventional routine. The inverse routine can predict hundreds of solutions that overcome the intrinsic signal saturation problem for linear response in hours, and the solutions are valid to a variety of materials. Our results demonstrate that the inverse design allowed by small dataset is an efficient and powerful tool to target multifarious applications of artificial skins, which can potentially advance the fields of intelligent robots, advanced healthcare, and human-machine interfaces.

cond-mat.soft↗

Interactive Segmentation as Gaussian Process Classification

Click-based interactive segmentation (IS) aims to extract the target objects under user interaction. For this task, most of the current deep learning (DL)-based methods mainly follow the general pipelines of semantic segmentation. Albeit achieving promising performance, they do not fully and explicitly utilize and propagate the click information, inevitably leading to unsatisfactory segmentation results, even at clicked points. Against this issue, in this paper, we propose to formulate the IS task as a Gaussian process (GP)-based pixel-wise binary classification model on each image. To solve this model, we utilize amortized variational inference to approximate the intractable GP posterior in a data-driven manner and then decouple the approximated GP posterior into double space forms for efficient sampling with linear complexity. Then, we correspondingly construct a GP classification framework, named GPCIS, which is integrated with the deep kernel learning mechanism for more flexibility. The main specificities of the proposed GPCIS lie in: 1) Under the explicit guidance of the derived GP posterior, the information contained in clicks can be finely propagated to the entire image and then boost the segmentation; 2) The accuracy of predictions at clicks has good theoretical support. These merits of GPCIS as well as its good generality and high efficiency are substantiated by comprehensive experiments on several benchmarks, as compared with representative methods both quantitatively and qualitatively.

cs.CV↗

XFL: A High Performace, Lightweighted Federated Learning Framework

This paper introduces XFL, an industrial-grade federated learning project. XFL supports training AI models collaboratively on multiple devices, while utilizes homomorphic encryption, differential privacy, secure multi-party computation and other security technologies ensuring no leakage of data. XFL provides an abundant algorithms library, integrating a large number of pre-built, secure and outstanding federated learning algorithms, covering both the horizontally and vertically federated learning scenarios. Numerical experiments have shown the prominent performace of these algorithms. XFL builds a concise configuration interfaces with presettings for all federation algorithms, and supports the rapid deployment via docker containers.Therefore, we believe XFL is the most user-friendly and easy-to-develop federated learning framework. XFL is open-sourced, and both the code and documents are available at https://github.com/paritybit-ai/XFL.

cs.LG↗

A dichotomy for Hörmander-type oscillatory integral operators

In this paper, we first generalize the work of Bourgain and state a curvature condition for Hörmander-type oscillatory integral operators, which we call Bourgain's condition. This condition is notably satisfied by the phase functions for the Fourier restriction problem and the Bochner-Riesz problem. We conjecture that for Hörmander-type oscillatory integral operators satisfying Bourgain's condition, they satisfy the same $L^p$ bounds as in the Fourier Restriction Conjecture. To support our conjecture, we show that whenever Bourgain's condition fails, then the $L^{\infty} \to L^q$ boundedness always fails for some $q= q(n) > \frac{2n}{n-1}$, extending Bourgain's three-dimensional result. On the other hand, if Bourgain's condition holds, then we prove $L^p$ bounds for Hörmander-type oscillatory integral operators for a range of $p$ that extends the currently best-known range for the Fourier restriction conjecture in high dimensions, given by Hickman and Zahl. This gives new progress on the Fourier restriction problem and the Bochner-Riesz problem.

math.CA↗

Quantum geometrical current and coherence of the open gravitation system: loop quantum gravity coupled with a thermal scalar field

Open quantum systems interacting with the environments often show interesting behaviors, such as decoherence, non-unitary evolution, dissipation, etc. It is interesting but still challenging to study the open quantum gravitation system interacting with the environments. In this work, we develop a general parameterized theoretical framework for the open quantum gravitation system. Under the Born-Markov approximation, we derived the quantum master equation with a new method which determines the evolution for certain types of open quantum gravitation system. Finally, we studied a specific model where the real scalar field plays the role of the environment and the spacetime is assumed to be homogeneous and isotropic. We quantize the spacetime through the loop quantum gravity. We show that the scalar field can induce the quantum geometry in the equilibrium state when the scalar field is under the thermal equilibrium. For the non-steady state, the quantum geometry flux emerges. We point out that the quantum geometry flux and the coherence can drive the evolution of the spacetime geometry. This provides us a new view on the evolution of the spacetime geometry. Our results shown that the coherence of the spacetime monotonically decreases as the temperature of the bath decreases. This indicates that a classical cold universe can emerge from an initial hot quantum universe. We found in this model that the entanglement entropy of the gravitation system is related to the average volume of the space. We take the continuous limit for studying the loop quantum cosmology and approximately obtain a tunneling probability of the spacetime from the zero volume state to the finite volume state.

gr-qc↗

A fast computational framework for the linear bond-based peridynamic model

Peridynamic (PD) theory is significant and promising in engineering and materials science; however, it imposes challenges owing to the enormous computational cost caused by its nonlocality. Our main contribution, which overcomes the restrictions of the existing fast method, is a general computational framework for the linear bond-based peridynamic models based on the meshfree method, called the matrix-structure-based fast method (MSBFM), which is suitable for the general case, including 2D/3D problems, and static/dynamic issues, as well as problems with general boundary conditions, in particular, problems with crack propagation. Consequently, we provide a general calculation flow chart. The proposed computational framework is practical and easily embedded into the existing computational algorithm. With this framework, the computational cost is reduced from $O(N^2)$ to $O(N\log N)$, and the storage request is reduced from $O(N^2)$ to $O(N)$, where N is the degree of freedom. Finally, the vast reduction of the computational and memory requirement is verified by numerical examples.

math.NA↗

Planning Automated Driving with Accident Experience Referencing and Common-sense Inferencing

Although a typical autopilot system far surpasses humans in term of sensing accuracy, performance stability and response agility, such a system is still far behind humans in the wisdom of understanding an unfamiliar environment with creativity, adaptivity and resiliency. Current AD brains are basically expert systems featuring logical computations, which resemble the thinking flow of a left brain working at tactical level. A right brain is needed to upgrade the safety of automated driving vehicle onto next generation by making intuitive strategical judgements that can supervise the tactical action planning. In this work, we present the concept of an Automated Driving Strategical Brain (ADSB): a framework of a scene perception and scene safety evaluation system that works at a higher abstraction level, incorporating experience referencing, common-sense inferring and goal-and-value judging capabilities, to provide a contextual perspective for decision making within automated driving planning. The ADSB brain architecture is made up of the Experience Referencing Engine (ERE), the Common-sense Referencing Engine (CIE) and the Goal and Value Keeper (GVK). 1,614,748 cases from FARS/CRSS database of NHTSA in the period 1975 to 2018 are used for the training of ERE model. The kernel of CIE is a trained model, COMET-BART by ATOMIC, which can be used to provide directional advice when tactical-level environmental perception conclusions are ambiguous; it can also use future scenario models to remind tactical-level decision systems to plan ahead of a perceived hazard scene. GVK can take in any additional expert-hand-written rules that are of qualitative nature. Moreover, we believe that with good scalability, the ADSB approach provides a potential solution to the problem of long-tail corner cases encountered in the validation of a rule-based planning algorithm.

cs.RO↗

How Does Traffic Environment Quantitatively Affect the Autonomous Driving Prediction?

An accurate trajectory prediction is crucial for safe and efficient autonomous driving in complex traffic environments. In recent years, artificial intelligence has shown strong capabilities in improving prediction accuracy. However, its characteristics of inexplicability and uncertainty make it challenging to determine the traffic environmental effect on prediction explicitly, posing significant challenges to safety-critical decision-making. To address these challenges, this study proposes a trajectory prediction framework with the epistemic uncertainty estimation ability that outputs high uncertainty when confronting unforeseeable or unknown scenarios. The proposed framework is used to analyze the environmental effect on the prediction algorithm performance. In the analysis, the traffic environment is considered in terms of scenario features and shifts, respectively, where features are divided into kinematic features of a target agent, features of its surrounding traffic participants, and other features. In addition, feature correlation and importance analyses are performed to study the above features' influence on the prediction error and epistemic uncertainty. Further, a cross-dataset case study is conducted using multiple intersection datasets to investigate the impact of unavoidable distributional shifts in the real world on trajectory prediction. The results indicate that the deep ensemble-based method has advantages in improving prediction robustness and estimating epistemic uncertainty. The consistent conclusions are obtained by the feature correlation and importance analyses, including the conclusion that kinematic features of the target agent have relatively strong effects on the prediction error and epistemic uncertainty. Furthermore, the prediction failure caused by distributional shifts and the potential of the deep ensemble-based method are analyzed.

cs.CV↗

Exploring high thermal conductivity polymers via interpretable machine learning with physical descriptors

The efficient and economical exploitation of polymers with high thermal conductivity is essential to solve the issue of heat dissipation in organic devices. Currently, the experimental preparation of functional thermal conductivity polymers remains a trial and error process due to the multi-degrees of freedom during the synthesis and characterization process. In this work, we have proposed a high-throughput screening framework for polymer chains with high thermal conductivity via interpretable machine learning and physical-feature engineering. The polymer thermal conductivity datasets for training were first collected by molecular dynamics simulation. Inspired by the drug-like small molecule representation and molecular force field, 320 polymer monomer descriptors were calculated and the 20 optimized descriptors with physical meaning were extracted by hierarchical down-selection. All the machine learning models achieve a prediction accuracy R2 greater than 0.80, which is superior to that of represented by traditional graph descriptors. Further, the cross-sectional area and dihedral stiffness descriptors were identified for positive/negative contribution to thermal conductivity, and 107 promising polymer structures with thermal conductivity greater than 20.00 W/mK were obtained. Mathematical formulas for predicting the polymer thermal conductivity were also constructed by using symbolic regression. The high thermal conductivity polymer structures are mostly π-conjugated, whose overlapping p-orbitals enable easily to maintain strong chain stiffness and large group velocities. The proposed data-driven framework should facilitate the theoretical and experimental design of polymers with desirable properties.

cond-mat.mtrl-sci↗

RCDNet: An Interpretable Rain Convolutional Dictionary Network for Single Image Deraining

As a common weather, rain streaks adversely degrade the image quality. Hence, removing rains from an image has become an important issue in the field. To handle such an ill-posed single image deraining task, in this paper, we specifically build a novel deep architecture, called rain convolutional dictionary network (RCDNet), which embeds the intrinsic priors of rain streaks and has clear interpretability. In specific, we first establish a RCD model for representing rain streaks and utilize the proximal gradient descent technique to design an iterative algorithm only containing simple operators for solving the model. By unfolding it, we then build the RCDNet in which every network module has clear physical meanings and corresponds to each operation involved in the algorithm. This good interpretability greatly facilitates an easy visualization and analysis on what happens inside the network and why it works well in inference process. Moreover, taking into account the domain gap issue in real scenarios, we further design a novel dynamic RCDNet, where the rain kernels can be dynamically inferred corresponding to input rainy images and then help shrink the space for rain layer estimation with few rain maps so as to ensure a fine generalization performance in the inconsistent scenarios of rain types between training and testing data. By end-to-end training such an interpretable network, all involved rain kernels and proximal operators can be automatically extracted, faithfully characterizing the features of both rain and clean background layers, and thus naturally lead to better deraining performance. Comprehensive experiments substantiate the superiority of our method, especially on its well generality to diverse testing scenarios and good interpretability for all its modules. Code is available in \emph{\url{https://github.com/hongwang01/DRCDNet}}.

eess.IV↗

Orientation-Shared Convolution Representation for CT Metal Artifact Learning

During X-ray computed tomography (CT) scanning, metallic implants carrying with patients often lead to adverse artifacts in the captured CT images and then impair the clinical treatment. Against this metal artifact reduction (MAR) task, the existing deep-learning-based methods have gained promising reconstruction performance. Nevertheless, there is still some room for further improvement of MAR performance and generalization ability, since some important prior knowledge underlying this specific task has not been fully exploited. Hereby, in this paper, we carefully analyze the characteristics of metal artifacts and propose an orientation-shared convolution representation strategy to adapt the physical prior structures of artifacts, i.e., rotationally symmetrical streaking patterns. The proposed method rationally adopts Fourier-series-expansion-based filter parametrization in artifact modeling, which can better separate artifacts from anatomical tissues and boost the model generalizability. Comprehensive experiments executed on synthesized and clinical datasets show the superiority of our method in detail preservation beyond the current representative MAR methods. Code will be available at \url{https://github.com/hongwang01/OSCNet}

eess.IV↗

InDuDoNet+: A Deep Unfolding Dual Domain Network for Metal Artifact Reduction in CT Images

During the computed tomography (CT) imaging process, metallic implants within patients often cause harmful artifacts, which adversely degrade the visual quality of reconstructed CT images and negatively affect the subsequent clinical diagnosis. For the metal artifact reduction (MAR) task, current deep learning based methods have achieved promising performance. However, most of them share two main common limitations: 1) the CT physical imaging geometry constraint is not comprehensively incorporated into deep network structures; 2) the entire framework has weak interpretability for the specific MAR task; hence, the role of each network module is difficult to be evaluated. To alleviate these issues, in the paper, we construct a novel deep unfolding dual domain network, termed InDuDoNet+, into which CT imaging process is finely embedded. Concretely, we derive a joint spatial and Radon domain reconstruction model and propose an optimization algorithm with only simple operators for solving it. By unfolding the iterative steps involved in the proposed algorithm into the corresponding network modules, we easily build the InDuDoNet+ with clear interpretability. Furthermore, we analyze the CT values among different tissues, and merge the prior observations into a prior network for our InDuDoNet+, which significantly improve its generalization performance.Comprehensive experiments on synthesized data and clinical data substantiate the superiority of the proposed methods as well as the superior generalization performance beyond the current state-of-the-art (SOTA) MAR methods. . Code is available at \url{https://github.com/hongwang01/InDuDoNet_plus}.

eess.IV↗

Quantum cosmology of the flat universe via closed real-time path integral

Quantum cosmology is crucial to understand the evolution of the early universe. Despite significant progress, challenges still remain. For example, the role of time in quantum cosmology is unclear. Furthermore, the influence of the environment on the evolution of the quantum universe is challenging. In this work, we studied the evolution of the quantum universe non-perturbatively using the closed real-time path integral. The environments coupled to the quantum universe being considered are the radiation, the non-relativistic matter, or the dark matter. We evaluated the influence functional of the massless scalar field coupled with the flat FRW universe. We studied the evolution of the quantum universe by setting the initial state of spacetime as a Gaussian wave packet. In different scenarios, we show that the classical trajectory of the universe is consistent with the quantum evolution of the wave packet. The coherence, the absolute quantum fluctuation and the Gibbs entropy all monotonically increase with time, yet the relative quantum fluctuation decreases with time. We show that for a given size of the radiation dominated universe, the lower temperature corresponds to a more quantum universe. We find that the minimal coupling of the free massless scalar field with the flat FRW spacetime generally gives rise to the memory characterized via non-Markovian correlations. Finally, we show that under higher radiation temperatures, a small universe has a higher chance of a transition to a bigger universe.

gr-qc↗

Factoring integers with sublinear resources on a superconducting quantum processor

Shor's algorithm has seriously challenged information security based on public key cryptosystems. However, to break the widely used RSA-2048 scheme, one needs millions of physical qubits, which is far beyond current technical capabilities. Here, we report a universal quantum algorithm for integer factorization by combining the classical lattice reduction with a quantum approximate optimization algorithm (QAOA). The number of qubits required is O(logN/loglog N), which is sublinear in the bit length of the integer $N$, making it the most qubit-saving factorization algorithm to date. We demonstrate the algorithm experimentally by factoring integers up to 48 bits with 10 superconducting qubits, the largest integer factored on a quantum device. We estimate that a quantum circuit with 372 physical qubits and a depth of thousands is necessary to challenge RSA-2048 using our algorithm. Our study shows great promise in expediting the application of current noisy quantum computers, and paves the way to factor large integers of realistic cryptographic significance.

quant-ph↗

Small amplitude ion-acoustic solitary waves in a four-component magneto-rotating plasma with a modified Cairns-Tsallis distribution

The small amplitude ion-acoustic solitary waves in the magneto-rotating plasma consisting of cold fluid ions, hot positrons, and the two-temperature electrons (cold and hot electrons) are investigated when the electrons obey a modified Cairns-Tsallis distribution. By using the reductive perturbation method, we derive the Korteweg-de Vries equation and the modified Korteweg-de Vries equation and obtain the small amplitude ion-acoustic solitary wave solutions. The dependences of solitary wave solutions on the nonextensive q-parameter, the nonthermal alpha-parameter and the plasma physical quantities are analyzed numerically. We show the significant effects of the nonextensive q-parameter and the nonthermal alpha-parameter etc. on the ion-acoustic solitary waves.

physics.plasm-ph↗

Spatial-Temporal Attention Network for Open-Set Fine-Grained Image Recognition

Triggered by the success of transformers in various visual tasks, the spatial self-attention mechanism has recently attracted more and more attention in the computer vision community. However, we empirically found that a typical vision transformer with the spatial self-attention mechanism could not learn accurate attention maps for distinguishing different categories of fine-grained images. To address this problem, motivated by the temporal attention mechanism in brains, we propose a spatial-temporal attention network for learning fine-grained feature representations, called STAN, where the features learnt by implementing a sequence of spatial self-attention operations corresponding to multiple moments are aggregated progressively. The proposed STAN consists of four modules: a self-attention backbone module for learning a sequence of features with self-attention operations, a spatial feature self-organizing module for facilitating the model training, a spatial-temporal feature learning module for aggregating the re-organized features via a Long Short-Term Memory network, and a context-aware module that is implemented as the forget block of the spatial-temporal feature learning module for preserving/forgetting the long-term memory by utilizing contextual information. Then, we propose a STAN-based method for open-set fine-grained recognition by integrating the proposed STAN network with a linear classifier, called STAN-OSFGR. Extensive experimental results on 3 fine-grained datasets and 2 coarse-grained datasets demonstrate that the proposed STAN-OSFGR outperforms 9 state-of-the-art open-set recognition methods significantly in most cases.

cs.CV↗