Searcharxiv⌕ Search

arXiv subjects

Bo Liu

Publications and source records attributed to Bo Liu.

At least 451 records · Page 25Linked to original sources

D-Unet: A Dual-encoder U-Net for Image Splicing Forgery Detection and Localization

Recently, many detection methods based on convolutional neural networks (CNNs) have been proposed for image splicing forgery detection. Most of these detection methods focus on the local patches or local objects. In fact, image splicing forgery detection is a global binary classification task that distinguishes the tampered and non-tampered regions by image fingerprints. However, some specific image contents are hardly retained by CNN-based detection networks, but if included, would improve the detection accuracy of the networks. To resolve these issues, we propose a novel network called dual-encoder U-Net (D-Unet) for image splicing forgery detection, which employs an unfixed encoder and a fixed encoder. The unfixed encoder autonomously learns the image fingerprints that differentiate between the tampered and non-tampered regions, whereas the fixed encoder intentionally provides the direction information that assists the learning and detection of the network. This dual-encoder is followed by a spatial pyramid global-feature extraction module that expands the global insight of D-Unet for classifying the tampered and non-tampered regions more accurately. In an experimental comparison study of D-Unet and state-of-the-art methods, D-Unet outperformed the other methods in image-level and pixel-level detection, without requiring pre-training or training on a large number of forgery images. Moreover, it was stably robust to different attacks.

cs.CV↗

APPL: Adaptive Planner Parameter Learning

While current autonomous navigation systems allow robots to successfully drive themselves from one point to another in specific environments, they typically require extensive manual parameter re-tuning by human robotics experts in order to function in new environments. Furthermore, even for just one complex environment, a single set of fine-tuned parameters may not work well in different regions of that environment. These problems prohibit reliable mobile robot deployment by non-expert users. As a remedy, we propose Adaptive Planner Parameter Learning (APPL), a machine learning framework that can leverage non-expert human interaction via several modalities -- including teleoperated demonstrations, corrective interventions, and evaluative feedback -- and also unsupervised reinforcement learning to learn a parameter policy that can dynamically adjust the parameters of classical navigation systems in response to changes in the environment. APPL inherits safety and explainability from classical navigation systems while also enjoying the benefits of machine learning, i.e., the ability to adapt and improve from experience. We present a suite of individual APPL methods and also a unifying cycle-of-learning scheme that combines all the proposed methods in a framework that can improve navigation performance through continual, iterative human interaction and simulation training.

cs.RO↗

Implicit semantic-based personalized micro-videos recommendation

With the rapid development of mobile Internet and big data, a huge amount of data is generated in the network, but the data that users are really interested in a very small portion. To extract the information that users are interested in from the huge amount of data, the information overload problem needs to be solved. In the era of mobile internet, the user's characteristics and other information should be combined in the massive amount of data to quickly and accurately recommend content to the user, as far as possible to meet the user's personalized needs. Therefore, there is an urgent need to realize high-speed and effective retrieval in tens of thousands of micro-videos. Video data content contains complex meanings, and there are intrinsic connections between video data. For multimodal information, subspace coding learning is introduced to build a coding network from public potential representations to multimodal feature information, taking into account the consistency and complementarity of information under each modality to obtain a public representation of the complete eigenvalue. An end-to-end reordering model based on deep learning and attention mechanism, called interest-related product similarity model based on multimodal data, is proposed for providing top-N recommendations. The multimodal feature learning module, interest-related network module and product similarity recommendation module together form the new model.By conducting extensive experiments on publicly accessible datasets, the results demonstrate the state-of-the-art performance of our proposed algorithm and its effectiveness.

cs.IR↗

In-plane anisotropic response to the uniaxial pressure in the hidden order state of URu$_2$Si$_2$

We studied the uniaxial-pressure dependence of the resistivity for URu$_{2-x}$Fe$_x$Si$_2$ samples with $x$ = 0 and 0.2, which host a hidden order (HO) and a large-moment antiferromagnetic (LMAFM) phase, respectively. For both samples, the elastoresistivity $ζ$ shows a seemingly divergent behavior above the transition temperature $T_0$ and a quick decrease below it. We found that the temperature dependence of $ζ$ for both samples can be well described by assuming the uniaxial pressure effect on the gap or certain energy scale except for $ζ_{(110)}$ of the $x$ = 0 sample, which exhibits a non-zero residual value at 0 K. We show that this provides a qualitative difference between the HO and LMAFM phases. Our results suggest that there is an in-plane anisotropic response to the uniaxial pressure that only exists in the hidden order state without necessarily breaking the rotational lattice symmetry.

cond-mat.str-el↗

Design and Commissioning of A Beam Distribution System for Multiple Undulator Line Operation of the SXFEL-UF

As an important measure of improving the efficiency and usability of X-ray free electron laser facilities, simultaneous operation of multiple undulator lines realized by a beam distribution system has become a standard configuration in the recent built XFEL facilities. In Shanghai, SXFEL-UF, the first soft X-ray free electron laser user facility in China, has finished construction and started commissioning recently. Electron beam from linac is alternately distributed between the two parallel undulator beam lines by a beam distribution system with a 6° deflection line. The beam distribution system is designed to keep the beam properties like low emittance, high peak charge and small bunch length from being spoiled. Beam collective effects such as the dispersion, coherent synchrotron radiation and micro-bunching instability should be well suppressed to guarantee the beam quality. In this work, the detailed physics design of the beam distribution system is described and the recent commissioning result is reported.

physics.acc-ph↗

A multi-task learning for cavitation detection and cavitation intensity recognition of valve acoustic signals

With the rapid development of smart manufacturing, data-driven machinery health management has received a growing attention. As one of the most popular methods in machinery health management, deep learning (DL) has achieved remarkable successes. However, due to the issues of limited samples and poor separability of different cavitation states of acoustic signals, which greatly hinder the eventual performance of DL modes for cavitation intensity recognition and cavitation detection. In this work, a novel multi-task learning framework for simultaneous cavitation detection and cavitation intensity recognition framework using 1-D double hierarchical residual networks (1-D DHRN) is proposed for analyzing valves acoustic signals. Firstly, a data augmentation method based on sliding window with fast Fourier transform (Swin-FFT) is developed to alleviate the small-sample issue confronted in this study. Secondly, a 1-D double hierarchical residual block (1-D DHRB) is constructed to capture sensitive features from the frequency domain acoustic signals of valve. Then, a new structure of 1-D DHRN is proposed. Finally, the devised 1-D DHRN is evaluated on two datasets of valve acoustic signals without noise (Dataset 1 and Dataset 2) and one dataset of valve acoustic signals with realistic surrounding noise (Dataset 3) provided by SAMSON AG (Frankfurt). Our method has achieved state-of-the-art results. The prediction accurcies of 1-D DHRN for cavitation intensitys recognition are as high as 93.75%, 94.31% and 100%, which indicates that 1-D DHRN outperforms other DL models and conventional methods. At the same time, the testing accuracies of 1-D DHRN for cavitation detection are as high as 97.02%, 97.64% and 100%. In addition, 1-D DHRN has also been tested for different frequencies of samples and shows excellent results for frequency of samples that mobile phones can accommodate.

cs.SD↗

Appending Information Reconciliation for Quantum Key Distribution

Information reconciliation (IR), which corrects the errors in the sifted keys, directly determines the secure key rate and the link distance of quantum key distribution (QKD) systems. In this article, we propose an appending information reconciliation (AIR) scheme based on polar codes, which achieves high efficiency and ultra-low failure probability simultaneously, by gradually disclosing the bit values of the polarized channels with high error probability. The experimental results show that the efficiency of the proposed AIR scheme is closer to the Shannon limit, compared with the state-of-the-art implemented polar codes-based IR schemes, with the overall failure probability around 1E-8, especially when performed with smaller block sizes. Moreover, the efficiency of the proposed AIR scheme is 1.046, when the block size is 1 Gb and the quantum bit error rate of 0.02. Therefore, the proposed AIR scheme can further eradicate the performance gap between theory and implementation for QKD systems.

quant-ph↗

Effective Mutation Rate Adaptation through Group Elite Selection

Evolutionary algorithms are sensitive to the mutation rate (MR); no single value of this parameter works well across domains. Self-adaptive MR approaches have been proposed but they tend to be brittle: Sometimes they decay the MR to zero, thus halting evolution. To make self-adaptive MR robust, this paper introduces the Group Elite Selection of Mutation Rates (GESMR) algorithm. GESMR co-evolves a population of solutions and a population of MRs, such that each MR is assigned to a group of solutions. The resulting best mutational change in the group, instead of average mutational change, is used for MR selection during evolution, thus avoiding the vanishing MR problem. With the same number of function evaluations and with almost no overhead, GESMR converges faster and to better solutions than previous approaches on a wide range of continuous test optimization problems. GESMR also scales well to high-dimensional neuroevolution for supervised image-classification tasks and for reinforcement learning control tasks. Remarkably, GESMR produces MRs that are optimal in the long-term, as demonstrated through a comprehensive look-ahead grid search. Thus, GESMR and its theoretical and empirical analysis demonstrate how self-adaptation can be harnessed to improve performance in several applications of evolutionary computation.

cs.NE↗

Mean-Variance Policy Iteration for Risk-Averse Reinforcement Learning

We present a mean-variance policy iteration (MVPI) framework for risk-averse control in a discounted infinite horizon MDP optimizing the variance of a per-step reward random variable. MVPI enjoys great flexibility in that any policy evaluation method and risk-neutral control method can be dropped in for risk-averse control off the shelf, in both on- and off-policy settings. This flexibility reduces the gap between risk-neutral control and risk-averse control and is achieved by working on a novel augmented MDP directly. We propose risk-averse TD3 as an example instantiating MVPI, which outperforms vanilla TD3 and many previous risk-averse control methods in challenging Mujoco robot simulation tasks under a risk-aware performance metric. This risk-averse TD3 is the first to introduce deterministic policies and off-policy learning into risk-averse reinforcement learning, both of which are key to the performance boost we show in Mujoco domains.

cs.LG↗

Broad Emission and Absorption Line Outflows in the Quasar SDSS J163345.22+512748.4

We present a detailed study of the optical and NIR emission and absorption line spectrum of the quasar SDSS J163345.22+512748.4. We discovered on the newly acquired NIR spectrum a highly meta-stable neutral helium broad absorption line (BAL) \heiozetz\ with a width of $\sim$ 2000 \kmps\ and a blueshift of $\sim$ 7000 \kmps\ in the velocity space. The BAL system is also significantly detected in \mgii\ and \heiteen. We estimate a column density of $(5.0 \pm 1.7) \times 10^{14}$ cm$^{-2}$ for the HeI*(2~$^3$S) level, and infer an ionization parameter of $U_{A} = 10^{-1.9\pm 0.2}$ for the BAL outflow assuming that the BAL region is thick enough for a full development of an ionization front. The total column density of the BAL outflow is constrained in the range N$\rm _{H}$ $\sim$ 10$^{21}$-10$^{21.4}$ cm$^{-2}$. We also found that the bulk of both MgII and UV FeII, as well as H$α$ broad emission lines (BELs) are blueshifted with a velocity of $\sim$ 2200 \kmps\ with respect to the quasar systemic redshift. We constrain that the blueshifted BEL region has a covering factor $C_{f}\approx 16\%$, a density n$\rm _{H}$ $\sim $ 10$^{10.6}$-10$^{11.3}$ cm$^{-3}$, a column density N$\rm _{H}\gtrsim 10^{23}$ cm$^{-2}$, and an ionization parameter $U_{E}\sim 10^{-2.1}-10^{-1.5}$. The outflow gas is located at $\sim$0.1 pc away from the central ionization source, at a scale comparable to the BLR. A toy kinetic model has been proposed to reproduce the profile of MgII BEL well if assuming a partial obscured axisymmetric geometry of the outflow with a radial velocity as observed by the BALs.

astro-ph.GA↗

Language-Level Semantics Conditioned 3D Point Cloud Segmentation

In this work, a language-level Semantics Conditioned framework for 3D Point cloud segmentation, called SeCondPoint, is proposed, where language-level semantics are introduced to condition the modeling of point feature distribution as well as the pseudo-feature generation, and a feature-geometry-based mixup approach is further proposed to facilitate the distribution learning. To our knowledge, this is the first attempt in literature to introduce language-level semantics to the 3D point cloud segmentation task. Since a large number of point features could be generated from the learned distribution thanks to the semantics conditioned modeling, any existing segmentation network could be embedded into the proposed framework to boost its performance. In addition, the proposed framework has the inherent advantage of dealing with novel classes, which seems an impossible feat for the current segmentation networks. Extensive experimental results on two public datasets demonstrate that three typical segmentation networks could achieve significant improvements over their original performances after enhancement by the proposed framework in the conventional 3D segmentation task. Two benchmarks are also introduced for a newly introduced zero-shot 3D segmentation task, and the results also validate the proposed framework.

cs.CV↗

An Iterative Co-Training Transductive Framework for Zero Shot Learning

In zero-shot learning (ZSL) community, it is generally recognized that transductive learning performs better than inductive one as the unseen-class samples are also used in its training stage. How to generate pseudo labels for unseen-class samples and how to use such usually noisy pseudo labels are two critical issues in transductive learning. In this work, we introduce an iterative co-training framework which contains two different base ZSL models and an exchanging module. At each iteration, the two different ZSL models are co-trained to separately predict pseudo labels for the unseen-class samples, and the exchanging module exchanges the predicted pseudo labels, then the exchanged pseudo-labeled samples are added into the training sets for the next iteration. By such, our framework can gradually boost the ZSL performance by fully exploiting the potential complementarity of the two models' classification capabilities. In addition, our co-training framework is also applied to the generalized ZSL (GZSL), in which a semantic-guided OOD detector is proposed to pick out the most likely unseen-class samples before class-level classification to alleviate the bias problem in GZSL. Extensive experiments on three benchmarks show that our proposed methods could significantly outperform about $31$ state-of-the-art ones.

cs.CV↗

Multi-wavelength Campaign on the Super-Eddington NLS1 RX J0134.2-4258 -- I. Peculiar X-ray Spectra and Variability

We have conducted a new long-term multi-wavelength campaign on one of the most super- Eddington narrow-line Seyfert 1s (NLS1s) known, namely RX J0134.2-4258. In this first paper, we report deep simultaneous X-ray observations performed by XMM-Newton and NuSTAR in 2019-12-19, during which RX J0134.2-4258 was fortuitously at one of its lowest X-ray flux states. However, there is a clear rise above 4 keV which implies that the intrinsic source flux may be higher. The X-ray spectra observed between 1996 and 2019 show drastic variability, probably due to complex, variable absorption along the line of sight. Unusually, the soft X-ray excess appears extremely weak in all these spectra, even when the hard X-ray spectrum has a steep slope of $Γ\simeq 2.2$. We explore the spectral-timing properties of the new (low X-ray flux) and archival (high X-ray flux) XMM-Newton data, fitting their time-average, rms and lag spectra simultaneously. The variability spectra indicate the presence of a very weak soft X-ray Comptonisation component, whose shape is similar to the soft excess in normal super-Eddington NLS1s, but with flux relative to the power law which is lower by more than one order of magnitude. Above 4 keV the low-flux data are dominated by a different component, which lags with respect to the lower energy emission. This is consistent with an origin of reflection or partial covering absorption from low ionization material located within 100 Rg. We interpret this as a further indication of the presence of a clumpy disc wind.

astro-ph.HE↗

Semantic-diversity transfer network for generalized zero-shot learning via inner disagreement based OOD detector

Zero-shot learning (ZSL) aims to recognize objects from unseen classes, where the kernel problem is to transfer knowledge from seen classes to unseen classes by establishing appropriate mappings between visual and semantic features. The knowledge transfer in many existing works is limited mainly due to the facts that 1) the widely used visual features are global ones but not totally consistent with semantic attributes; 2) only one mapping is learned in existing works, which is not able to effectively model diverse visual-semantic relations; 3) the bias problem in the generalized ZSL (GZSL) could not be effectively handled. In this paper, we propose two techniques to alleviate these limitations. Firstly, we propose a Semantic-diversity transfer Network (SetNet) addressing the first two limitations, where 1) a multiple-attention architecture and a diversity regularizer are proposed to learn multiple local visual features that are more consistent with semantic attributes and 2) a projector ensemble that geometrically takes diverse local features as inputs is proposed to model visual-semantic relations from diverse local perspectives. Secondly, we propose an inner disagreement based domain detection module (ID3M) for GZSL to alleviate the third limitation, which picks out unseen-class data before class-level classification. Due to the absence of unseen-class data in training stage, ID3M employs a novel self-contained training scheme and detects out unseen-class data based on a designed inner disagreement criterion. Experimental results on three public datasets demonstrate that the proposed SetNet with the explored ID3M achieves a significant improvement against $30$ state-of-the-art methods.

cs.CV↗

Label-only Model Inversion Attack: The Attack that Requires the Least Information

In a model inversion attack, an adversary attempts to reconstruct the data records, used to train a target model, using only the model's output. In launching a contemporary model inversion attack, the strategies discussed are generally based on either predicted confidence score vectors, i.e., black-box attacks, or the parameters of a target model, i.e., white-box attacks. However, in the real world, model owners usually only give out the predicted labels; the confidence score vectors and model parameters are hidden as a defense mechanism to prevent such attacks. Unfortunately, we have found a model inversion method that can reconstruct the input data records based only on the output labels. We believe this is the attack that requires the least information to succeed and, therefore, has the best applicability. The key idea is to exploit the error rate of the target model to compute the median distance from a set of data records to the decision boundary of the target model. The distance, then, is used to generate confidence score vectors which are adopted to train an attack model to reconstruct the data records. The experimental results show that highly recognizable data records can be reconstructed with far less information than existing methods.

cs.CR↗

One Parameter Defense -- Defending against Data Inference Attacks via Differential Privacy

Machine learning models are vulnerable to data inference attacks, such as membership inference and model inversion attacks. In these types of breaches, an adversary attempts to infer a data record's membership in a dataset or even reconstruct this data record using a confidence score vector predicted by the target model. However, most existing defense methods only protect against membership inference attacks. Methods that can combat both types of attacks require a new model to be trained, which may not be time-efficient. In this paper, we propose a differentially private defense method that handles both types of attacks in a time-efficient manner by tuning only one parameter, the privacy budget. The central idea is to modify and normalize the confidence score vectors with a differential privacy mechanism which preserves privacy and obscures membership and reconstructed data. Moreover, this method can guarantee the order of scores in the vector to avoid any loss in classification accuracy. The experimental results show the method to be an effective and timely defense against both membership inference and model inversion attacks with no reduction in accuracy.

cs.CR↗

Low-temperature specific-heat studies on two square-kagome antiferromagnets

We studied the low-temperature specific heats of two antiferromagnets with the two-dimensional square-kagome structure, i.e., KCu$_6$AlBiO$_4$(SO$_4$)$_5$Cl (KCu6) and Na$_6$Cu$_7$BiO$_4$(PO$_4$)$_4$[Cl,(OH)]$_3$ (NaCu7) with the structural differences that there are interlayer Cu$^{2+}$ ions in NaCu7. Both materials show no magnetic ordering down to 50 mK. At zero field, the $C/T$ of KCu6 has a finite value when the temperature is close to zero K. Under the magnetic field, a seemingly $T^2$ dependence appears and its coefficient is progressively suppressed by the field. For NaCu7, the specific heat exhibits the $T^2$ dependence at zero field and under fields. The ratio of the quadratic coefficients of KCu6 and NaCu7 at high fields is inversely proportional to ratio of the squared Weiss temperatures, which indicates these two compounds host the same ground state under fields. Our results suggest that the interlayer Cu$^{2+}$ ions in NaCu7 play a negligible role in determination of its ground state. We discuss the possible quantum-spin-liquid states in these compounds and further directions to pursue based our results.

cond-mat.str-el↗

Polar Codes-based Information Reconciliation Scheme with Frozen Bits Erasure Strategy for Quantum Key Distribution

Information reconciliation (IR) ensures the correctness of quantum key distribution systems, by correcting the error bits existed in the sifted keys. In this article, we propose a polar codes-based IR scheme with the frozen bits erasure strategy, where an equivalent transmission of sifted keys is conducted, so that the frozen bits in the decoding procedure is erased to 0. Thus, our IR scheme can be implemented efficiently without the assumption of true random numbers. Furthermore, we implement the proposed IR scheme with the fast simplified successive cancellation list decoder and its throughput reaches to 0.88Mbps with the yield of 0.8333, where the decoder list size is 16, the block size is 1Mb and the quantum bit error rate is 0.02.

quant-ph↗