Searcharxiv⌕ Search

arXiv subjects

Rui Li

Publications and source records attributed to Rui Li.

At least 469 records · Page 26Linked to original sources

Multi-stage Attention ResU-Net for Semantic Segmentation of Fine-Resolution Remote Sensing Images

The attention mechanism can refine the extracted feature maps and boost the classification performance of the deep network, which has become an essential technique in computer vision and natural language processing. However, the memory and computational costs of the dot-product attention mechanism increase quadratically with the spatio-temporal size of the input. Such growth hinders the usage of attention mechanisms considerably in application scenarios with large-scale inputs. In this Letter, we propose a Linear Attention Mechanism (LAM) to address this issue, which is approximately equivalent to dot-product attention with computational efficiency. Such a design makes the incorporation between attention mechanisms and deep networks much more flexible and versatile. Based on the proposed LAM, we re-factor the skip connections in the raw U-Net and design a Multi-stage Attention ResU-Net (MAResU-Net) for semantic segmentation from fine-resolution remote sensing images. Experiments conducted on the Vaihingen dataset demonstrated the effectiveness and efficiency of our MAResU-Net. Open-source code is available at https://github.com/lironui/Multistage-Attention-ResU-Net.

cs.CV↗

Central velocity dispersion catalog of LAMOST-DR7 galaxies

The Large Sky Area Multi-Object Fiber Spectroscopic Telescope (LAMOST) is a major facility to carry out spectroscopic surveys for cosmology and galaxy evolution studies. The seventh data release of the LAMOST ExtraGAlactic Survey (LEGAS) is currently available and including redshifts of 193\,361 galaxies. These sources are spread over $\sim 11\,500$ deg$^2$ of the sky, largely overlapping with other imaging (SDSS, HSC) and spectroscopic (BOSS) surveys. The estimated depth of the galaxy sample, $r\sim17.8$, the high signal-to-noise ratio, and the spectral resolution $R=1800$, make the LAMOST spectra suitable for galaxy velocity dispersion measurements, which are invaluable to study the structure and formation of galaxies and to determine their central dark matter (DM) content. We present the first estimates of central velocity dispersion of $\sim86\,000$ galaxies in LAMOST footprint. We have used a wrap-up procedure to perform the spectral fitting using \textsc{pPXF}, and derive velocity dispersion measurements. Statistical errors are also assessed by comparing LAMOST velocity dispersion estimates with the ones of SDSS and BOSS over a common sample of $\sim51\,000$ galaxies. The two datasets show a good agreement, within the statistical errors, in particular when velocity dispersion values are corrected to 1 effective radius aperture. We also present a preliminary Mass-$σ$ relation and find consistency with previous analyses based on local galaxy samples. These first results suggest that LAMOST spectra are suitable for galaxy velocity dispersion measurements to complement the available catalogs of galaxy internal kinematics in the northern hemisphere. We plan to expand this analysis to next LAMOST data releases.

astro-ph.GA↗

Multi-Attention-Network for Semantic Segmentation of Fine Resolution Remote Sensing Images

Semantic segmentation of remote sensing images plays an important role in a wide range of applications including land resource management, biosphere monitoring and urban planning. Although the accuracy of semantic segmentation in remote sensing images has been increased significantly by deep convolutional neural networks, several limitations exist in standard models. First, for encoder-decoder architectures such as U-Net, the utilization of multi-scale features causes the underuse of information, where low-level features and high-level features are concatenated directly without any refinement. Second, long-range dependencies of feature maps are insufficiently explored, resulting in sub-optimal feature representations associated with each semantic class. Third, even though the dot-product attention mechanism has been introduced and utilized in semantic segmentation to model long-range dependencies, the large time and space demands of attention impede the actual usage of attention in application scenarios with large-scale input. This paper proposed a Multi-Attention-Network (MANet) to address these issues by extracting contextual dependencies through multiple efficient attention modules. A novel attention mechanism of kernel attention with linear complexity is proposed to alleviate the large computational demand in attention. Based on kernel attention and channel attention, we integrate local feature maps extracted by ResNeXt-101 with their corresponding global dependencies and reweight interdependent channel maps adaptively. Numerical experiments on three large-scale fine resolution remote sensing images captured by different satellite sensors demonstrate the superior performance of the proposed MANet, outperforming the DeepLab V3+, PSPNet, FastFCN, DANet, OCRNet, and other benchmark approaches.

eess.IV↗

Chiral state conversion in a levitated micromechanical oscillator with in situ control of parameter loops

Physical systems with gain and loss can be described by a non-Hermitian Hamiltonian, which is degenerated at the exceptional points (EPs). Many new and unexpected features have been explored in the non-Hermitian systems with a great deal of recent interest. One of the most fascinating features is that, chiral state conversion appears when one EP is encircled dynamically. Here, we propose an easy-controllable levitated microparticle system that carries a pair of EPs and realize slow evolution of the Hamiltonian along loops in the parameter plane. Utilizing the controllable rotation angle, gain and loss coefficients, we can control the structure, size and location of the loops in situ. We demonstrate that, under the joint action of topological structure of energy surfaces and nonadiabatic transitions (NATs), the chiral behavior emerges both along a loop encircling an EP and even along a straight path away from the EP. This work broadens the range of parameter space for the chiral state conversion, and proposes a useful platform to explore the interesting properties of exceptional points physics.

quant-ph↗

Interpretable Structured Learning with Sparse Gated Sequence Encoder for Protein-Protein Interaction Prediction

Predicting protein-protein interactions (PPIs) by learning informative representations from amino acid sequences is a challenging yet important problem in biology. Although various deep learning models in Siamese architecture have been proposed to model PPIs from sequences, these methods are computationally expensive for a large number of PPIs due to the pairwise encoding process. Furthermore, these methods are difficult to interpret because of non-intuitive mappings from protein sequences to their sequence representation. To address these challenges, we present a novel deep framework to model and predict PPIs from sequence alone. Our model incorporates a bidirectional gated recurrent unit to learn sequence representations by leveraging contextualized and sequential information from sequences. We further employ a sparse regularization to model long-range dependencies between amino acids and to select important amino acids (protein motifs), thus enhancing interpretability. Besides, the novel design of the encoding process makes our model computationally efficient and scalable to an increasing number of interactions. Experimental results on up-to-date interaction datasets demonstrate that our model achieves superior performance compared to other state-of-the-art methods. Literature-based case studies illustrate the ability of our model to provide biological insights to interpret the predictions.

cs.LG↗

Predicting Biomedical Interactions with Higher-Order Graph Convolutional Networks

Biomedical interaction networks have incredible potential to be useful in the prediction of biologically meaningful interactions, identification of network biomarkers of disease, and the discovery of putative drug targets. Recently, graph neural networks have been proposed to effectively learn representations for biomedical entities and achieved state-of-the-art results in biomedical interaction prediction. These methods only consider information from immediate neighbors but cannot learn a general mixing of features from neighbors at various distances. In this paper, we present a higher-order graph convolutional network (HOGCN) to aggregate information from the higher-order neighborhood for biomedical interaction prediction. Specifically, HOGCN collects feature representations of neighbors at various distances and learns their linear mixing to obtain informative representations of biomedical entities. Experiments on four interaction networks, including protein-protein, drug-drug, drug-target, and gene-disease interactions, show that HOGCN achieves more accurate and calibrated predictions. HOGCN performs well on noisy, sparse interaction networks when feature representations of neighbors at various distances are considered. Moreover, a set of novel interaction predictions are validated by literature-based case studies.

cs.LG↗

Contrastive Rendering for Ultrasound Image Segmentation

Ultrasound (US) image segmentation embraced its significant improvement in deep learning era. However, the lack of sharp boundaries in US images still remains an inherent challenge for segmentation. Previous methods often resort to global context, multi-scale cues or auxiliary guidance to estimate the boundaries. It is hard for these methods to approach pixel-level learning for fine-grained boundary generating. In this paper, we propose a novel and effective framework to improve boundary estimation in US images. Our work has three highlights. First, we propose to formulate the boundary estimation as a rendering task, which can recognize ambiguous points (pixels/voxels) and calibrate the boundary prediction via enriched feature representation learning. Second, we introduce point-wise contrastive learning to enhance the similarity of points from the same class and contrastively decrease the similarity of points from different classes. Boundary ambiguities are therefore further addressed. Third, both rendering and contrastive learning tasks contribute to consistent improvement while reducing network parameters. As a proof-of-concept, we performed validation experiments on a challenging dataset of 86 ovarian US volumes. Results show that our proposed method outperforms state-of-the-art methods and has the potential to be used in clinical practice.

eess.IV↗

Thick Cloud Removal of Remote Sensing Images Using Temporal Smoothness and Sparsity-Regularized Tensor Optimization

In remote sensing images, the presence of thick cloud accompanying cloud shadow is a high probability event, which can affect the quality of subsequent processing and limit the scenarios of application. Hence, removing the thick cloud and cloud shadow as well as recovering the cloud-contaminated pixels is indispensable to make good use of remote sensing images. In this paper, a novel thick cloud removal method for remote sensing images based on temporal smoothness and sparsity-regularized tensor optimization (TSSTO) is proposed. The basic idea of TSSTO is that the thick cloud and cloud shadow are not only sparse but also smooth along the horizontal and vertical direction in images while the clean images are smooth along the temporal direction between images. Therefore, the sparsity norm is used to boost the sparsity of the cloud and cloud shadow, and unidirectional total variation (UTV) regularizers are applied to ensure the unidirectional smoothness. This paper utilizes alternation direction method of multipliers to solve the presented model and generate the cloud and cloud shadow element as well as the clean element. The cloud and cloud shadow element is purified to get the cloud area and cloud shadow area. Then, the clean area of the original cloud-contaminated images is replaced to the corresponding area of the clean element. Finally, the reference image is selected to reconstruct details of the cloud area and cloud shadow area using the information cloning method. A series of experiments are conducted both on simulated and real cloud-contaminated images from different sensors and with different resolutions, and the results demonstrate the potential of the proposed TSSTO method for removing cloud and cloud shadow from both qualitative and quantitative viewpoints.

eess.IV↗

Linear Attention Mechanism: An Efficient Attention for Semantic Segmentation

In this paper, to remedy this deficiency, we propose a Linear Attention Mechanism which is approximate to dot-product attention with much less memory and computational costs. The efficient design makes the incorporation between attention mechanisms and neural networks more flexible and versatile. Experiments conducted on semantic segmentation demonstrated the effectiveness of linear attention mechanism. Code is available at https://github.com/lironui/Linear-Attention-Mechanism.

cs.CV↗

Mechanical dissipation below 1$μ$Hz with a cryogenic diamagnetic-levitated micro-oscillator

Ultralow dissipation plays an important role in sensing applications and exploring macroscopic quantum phenomena using micro-and nano-mechanical systems. We report a diamagnetic-levitated micro-mechanical oscillator operating at a low temperature of 3K with measured dissipation as low as 0.59 $μ$Hz and a quality factor as high as $2 \times 10^7$. To the best of our knowledge the achieved dissipation is the lowest in micro- and nano-mechanical systems to date, orders of magnitude improvement over the reported state-of-the-art systems based on different principles. The cryogenic diamagnetic-levitated oscillator described here is applicable to a wide range of mass, making it a good candidate for measuring both force and acceleration with ultra-high sensitivity. By virtue of the naturally existing strong magnetic gradient, this system has great potential in quantum spin mechanics study.

quant-ph↗

Searching Collaborative Agents for Multi-plane Localization in 3D Ultrasound

3D ultrasound (US) is widely used due to its rich diagnostic information, portability and low cost. Automated standard plane (SP) localization in US volume not only improves efficiency and reduces user-dependence, but also boosts 3D US interpretation. In this study, we propose a novel Multi-Agent Reinforcement Learning (MARL) framework to localize multiple uterine SPs in 3D US simultaneously. Our contribution is two-fold. First, we equip the MARL with a one-shot neural architecture search (NAS) module to obtain the optimal agent for each plane. Specifically, Gradient-based search using Differentiable Architecture Sampler (GDAS) is employed to accelerate and stabilize the training process. Second, we propose a novel collaborative strategy to strengthen agents' communication. Our strategy uses recurrent neural network (RNN) to learn the spatial relationship among SPs effectively. Extensively validated on a large dataset, our approach achieves the accuracy of 7.05 degree/2.21mm, 8.62 degree/2.36mm and 5.93 degree/0.89mm for the mid-sagittal, transverse and coronal plane localization, respectively. The proposed MARL framework can significantly increase the plane localization accuracy and reduce the computational cost and model size.

cs.CV↗

Parallel multilevel restricted Schwarz preconditioners for implicit simulation of subsurface flows with Peng-Robinson equation of state

Parallel algorithms and simulators with good scalabilities are particularly important for large-scale reservoir simulations on modern supercomputers with a large number of processors. In this paper, we introduce and study a family of highly scalable multilevel restricted additive Schwarz (RAS) methods for the fully implicit solution of subsurface flows with Peng-Robinson equation of state in two and three dimensions. With the use of a second-order fully implicit scheme, the proposed simulator is unconditionally stable with the relaxation of the time step size by the stability condition. The investigation then focuses on the development of several types of multilevel overlapping additive Schwarz methods for the preconditioning of the resultant linear system arising from the inexact Newton iteration, and some fast solver technologies are presented for the assurance of the multilevel approach efficiency and scalability. We numerically show that the proposed fully implicit framework is highly efficient for solving both standard benchmarks as well as realistic problems with several hundreds of millions of unknowns and scalable to 8192 processors on the Tianhe-2 supercomputer.

math.NA↗

Validation of image-guided cochlear implant programming techniques

Cochlear implants (CIs) are a standard treatment for patients who experience severe to profound hearing loss. Recent studies have shown that hearing outcome is correlated with intra-cochlear anatomy and electrode placement. Our group has developed image-guided CI programming (IGCIP) techniques that use image analysis methods to both segment the inner ear structures in pre- or post-implantation CT images and localize the CI electrodes in post-implantation CT images. This permits to assist audiologists with CI programming by suggesting which among the contacts should be deactivated to reduce electrode interaction that is known to affect outcomes. Clinical studies have shown that IGCIP can improve hearing outcomes for CI recipients. However, the sensitivity of IGCIP with respect to the accuracy of the two major steps: electrode localization and intra-cochlear anatomy segmentation, is unknown. In this article, we create a ground truth dataset with conventional CT and micro-CT images of 35 temporal bone specimens to both rigorously characterize the accuracy of these two steps and assess how inaccuracies in these steps affect the overall results. Our study results show that when clinical pre- and post-implantation CTs are available, IGCIP produces results that are comparable to those obtained with the corresponding ground truth in 86.7% of the subjects tested. When only post-implantation CTs are available, this number is 83.3%. These results suggest that our current method is robust to errors in segmentation and localization but also that it can be improved upon. Keywords: cochlear implant, ground truth, segmentation, validation

cs.CV↗

On quotients of Boolean control networks

In this paper, we focus on the study of quotients of Boolean control networks (BCNs) with the motivation that they might serve as smaller models that still carry enough information about the original network. Given a BCN and an equivalence relation on the state set, we consider a labeled transition system that is generated by the BCN. The resulting quotient transition system then naturally captures the quotient dynamics of the BCN concerned. We therefore develop a method for constructing a Boolean system that behaves equivalently to the resulting quotient transition system. The use of the obtained quotient system for control design is discussed and we show that for BCNs, controller synthesis can be done by first designing a controller for a quotient and subsequently lifting it to the original model. We finally demonstrate the applicability of the proposed techniques on a biological example.

math.OC↗

The Tianlai Cylinder Pathfinder Array: System Functions and Basic Performance Analysis

The Tianlai Cylinder Pathfinder is a radio interferometer array designed to test techniques for 21 cm intensity mapping in the post-reionization Universe, with the ultimate aim of mapping the large scale structure and measuring cosmological parameters such as the dark energy equation of state. Each of its three parallel cylinder reflectors is oriented in the north-south direction, and the array has a large field of view. As the Earth rotates, the northern sky is observed by drift scanning. The array is located in Hongliuxia, a radio-quiet site in Xinjiang, and saw its first light in September 2016. In this first data analysis paper for the Tianlai cylinder array, we discuss the sub-system qualification tests, and present basic system performance obtained from preliminary analysis of the commissioning observations during 2016-2018. We show typical interferometric visibility data, from which we derive the actual beam profile in the east-west direction and the frequency band-pass response. We describe also the calibration process to determine the complex gains for the array elements, either using bright astronomical point sources, or an artificial on site calibrator source, and discuss the instrument response stability, crucial for transit interferometry. Based on this analysis, we find a system temperature of about 90 K, and we also estimate the sensitivity of the array.

astro-ph.IM↗

Single-spin scanning magnetic microscopy with radial basis function reconstruction algorithm

Exotic magnetic structures, such as magnetic skyrmions and domain walls, are becoming more important in nitrogen-vacancy center scanning magnetometry. However, a systematic imaging approach to mapping stray fields with fluctuation of several milliteslas generated by such structures is not yet available. Here we present a scheme to image a millitesla magnetic field by tracking the magnetic resonance frequency, which can record multiple contour lines for a magnetic field. The radial basis function algorithm is employed to reconstruct the magnetic field from the contour lines. Simulations with shot noise quantitatively confirm the high quality of the reconstruction algorithm. The method was validated by imaging the stray field of a frustrated magnet. Our scheme had a maximum detectable magnetic field gradient of 0.86 mT per pixel, which enables the efficient imaging of millitesla magnetic fields.

quant-ph↗

LiteDenseNet: A Lightweight Network for Hyperspectral Image Classification

Hyperspectral Image (HSI) classification based on deep learning has been an attractive area in recent years. However, as a kind of data-driven algorithm, deep learning method usually requires numerous computational resources and high-quality labelled dataset, while the cost of high-performance computing and data annotation is expensive. In this paper, to reduce dependence on massive calculation and labelled samples, we propose a lightweight network architecture (LiteDenseNet) based on DenseNet for Hyperspectral Image Classification. Inspired by GoogLeNet and PeleeNet, we design a 3D two-way dense layer to capture the local and global features of the input. As convolution is a computationally intensive operation, we introduce group convolution to decrease calculation cost and parameter size further. Thus, the number of parameters and the consumptions of calculation are observably less than contrapositive deep learning methods, which means LiteDenseNet owns simpler architecture and higher efficiency. A series of quantitative experiences on 6 widely used hyperspectral datasets show that the proposed LiteDenseNet obtains the state-of-the-art performance, even though when the absence of labelled samples is severe.

eess.IV↗