arXiv subjects

Chun Meng

Publications and source records attributed to Chun Meng.

8 recordsLinked to original sources

arXiv2026

Controllable Lateral Optical Forces on Janus Particles in Fluid Media

Optical forces - studied since the earliest days of laser physics - continue to reveal rich dynamics and enable powerful tools for manipulation of objects on micro- and nanoscales, and even individual atoms. Lateral optical forces, which act perpendicular to the direction of beam propagation, are particularly intriguing but have largely been restricted to interface geometries such as air - water boundaries. Here, we realize tunable lateral optical force entirely within a fluid environment by using Janus particles: dielectric microspheres half-coated with gold. We show that the lateral optical force arises from scattering asymmetry induced by the asymmetric structure of the particles; it can be tuned by adjusting the polarization angle of a linearly polarized beam, but also particle parameters including their size and orientation. Experimentally, we directly observe fully reversible lateral propulsion of Janus particles in water merely by rotating the polarization direction, in excellent agreement with theoretical predictions. These results establish a new mechanism for programmable, polarization-controlled optical manipulation, with promising implications for biophotonics, microfluidics, and active soft-matter systems.

physics.optics↗

arXiv2024

Research on Cervical Cancer p16/Ki-67 Immunohistochemical Dual-Staining Image Recognition Algorithm Based on YOLO

The p16/Ki-67 dual staining method is a new approach for cervical cancer screening with high sensitivity and specificity. However, there are issues of mis-detection and inaccurate recognition when the YOLOv5s algorithm is directly applied to dual-stained cell images. This paper Proposes a novel cervical cancer dual-stained image recognition (DSIR-YOLO) model based on an YOLOv5. By fusing the Swin-Transformer module, GAM attention mechanism, multi-scale feature fusion, and EIoU loss function, the detection performance is significantly improved, with mAP@0.5 and mAP@0.5:0.95 reaching 92.6% and 70.5%, respectively. Compared with YOLOv5s in five-fold cross-validation, the accuracy, recall, mAP@0.5, and mAP@0.5:0.95 of the improved algorithm are increased by 2.3%, 4.1%, 4.3%, and 8.0%, respectively, with smaller variances and higher stability. Compared with other detection algorithms, DSIR-YOLO in this paper sacrifices some performance requirements to improve the network recognition effect. In addition, the influence of dataset quality on the detection results is studied. By controlling the sealing property of pixels, scale difference, unlabelled cells, and diagonal annotation, the model detection accuracy, recall, mAP@0.5, and mAP@0.5:0.95 are improved by 13.3%, 15.3%, 18.3%, and 30.5%, respectively.

cs.AI↗

arXiv2019

3D U-Net Based Brain Tumor Segmentation and Survival Days Prediction

Past few years have witnessed the prevalence of deep learning in many application scenarios, among which is medical image processing. Diagnosis and treatment of brain tumors requires an accurate and reliable segmentation of brain tumors as a prerequisite. However, such work conventionally requires brain surgeons significant amount of time. Computer vision techniques could provide surgeons a relief from the tedious marking procedure. In this paper, a 3D U-net based deep learning model has been trained with the help of brain-wise normalization and patching strategies for the brain tumor segmentation task in the BraTS 2019 competition. Dice coefficients for enhancing tumor, tumor core, and the whole tumor are 0.737, 0.807 and 0.894 respectively on the validation dataset. These three values on the test dataset are 0.778, 0.798 and 0.852. Furthermore, numerical features including ratio of tumor size to brain size and the area of tumor surface as well as age of subjects are extracted from predicted tumor labels and have been used for the overall survival days prediction task. The accuracy could be 0.448 on the validation dataset, and 0.551 on the final test dataset.

eess.IV↗

arXiv2019

Optimal step-size of least mean absolute fourth algorithm in low SNR

There is a need to improve the capability of the adaptive filtering algorithm against Gaussian or multiple types of non-Gaussian noises, time-varying system, and systems with low SNR. In this paper, we propose an optimized least mean absolute fourth (OPLMF) algorithm, especially for a time-varying unknown system with low signal-noise-rate (SNR). The optimal step-size of OPLMF is obtained by minimizing the mean-square deviation (MSD) at any given moment in time. In addition, the mean convergence and steady-state error of OPLMF are derived. Also the theoretical computational complexity of OPLMF is analyzed. Furthermore, the simulation experiment results of system identification are used to illustrate the principle and efficiency of the OPLMF algorithm. The performance of the algorithm is analyzed mathematically and validated experimentally. Simulation results demonstrate that the proposed OPLMF is superior to the normalized LMF (NLMF) and variable step-size of LMF using quotient form (VSSLMFQ) algorithms.

eess.SP↗

arXiv2019

Diffusion probabilistic LMS algorithm

In this paper, a novel diffusion estimation algorithm is proposed from a probabilistic perspective by combining diffusion strategy and the probabilistic least-mean-squares (PLMS) at all agents. The proposed method diffusion probabilistic LMS (DPLMS) is more robust to input signal and impulsive interference than the DSE-LMS, DRVSSLMS and DLLAD algorithms. Instead of minimizing the estimate error, the DPLMS algorithm is derived from approximating the posterior distribution with an isotropic Gaussian distribution. The stability of mean performance and computational complexity are analyzed theoretically. Results from the simulation indicate that the DPLMS algorithm is more robust to input signal and impulsive interference than the DSE-LMS, DRVSSLMS and DLLAD algorithms. These results suggest that the DPLMS algorithm can perform better in identifying the unknown coefficients under the complex and changeable impulsive interference environments.

eess.SP↗

arXiv2014

Precoding-Based Network Alignment For Three Unicast Sessions

We consider the problem of network coding across three unicast sessions over a directed acyclic graph, where each sender and the receiver is connected to the network via a single edge of unit capacity. We consider a network model in which the middle of the network only performs random linear network coding, and restrict our approaches to precoding-based linear schemes, where the senders use precoding matrices to encode source symbols. We adapt a precoding-based interference alignment technique, originally developed for the wireless interference channel, to construct a precoding-based linear scheme, which we refer to as as a {\em precoding-based network alignment scheme (PBNA)}. A primary difference between this setting and the wireless interference channel is that the network topology can introduce dependencies between elements of the transfer matrix, which we refer to as coupling relations, and can potentially affect the achievable rate of PBNA. We identify all possible such coupling relations, and interpret these coupling relations in terms of network topology and present polynomial-time algorithms to check the presence of these coupling relations. Finally, we show that, depending on the coupling relations present in the network, the optimal symmetric rate achieved by precoding-based linear scheme can take only three possible values, all of which can be achieved by PBNA.

cs.IT↗

arXiv2014

On Routing-Optimal Network for Multiple Unicasts

In this paper, we consider networks with multiple unicast sessions. Generally, non-linear network coding is needed to achieve the whole rate region of network coding. Yet, there exist networks for which routing is sufficient to achieve the whole rate region, and we refer to them as routing-optimal networks. We identify a class of routing-optimal networks, which we refer to as information-distributive networks, defined by three topological features. Due to these features, for each rate vector achieved by network coding, there is always a routing scheme such that it achieves the same rate vector, and the traffic transmitted through the network is exactly the information transmitted over the cut-sets between the sources and the sinks in the corresponding network coding scheme. We present more examples of information-distributive networks, including some examples from index coding and single unicast with hard deadline constraint.

cs.IT↗

arXiv2012

On the Feasibility of Precoding-Based Network Alignment for Three Unicast Sessions

We consider the problem of network coding across three unicast sessions over a directed acyclic graph, when each session has min-cut one. Previous work by Das et al. adapted a precoding-based interference alignment technique, originally developed for the wireless interference channel, specifically to this problem. We refer to this approach as precoding-based network alignment (PBNA). Similar to the wireless setting, PBNA asymptotically achieves half the minimum cut; different from the wireless setting, its feasibility depends on the graph structure. Das et al. provided a set of feasibility conditions for PBNA with respect to a particular precoding matrix. However, the set consisted of an infinite number of conditions, which is impossible to check in practice. Furthermore, the conditions were purely algebraic, without interpretation with regards to the graph structure. In this paper, we first prove that the set of conditions provided by Das. et al are also necessary for the feasibility of PBNA with respect to any precoding matrix. Then, using two graph-related properties and a degree-counting technique, we reduce the set to just four conditions. This reduction enables an efficient algorithm for checking the feasibility of PBNA on a given graph.

cs.IT↗