Searcharxiv⌕ Search

arXiv subjects

Ziyang Chen

Publications and source records attributed to Ziyang Chen.

At least 127 records · Page 7Linked to original sources

SAMN: A Sample Attention Memory Network Combining SVM and NN in One Architecture

Support vector machine (SVM) and neural networks (NN) have strong complementarity. SVM focuses on the inner operation among samples while NN focuses on the operation among the features within samples. Thus, it is promising and attractive to combine SVM and NN, as it may provide a more powerful function than SVM or NN alone. However, current work on combining them lacks true integration. To address this, we propose a sample attention memory network (SAMN) that effectively combines SVM and NN by incorporating sample attention module, class prototypes, and memory block to NN. SVM can be viewed as a sample attention machine. It allows us to add a sample attention module to NN to implement the main function of SVM. Class prototypes are representatives of all classes, which can be viewed as alternatives to support vectors. The memory block is used for the storage and update of class prototypes. Class prototypes and memory block effectively reduce the computational cost of sample attention and make SAMN suitable for multi-classification tasks. Extensive experiments show that SAMN achieves better classification performance than single SVM or single NN with similar parameter sizes, as well as the previous best model for combining SVM and NN. The sample attention mechanism is a flexible module that can be easily deepened and incorporated into neural networks that require it.

cs.LG↗

Towards Safer Robot-Assisted Surgery: A Markerless Augmented Reality Framework

Robot-assisted surgery is rapidly developing in the medical field, and the integration of augmented reality shows the potential of improving the surgeons' operation performance by providing more visual information. In this paper, we proposed a markerless augmented reality framework to enhance safety by avoiding intra-operative bleeding which is a high risk caused by the collision between the surgical instruments and the blood vessel. Advanced stereo reconstruction and segmentation networks are compared to find out the best combination to reconstruct the intra-operative blood vessel in the 3D space for the registration of the pre-operative model, and the minimum distance detection between the instruments and the blood vessel is implemented. A robot-assisted lymphadenectomy is simulated on the da Vinci Research Kit in a dry lab, and ten human subjects performed this operation to explore the usability of the proposed framework. The result shows that the augmented reality framework can help the users to avoid the dangerous collision between the instruments and the blood vessel while not introducing an extra load. It provides a flexible framework that integrates augmented reality into the medical robot platform to enhance safety during the operation.

cs.RO↗

Sound Localization from Motion: Jointly Learning Sound Direction and Camera Rotation

The images and sounds that we perceive undergo subtle but geometrically consistent changes as we rotate our heads. In this paper, we use these cues to solve a problem we call Sound Localization from Motion (SLfM): jointly estimating camera rotation and localizing sound sources. We learn to solve these tasks solely through self-supervision. A visual model predicts camera rotation from a pair of images, while an audio model predicts the direction of sound sources from binaural sounds. We train these models to generate predictions that agree with one another. At test time, the models can be deployed independently. To obtain a feature representation that is well-suited to solving this challenging problem, we also propose a method for learning an audio-visual representation through cross-view binauralization: estimating binaural sound from one view, given images and sound from another. Our model can successfully estimate accurate rotations on both real and synthetic scenes, and localize sound sources with accuracy competitive with state-of-the-art self-supervised approaches. Project site: https://ificl.github.io/SLfM/

cs.CV↗

Lightweight Neural Path Planning

Learning-based path planning is becoming a promising robot navigation methodology due to its adaptability to various environments. However, the expensive computing and storage associated with networks impose significant challenges for their deployment on low-cost robots. Motivated by this practical challenge, we develop a lightweight neural path planning architecture with a dual input network and a hybrid sampler for resource-constrained robotic systems. Our architecture is designed with efficient task feature extraction and fusion modules to translate the given planning instance into a guidance map. The hybrid sampler is then applied to restrict the planning within the prospective regions indicated by the guide map. To enable the network training, we further construct a publicly available dataset with various successful planning instances. Numerical simulations and physical experiments demonstrate that, compared with baseline approaches, our approach has nearly an order of magnitude fewer model size and five times lower computational while achieving promising performance. Besides, our approach can also accelerate the planning convergence process with fewer planning iterations compared to sample-based methods.

cs.RO↗

Countermeasure for negative impact of practical source in continuous-variable measurement-device-independent quantum key distribution

Continuous-variable measurement-device-independent quantum key distribution (CV-MDI QKD) can defend all attacks on the measurement devices fundamentally. Consequently, higher requirements are put forward for the source of CV-MDI QKD system. However, the imperfections of actual source brings practical security risks to the CV-MDI QKD system. Therefore, the characteristics of the realistic source must be controlled in real time to guarantee the practical security of the CV-MDI QKD system. Here we propose a countermeasure for negative impact introduced by the actual source in the CV-MDI QKD system based on one-time-calibration method, not only eliminating the loophole induced from the relative intensity noise (RIN) which is part of the source noise, but also modeling the source noise thus improving the performance. In particular, three cases in terms of whether the preparation noise of the practical sources are defined or not, where only one of the users or both two users operate monitoring on their respective source outputs, are investigated. The simulation results show that the estimated secret key rate without our proposed scheme are about 10.7 times higher than the realistic rate at 18 km transmission distance when the variance of RIN is only 0.4. What's worse, the difference becomes greater and greater with the increase of the variance of RIN. Thus, our proposed scheme makes sense in further completing the practical security of CV-MDI QKD system. In other words, our work enables CV-MDI QKD system not only to resist all attacks against detectors, but also to close the vulnerability caused by the actual source, thus making the scheme closer to practical security.

quant-ph↗

Thermal energy census with the Sunyaev-Zel'dovich effect of DESI galaxy clusters/groups and its implication on the weak lensing power spectrum

We carry out a thermal energy census of hot baryons at $z < 1$, by cross-correlating the \emph{Planck} MILCA y-map with 0.8 million clusters/groups selected from the Yang et.al (2021) catalog. The thermal Sunyaev-Zel'dovich (tSZ) effect around these clusters/groups are reliably obtained, which enables us to make our model constraints based on one-halo (1h) and two-halo (2h) contributions, respectively. (1) The total measurement S/N of the one-halo term is 63. We constrain the $Y$-$M$ relation over the halo mass range of $10^{13}$-$10^{15} M_\odot/h$, and find $Y\propto M^α$ with $α= 1.8$ at $z=0.14$ ($α=2.1$ at $z=0.75$). The total thermal energy of gas bound to clusters/groups increases from $0.1\ \rm meV/cm^3$ at $z=0.14$ to $0.22\ \rm meV/cm^3$ at $z=0.75$. (2) The two-halo term is used to constrain the bias-weighted electron pressure $\langle b_yP_e \rangle$. We find that $\langle b_yP_e \rangle$ (in unit of $\rm meV/cm^3$) increases from $0.24\pm 0.02$ at $z=0.14$ to $0.45\pm 0.02$ at $z=0.75$. These results lead to several implications. (i) The hot gas fraction $f_{\rm gas}$ in clusters/groups monotonically increase with halo mass, where $f_{\rm gas}$ of a $10^{14} M_\odot/h$ halo is $\sim 50\%$ ($25\%$) of the cosmic mean at $z=0.14\ (0.75)$. (ii) By comparing the 1h- and 2h-terms, we obtain tentative constraint on the thermal energy of unbound gas. (iii) The above results lead to significant suppression of matter and weak lensing power spectrum at small scales. These implications are important for astrophysics and cosmology, and we will further investigate them with improved data and gas modeling.

astro-ph.CO↗

Principal Component Analysis of Galaxy Clustering in Hyperspace of Galaxy Properties

Ongoing and upcoming galaxy surveys are providing precision measurements of galaxy clustering. However a major obstacle in its cosmological application is the stochasticity in the galaxy bias. We explore whether the principal component analysis (PCA) of galaxy correlation matrix in hyperspace of galaxy properties (e.g. magnitude and color) can reveal further information on mitigating this issue. Based on the hydrodynamic simulation TNG300-1, we analyze the cross power spectrum matrix of galaxies in the magnitude and color space of multiple photometric bands. (1) We find that the first principal component $E_i^{(1)}$ is an excellent proxy of the galaxy deterministic bias $b_{D}$, in that $E_i^{(1)}=\sqrt{P_{mm}/λ(1)}b_{D,i}$. Here $i$ denotes the $i$-th galaxy sub-sample. $λ^{(1)}$ is the largest eigenvalue and $P_{mm}$ is the matter power spectrum. We verify that this relation holds for all the galaxy samples investigated, down to $k\sim 2h/$Mpc. Since $E_i^{(1)}$ is a direct observable, we can utilize it to design a linear weighting scheme to suppress the stochasticity in the galaxy-matter relation. For an LSST-like magnitude limit galaxy sample, the stochasticity $\mathcal{S}\equiv 1-r^2$ can be suppressed by a factor of $\ga 2$ at $k=1h/$Mpc. This reduces the stochasticity-induced systematic error in the matter power spectrum reconstruction combining galaxy clustering and galaxy-galaxy lensing from $\sim 12\%$ to $\sim 5\%$ at $k=1h/$Mpc. (2) We also find that $\mathcal{S}$ increases monotonically with $f_λ$ and $f_{λ^2}$. $f_{λ,λ^2}$ quantify the fractional contribution of other eigenmodes to the galaxy clustering and are direct observables. Therefore the two provide extra information on mitigating galaxy stochasticity.

astro-ph.CO↗

Treasure in Distribution: A Domain Randomization based Multi-Source Domain Generalization for 2D Medical Image Segmentation

Although recent years have witnessed the great success of convolutional neural networks (CNNs) in medical image segmentation, the domain shift issue caused by the highly variable image quality of medical images hinders the deployment of CNNs in real-world clinical applications. Domain generalization (DG) methods aim to address this issue by training a robust model on the source domain, which has a strong generalization ability. Previously, many DG methods based on feature-space domain randomization have been proposed, which, however, suffer from the limited and unordered search space of feature styles. In this paper, we propose a multi-source DG method called Treasure in Distribution (TriD), which constructs an unprecedented search space to obtain the model with strong robustness by randomly sampling from a uniform distribution. To learn the domain-invariant representations explicitly, we further devise a style-mixing strategy in our TriD, which mixes the feature styles by randomly mixing the augmented and original statistics along the channel wise and can be extended to other DG methods. Extensive experiments on two medical segmentation tasks with different modalities demonstrate that our TriD achieves superior generalization performance on unseen target-domain data. Code is available at https://github.com/Chen-Ziyang/TriD.

cs.CV↗

What You See is What You Grasp: User-Friendly Grasping Guided by Near-eye-tracking

This work presents a next-generation human-robot interface that can infer and realize the user's manipulation intention via sight only. Specifically, we develop a system that integrates near-eye-tracking and robotic manipulation to enable user-specified actions (e.g., grasp, pick-and-place, etc), where visual information is merged with human attention to create a mapping for desired robot actions. To enable sight guided manipulation, a head-mounted near-eye-tracking device is developed to track the eyeball movements in real-time, so that the user's visual attention can be identified. To improve the grasping performance, a transformer based grasp model is then developed. Stacked transformer blocks are used to extract hierarchical features where the volumes of channels are expanded at each stage while squeezing the resolution of feature maps. Experimental validation demonstrates that the eye-tracking system yields low gaze estimation error and the grasping system yields promising results on multiple grasping datasets. This work is a proof of concept for gaze interaction-based assistive robot, which holds great promise to help the elder or upper limb disabilities in their daily lives. A demo video is available at https://www.youtube.com/watch?v=yuZ1hukYUrM

cs.RO↗

Non-Gaussian reconciliation for continuous-variable quantum key distribution

Non-Gaussian modulation can improve the performance of continuous-variable quantum key distribution (CV-QKD). For Gaussian modulated coherent state CV-QKD, photon subtraction can realize non-Gaussian modulation, which can be equivalently implemented by non-Gaussian postselection. However, non-Gaussian reconciliation has not been deeply researched, which is one of the key technologies in CV-QKD. In this paper, we propose a non-Gaussian reconciliation method to obtain identical keys from non-Gaussian data. Multidimensional reconciliation and multi-edge type low density parity check codes (MET-LDPC) are used in non-Gaussian reconciliation scheme, where the layered belief propagation decoding algorithm of MET-LDPC codes is used to reduce the decoding complexity. Furthermore, we compare the error correction performance of Gaussian data and non-Gaussian data. The results show that the error correction performance of non-Gaussian data is better than Gaussian data, where the frame error rate can be reduced by 50% for code rate 0.1 at SNR of 0.1554 and the average iteration number can be reduced by 25%.

quant-ph↗

Experimental upstream transmission of continuous variable quantum key distribution access network

Continuous-variable quantum key distribution which can be implemented using only low-cost and off-the-shelf components reveals great potential in the practical large-scale realization. Access network as a modern network necessity, connects multiple end-users to the network backbone. In this work, we demonstrate the first upstream transmission quantum access networks using continuous-variable quantum key distribution. A two-end-user quantum access network is then experimentally realized. Through phase compensation, data synchronization and other technical upgrades, we achieve 390kbps secret key rate of the total network. In addition, we extend the case of two-end-user quantum access network to the case of multiple users, and analyze the network capacity in the case of multiple users by measuring the additive excess noise from different time slots.

quant-ph↗

Conditional Generation of Audio from Video via Foley Analogies

The sound effects that designers add to videos are designed to convey a particular artistic effect and, thus, may be quite different from a scene's true sound. Inspired by the challenges of creating a soundtrack for a video that differs from its true sound, but that nonetheless matches the actions occurring on screen, we propose the problem of conditional Foley. We present the following contributions to address this problem. First, we propose a pretext task for training our model to predict sound for an input video clip using a conditional audio-visual clip sampled from another time within the same source video. Second, we propose a model for generating a soundtrack for a silent input video, given a user-supplied example that specifies what the video should "sound like". We show through human studies and automated evaluation metrics that our model successfully generates sound from video, while varying its output according to the content of a supplied example. Project site: https://xypb.github.io/CondFoleyGen/

cs.CV↗

Reconstruction-driven Dynamic Refinement based Unsupervised Domain Adaptation for Joint Optic Disc and Cup Segmentation

Glaucoma is one of the leading causes of irreversible blindness. Segmentation of optic disc (OD) and optic cup (OC) on fundus images is a crucial step in glaucoma screening. Although many deep learning models have been constructed for this task, it remains challenging to train an OD/OC segmentation model that could be deployed successfully to different healthcare centers. The difficulties mainly comes from the domain shift issue, i.e., the fundus images collected at these centers usually vary greatly in the tone, contrast, and brightness. To address this issue, in this paper, we propose a novel unsupervised domain adaptation (UDA) method called Reconstruction-driven Dynamic Refinement Network (RDR-Net), where we employ a due-path segmentation backbone for simultaneous edge detection and region prediction and design three modules to alleviate the domain gap. The reconstruction alignment (RA) module uses a variational auto-encoder (VAE) to reconstruct the input image and thus boosts the image representation ability of the network in a self-supervised way. It also uses a style-consistency constraint to force the network to retain more domain-invariant information. The low-level feature refinement (LFR) module employs input-specific dynamic convolutions to suppress the domain-variant information in the obtained low-level features. The prediction-map alignment (PMA) module elaborates the entropy-driven adversarial learning to encourage the network to generate source-like boundaries and regions. We evaluated our RDR-Net against state-of-the-art solutions on four public fundus image datasets. Our results indicate that RDR-Net is superior to competing models in both segmentation performance and generalization ability

eess.IV↗

UniSeg: A Prompt-driven Universal Segmentation Model as well as A Strong Representation Learner

The universal model emerges as a promising trend for medical image segmentation, paving up the way to build medical imaging large model (MILM). One popular strategy to build universal models is to encode each task as a one-hot vector and generate dynamic convolutional layers at the end of the decoder to extract the interested target. Although successful, it ignores the correlations among tasks and meanwhile is too late to make the model 'aware' of the ongoing task. To address both issues, we propose a prompt-driven Universal Segmentation model (UniSeg) for multi-task medical image segmentation using diverse modalities and domains. We first devise a learnable universal prompt to describe the correlations among all tasks and then convert this prompt and image features into a task-specific prompt, which is fed to the decoder as a part of its input. Thus, we make the model 'aware' of the ongoing task early and boost the task-specific training of the whole decoder. Our results indicate that the proposed UniSeg outperforms other universal models and single-task models on 11 upstream tasks. Moreover, UniSeg also beats other pre-trained models on two downstream datasets, providing the community with a high-quality pre-trained model for 3D medical image segmentation. Code and model are available at https://github.com/yeerwen/UniSeg.

cs.CV↗

Continuous-mode quantum key distribution with digital signal processing

Continuous-variable quantum key distribution (CVQKD) offers the specific advantage of sharing keys remotely by the use of standard telecom components, thereby promoting cost-effective and high-performance metropolitan applications. Nevertheless, the introduction of high-rate spectrum broadening has pushed CVQKD from a single-mode to a continuous-mode region, resulting in the adoption of modern digital signal processing (DSP) technologies to recover quadrature information from continuous-mode quantum states. However, the security proof of DSP involving multi-point processing is a missing step. Here, we propose a generalized method of analyzing continuous-mode state processing by linear DSP via temporal-modes theory. The construction of temporal modes is key in reducing the security proof to single-mode scenarios. The proposed practicality oriented security analysis method paves the way for building classical compatible digital CVQKD.

quant-ph↗

Self-Supervised Video Forensics by Audio-Visual Anomaly Detection

Manipulated videos often contain subtle inconsistencies between their visual and audio signals. We propose a video forensics method, based on anomaly detection, that can identify these inconsistencies, and that can be trained solely using real, unlabeled data. We train an autoregressive model to generate sequences of audio-visual features, using feature sets that capture the temporal synchronization between video frames and sound. At test time, we then flag videos that the model assigns low probability. Despite being trained entirely on real videos, our model obtains strong performance on the task of detecting manipulated speech videos. Project site: https://cfeng16.github.io/audio-visual-forensics

cs.CV↗

Sound Localization by Self-Supervised Time Delay Estimation

Sounds reach one microphone in a stereo pair sooner than the other, resulting in an interaural time delay that conveys their directions. Estimating a sound's time delay requires finding correspondences between the signals recorded by each microphone. We propose to learn these correspondences through self-supervision, drawing on recent techniques from visual tracking. We adapt the contrastive random walk of Jabri et al. to learn a cycle-consistent representation from unlabeled stereo sounds, resulting in a model that performs on par with supervised methods on "in the wild" internet recordings. We also propose a multimodal contrastive learning model that solves a visually-guided localization task: estimating the time delay for a particular person in a multi-speaker mixture, given a visual representation of their face. Project site: https://ificl.github.io/stereocrw/

cs.CV↗

Mix and Localize: Localizing Sound Sources in Mixtures

We present a method for simultaneously localizing multiple sound sources within a visual scene. This task requires a model to both group a sound mixture into individual sources, and to associate them with a visual signal. Our method jointly solves both tasks at once, using a formulation inspired by the contrastive random walk of Jabri et al. We create a graph in which images and separated sounds correspond to nodes, and train a random walker to transition between nodes from different modalities with high return probability. The transition probabilities for this walk are determined by an audio-visual similarity metric that is learned by our model. We show through experiments with musical instruments and human speech that our model can successfully localize multiple sounds, outperforming other self-supervised methods. Project site: https://hxixixh.github.io/mix-and-localize

cs.CV↗