arXiv subjects

Zhihong Liu

Publications and source records attributed to Zhihong Liu.

At least 37 records · Page 2Linked to original sources

arXiv2023

2D-Shapley: A Framework for Fragmented Data Valuation

Data valuation -- quantifying the contribution of individual data sources to certain predictive behaviors of a model -- is of great importance to enhancing the transparency of machine learning and designing incentive systems for data sharing. Existing work has focused on evaluating data sources with the shared feature or sample space. How to valuate fragmented data sources of which each only contains partial features and samples remains an open question. We start by presenting a method to calculate the counterfactual of removing a fragment from the aggregated data matrix. Based on the counterfactual calculation, we further propose 2D-Shapley, a theoretical framework for fragmented data valuation that uniquely satisfies some appealing axioms in the fragmented data context. 2D-Shapley empowers a range of new use cases, such as selecting useful data fragments, providing interpretation for sample-wise data values, and fine-grained data issue diagnosis.

cs.LG↗

arXiv2023

Entanglement harvesting of accelerated detectors versus static ones in a thermal bath

We make a detailed comparison between entanglement harvesting for uniformly accelerated detectors in vacuum and static ones in a thermal bath at the Unruh temperature and find that, for a small energy gap relative to the Heisenberg energy of the detectors, static detectors in the thermal bath can harvest more entanglement and possess a comparatively larger harvesting-achievable range than the uniformly accelerated ones; however, as the energy gap grows sufficiently large, the uniformly accelerated detectors are instead likely to harvest more entanglement and possess a relatively larger harvesting-achievable range than inertial ones in the thermal bath. In comparison with static detectors in vacuum, there exist phenomena of acceleration-assisted entanglement harvesting but never that of thermal-noise-assisted one. A notably interesting feature is that, although both the amount of entanglement harvested and the harvesting-achievable interdetector separation for static detectors in a thermal bath are always a decreasing function of temperature, they are not always so for uniformly accelerated detectors as acceleration (Unruh temperature) varies, suggesting the existence of the anti-Unruh effect in the entanglement harvesting phenomena of the accelerated detectors.

quant-ph↗

arXiv2022

Unsupervised Tissue Segmentation via Deep Constrained Gaussian Network

Tissue segmentation is the mainstay of pathological examination, whereas the manual delineation is unduly burdensome. To assist this time-consuming and subjective manual step, researchers have devised methods to automatically segment structures in pathological images. Recently, automated machine and deep learning based methods dominate tissue segmentation research studies. However, most machine and deep learning based approaches are supervised and developed using a large number of training samples, in which the pixelwise annotations are expensive and sometimes can be impossible to obtain. This paper introduces a novel unsupervised learning paradigm by integrating an end-to-end deep mixture model with a constrained indicator to acquire accurate semantic tissue segmentation. This constraint aims to centralise the components of deep mixture models during the calculation of the optimisation function. In so doing, the redundant or empty class issues, which are common in current unsupervised learning methods, can be greatly reduced. By validation on both public and in-house datasets, the proposed deep constrained Gaussian network achieves significantly (Wilcoxon signed-rank test) better performance (with the average Dice scores of 0.737 and 0.735, respectively) on tissue segmentation with improved stability and robustness, compared to other existing unsupervised segmentation approaches. Furthermore, the proposed method presents a similar performance (p-value > 0.05) compared to the fully supervised U-Net.

eess.IV↗

arXiv2022

Does acceleration assist entanglement harvesting?

We explore whether acceleration assists entanglement harvesting for a pair of uniformly accelerated detectors in three different acceleration scenarios, i.e., parallel, anti-parallel and mutually perpendicular acceleration, both in the sense of the entanglement harvested and harvesting-achievable separation between the two detectors. Within the framework of entanglement harvesting protocols and the Unruh-DeWitt model of detectors locally interacting with massless scalar fields via a Gaussian switching function with an interaction duration parameter, we find that, in the sense of the entanglement harvested, acceleration is a mixed blessing insofar as it increases the harvested entanglement for a large detector energy gap relative to the interaction duration parameter, whilst inhibiting the entanglement harvested for a small energy gap. Regarding the harvesting-achievable separation range between the detectors, we further find that for very small acceleration and large energy gap, both relative to the duration parameter, acceleration-assisted enhancement can happen in all three acceleration scenarios. This is in sharp contrast to what was argued previously: that the harvesting-achievable range can be enhanced only for anti-parallel acceleration. However, for a not too small acceleration relative to the duration parameter and an energy gap larger than the acceleration, we find that only detectors in parallel acceleration possess a harvesting-achievable range larger than those at rest.

quant-ph↗

arXiv2022

Automatic Fine-grained Glomerular Lesion Recognition in Kidney Pathology

Recognition of glomeruli lesions is the key for diagnosis and treatment planning in kidney pathology; however, the coexisting glomerular structures such as mesangial regions exacerbate the difficulties of this task. In this paper, we introduce a scheme to recognize fine-grained glomeruli lesions from whole slide images. First, a focal instance structural similarity loss is proposed to drive the model to locate all types of glomeruli precisely. Then an Uncertainty Aided Apportionment Network is designed to carry out the fine-grained visual classification without bounding-box annotations. This double branch-shaped structure extracts common features of the child class from the parent class and produces the uncertainty factor for reconstituting the training dataset. Results of slide-wise evaluation illustrate the effectiveness of the entire scheme, with an 8-22% improvement of the mean Average Precision compared with remarkable detection methods. The comprehensive results clearly demonstrate the effectiveness of the proposed method.

eess.IV↗

arXiv2021

Entanglement harvesting in the presence of a reflecting boundary

We study, in the framework of the entanglement harvesting protocol, the entanglement harvesting of both a pair of inertial and uniformly accelerated detectors locally interacting with vacuum massless scalar fields subjected to a perfectly reflecting plane boundary. We find that the presence of the boundary generally degrades the harvested entanglement when two detectors are very close to the boundary. However, when the distance between detectors and the boundary becomes comparable to the interaction duration parameter, the amount of the harvested entanglement approaches a peak, which even goes beyond that without a boundary. Remarkably, the parameter space of the detectors' separation and the magnitude of acceleration that allows entanglement harvesting to occur is enlarged due to the presence of the boundary. In this sense, the boundary plays a double-edged role on entanglement harvesting, degrading in general the harvested entanglement while enlarging the entanglement harvesting-achievable parameter space. A comparison of three different acceleration scenarios of the detectors with respect to the boundary, i.e., parallel, anti-parallel and mutually perpendicular acceleration, shows that the phenomenon of entanglement harvesting crucially depends on the acceleration, the separation between two detectors and the detectors' distance from the boundary.

quant-ph↗

arXiv2020

Deep Learning Methods for Lung Cancer Segmentation in Whole-slide Histopathology Images -- the ACDC@LungHP Challenge 2019

Accurate segmentation of lung cancer in pathology slides is a critical step in improving patient care. We proposed the ACDC@LungHP (Automatic Cancer Detection and Classification in Whole-slide Lung Histopathology) challenge for evaluating different computer-aided diagnosis (CADs) methods on the automatic diagnosis of lung cancer. The ACDC@LungHP 2019 focused on segmentation (pixel-wise detection) of cancer tissue in whole slide imaging (WSI), using an annotated dataset of 150 training images and 50 test images from 200 patients. This paper reviews this challenge and summarizes the top 10 submitted methods for lung cancer segmentation. All methods were evaluated using the false positive rate, false negative rate, and DICE coefficient (DC). The DC ranged from 0.7354$\pm$0.1149 to 0.8372$\pm$0.0858. The DC of the best method was close to the inter-observer agreement (0.8398$\pm$0.0890). All methods were based on deep learning and categorized into two groups: multi-model method and single model method. In general, multi-model methods were significantly better ($\textit{p}$<$0.01$) than single model methods, with mean DC of 0.7966 and 0.7544, respectively. Deep learning based methods could potentially help pathologists find suspicious regions for further analysis of lung cancer in WSI.

eess.IV↗

arXiv2020

Refined Bohr inequality for bounded analytic functions

In this article, by combining appropriate refined Bohr's inequalities with some techniques concerning bounded analytic functions defined in the unit disk, we generalize and improve several Bohr type inequalities for such functions.

math.CV↗

arXiv2019

Mission Oriented Miniature Fixed-wing UAV Swarms: A Multi-layered and Distributed Architecture

UAV swarms have triggered wide concern due to their potential application values in recent years. While there are studies proposed in terms of the architecture design for UAV swarms, two main challenges still exist: (1) Scalability, supporting a large scale of vehicles; (2) Versatility, integrating diversified missions. To this end, a multi-layered and distributed architecture for mission oriented miniature fixed-wing UAV swarms is presented in this paper. The proposed architecture is built on the concept of modularity. It divides the overall system to five layers: low-level control, high-level control, coordination, communication and human interaction layers, and many modules that can be viewed as black boxes with interfaces of inputs and outputs. In this way, not only the complexity of developing a large system can be reduced, but also the versatility of supporting diversified missions can be ensured. Furthermore, the proposed architecture is fully distributed that each UAV performs the decision-making procedure autonomously so as to achieve better scalability. Moreover, different kinds of aerial platforms can be feasibly extended by using the control allocation matrices and the integrated hardware box. A prototype swarm system based on the proposed architecture is built and the proposed architecture is evaluated through field experiments with a scale of 21 fixed-wing UAVs. Particularly, to the best of our knowledge, this paper is the first work which successfully demonstrates formation flight, target recognition and tracking missions within an integrated architecture for fixed-wing UAV swarms through field experiments.

cs.MA↗

arXiv2019

Hiding Communications in AWGN Channels and THz Band with Interference Uncertainty

Covert communication can prevent an adversary from knowing that a wireless transmission has occurred. In additive white Gaussian noise (AWGN) channels, a square root law is found that Alice can reliably and covertly transmit $\mathcal{O}(\sqrt{n})$ bits to Bob in $n$ channel uses. In this paper, we consider covert communications in noisy wireless networks, where the receivers not only experience the background noise, but also the aggregate interference from other transmitters. Our results show that uncertainty in interference experienced by the adversary Willie is beneficial to Alice. In AWGN channels, when the distance between Alice and Willie $d_{a,w}=ω(n^{1/(2α)})$ ($α$ is the path loss exponent), Alice can reliably and covertly transmit $\mathcal{O}(\log_2\sqrt{n})$ bits to Bob in $n$ channel uses. Although the covert throughput is lower than the square root law, the spatial throughput is higher. In THz (Terahertz) Band networks,covert communication is more difficult because Willie can simply place a receiver in the narrow beam between Alice and Bob to detect or block their LOS (Line-of-Sight) communications. We then present a covert communication scheme that utilizes the reflection or diffuse scattering from a rough surface to prevent being detected by Willie. From the network perspective, the communications are hidden in the interference of noisy wireless networks, and what Willie sees is merely a "shadow" wireless network.

cs.CR↗

arXiv2019

P3SGD: Patient Privacy Preserving SGD for Regularizing Deep CNNs in Pathological Image Classification

Recently, deep convolutional neural networks (CNNs) have achieved great success in pathological image classification. However, due to the limited number of labeled pathological images, there are still two challenges to be addressed: (1) overfitting: the performance of a CNN model is undermined by the overfitting due to its huge amounts of parameters and the insufficiency of labeled training data. (2) privacy leakage: the model trained using a conventional method may involuntarily reveal the private information of the patients in the training dataset. The smaller the dataset, the worse the privacy leakage. To tackle the above two challenges, we introduce a novel stochastic gradient descent (SGD) scheme, named patient privacy preserving SGD (P3SGD), which performs the model update of the SGD in the patient level via a large-step update built upon each patient's data. Specifically, to protect privacy and regularize the CNN model, we propose to inject the well-designed noise into the updates. Moreover, we equip our P3SGD with an elaborated strategy to adaptively control the scale of the injected noise. To validate the effectiveness of P3SGD, we perform extensive experiments on a real-world clinical dataset and quantitatively demonstrate the superior ability of P3SGD in reducing the risk of overfitting. We also provide a rigorous analysis of the privacy cost under differential privacy. Additionally, we find that the models trained with P3SGD are resistant to the model-inversion attack compared with those trained using non-private SGD.

cs.CV↗

arXiv2019

G2C: A Generator-to-Classifier Framework Integrating Multi-Stained Visual Cues for Pathological Glomerulus Classification

Pathological glomerulus classification plays a key role in the diagnosis of nephropathy. As the difference between different subcategories is subtle, doctors often refer to slides from different staining methods to make decisions. However, creating correspondence across various stains is labor-intensive, bringing major difficulties in collecting data and training a vision-based algorithm to assist nephropathy diagnosis. This paper provides an alternative solution for integrating multi-stained visual cues for glomerulus classification. Our approach, named generator-to-classifier (G2C), is a two-stage framework. Given an input image from a specified stain, several generators are first applied to estimate its appearances in other staining methods, and a classifier follows to combine visual cues from different stains for prediction (whether it is pathological, or which type of pathology it has). We optimize these two stages in a joint manner. To provide a reasonable initialization, we pre-train the generators in an unlabeled reference set under an unpaired image-to-image translation task, and then fine-tune them together with the classifier. We conduct experiments on a glomerulus type classification dataset collected by ourselves (there are no publicly available datasets for this purpose). Although joint optimization slightly harms the authenticity of the generated patches, it boosts classification performance, suggesting more effective visual cues are extracted in an automatic way. We also transfer our model to a public dataset for breast cancer classification, and outperform the state-of-the-arts significantly.

cs.CV↗

arXiv2019

Challenges in Covert Wireless Communications with Active Warden on AWGN channels

Covert wireless communication or low probability of detection (LPD) communication that employs the noise or jamming signals as the cover to hide user's information can prevent a warden Willie from discovering user's transmission attempts. Previous work on this problem has typically assumed that the warden is static and has only one antenna, often neglecting an active warden who can dynamically adjust his/her location to make better statistic tests. In this paper, we analyze the effect of an active warden in covert wireless communications on AWGN channels and find that, having gathered samples at different places, the warden can easily detect Alice's transmission behavior via a trend test, and the square root law is invalid in this scenario. Furthermore, a more powerful warden with multiple antennas is harder to be deceived, and Willie's detection time can be greatly shortened.

cs.CR↗

arXiv2018

Decoy state quantum key distribution with imperfect source

The decoy state protocol has been considered to be one of the most important methods to protect the security of quantum key distribution (QKD) with a weak coherent source. Here we test two experimental approaches to generating the decoy states with different intensities: modulation of the pump current of a semiconductor laser diode, and external modulation by an optical intensity modulator. The former approach shows a side-channel in the time domain that allows an attacker to distinguish s signal state from a decoy state, breaking a basic assumption in the protocol. We model a photon-number-splitting attack based on our experimental data, and show that it compromises the system's security. Then, based on the work of K. Tamaki et al. [New J. Phys. 18, 065008 (2016)], we obtain two analytical formulas to estimate the yield and the error rate of single-photon pulses when the signal and decoy states are distinguishable. The distinguishability reduces the secure key rate below that of a perfect decoy-state protocol. To mitigate this reduction, we propose to calibrate the transmittance of the receiver (Bob's) unit. We apply our method to three QKD systems and estimate their secure key rates.

quant-ph↗

arXiv2018

Covert Wireless Communications with Active Eavesdropper on AWGN Channels

Covert wireless communication can prevent an adversary from knowing the existence of user's transmission, thus provide stronger security protection. In AWGN channels, a square root law was obtained and the result shows that Alice can reliably and covertly transmit $\mathcal{O}(\sqrt{n})$ bits to Bob in n channel uses in the presence of a passive eavesdropper (Willie). However, existing work presupposes that Willie is static and only samples the channels at a fixed place. If Willie can dynamically adjust the testing distance between him and Alice according to his sampling values, his detection probability of error can be reduced significantly via a trend test. We found that, if Alice has no prior knowledge about Willie, she cannot hide her transmission behavior in the presence of an active Willie, and the square root law does not hold in this situation. We then proposed a novel countermeasure to deal with the active Willie. Through randomized transmission scheduling, Willie cannot detect Alice's transmission attempts if Alice can set her transmission probability below a threshold. Additionally, we systematically evaluated the security properties of covert communications in a dense wireless network, and proposed a density-based routing scheme to deal with multi-hop covert communication in a wireless network. As the network grows denser, Willie's uncertainty increases, and finally resulting in a "shadow" network to Willie.

cs.IT↗

arXiv2018

The Sound and the Fury: Hiding Communications in Noisy Wireless Networks with Interference Uncertainty

Covert communication can prevent the adversary from knowing that a wireless transmission has occurred. In the additive white Gaussian noise channels, a square root law is obtained and the result shows that Alice can reliably and covertly transmit $\mathcal{O}(\sqrt{n})$ bits to Bob in $n$ channel uses. If additional "friendly" node near the adversary can inject artificial noise to aid Alice in hiding her transmission attempt, covert throughput can be improved, i.e., Alice can covertly transmit $\mathcal{O}(\min\{n,λ^{α/2}\sqrt{n}\})$ bits to Bob over $n$ uses of the channel ($λ$ is the density of friendly nodes and $α$ is the path loss exponent of wireless channels). In this paper, we consider the covert communication in a noisy wireless network, where Bob and the adversary Willie not only experience the background noise, but also the aggregated interference from other transmitters. Our results show that uncertainty in interference experienced by Willie is beneficial to Alice. When the distance between Alice and Willie $d_{a,w}=ω(n^{δ/4})$ ($δ=2/α$ is stability exponent), Alice can reliably and covertly transmit $\mathcal{O}(\log_2\sqrt{n})$ bits to Bob in $n$ channel uses. Although the covert throughput is lower than the square root law and the friendly jamming scheme, the spatial throughput is higher. From the network perspective, the communications are hidden in "the sound and the fury" of noisy wireless networks, and what Willie sees is merely a "shadow" wireless network. He knows for certain that some nodes are transmitting, but he cannot catch anyone red-handed.

cs.IT↗

arXiv2016

Univalency of convolutions of univalent harmonic right half-plane mappings

We consider the convolution of half-plane harmonic mappings with respective dilatations $(z+a)/(1+az)$ and $e^{iθ}z^{n}$, where $-1<a<1$ and $θ\in\mathbb{R},n\in\mathbb{N}$. We prove that such convolutions are locally univalent for $n=1$, which solves an open problem of Dorff et. al (see \cite[Problem~3.26]{Bshouty2010}). Moreover, we provide some numerical computations to illustrate that such convolutions are not univalent for $n\geq 2$.

math.CV↗

arXiv2011

Control and Characterization of Individual Grains and Grain Boundaries in Graphene Grown by Chemical Vapor Deposition

The strong interest in graphene has motivated the scalable production of high quality graphene and graphene devices. Since large-scale graphene films synthesized to date are typically polycrystalline, it is important to characterize and control grain boundaries, generally believed to degrade graphene quality. Here we study single-crystal graphene grains synthesized by ambient CVD on polycrystalline Cu, and show how individual boundaries between coalescing grains affect graphene's electronic properties. The graphene grains show no definite epitaxial relationship with the Cu substrate, and can cross Cu grain boundaries. The edges of these grains are found to be predominantly parallel to zigzag directions. We show that grain boundaries give a significant Raman "D" peak, impede electrical transport, and induce prominent weak localization indicative of intervalley scattering in graphene. Finally, we demonstrate an approach using pre-patterned growth seeds to control graphene nucleation, opening a route towards scalable fabrication of single-crystal graphene devices without grain boundaries.

cond-mat.mes-hall↗