Searcharxiv⌕ Search

arXiv subjects

Wei Sun

Publications and source records attributed to Wei Sun.

At least 397 records · Page 22Linked to original sources

Learning to Zoom-in via Learning to Zoom-out: Real-world Super-resolution by Generating and Adapting Degradation

Most learning-based super-resolution (SR) methods aim to recover high-resolution (HR) image from a given low-resolution (LR) image via learning on LR-HR image pairs. The SR methods learned on synthetic data do not perform well in real-world, due to the domain gap between the artificially synthesized and real LR images. Some efforts are thus taken to capture real-world image pairs. The captured LR-HR image pairs usually suffer from unavoidable misalignment, which hampers the performance of end-to-end learning, however. Here, focusing on the real-world SR, we ask a different question: since misalignment is unavoidable, can we propose a method that does not need LR-HR image pairing and alignment at all and utilize real images as they are? Hence we propose a framework to learn SR from an arbitrary set of unpaired LR and HR images and see how far a step can go in such a realistic and "unsupervised" setting. To do so, we firstly train a degradation generation network to generate realistic LR images and, more importantly, to capture their distribution (i.e., learning to zoom out). Instead of assuming the domain gap has been eliminated, we minimize the discrepancy between the generated data and real data while learning a degradation adaptive SR network (i.e., learning to zoom in). The proposed unpaired method achieves state-of-the-art SR results on real-world images, even in the datasets that favor the paired-learning methods more.

eess.IV↗

The complement value problem for a class of second order elliptic integro-differential operators

We consider the complement value problem for a class of second order elliptic integro-differential operators. Let $D$ be a bounded Lipschitz domain of $\mathbb{R}^d$. Under mild conditions, we show that there exists a unique bounded continuous weak solution to the following equation $$ \left\{\begin{array}{l}(Δ+a^αΔ^{α/2}+b\cdot\nabla+c+{\rm div} \hat{b})u+f=0\ \ {\rm in}\ D,\\ u=g\ \ {\rm on}\ D^c. \end{array}\right.$$ Moreover, we give an explicit probabilistic representation of the solution. The recently developed stochastic calculus for Markov processes associated with semi-Dirichlet forms and heat kernel estimates play important roles in our approach.

math.PR↗

Complexity growth rate, grand potential and partition function

We examine the complexity/volume conjecture and further investigate the possible connections between complexity and partition function. The complexity/volume 2.0 states that the complexity growth rate $\mathcal{\dot{C}}\sim PV$. In the standard statistics, there is a fundamental relation among $PV$, the grand potential $Ω$ and the partition function $\mathcal{Z}$. By using this relation, we are able to construct an ansatz between complexity and partition function. The complexity/partition function relation is then utilized to study the complexity of the thermofield double state of extended SYK models for various conditions. The relation between complexity growth rate and black hole phase transition is also discussed.

hep-th↗

The complement value problem for non-local operators

Let $D$ be a bounded Lipschitz domain of $\mathbb{R}^d$. We consider the complement value problem $$ \left\{\begin{array}{l}(Δ+a^αΔ^{α/2}+b\cdot\nabla+c)u+f=0\ \ {\rm in}\ D,\\ u=g\ \ {\rm on}\ D^c. \end{array}\right.$$ Under mild conditions, we show that there exists a unique bounded continuous weak solution. Moreover, we give an explicit probabilistic representation of the solution. The theory of semi-Dirichlet forms and heat kernel estimates play an important role in our approach.

math.PR↗

Cracking In-Memory Database Index A Case Study for Adaptive Radix Tree Index

Indexes provide a method to access data in databases quickly. It can improve the response speed of subsequent queries by building a complete index in advance. However, it also leads to a huge overhead of the continuous updating during creating the index. An in-memory database usually has a higher query processing performance than disk databases and is more suitable for real-time query processing. Therefore, there is an urgent need to reduce the index creation and update cost for in-memory databases. Database cracking technology is currently recognized as an effective method to reduce the index initialization time. However, conventional cracking algorithms are focused on simple column data structure rather than those complex index structure for in-memory databases. In order to show the feasibility of in-memory database index cracking and promote to future more extensive research, this paper conducted a case study on the Adaptive Radix Tree (ART), a popular tree index structure of in-memory databases. On the basis of carefully examining the ART index construction overhead, an algorithm using auxiliary data structures to crack the ART index is proposed.

cs.DB↗

XMM-Newton RGS spectroscopy of the M31 bulge. I: Evidences for a past AGN half a million years ago

Existing analysis based on XMM-Newton/RGS spectra already shows that the G-ratio of the OVII He$α$ triplet in the inner bulge of M31 is too high to be consistent with a pure optically thin thermal plasma in collisional ionization equilibrium (CIE). Different processes that may affect properties of diffuse hot plasma were proposed, such as resonance scattering (RS) and charge exchange (CX) with cold gas. To determine which physical process(es) may be responsible for this inconsistency, we present a systematic spectroscopic analysis based on 0.8 Ms XMM-Newton/RGS data, together with complementary Chandra/ACIS-S images. The combination of these data enables us to reveal multiple non-CIE spectroscopic diagnostics, including but not limited to the large G-ratios of He$α$ triplets (OVII, NVI, and NeIX) and the high Lyman series line ratios (OVIII Ly$β$/Ly$α$ and Ly$γ$/Ly$α$, and NVII Ly$β$/Ly$α$), which are not expected for a CIE plasma, and the high iron line ratios (FeXVIII 14.2 Å/FeXVII~17 Åand FeXVII~15 Å/17 Å), which suggest much higher temperatures than other line ratios, as well as their spatial variations. Neither CX nor RS explains all these spectroscopic diagnostics satisfactorily. Alternatively, we find that an active galactic nucleus (AGN) relic scenario provides a plausible explanation for virtually all the signatures. We estimate that an AGN was present at the center of M31 about half a million years ago and that the initial ionization parameter $ξ$ of the relic plasma is in the range of 3-4.

astro-ph.GA↗

Making Predictive Coding Networks Generative

Predictive coding (PC) networks are a biologically interesting class of neural networks. Their layered hierarchy mimics the reciprocal connectivity pattern observed in the mammalian cortex, and they can be trained using local learning rules that approximate backpropagation [Bogacz, 2017]. However, despite having feedback connections that enable information to flow down the network hierarchy, discriminative PC networks are not generative. Clamping the output class and running the network to equilibrium yields an input sample that typically does not resemble the training input. This paper studies this phenomenon, and proposes a simple solution that promotes the generation of input samples that resemble the training inputs. Simple decay, a technique already in wide use in neural networks, pushes the PC network toward a unique minimum 2-norm solution, and that unique solution provably (for linear networks) matches the training inputs. The method also vastly improves the samples generated for nonlinear networks, as we demonstrate on MNIST.

cs.NE↗

Some explorations on two conjectures about Rademacher sequences

In this paper, we explore two conjectures about Rademacher sequences. Let $(ε_i)$ be a Rademacher sequence, i.e., a sequence of independent $\{-1,1\}$-valued symmetric random variables. Set $S_n=a_1ε_1+\cdots+a_nε_n$ for $a=(a_1,\dots,a_n)\in \mathbb{R}^n$. The first conjecture says that $P\ (\ |S_n\ |\leq \|a\|\ )\geq\frac{1}{2}$ for all $a\in \mathbb{R}^n$ and $n\in \mathbb{N}$. The second conjecture says that $P\ (\ |S_n\ |\geq\|a\|\ )\geq \frac{7}{32}$ for all $a\in \mathbb{R}^n$ and $n\in \mathbb{N}$. Regarding the first conjecture, we present several new equivalent formulations. These include a topological view, a combinatorial version and a strengthened version of the conjecture. Regarding the second conjecture, we prove that it holds true when $n\leq 7$.

math.PR↗

AF-DCGAN: Amplitude Feature Deep Convolutional GAN for Fingerprint Construction in Indoor Localization Systems

With widely deployed WiFi network and the uniqueness feature (fingerprint) of wireless channel information, fingerprinting based WiFi positioning is currently the mainstream indoor positioning method, in which fingerprint database construction is crucial. However, for accuracy, this approach requires enough data to be sampled at many reference points, which consumes excessive efforts and time. In this paper, we collect Channel State Information (CSI) data at reference points by the method of device-free localization, then we convert collected CSI data into amplitude feature maps and extend the fingerprint database using the proposed Amplitude-Feature Deep Convolutional Generative Adversarial Network (AF-DCGAN) model. The use of AF-DCGAN accelerates convergence during the training phase, and substantially increases the diversity of the CSI amplitude feature map. The extended fingerprint database both reduces the human effort involved in fingerprint database construction and the accuracy of an indoor localization system, as demonstrated in the experiments.

cs.NI↗

Pose Guided Fashion Image Synthesis Using Deep Generative Model

Generating a photorealistic image with intended human pose is a promising yet challenging research topic for many applications such as smart photo editing, movie making, virtual try-on, and fashion display. In this paper, we present a novel deep generative model to transfer an image of a person from a given pose to a new pose while keeping fashion item consistent. In order to formulate the framework, we employ one generator and two discriminators for image synthesis. The generator includes an image encoder, a pose encoder and a decoder. The two encoders provide good representation of visual and geometrical context which will be utilized by the decoder in order to generate a photorealistic image. Unlike existing pose-guided image generation models, we exploit two discriminators to guide the synthesis process where one discriminator differentiates between generated image and real images (training samples), and another discriminator verifies the consistency of appearance between a target pose and a generated image. We perform end-to-end training of the network to learn the parameters through back-propagation given ground-truth images. The proposed generative model is capable of synthesizing a photorealistic image of a person given a target pose. We have demonstrated our results by conducting rigorous experiments on two data sets, both quantitatively and qualitatively.

cs.CV↗

A low-energy compact Shanghai-Wuhan electron beam ion trap for extraction of highly charged ions

A low-energy, compact and superconducting electron beam ion trap (the Shanghai-Wuhan EBIT or SW-EBIT) for extraction of highly charged ions is presented. The magnetic field in the central drift tube of the SW-EBIT is approximately 0.21 T produced by a pair of high-temperature superconducting coils. The electron-beam energy of the SW-EBIT is in the range of 30-4000 eV, and the maximum electron-beam current is up to 9 mA. Acting as a source of highly charged ions, the ion-beam optics for extraction is integrated, including an ion extractor and an einzel lens. A Wien filter is then used to measure the charge-state distribution of the extracted ions. In this work, the tungsten ions below the charge state of 15 have been produced, extracted, and analyzed. The charge-state distributions and spectra in the range of 530-580 nm of tungsten ions have been measured simultaneously with the electron-beam energy of 279 eV and 300 eV, which preliminarily indicates that the 549.9 nm line comes from $W^{14+}$.

physics.atom-ph↗

Image Synthesis From Reconfigurable Layout and Style

Despite remarkable recent progress on both unconditional and conditional image synthesis, it remains a long-standing problem to learn generative models that are capable of synthesizing realistic and sharp images from reconfigurable spatial layout (i.e., bounding boxes + class labels in an image lattice) and style (i.e., structural and appearance variations encoded by latent vectors), especially at high resolution. By reconfigurable, it means that a model can preserve the intrinsic one-to-many mapping from a given layout to multiple plausible images with different styles, and is adaptive with respect to perturbations of a layout and style latent code. In this paper, we present a layout- and style-based architecture for generative adversarial networks (termed LostGANs) that can be trained end-to-end to generate images from reconfigurable layout and style. Inspired by the vanilla StyleGAN, the proposed LostGAN consists of two new components: (i) learning fine-grained mask maps in a weakly-supervised manner to bridge the gap between layouts and images, and (ii) learning object instance-specific layout-aware feature normalization (ISLA-Norm) in the generator to realize multi-object style generation. In experiments, the proposed method is tested on the COCO-Stuff dataset and the Visual Genome dataset with state-of-the-art performance obtained. The code and pretrained models are available at \url{https://github.com/iVMCL/LostGANs}.

cs.CV↗

Hunt's Hypothesis (H) for Markov Processes: Survey and Beyond

The goal of this paper is threefold. First, we survey the existing results on Hunt's hypothesis (H) for Markov processes and Getoor's conjecture for Lévy processes. Second, we investigate (H) for multidimensional Lévy processes from the viewpoints of projections and energy, respectively. Third, we present a few open questions for further study.

math.PR↗

3D Virtual Garment Modeling from RGB Images

We present a novel approach that constructs 3D virtual garment models from photos. Unlike previous methods that require photos of a garment on a human model or a mannequin, our approach can work with various states of the garment: on a model, on a mannequin, or on a flat surface. To construct a complete 3D virtual model, our approach only requires two images as input, one front view and one back view. We first apply a multi-task learning network called JFNet that jointly predicts fashion landmarks and parses a garment image into semantic parts. The predicted landmarks are used for estimating sizing information of the garment. Then, a template garment mesh is deformed based on the sizing information to generate the final 3D model. The semantic parts are utilized for extracting color textures from input images. The results of our approach can be used in various Virtual Reality and Mixed Reality applications.

cs.CV↗

Products of Conditional Expectation Operators: Convergence and Divergence

In this paper, we investigate the convergence of products of conditional expectation operators. We show that if $(Ω,\cal{F},P)$ is a probability space that is not purely atomic, then divergent sequences of products of conditional expectation operators involving 3 or 4 sub-$σ$-fields of $\cal{F}$ can be constructed for a large class of random variables in $L^2(Ω,\cal{F},P)$. This settles in the negative a long-open conjecture. On the other hand, we show that if $(Ω,\cal{F},P)$ is a purely atomic probability space, then products of conditional expectation operators involving any finite set of sub-$σ$-fields of $\cal{F}$ must converge for all random variables in $L^1(Ω,\cal{F},P)$.

math.PR↗

A support vector regression-based multi-fidelity surrogate model

Computational simulations with different fidelity have been widely used in engineering design. A high-fidelity (HF) model is generally more accurate but also more time-consuming than an low-fidelity (LF) model. To take advantages of both HF and LF models, multi-fidelity surrogate models that aim to integrate information from both HF and LF models have gained increasing popularity. In this paper, a multi-fidelity surrogate model based on support vector regression named as Co_SVR is developed by combining HF and LF models. In Co_SVR, a kernel function is used to map the map the difference between the HF and LF models. Besides, a heuristic algorithm is used to obtain the optimal parameters of Co_SVR. The proposed Co_SVR is compared with two popular multi-fidelity surrogate models Co_Kriging model, Co_RBF model, and their single-fidelity surrogates through several numerical cases and a pressure vessel design problem. The results show that Co_SVR provides competitive prediction accuracy for numerical cases, and presents a better performance compared with the Co_Kriging and Co_RBF models and single-fidelity surrogate models.

stat.ML↗

Periodic solutions of stochastic differential equations driven by Levy noises

In this paper, we first show the well-posedness of the SDEs driven by Lévy noises under mild conditions. Then, we consider the existence and uniqueness of periodic solutions of the SDEs. To establish the ergodicity and uniqueness of periodic solutions, we investigate the strong Feller property and the irreducibility of the corresponding time-inhomogeneous semigroups when both small and large jumps are allowed in the equations. Some examples are presented to illustrate our results.

math.PR↗

Interpretable Spatio-temporal Attention for Video Action Recognition

Inspired by the observation that humans are able to process videos efficiently by only paying attention where and when it is needed, we propose an interpretable and easy plug-in spatial-temporal attention mechanism for video action recognition. For spatial attention, we learn a saliency mask to allow the model to focus on the most salient parts of the feature maps. For temporal attention, we employ a convolutional LSTM based attention mechanism to identify the most relevant frames from an input video. Further, we propose a set of regularizers to ensure that our attention mechanism attends to coherent regions in space and time. Our model not only improves video action recognition accuracy, but also localizes discriminative regions both spatially and temporally, despite being trained in a weakly-supervised manner with only classification labels (no bounding box labels or time frame temporal labels). We evaluate our approach on several public video action recognition datasets with ablation studies. Furthermore, we quantitatively and qualitatively evaluate our model's ability to localize discriminative regions spatially and critical frames temporally. Experimental results demonstrate the efficacy of our approach, showing superior or comparable accuracy with the state-of-the-art methods while increasing model interpretability.

cs.CV↗