arXiv subjects

He Sun

Publications and source records attributed to He Sun.

At least 73 records · Page 4Linked to original sources

arXiv2024

RSRP Measurement Based Channel Autocorrelation Estimation for IRS-Aided Wideband Communication

The passive and frequency-flat reflection of IRS, as well as the high-dimensional IRS-reflected channels, have posed significant challenges for efficient IRS channel estimation, especially in wideband communication systems with significant multi-path channel delay spread. To address these challenges, we propose a novel neural network (NN)-empowered framework for IRS channel autocorrelation matrix estimation in wideband orthogonal frequency division multiplexing (OFDM) systems. This framework relies only on the easily accessible reference signal received power (RSRP) measurements at users in existing wideband communication systems, without requiring additional pilot transmission. Based on the estimates of channel autocorrelation matrix, the passive reflection of IRS is optimized to maximize the average user received signal-to-noise ratio (SNR) over all subcarriers in the OFDM system. Numerical results verify that the proposed algorithm significantly outperforms existing powermeasurement-based IRS reflection designs in wideband channels.

cs.IT↗

arXiv2024

Learning Diffusion Model from Noisy Measurement using Principled Expectation-Maximization Method

Diffusion models have demonstrated exceptional ability in modeling complex image distributions, making them versatile plug-and-play priors for solving imaging inverse problems. However, their reliance on large-scale clean datasets for training limits their applicability in scenarios where acquiring clean data is costly or impractical. Recent approaches have attempted to learn diffusion models directly from corrupted measurements, but these methods either lack theoretical convergence guarantees or are restricted to specific types of data corruption. In this paper, we propose a principled expectation-maximization (EM) framework that iteratively learns diffusion models from noisy data with arbitrary corruption types. Our framework employs a plug-and-play Monte Carlo method to accurately estimate clean images from noisy measurements, followed by training the diffusion model using the reconstructed images. This process alternates between estimation and training until convergence. We evaluate the performance of our method across various imaging tasks, including inpainting, denoising, and deblurring. Experimental results demonstrate that our approach enables the learning of high-fidelity diffusion priors from noisy data, significantly enhancing reconstruction quality in imaging inverse problems.

cs.CV↗

arXiv2024

Can we measure the impact of a database?

In disseminating scientific and statistical data, on-line databases have almost completely replaced traditional paper-based media such as journals and reference works. Given this, can we measure the impact of a database in the same way that we measure an author's or journal's impact? To do this, we need somehow to represent a database as a set of publications, and databases typically allow a large number of possible decompositions into parts, any of which could be treated as a publication. We show that the definition of the h-index naturally extends to hierarchies, so that if a database admits some kind of hierarchical interpretation we can use this as one measure of the importance of a database; moreover, this can be computed as efficiently as one can compute the normal h-index. This also gives us a decomposition of the database that might be used for other purposes such as giving credit to the curators or contributors to the database. We illustrate the process by analyzing three widely used databases.

cs.DB↗

arXiv2024

Integrating Amortized Inference with Diffusion Models for Learning Clean Distribution from Corrupted Images

Diffusion models (DMs) have emerged as powerful generative models for solving inverse problems, offering a good approximation of prior distributions of real-world image data. Typically, diffusion models rely on large-scale clean signals to accurately learn the score functions of ground truth clean image distributions. However, such a requirement for large amounts of clean data is often impractical in real-world applications, especially in fields where data samples are expensive to obtain. To address this limitation, in this work, we introduce \emph{FlowDiff}, a novel joint training paradigm that leverages a conditional normalizing flow model to facilitate the training of diffusion models on corrupted data sources. The conditional normalizing flow try to learn to recover clean images through a novel amortized inference mechanism, and can thus effectively facilitate the diffusion model's training with corrupted data. On the other side, diffusion models provide strong priors which in turn improve the quality of image recovery. The flow model and the diffusion model can therefore promote each other and demonstrate strong empirical performances. Our elaborate experiment shows that FlowDiff can effectively learn clean distributions across a wide range of corrupted data sources, such as noisy and blurry images. It consistently outperforms existing baselines with significant margins under identical conditions. Additionally, we also study the learned diffusion prior, observing its superior performance in downstream computational imaging tasks, including inpainting, denoising, and deblurring.

cs.CV↗

arXiv2024

Blind Inversion using Latent Diffusion Priors

Diffusion models have emerged as powerful tools for solving inverse problems due to their exceptional ability to model complex prior distributions. However, existing methods predominantly assume known forward operators (i.e., non-blind), limiting their applicability in practical settings where acquiring such operators is costly. Additionally, many current approaches rely on pixel-space diffusion models, leaving the potential of more powerful latent diffusion models (LDMs) underexplored. In this paper, we introduce LatentDEM, an innovative technique that addresses more challenging blind inverse problems using latent diffusion priors. At the core of our method is solving blind inverse problems within an iterative Expectation-Maximization (EM) framework: (1) the E-step recovers clean images from corrupted observations using LDM priors and a known forward model, and (2) the M-step estimates the forward operator based on the recovered images. Additionally, we propose two novel optimization techniques tailored for LDM priors and EM frameworks, yielding more accurate and efficient blind inversion results. As a general framework, LatentDEM supports both linear and non-linear inverse problems. Beyond common 2D image restoration tasks, it enables new capabilities in non-linear 3D inverse rendering problems. We validate LatentDEM's performance on representative 2D blind deblurring and 3D sparse-view reconstruction tasks, demonstrating its superior efficacy over prior arts.

cs.CV↗

arXiv2024

Spectral Toolkit of Algorithms for Graphs: Technical Report (2)

Spectral Toolkit of Algorithms for Graphs (STAG) is an open-source library for efficient graph algorithms. This technical report presents the newly implemented component on locality sensitive hashing, kernel density estimation, and fast spectral clustering. The report includes a user's guide to the newly implemented algorithms, experiments and demonstrations of the new functionality, and several technical considerations behind our development.

cs.DS↗

arXiv2024

Dynamic Spectral Clustering with Provable Approximation Guarantee

This paper studies clustering algorithms for dynamically evolving graphs $\{G_t\}$, in which new edges (and potential new vertices) are added into a graph, and the underlying cluster structure of the graph can gradually change. The paper proves that, under some mild condition on the cluster-structure, the clusters of the final graph $G_T$ of $n_T$ vertices at time $T$ can be well approximated by a dynamic variant of the spectral clustering algorithm. The algorithm runs in amortised update time $O(1)$ and query time $o(n_T)$. Experimental studies on both synthetic and real-world datasets further confirm the practicality of our designed algorithm.

cs.DS↗

arXiv2024

Power Measurement Based Channel Estimation for IRS-Enhanced Wireless Coverage

In this paper, we study an IRS-assisted coverage enhancement problem for a given region, aiming to optimize the passive reflection of the IRS for improving the average communication performance in the region by accounting for both deterministic and random channels in the environment. To this end, we first derive the closed-form expression of the average received signal power in terms of the deterministic base station (BS)-IRS-user cascaded channels over all user locations, and propose an IRS-aided coverage enhancement framework to facilitate the estimation of such deterministic channels for IRS passive reflection design. Specifically, to avoid the exorbitant overhead of estimating the cascaded channels at all possible user locations, a location selection method is first proposed to select only a set of typical user locations for channel estimation by exploiting the channel spatial correlation in the region. To estimate the deterministic cascaded channels at the selected user locations, conventional IRS channel estimation methods require additional pilot signals, which not only results in high system training overhead but also may not be compatible with the existing communication protocols. To overcome this issue, we further propose a single-layer neural network (NN)-enabled IRS channel estimation method in this paper, based on only the average received signal power measurements at each selected location corresponding to different IRS random training reflections, which can be offline implemented in current wireless systems. Numerical results demonstrate that our proposed scheme can significantly improve the coverage performance of the target region and outperform the existing power-measurement-based IRS reflection designs.

cs.IT↗

arXiv2024

Low Complexity Successive Cancellation Decoding of Polar Codes based on Pruning Strategy in Deletion Error Channels

A novel SC decoding method of polar codes is proposed in $d$-deletion channels, where a new pruning strategy is designed to reduce decoding complexity. Considering the difference of the scenario weight distributions, pruning thresholds for each node are designed separately according to a uniform constraint on the pruning error probability, which further reduce the number of scenarios that need to be calculated during the decoding procedure. In addition, by exploiting the properties of the joint weight distribution, a simplified calculation method of thresholds is proposed. Using this simplified calculation method, the number of scenarios that required to be calculated is reduced from $(d+1)(d+2)/2$ to $d+1$.

cs.IT↗

arXiv2024

Polynomial-Time Algorithms for Weaver's Discrepancy Problem in a Dense Regime

Given $v_1,\ldots, v_m\in\mathbb{C}^d$ with $\|v_i\|^2= α$ for all $i\in[m]$ as input and suppose $\sum_{i=1}^m | \langle u, v_i \rangle |^2 = 1$ for every unit vector $u\in\mathbb{C}^d$, Weaver's discrepancy problem asks for a partition $S_1, S_2$ of $[m]$, such that $\sum_{i\in S_{j}} |\langle u, v_i \rangle|^2 \leq 1 -θ$ for some universal constant $θ$, every unit vector $u\in\mathbb{C}^d$ and every $j\in\{1,2\}$. We prove that this problem can be solved deterministically in polynomial time when $m\geq 49 d^2$.

cs.DS↗

arXiv2023

MoEC: Mixture of Experts Implicit Neural Compression

Emerging Implicit Neural Representation (INR) is a promising data compression technique, which represents the data using the parameters of a Deep Neural Network (DNN). Existing methods manually partition a complex scene into local regions and overfit the INRs into those regions. However, manually designing the partition scheme for a complex scene is very challenging and fails to jointly learn the partition and INRs. To solve the problem, we propose MoEC, a novel implicit neural compression method based on the theory of mixture of experts. Specifically, we use a gating network to automatically assign a specific INR to a 3D point in the scene. The gating network is trained jointly with the INRs of different local regions. Compared with block-wise and tree-structured partitions, our learnable partition can adaptively find the optimal partition in an end-to-end manner. We conduct detailed experiments on massive and diverse biomedical data to demonstrate the advantages of MoEC against existing approaches. In most of experiment settings, we have achieved state-of-the-art results. Especially in cases of extreme compression ratios, such as 6000x, we are able to uphold the PSNR of 48.16.

cs.CV↗

arXiv2023

Giant tunneling magnetoresistance in Fe$_2$CrSi/Fe$_2$TiSi/Fe$_2$CrSi magnetic tunnel junction

We propose a theoretical model for an all-Heusler magnetic tunnel junction that uses two Heusler compounds: Fe$_2$CrSi and Fe$_2$TiSi, both of which can be experimentally synthesized. Fe$_2$CrSi is a half-metallic ferromagnet, making it a promising material for efficient spin injection in magnetic random access memories and other spin-dependent devices. While, Fe$_2$TiSi is a nonmagnetic semiconductor that has the same lattice structure and comparable lattice constant with Fe$_2$CrSi, as it can be obtained by substituting the $Y$-site atoms in Fe$_2$CrSi. By using Fe$_2$TiSi as a tunneling barrier sandwiched by two pieces of semi-infinite Fe$_2$CrSi to construct an all-Heusler magnetic tunnel junction, the interface disorder is naturally reduced. Our calculations demonstrate that this magnetic tunnel junction can exhibit a giant tunneling magnetoresistance of up to 10$^{9}$\% and remains robust under finite bias voltage. These characteristics suggest that Fe$_2$CrSi/Fe$_2$TiSi/Fe$_2$CrSi MTJ will be an ideal candidate for future spintronic applications. More importantly, such a device model can keep such a giant tunneling magnetoresistance at and beyond room temperature due to the high Curie temperature of Fe$_2$CrSi.

physics.app-ph↗

arXiv2023

Filamentary structures as the origin of blazar jet radio variability

Supermassive black holes at the centre of active galactic nuclei power some of the most luminous objects in the Universe. Typically, very long baseline interferometric (VLBI) observations of blazars have revealed only funnel-like morphologies with little information of the ejected plasma internal structure, or lacked the sufficient dynamic range to reconstruct the extended jet emission. Here we show microarcsecond-scale angular resolution images of the blazar 3C 279 obtained at 22 GHz with the space VLBI mission RadioAstron, which allowed us to resolve the jet transversely and reveal several filaments produced by plasma instabilities in a kinetically dominated flow. Our high angular resolution and dynamic range image suggests that emission features traveling down the jet may manifest as a result of differential Doppler-boosting within the filaments, as opposed to the standard shock-in-jet model invoked to explain blazar jet radio variability. Moreover, we infer that the filaments in 3C 279 are possibly threaded by a helical magnetic field rotating clockwise, as seen in the direction of the flow motion, with an intrinsic helix pitch angle of ~45 degrees in a jet with a Lorentz factor of ~13 at the time of observation.

astro-ph.HE↗

arXiv2023

Discovering Structure From Corruption for Unsupervised Image Reconstruction

We consider solving ill-posed imaging inverse problems without access to an image prior or ground-truth examples. An overarching challenge in these inverse problems is that an infinite number of images, including many that are implausible, are consistent with the observed measurements. Thus, image priors are required to reduce the space of possible solutions to more desirable reconstructions. However, in many applications it is difficult or potentially impossible to obtain example images to construct an image prior. Hence inaccurate priors are often used, which inevitably result in biased solutions. Rather than solving an inverse problem using priors that encode the spatial structure of any one image, we propose to solve a set of inverse problems jointly by incorporating prior constraints on the collective structure of the underlying images. The key assumption of our work is that the underlying images we aim to reconstruct share common, low-dimensional structure. We show that such a set of inverse problems can be solved simultaneously without the use of a spatial image prior by instead inferring a shared image generator with a low-dimensional latent space. The parameters of the generator and latent embeddings are found by maximizing a proxy for the Evidence Lower Bound (ELBO). Once identified, the generator and latent embeddings can be combined to provide reconstructed images for each inverse problem. The framework we propose can handle general forward model corruptions, and we show that measurements derived from only a small number of ground-truth images ($\leqslant 150$) are sufficient for image reconstruction. We demonstrate our approach on a variety of convex and non-convex inverse problems, including denoising, phase retrieval, and black hole video reconstruction.

eess.IV↗

arXiv2023

Fast Approximation of Similarity Graphs with Kernel Density Estimation

Constructing a similarity graph from a set $X$ of data points in $\mathbb{R}^d$ is the first step of many modern clustering algorithms. However, typical constructions of a similarity graph have high time complexity, and a quadratic space dependency with respect to $|X|$. We address this limitation and present a new algorithmic framework that constructs a sparse approximation of the fully connected similarity graph while preserving its cluster structure. Our presented algorithm is based on the kernel density estimation problem, and is applicable for arbitrary kernel functions. We compare our designed algorithm with the well-known implementations from the scikit-learn library and the FAISS library, and find that our method significantly outperforms the implementation from both libraries on a variety of datasets.

cs.DS↗

arXiv2023

User Power Measurement Based IRS Channel Estimation via Single-Layer Neural Network

One main challenge for implementing intelligent reflecting surface (IRS) aided communications lies in the difficulty to obtain the channel knowledge for the base station (BS)-IRS-user cascaded links, which is needed to design high-performance IRS reflection in practice. Traditional methods for estimating IRS cascaded channels are usually based on the additional pilot signals received at the BS/users, which increase the system training overhead and also may not be compatible with the current communication protocols. To tackle this challenge, we propose in this paper a new single-layer neural network (NN)-enabled IRS channel estimation method based on only the knowledge of users' individual received signal power measurements corresponding to different IRS random training reflections, which are easily accessible in current wireless systems. To evaluate the effectiveness of the proposed channel estimation method, we design the IRS reflection for data transmission based on the estimated cascaded channels in an IRS-aided multiuser communication system. Numerical results show that the proposed IRS channel estimation and reflection design can significantly improve the minimum received signal-to-noise ratio (SNR) among all users, as compared to existing power measurement based designs.

cs.IT↗

arXiv2023

Research on the impact of asteroid mining on global equity

In the future situation, aiming to seek more resources, human beings decided to march towards the mysterious and bright starry sky, which opened the era of great interstellar exploration. According to the Outer Space Treaty, any exploration of celestial bodies should be aimed at promoting global equality and for the benefit of all nations. Firstly, we defined global equity and set a Unified Equity Index (UEI) model to measure it. We merge the factors with greater correlation, and finally, get 6 elements, and then use the entropy method (TEM) to find the dispersion of these elements in different countries. Then use principal component analysis (PCA) to reduce the dimensionality of the dispersion, and then use the scandalized index to obtain the global equity. Secondly, we simulated a future with asteroid mining and evaluated its impact on Unified Equity Index (UEI). Then, we divided the mineable asteroids into three classes with different mining difficulties and values, identified 28 mining entities including private companies, national and international organizations. We considered changes in the asteroid classes, mining capabilities and mining scales to determine the changes in the value of minerals mined between 2025 and 2085. We convert mining output value into mineral transaction value through allocation matrix. Based on grey relational analysis (GRA). Finally, we presented three possible versions of the future of asteroid mining by changing the conditions. We propose two sets of corresponding policies for changes in future trends in global fairness with asteroid mining. We test the separate and combined effects of these policies and find that they are positive, strongly supporting the effectiveness of our model.

physics.soc-ph↗

arXiv2023

Revive, Restore, Revitalize: An Eco-economic Methodology for Maasai Mara

The Maasai Mara in Kenya, renowned for its biodiversity, is witnessing ecosystem degradation and species endangerment due to intensified human activities. Addressing this, we introduce a dynamic system harmonizing ecological and human priorities. Our agent-based model replicates the Maasai Mara savanna ecosystem, incorporating 71 animal species, 10 human classifications, and 2 natural resource types. The model employs the metabolic rate-mass relationship for animal energy dynamics, logistic curves for animal growth, individual interactions for food web simulation, and human intervention impacts. Algorithms like fitness proportional selection and particle swarm mimic organism preferences for resources. To guide preservation activities, we formulated 21 management strategies encompassing tourism, transportation, taxation, environmental conservation, research, diplomacy, and poaching, employing a game-theoretic framework. Using the TOPSIS method, we prioritized four key developmental indicators: environmental health, research advancement, economic growth, and security. The interplay of 16 factors determines these indicators, each influenced by our policies to varying degrees. By evaluating the policies' repercussions, we aim to mitigate adverse animal-human interactions and equitably address human concerns. We classified the policy impacts into three categories: Environmental Preservation, Economic Prosperity, and Holistic Development. By applying these policy groupings to our ecosystem model, we tracked the effects on the intricate animal-human-resource dynamics. Utilizing the entropy weight method, we assessed the efficacy of these policy clusters over a decade, identifying the optimal blend emphasizing both environmental conservation and economic progression.

q-bio.PE↗