arXiv subjects

Hao Sheng

Publications and source records attributed to Hao Sheng.

28 records · Page 2Linked to original sources

arXiv2020

Short-Term Solar Irradiance Forecasting Using Calibrated Probabilistic Models

Advancing probabilistic solar forecasting methods is essential to supporting the integration of solar energy into the electricity grid. In this work, we develop a variety of state-of-the-art probabilistic models for forecasting solar irradiance. We investigate the use of post-hoc calibration techniques for ensuring well-calibrated probabilistic predictions. We train and evaluate the models using public data from seven stations in the SURFRAD network, and demonstrate that the best model, NGBoost, achieves higher performance at an intra-hourly resolution than the best benchmark solar irradiance forecasting model across all stations. Further, we show that NGBoost with CRUDE post-hoc calibration achieves comparable performance to a numerical weather prediction model on hourly-resolution forecasting.

cs.LG↗

arXiv2020

Effective Data Fusion with Generalized Vegetation Index: Evidence from Land Cover Segmentation in Agriculture

How can we effectively leverage the domain knowledge from remote sensing to better segment agriculture land cover from satellite images? In this paper, we propose a novel, model-agnostic, data-fusion approach for vegetation-related computer vision tasks. Motivated by the various Vegetation Indices (VIs), which are introduced by domain experts, we systematically reviewed the VIs that are widely used in remote sensing and their feasibility to be incorporated in deep neural networks. To fully leverage the Near-Infrared channel, the traditional Red-Green-Blue channels, and Vegetation Index or its variants, we propose a Generalized Vegetation Index (GVI), a lightweight module that can be easily plugged into many neural network architectures to serve as an additional information input. To smoothly train models with our GVI, we developed an Additive Group Normalization (AGN) module that does not require extra parameters of the prescribed neural networks. Our approach has improved the IoUs of vegetation-related classes by 0.9-1.3 percent and consistently improves the overall mIoU by 2 percent on our baseline.

cs.CV↗

arXiv2020

The 1st Agriculture-Vision Challenge: Methods and Results

The first Agriculture-Vision Challenge aims to encourage research in developing novel and effective algorithms for agricultural pattern recognition from aerial images, especially for the semantic segmentation task associated with our challenge dataset. Around 57 participating teams from various countries compete to achieve state-of-the-art in aerial agriculture semantic segmentation. The Agriculture-Vision Challenge Dataset was employed, which comprises of 21,061 aerial and multi-spectral farmland images. This paper provides a summary of notable methods and results in the challenge. Our submission server and leaderboard will continue to open for researchers that are interested in this challenge dataset and task; the link can be found here.

cs.CV↗

arXiv2020

PIV-Based 3D Fluid Flow Reconstruction Using Light Field Camera

Particle Imaging Velocimetry (PIV) estimates the flow of fluid by analyzing the motion of injected particles. The problem is challenging as the particles lie at different depths but have similar appearance and tracking a large number of particles is particularly difficult. In this paper, we present a PIV solution that uses densely sampled light field to reconstruct and track 3D particles. We exploit the refocusing capability and focal symmetry constraint of the light field for reliable particle depth estimation. We further propose a new motion-constrained optical flow estimation scheme by enforcing local motion rigidity and the Navier-Stoke constraint. Comprehensive experiments on synthetic and real experiments show that using a single light field camera, our technique can recover dense and accurate 3D fluid flows in small to medium volumes.

cs.CV↗

arXiv2019

Online Measurement-Based Estimation of Dynamic System State Matrix in Ambient Conditions

In this paper, a purely measurement-based method is proposed to estimate the dynamic system state matrix by applying the regression theorem of the multivariate Ornstein-Uhlenbeck process. The proposed method employs a recursive algorithm to minimize the required computational effort, making it applicable to the real-time environment. One main advantage of the proposed method is model independence, i.e., it is independent of the network model and the dynamic model of generators. Among various applications of the estimated matrix, detecting and locating unexpected network topology change is illustrated in details. Simulation studies have shown that the proposed measurement-based method can provide an accurate and efficient estimation of the dynamic system state matrix under the occurrence of unexpected topology change. Besides, various implementation conditions are tested to show that the proposed method can provide accurate approximation despite measurement noise, missing PMUs, and the implementation of higher-order generator models with control devices.

eess.SP↗

arXiv2019

Generic Multiview Visual Tracking

Recent progresses in visual tracking have greatly improved the tracking performance. However, challenges such as occlusion and view change remain obstacles in real world deployment. A natural solution to these challenges is to use multiple cameras with multiview inputs, though existing systems are mostly limited to specific targets (e.g. human), static cameras, and/or camera calibration. To break through these limitations, we propose a generic multiview tracking (GMT) framework that allows camera movement, while requiring neither specific object model nor camera calibration. A key innovation in our framework is a cross-camera trajectory prediction network (TPN), which implicitly and dynamically encodes camera geometric relations, and hence addresses missing target issues such as occlusion. Moreover, during tracking, we assemble information across different cameras to dynamically update a novel collaborative correlation filter (CCF), which is shared among cameras to achieve robustness against view change. The two components are integrated into a correlation filter tracking framework, where the features are trained offline using existing single view tracking datasets. For evaluation, we first contribute a new generic multiview tracking dataset (GMTD) with careful annotations, and then run experiments on GMTD and the PETS2009 datasets. On both datasets, the proposed GMT algorithm shows clear advantages over state-of-the-art ones.

cs.CV↗

arXiv2019

Probabilistic Power Flow Calculation using Non-intrusive Low-rank Approximation Method

In this paper, a novel non-intrusive probabilistic power flow (PPF) analysis method based on the low-rank approximation (LRA) is proposed, which can accurately and efficiently estimate the probabilistic characteristics (e.g., mean, variance, probability density function) of the PPF solutions. This method aims at building up a statistically-equivalent surrogate for the PPF solutions through a small number of power flow evaluations. By exploiting the retained tensor-product form of the univariate polynomial basis, a sequential correction-updating scheme is applied, making the total number of unknowns to be linear rather than exponential to the number of random inputs. Consequently, the LRA method is particularly promising for dealing with high-dimensional problems with a large number of random inputs. Numerical studies on the IEEE 39-bus, 118-bus, and 1354-bus systems show that the proposed method can achieve accurate probabilistic characteristics of the PPF solutions with much less computational effort compared to the Monte Carlo simulations. Even compared to the polynomial chaos expansion method, the LRA method can achieve comparable accuracy, while the LRA method is more capable of handling higher-dimensional problems. Moreover, numerical results reveal that the randomness brought about by the renewable energy resources and loads may inevitably affect the feasibility of dispatch/planning schemes.

eess.SP↗

arXiv2018

A Non-Intrusive Low-Rank Approximation Method for Assessing the Probabilistic Available Transfer Capability

In this paper, a mathematical formulation of the probabilistic available transfer capability (PATC) problem is proposed to incorporate uncertainties from the large-scale renewable energy generation (e.g., wind farms and solar PV power plants). Moreover, a novel non-intrusive low-rank approximation (LRA) is developed to assess PATC, which can accurately and efficiently estimate the probabilistic characteristics (e.g., mean, variance, probability density function (PDF)) of the PATC. Numerical studies on the IEEE 24-bus reliability test system (RTS) and IEEE 118-bus system show that the proposed method can achieve accurate estimations for the probabilistic characteristics of the PATC with much less computational effort compared to the Latin hypercube sampling (LHS)-based Monte Carlo simulations (MCS). The proposed LRA-PATC method offers an efficient and effective way to determine the available transfer capability so as to fully utilize the transmission assets while maintaining the security of the grid.

eess.SP↗

arXiv2018

Applying Polynomial Chaos Expansion to Assess Probabilistic Available Delivery Capability for Distribution Networks with Renewables

Considering the increasing penetration of renewable energy sources and electrical vehicles in utility distribution feeders, it is imperative to study the impacts of the resulting increasing uncertainty on the delivery capability of a distribution network. In this paper, probabilistic available delivery capability (ADC) is formulated for a general distribution network integrating various RES and load variations. To reduce the computational efforts by using conventional Monte Carlo simulations, we develop and employ a computationally efficient method to assess the probabilistic ADC, which combines the up-to-date sparse polynomial chaos expansion (PCE) and the continuation method. Particularly, the proposed method is able to handle a large number of correlated random inputs with different marginal distributions. Numerical examples in the IEEE 13 and IEEE 123 node test feeders are presented, showing that the proposed method can achieve accuracy and efficiency simultaneously. Numerical results also demonstrate that the randomness brought about by the RES and loads indeed leads to a reduction in the delivery capability of a distribution network.

eess.SP↗

arXiv2017

Probabilistic Available Delivery Capability Assessment of General Distribution Network with Renewables

Rapid increase of renewable energy sources and electric vehicles in utility distribution feeders introduces more and more uncertainties. To investigate how such uncertainties may affect the available delivery capability (ADC) of the distribution network, it is imperative to employ a probabilistic analysis framework. In this paper, a formulation for probabilistic ADC incorporating renewable generators and load variations is proposed; a computationally efficient method to solve the probabilistic ADC is presented, which combines the up-to-date sparse polynomial chaos expansion (PCE) and the continuation method. A numerical example in the IEEE 13 node test feeder is given to demonstrate the accuracy and efficiency of the proposed method.

eess.SP↗