arXiv subjects

Bowen Huang

Publications and source records attributed to Bowen Huang.

51 records · Page 3Linked to original sources

arXiv2023

Improvement of the Pan-STARRS Photometric Calibration with LAMOST and Gaia

In this work, we perform the re-calibration of PS1 photometry by correcting for position-dependent systematic errors using the spectroscopy-based Stellar Color Regression method (SCR), the photometry-based SCR method (SCR$'$), and the Gaia XP synthetic photometry method (XPSP). We confirm the significant large-scale and small-scale spatial variation of magnitude offsets for all the $grizy$ filters. We show that the PS1 photometric calibration precisions in the $grizy$ filters are around 5--7\,mmag when averaged over 14$'$ regions. We note a much larger calibration error up to 0.04 mag in the Galactic plane, which is probably caused by the systematic errors of the PS1 magnitudes in crowded fields. The results of the three methods are consistent with each other within 1--2\,mmag or better for all the filters. We provide two-dimensional maps and a python package ({\url{https://doi.org/10.12149/101283}}) to correct for position-dependent magnitude offsets of PS1, which can be used for high-precision investigations and as a reference to calibrate other surveys.

astro-ph.IM↗

arXiv2023

Photometric calibration of the Stellar Abundance and Galactic Evolution Survey (SAGES): Nanshan One-meter Wide-field Telescope g, r, and i band imaging data

In this paper, a total of approximately 2.6 million dwarfs were constructed as standard stars, with an accuracy of about 0.01-0.02 mag for each band, by combining spectroscopic data from the Large Sky Area Multi-Object Fiber Spectroscopic Telescope Data Release 7, photometric data from the corrected Gaia Early Data Release 3, and photometric metallicities. Using the spectroscopy based stellar color regression method (SCR method) and the photometric-based SCR method (SCR' method), we performed the relative calibration of the Nanshan One-meter Wide-field Telescope imaging data. Based on the corrected Pan-STARRS DR1 photometry, the absolute calibration was also performed. In the photometric calibration process, we analyzed the dependence of the calibration zero points on different images (observation time), different gates of the CCD detector, and different CCD positions. We found that the stellar flat and the relative gain between different gates depend on time. The amplitude of gain variation in three channels is approximately 0.5%-0.7% relative to the other channel, with a maximum value of 4%. In addition, significant spatial variations of the stellar flat fitting residual are found and corrected. Using repeated sources in the adjacent images, we checked and discovered internal consistency of about 1-2 mmag in all the filters. Using the PS1 magnitudes synthesized by Gaia DR3 BP/RP spectra by the synthetic photometry method, we found that the photometric calibration uniformity is about 1-2 mmag for all the bands, at a spatial resolution of 1.3 degree. A detailed comparison between the spectroscopy-based SCR and photometric-based SCR method magnitude offsets was performed, and we achieved an internal consistency precision of about 2 mmag or better with resolutions of 1.3 degree for all the filters. Which is mainly from the position-dependent errors of the E(B-V) used in SCR' method.

astro-ph.SR↗

arXiv2022

Photometric calibration methods for wide-field photometric surveys

Uniform and accurate photometric calibration plays an important role in the current and next-generation wide-field imaging surveys. Herein, we review the modern photometric calibration methods, including the classic standard star method, "hardware/observation-driven" methods (such as the Ubercalibration, Hypercalibration, and Forward Global Calibration Methods), and "software/physics-driven" methods (e.g., the Stellar Locus Regression, Stellar Locus, and Stellar Color Regression Methods). Further, we discuss their advantages, limitations, and future developments toward millimagnitude precision calibration.

astro-ph.IM↗

arXiv2022

Leaky Frontends: Security Vulnerabilities in Processor Frontends

This paper evaluates new security threats due to the processor frontend in modern Intel processors. The root causes of the security threats are the multiple paths in the processor frontend that the micro-operations can take: through the Micro-Instruction Translation Engine (MITE), through the Decode Stream Buffer (DSB), also called the Micro-operation Cache, or through the Loop Stream Detector (LSD). Each path has its own unique timing and power signatures, which lead to the side- and covert-channel attacks presented in this work. Especially, the switching between the different paths leads to observable timing or power differences which, as this work demonstrates, could be exploited by attackers. Because of the different paths, the switching, and way the components are shared in the frontend between hardware threads, two separate threads are able to be mutually influenced and timing or power can reveal activity on the other thread. The security threats are not limited to multi-threading, and this work further demonstrates new ways for leaking execution information about SGX enclaves or a new in-domain Spectre variant in single-thread setting. Finally, this work demonstrates a new method for fingerprinting the microcode patches of the processor by analyzing the behavior of different paths in the frontend. The findings of this work highlight the security threats associated with the processor frontend and the need for deployment of defenses for the modern processor frontend.

cs.CR↗

arXiv2021

Photometric recalibration of the SDSS Stripe 82 to a few milimagnitude precision with the stellar color regression method and Gaia EDR3

By combining spectroscopic data from the LAMOST DR7, SDSS DR12, and corrected photometric data from the Gaia EDR3, we apply the Stellar Color Regression (SCR; Yuan et al. 2015a) method to recalibrate the SDSS Stripe 82 standard stars catalog of Ivezić et al. (2007). With a total number of about 30,000 spectroscopically targeted stars, we have mapped out the relatively large and strongly correlated photometric zero-point errors present in the catalog, $\sim$2.5 per cent in the $u$ band and $\sim$ 1 per cent in the $griz$ bands. Our study also confirms some small but significant magnitude dependence errors in the $z$ band for some charge-coupled devices. Various tests show that we have achieved an internal precision of about 5 mmag in the $u$ band and about 2 mmag in the $griz$ bands, which is about 5 times better than previous results. We also apply the method to the latest version of the catalog (V4.2; Thanjavur et al. 2021), and find modest systematic calibration errors up to $\sim$ 1 per cent along the R.A. direction and smaller errors along the Dec. direction. The results demonstrate the power of the SCR method when combining spectroscopic data and Gaia photometry in breaking the 1 percent precision barrier of ground-based photometric surveys. Our work paves the way for the re-calibration of the whole SDSS photometric survey and has important implications for the calibration of future surveys. Future implementations and improvements of the SCR method under different situations are also discussed.

astro-ph.IM↗

arXiv2021

CSMCNet: Scalable Video Compressive Sensing Reconstruction with Interpretable Motion Estimation

Most deep network methods for compressive sensing reconstruction suffer from the black-box characteristic of DNN. In this paper, a deep neural network with interpretable motion estimation named CSMCNet is proposed. The network is able to realize high-quality reconstruction of video compressive sensing by unfolding the iterative steps of optimization based algorithms. A DNN based, multi-hypothesis motion estimation module is designed to improve the reconstruction quality, and a residual module is employed to further narrow down the gap between re-construction results and original signal in our proposed method. Besides, we propose an interpolation module with corresponding training strategy to realize scalable CS reconstruction, which is capable of using the same model to decode various compression ratios. Experiments show that a PSNR of 29.34dB can be achieved at 2% CS ratio (compressed by 98%), which is superior than other state-of-the-art methods. Moreover, the interpolation module is proved to be effective, with significant cost saving and acceptable performance losses.

eess.IV↗

arXiv2021

A Power and Area Efficient Lepton Hardware Encoder with Hash-based Memory Optimization

Although it has been surpassed by many subsequent coding standards, JPEG occupies a large share of the storage load of the current data hosting service. To reduce the storage costs, DropBox proposed a lossless secondary compression algorithm, Lepton, to further improve the compression rate of JPEG images. However, the bloated probability models defined by Lepton severely restrict its throughput and energy efficiency. To solve this problem, we construct an efficient access probability-based hash function for the probability models, and then propose a hardware-friendly memory optimization method by combining the proposed hash function and the N-way Set-Associative unit. After that, we design a highly parameterized hardware structure for the probability models and finally implement a power and area efficient Lepton hardware encoder. To the best of our knowledge, this is the first hardware implementation of Lepton. The synthesis result shows that the proposed hardware structure reduces the total area of the probability models by 70.97%. Compared with DropBox's software solution, the throughput and the energy efficiency of the proposed Lepton hardware encoder are increased by 55.25 and 4899 times respectively. In terms of manufacturing cost, the proposed Lepton hardware encoder is also significantly lower than the general-purpose CPU used by DropBox.

cs.MM↗

arXiv2021

A Convex Approach to Data-driven Optimal Control via Perron-Frobenius and Koopman Operators

The paper is about the data-driven computation of optimal control for a class of control affine deterministic nonlinear systems. We assume that the control dynamical system model is not available, and the only information about the system dynamics is available in the form of time-series data. We provide a convex formulation for the optimal control problem of the nonlinear system. The convex formulation relies on the duality result in the dynamical system's stability theory involving density function and Perron-Frobenius operator. We formulate the optimal control problem as an infinite-dimensional convex optimization program. The finite-dimensional approximation of the optimization problem relies on the recent advances made in the Koopman operator's data-driven computation, which is dual to the Perron-Frobenius operator. Simulation results are presented to demonstrate the application of the developed framework.

math.OC↗

arXiv2020

CS-MCNet:A Video Compressive Sensing Reconstruction Network with Interpretable Motion Compensation

In this paper, a deep neural network with interpretable motion compensation called CS-MCNet is proposed to realize high-quality and real-time decoding of video compressive sensing. Firstly, explicit multi-hypothesis motion compensation is applied in our network to extract correlation information of adjacent frames(as shown in Fig. 1), which improves the recover performance. And then, a residual module further narrows down the gap between reconstruction result and original signal. The overall architecture is interpretable by using algorithm unrolling, which brings the benefits of being able to transfer prior knowledge about the conventional algorithms. As a result, a PSNR of 22dB can be achieved at 64x compression ratio, which is about 4% to 9% better than state-of-the-art methods. In addition, due to the feed-forward architecture, the reconstruction can be processed by our network in real time and up to three orders of magnitude faster than traditional iterative methods.

eess.IV↗

arXiv2019

Data-driven Identification and Prediction of Power System Dynamics Using Linear Operators

In this paper, we propose linear operator theoretic framework involving Koopman operator for the data-driven identification of power system dynamics. We explicitly account for noise in the time series measurement data and propose robust approach for data-driven approximation of Koopman operator for the identification of nonlinear power system dynamics. The identified model is used for the prediction of state trajectories in the power system. The application of the framework is illustrated using an IEEE nine bus test system.

eess.SP↗

arXiv2019

Data-Driven Nonlinear Stabilization Using Koopman Operator

We propose the application of Koopman operator theory for the design of stabilizing feedback controller for a nonlinear control system. The proposed approach is data-driven and relies on the use of time-series data generated from the control dynamical system for the lifting of a nonlinear system in the Koopman eigenfunction coordinates. In particular, a finite-dimensional bilinear representation of a control-affine nonlinear dynamical system is constructed in the Koopman eigenfunction coordinates using time-series data. Sample complexity results are used to determine the data required to achieve the desired level of accuracy for the approximate bilinear representation of the nonlinear system in Koopman eigenfunction coordinates. A control Lyapunov function-based approach is proposed for the design of stabilizing feedback controller, and the principle of inverse optimality is used to comment on the optimality of the designed stabilizing feedback controller for the bilinear system. A systematic convex optimization-based formulation is proposed for the search of control Lyapunov function. Several numerical examples are presented to demonstrate the application of the proposed data-driven stabilization approach.

math.OC↗

arXiv2018

Feedback Stabilization Using Koopman Operator

In this paper, we provide a systematic approach for the design of stabilizing feedback controllers for nonlinear control systems using the Koopman operator framework. The Koopman operator approach provides a linear representation for a nonlinear dynamical system and a bilinear representation for a nonlinear control system. The problem of feedback stabilization of a nonlinear control system is then transformed to the stabilization of a bilinear control system. We propose a control Lyapunov function (CLF)-based approach for the design of stabilizing feedback controllers for the bilinear system. The search for finding a CLF for the bilinear control system is formulated as a convex optimization problem. This leads to a schematic procedure for designing CLF-based stabilizing feedback controllers for the bilinear system and hence the original nonlinear system. Another advantage of the proposed controller design approach outlined in this paper is that it does not require explicit knowledge of system dynamics. In particular, the bilinear representation of a nonlinear control system in the Koopman eigenfunction space can be obtained from time-series data. Simulation results are presented to verify the main results on the design of stabilizing feedback controllers and the data-driven aspect of the proposed approach.

math.OC↗

arXiv2018

Data-Driven Optimal Control Using Perron-Frobenius Operator

In this paper, we propose a data-driven approach for control of nonlinear dynamical systems. The proposed data-driven approach relies on transfer Koopman and Perron-Frobenius (P-F) operators for linear representation and control of such systems. Systematic model-based frameworks involving linear transfer P-F operator were proposed for almost everywhere stability analysis and control design of a nonlinear dynamical system in previous works [1-3]. Lyapunov measure can be used as a tool to provide linear programming-based computational framework for stability analysis and almost everywhere stabilizing control design of a nonlinear system. In this paper, we show that those frameworks can be extended to a data-driven setting, where the finite dimensional approximation of linear transfer P-F operator and stabilizing feedback controller can be obtained from time-series data. We exploit the positivity and Markov property of these operators and their finite-dimensional approximation to provide {\it linear programming} based approach for designing an optimally stabilizing feedback controller.

eess.SY↗

arXiv2017

Data-Driven Approximation of Transfer Operators: Naturally Structured Dynamic Mode Decomposition

In this paper, we provide a new algorithm for the finite dimensional approximation of the linear transfer Koopman and Perron-Frobenius operator from time series data. We argue that existing approach for the finite dimensional approximation of these transfer operators such as Dynamic Mode Decomposition (DMD) and Extended Dynamic Mode Decomposition (EDMD) do not capture two important properties of these operators, namely positivity and Markov property. The algorithm we propose in this paper preserve these two properties. We call the proposed algorithm as naturally structured DMD since it retains the inherent properties of these operators. Naturally structured DMD algorithm leads to a better approximation of the steady-state dynamics of the system regarding computing Koopman and Perron- Frobenius operator eigenfunctions and eigenvalues. However preserving positivity properties is critical for capturing the real transient dynamics of the system. This positivity of the transfer operators and it's finite dimensional approximation also has an important implication on the application of the transfer operator methods for controller and estimator design for nonlinear systems from time series data.

math.DS↗

arXiv2012

A Spatial Model of City Growth and Formation

We introduce a model in which city populations grow at rates proportional to the area of their "sphere of influence", where the influence of a city depends on its population (to power α) and distance from city (to power -β) and where new cities arise according to a certain random rule. A simple non-rigorous analysis of asymptotics indicates that for β> 2α$ the system exhibits "balanced growth" in which there are an increasing number of large cities, whose populations have the same order of magnitude, whereas for β< 2α$ the system exhibits "unbalanced growth" in which a few cities capture most of the total population. Conceptually the model is best regarded as a spatial analog of the combinatorial "Chinese restaurant process".

physics.soc-ph↗