Searcharxiv⌕ Search

arXiv subjects

Yu Guo

Publications and source records attributed to Yu Guo.

At least 163 records · Page 9Linked to original sources

Local-to-Global Registration for Bundle-Adjusting Neural Radiance Fields

Neural Radiance Fields (NeRF) have achieved photorealistic novel views synthesis; however, the requirement of accurate camera poses limits its application. Despite analysis-by-synthesis extensions for jointly learning neural 3D representations and registering camera frames exist, they are susceptible to suboptimal solutions if poorly initialized. We propose L2G-NeRF, a Local-to-Global registration method for bundle-adjusting Neural Radiance Fields: first, a pixel-wise flexible alignment, followed by a frame-wise constrained parametric alignment. Pixel-wise local alignment is learned in an unsupervised way via a deep network which optimizes photometric reconstruction errors. Frame-wise global alignment is performed using differentiable parameter estimation solvers on the pixel-wise correspondences to find a global transformation. Experiments on synthetic and real-world data show that our method outperforms the current state-of-the-art in terms of high-fidelity reconstruction and resolving large camera pose misalignment. Our module is an easy-to-use plugin that can be applied to NeRF variants and other neural field applications. The Code and supplementary materials are available at https://rover-xingyu.github.io/L2G-NeRF/.

cs.CV↗

Asynchronous Trajectory Matching-Based Multimodal Maritime Data Fusion for Vessel Traffic Surveillance in Inland Waterways

The automatic identification system (AIS) and video cameras have been widely exploited for vessel traffic surveillance in inland waterways. The AIS data could provide the vessel identity and dynamic information on vessel position and movements. In contrast, the video data could describe the visual appearances of moving vessels, but without knowing the information on identity, position and movements, etc. To further improve vessel traffic surveillance, it becomes necessary to fuse the AIS and video data to simultaneously capture the visual features, identity and dynamic information for the vessels of interest. However, traditional data fusion methods easily suffer from several potential limitations, e.g., asynchronous messages, missing data, random outliers, etc. In this work, we first extract the AIS- and video-based vessel trajectories, and then propose a deep learning-enabled asynchronous trajectory matching method (named DeepSORVF) to fuse the AIS-based vessel information with the corresponding visual targets. In addition, by combining the AIS- and video-based movement features, we also present a prior knowledge-driven anti-occlusion method to yield accurate and robust vessel tracking results under occlusion conditions. To validate the efficacy of our DeepSORVF, we have also constructed a new benchmark dataset (termed FVessel) for vessel detection, tracking, and data fusion. It consists of many videos and the corresponding AIS data collected in various weather conditions and locations. The experimental results have demonstrated that our method is capable of guaranteeing high-reliable data fusion and anti-occlusion vessel tracking.

cs.CV↗

Device-independent verification of Einstein-Podolsky-Rosen steering

Entanglement lies at the heart of quantum mechanics, and has been identified an essential resource for diverse applications in quantum information. If entanglement could be verified without any trust in the devices of observers, i.e., in a device-independent (DI) way, then unconditional security can be guaranteed for various quantum information tasks. In this work, we propose an experimental-friendly DI protocol to certify the presence of entanglement, based on Einstein-Podolsky-Rosen (EPR) steering. We first establish the DI verification framework, relying on the measurement-device-independent technique and self-testing, and show it is able to verify all EPR-steerable states. In the context of three-measurement settings as per party, it is found to be noise robustness towards inefficient measurements and imperfect self-testing. Finally, a four-photon experiment is implemented to device-independently verify EPR-steering even for Bell local states. Our work paves the way for realistic implementations of secure quantum information tasks.

quant-ph↗

ESIE-BERT: Enriching Sub-words Information Explicitly with BERT for Joint Intent Classification and SlotFilling

Natural language understanding (NLU) has two core tasks: intent classification and slot filling. The success of pre-training language models resulted in a significant breakthrough in the two tasks. One of the promising solutions called BERT can jointly optimize the two tasks. We note that BERT-based models convert each complex token into multiple sub-tokens by wordpiece algorithm, which generates a mismatch between the lengths of the tokens and the labels. This leads to BERT-based models do not do well in label prediction which limits model performance improvement. Many existing models can be compatible with this issue but some hidden semantic information is discarded in the fine-tuning process. We address the problem by introducing a novel joint method on top of BERT which explicitly models the multiple sub-tokens features after wordpiece tokenization, thereby contributing to the two tasks. Our method can well extract the contextual features from complex tokens by the proposed sub-words attention adapter (SAA), which preserves overall utterance information. Additionally, we propose an intent attention adapter (IAA) to obtain the full sentence features to aid users to predict intent. Experimental results confirm that our proposed model is significantly improved on two public benchmark datasets. In particular, the slot filling F1 score is improved from 96.1 to 98.2 (2.1% absolute) on the Airline Travel Information Systems (ATIS) dataset.

cs.CL↗

Three-dimensional sedimentation patterns of two interacting disks in a viscous fluid

The sedimentation of two spherical solid objects in a viscous fluid has been extensively investigated and well understood. However, a pair of flat disks (in three dimensions) settling in the fluid shows more complex hydrodynamic behaviors. The present work aims to improve understanding of this phenomenon by performing Direct Numerical Simulations (DNS) and physical experiments. The present results show that the sedimentation processes are significantly influenced by disk shape, characterized by a dimensionless moment of inertia I*, and Reynolds number of the leading disk Re. For the flatter disks with smaller I*, steady falling with enduring contact transits to periodic swinging with intermittent contacts as Re increases. The disks with larger I* tend to fall in a Drafting-Kissing-Tumbling (DKT) mode at low Re and to remain separated at high Re. Based on I* and Re, a phase diagram is created to classify the two-disk falling into ten distinctive patterns. The planar motion or three-dimensional motion of the disks is determined primarily by Re. Turbulent disturbance flows at a high Re contribute to the chaotic three-dimensional rotation of the disks. The chance for the two disks to contact is increased when I* and Re are reduced.

physics.flu-dyn↗

Complete monogamy of the multipartite quantum mutual information

Quantum mutual information (QMI) not only displays the mutual information in the system but also demonstrates some quantum correlation beyond entanglement. We explore here the two alternatives of multipartite quantum mutual information (MQMI) based on the von Neumann entropy according to the framework of the complete measure of multi-particle quantum system. We show that these two MQMI are complete, monogamous on pure states, and one of them is not only completely monogamous but also tightly complete monogamous while another one is not. Moreover, we present another two MQMI by replacing the von Neumann entropy with the Tasllis $q$-entropy from the former two ones. It is proved that one of them displays some degree of ``completeness'' as a measure of multi-particle quantum system, but the other one is not even non-negative and thus it can not be a alternative of MQMI. We also discuss the triangle relation for these three alternatives of MQMI. It is shown that the triangle inequalities hold for the former two MQMI as that of entanglement measure but the later one fails. By comparison, we found that the von Neumann entropy is better than other versions of entropy as desired when we characterize the quantum correlation in multi-particle system.

quant-ph↗

Boosting Video Super Resolution with Patch-Based Temporal Redundancy Optimization

The success of existing video super-resolution (VSR) algorithms stems mainly exploiting the temporal information from the neighboring frames. However, none of these methods have discussed the influence of the temporal redundancy in the patches with stationary objects and background and usually use all the information in the adjacent frames without any discrimination. In this paper, we observe that the temporal redundancy will bring adverse effect to the information propagation,which limits the performance of the most existing VSR methods. Motivated by this observation, we aim to improve existing VSR algorithms by handling the temporal redundancy patches in an optimized manner. We develop two simple yet effective plug and play methods to improve the performance of existing local and non-local propagation-based VSR algorithms on widely-used public videos. For more comprehensive evaluating the robustness and performance of existing VSR algorithms, we also collect a new dataset which contains a variety of public videos as testing set. Extensive evaluations show that the proposed methods can significantly improve the performance of existing VSR methods on the collected videos from wild scenarios while maintain their performance on existing commonly used datasets. The code is available at https://github.com/HYHsimon/Boosted-VSR.

cs.CV↗

MatchNorm: Learning-based Point Cloud Registration for 6D Object Pose Estimation in the Real World

In this work, we tackle the task of estimating the 6D pose of an object from point cloud data. While recent learning-based approaches to addressing this task have shown great success on synthetic datasets, we have observed them to fail in the presence of real-world data. We thus analyze the causes of these failures, which we trace back to the difference between the feature distributions of the source and target point clouds, and the sensitivity of the widely-used SVD-based loss function to the range of rotation between the two point clouds. We address the first challenge by introducing a new normalization strategy, Match Normalization, and the second via the use of a loss function based on the negative log likelihood of point correspondences. Our two contributions are general and can be applied to many existing learning-based 3D object registration frameworks, which we illustrate by implementing them in two of them, DCP and IDAM. Our experiments on the real-scene TUD-L, LINEMOD and Occluded-LINEMOD datasets evidence the benefits of our strategies. They allow for the first time learning-based 3D object registration methods to achieve meaningful results on real-world data. We therefore expect them to be key to the future development of point cloud registration methods.

cs.CV↗

Combining Intra-Risk and Contagion Risk for Enterprise Bankruptcy Prediction Using Graph Neural Networks

Predicting the bankruptcy risk of small and medium-sized enterprises (SMEs) is an important step for financial institutions when making decisions about loans. Existing studies in both finance and AI research fields, however, tend to only consider either the intra-risk or contagion risk of enterprises, ignoring their interactions and combinatorial effects. This study for the first time considers both types of risk and their joint effects in bankruptcy prediction. Specifically, we first propose an enterprise intra-risk encoder based on statistically significant enterprise risk indicators for its intra-risk learning. Then, we propose an enterprise contagion risk encoder based on enterprise relation information from an enterprise knowledge graph for its contagion risk embedding. In particular, the contagion risk encoder includes both the newly proposed Hyper-Graph Neural Networks and Heterogeneous Graph Neural Networks, which can model contagion risk in two different aspects, i.e. common risk factors based on hyperedges and direct diffusion risk from neighbors, respectively. To evaluate the model, we collect real-world multi-sources data on SMEs and build a novel benchmark dataset called SMEsD. We provide open access to the dataset, which is expected to further promote research on financial risk analysis. Experiments on SMEsD against twelve state-of-the-art baselines demonstrate the effectiveness of the proposed model for bankruptcy prediction.

q-fin.RM↗

Contrastive Vision-Language Pre-training with Limited Resources

Pioneering dual-encoder pre-training works (e.g., CLIP and ALIGN) have revealed the potential of aligning multi-modal representations with contrastive learning. However, these works require a tremendous amount of data and computational resources (e.g., billion-level web data and hundreds of GPUs), which prevent researchers with limited resources from reproduction and further exploration. To this end, we propose a stack of novel methods, which significantly cut down the heavy resource dependency and allow us to conduct dual-encoder multi-modal representation alignment with limited resources. Besides, we provide a reproducible baseline of competitive results, namely ZeroVL, with only 14M publicly accessible academic datasets and 8 V100 GPUs. Additionally, we collect 100M web data for pre-training, and achieve comparable or superior results than state-of-the-art methods, further proving the effectiveness of our methods on large-scale data. We hope that this work will provide useful data points and experience for future research in contrastive vision-language pre-training. Code is available at https://github.com/zerovl/ZeroVL.

cs.CV↗

A Universal Framework for Reconstructing Complex Networks and Node Dynamics from Discrete or Continuous Dynamics Data

Many dynamical processes of complex systems can be understood as the dynamics of a group of nodes interacting on a given network structure. However, finding such interaction structure and node dynamics from time series of node behaviours is tough. Conventional methods focus on either network structure inference task or dynamics reconstruction problem, very few of them can work well on both. This paper proposes a universal framework for reconstructing network structure and node dynamics at the same time from observed time-series data of nodes. We use a differentiable Bernoulli sampling process to generate a candidate network structure, and use neural networks to simulate the node dynamics based on the candidate network. We then adjust all the parameters with a stochastic gradient descent algorithm to maximize the likelihood function defined on the data. The experiments show that our model can recover various network structures and node dynamics at the same time with high accuracy. It can also work well on binary, discrete and continuous time-series data, and the reconstruction results are robust against noise and missing information.

physics.soc-ph↗

An adaptive primitive-conservative scheme for high speed transcritical flow with an arbitrary equation of state

When fully conservative methods are used to simulate transcritical flow, spurious pressure oscillations and numerical instability are generated. The strength and speed of propagation of shock waves cannot be represented correctly using a semi-conservative or primitive method. In this research, an adaptive primitive-conservative scheme is designed to overcome the aforesaid two difficulties. The underlying cause for pressure oscillation is analyzed within the framework of Finite Volume Method (FVM). We found that the nonlinearity of the thermodynamic properties of transcritical fluids renders standard conservative numerical methods ineffective. In smooth regions, schemes based on primitive variable are used to eliminate spurious pressure oscillations. For the purpose of correctly capturing shock waves, the modified Roe Riemann solver for real fluid is utilized in regions where shock waves induce discontinuity. The adaptive numerical approach relies only on the speed of sound, eliminating the requirement to calculate the derivatives of thermodynamic quantities. A large number of numerical test cases conducted in one- and two-dimensional spaces have shown the robustness and accuracy of the proposed adaptive scheme for the simulations of high speed transcritical flows.

physics.flu-dyn↗

Molecular dynamics simulation of flow around a circular nano-cylinder

In this study, the wake flow around a circular nano-cylinder is numerically investigated with molecular dynamics simulation to reveal the micro/nano size effect on the wake flow. The cavitation occurring when Reynolds number (Re) > 101 can effectively influence the wake flow. The Strouhal number (St) of the wake flow increases with the Re at low Re, but steadily decreases with the Re after the cavitation appears. The dominant frequency of the lift force fluctuation can be higher than that of the velocity fluctuation, and be drowned in the chaotic fluctuating background of the Brownian forces when Re {\geq} 127. Also because of the strong influence of the Brownian forces, no dominant frequency of the drag force fluctuation can be observed. The Jz number, which is defined as the ratio between the mean free path λ of the fluid molecules and the equilibrium distance of potential energy σ, is newly introduced in order to consider the internal size effect of fluid. The St of the wake flow increases with the Jz until it falls to zero sharply when Jz {\approx} 1.7. It denotes the discontinuity of the fluid can eventually eliminate the vortex generation and shedding. Meanwhile, the St decreases with the Kn because of the intensification of the cavitation.

physics.flu-dyn↗

Entanglement swapping and quantum correlations via Elegant Joint Measurements

We use hyper-entanglement to experimentally realize deterministic entanglement swapping based on quantum Elegant Joint Measurements. These are joint projections of two qubits onto highly symmetric, iso-entangled, bases. We report measurement fidelities no smaller than $97.4\%$. We showcase the applications of these measurements by using the entanglement swapping procedure to demonstrate quantum correlations in the form of proof-of-principle violations of both bilocal Bell inequalities and more stringent correlation criteria corresponding to full network nonlocality. Our results are a foray into entangled measurements and nonlocality beyond the paradigmatic Bell state measurement and they show the relevance of more general measurements in entanglement swapping scenarios.

quant-ph↗

Deep Understanding based Multi-Document Machine Reading Comprehension

Most existing multi-document machine reading comprehension models mainly focus on understanding the interactions between the input question and documents, but ignore following two kinds of understandings. First, to understand the semantic meaning of words in the input question and documents from the perspective of each other. Second, to understand the supporting cues for a correct answer from the perspective of intra-document and inter-documents. Ignoring these two kinds of important understandings would make the models oversee some important information that may be helpful for inding correct answers. To overcome this deiciency, we propose a deep understanding based model for multi-document machine reading comprehension. It has three cascaded deep understanding modules which are designed to understand the accurate semantic meaning of words, the interactions between the input question and documents, and the supporting cues for the correct answer. We evaluate our model on two large scale benchmark datasets, namely TriviaQA Web and DuReader. Extensive experiments show that our model achieves state-of-the-art results on both datasets.

cs.CL↗

Quantum simulation of indefinite causal order induced quantum refrigeration

In the classical world, physical events always happen in a fixed causal order. However, it was recently revealed that quantum mechanics allows events to occur with indefinite causal order (ICO). In this study, we use an optical quantum switch to experimentally investigate the application of ICO in thermodynamic tasks. Specifically, we simulate the working system interacting with two identical thermal reservoirs in an ICO, observing the quantum heat extraction even though they are in thermal equilibrium where heat extraction is unaccessible by traditional thermal contact. Using such a process, we simulate an ICO refrigeration cycle and investigate its properties. We also show that by passing through the ICO channel multiple times, one can extract more heat per cycle and thus obtain a higher refrigeration performance. Our results suggest that the causal nonseparability can be a powerful resource for quantum thermodynamic tasks.

quant-ph↗

Genuine multipartite entanglement measure

Quantifying genuine entanglement is a crucial task in quantum information theory.In this work, we give an approach of constituting genuine $m$-partite entanglement measures from any bipartite entanglement and any $k$-partite entanglement measure, $3\leq k<m$. In addition, as a complement to the three-qubit concurrence triangle proposed in [Phys. Rev. Lett., 127, 040403], we show that the triangle relation is also valid for any continuous entanglement measure and system with any dimension. We also discuss the tetrahedron structure for the four-partite system via the triangle relation associated with tripartite and bipartite entanglement respectively. For multipartite system that contains more than four parties, there is no symmetric geometric structure as that of tri- and four-partite cases.

quant-ph↗

When is a Genuine Multipartite Entanglement Measure Monogamous?

A crucial issue in quantum communication tasks is characterizing how quantum resources can be quantified and distributed over many parties. Consequently, entanglement has been explored extensively. However, the genuine entanglement still lacks of studying. There are few genuine multipartite entanglement measures and whether it is monogamous is unknown so far. In this work, we explore the complete monogamy of genuine multipartite entanglement measure (GMEM) for which, at first, we investigate a framework for unified/complete GMEM according to the unified/complete multipartite entanglement measure proposed in [Phys. Rev. A 101, 032301 (2020)]. We find a way of inducing unified/complete GMEM from any given unified/complete multipartite entanglement measure.It is shown that any unified GMEM is completely monogamous, and any complete GMEM that induced by some given complete multipartite entanglement measure is tightly complete monogamous whenever the given complete multipartite entanglement measure is tightly complete monogamous. In addition, the previous GMEMs are checked under this framework. It turns out that the genuinely multipartite concurrence is not a good candidate as a GMEM.

quant-ph↗