Zheng Zhou

Dr. Zheng Zhou

School of Mathematics, Statistics and Mechanics, Beijing University of Technology, Beijing, China
orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 July 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
MZMei Zhang
Mei Zhang
Yongdao ZhouYongdao Zhou
Yongdao Zhou
ZZZheng Zhou
Zheng Zhou
AZAijun Zhang
Aijun Zhang
Subsampling or subdata selection is a useful approach in large-scale statistical learning. Most existing studies focus on model-based subsampling methods which significantly depend on the model assumption. In this article, we consider the model-free subsampling strategy for generating subdata from the original full data. In order to measure the goodness of representation of a subdata with respect to the original data, we propose a criterion, generalized empirical $F$ -discrepancy (GEFD), and study its theoretical properties in connection with the classical generalized $\ell _{2}$ -discrepancy in the theory of uniform designs. These properties allow us to develop a kind of low-GEFD data-driven subsampling method based on the existing uniform designs. By simulation examples and a real case study, we show that the proposed subsampling method is superior to the random sampling method. Moreover, our method keeps robust under diverse model specifications while other popular model-based subsampling methods are under-performing. In practice, such a model-free property is more appealing than the model-based subsampling methods, where the latter may have poor performance when the model is misspecified, as demonstrated in our simulation studies. In addition, our method is orders of magnitude faster than other model-free subsampling methods, which makes it more applicable for subsampling of Big Data.

10 October 2024 in Entropy
Verified
Journal Article
Open access
PDF file
FYFeng Yang
Feng Yang
ZZZheng Zhou
Zheng Zhou
Contemporary experiments often involve special factors known as branching factors. The levels of such factors determine the presence of some certain factors, referred to as nested factors. The design criteria for investigating the goodness of such designs are rarely developed. Furthermore, the existing criteria for such designs pay less attention to the space-filling property of low-dimensional projections of the design. The efficiencies of designs yielded by such criteria can markedly decrease when only a few factors are significant. To address this issue, this paper proposes a novel space-filling criterion based on the maximum projection criterion to evaluate the performance of the designs with branching and nested factors. A framework to construct optimal designs under the proposed criterion is also provided. Compared with the existing works, the resulting designs have better space-filling properties in all possible low-dimensional projections. Moreover, our strategy imposes no constraints on run size, level, and type of any factor, demonstrating its broad applicability.

29 September 2025 in Journal of the American Statistical Association
Verified
Journal Article
Closed access
ZZZheng Zhou
Zheng Zhou
RMRobert Mee
Robert Mee
HHHerbert Hamers
Herbert Hamers
WZWei Zheng
Wei Zheng

27 March 2022
Verified
Conference Paper
Closed access
PDF file
YYYe Yang
Ye Yang
ZZZheng Zhou
Zheng Zhou
LYLei Yan
Lei Yan
KHKun Han
Kun Han
XDXiaogang Dang
Xiaogang Dang
SLShiwei Lei
Shiwei Lei
When the classical gray stretching algorithm is applied in digital low light level devices, it cannot meet the requirements of illumination environment change in large dynamic range, and the image processed under very low illumination or very high illumination is prone to the loss of target details, an adaptive gray stretching algorithm suitable for digital low light level devices is designed. The algorithm adds the variable of the brightness value of the original image information collected by the digital low light level device to the gray stretching transformation matrix, deduces the current environmental illuminance value according to the transformation of the brightness value, timely adjusts the relevant parameters in the gray stretching calculation matrix according to the environmental illuminance value, and obtains the gray stretching transformation matrix suitable for different image features under different illuminance environments, In order to meet the requirement that digital low light level devices should be suitable for the change of illumination environment in a large dynamic range. This paper also compares the adaptive algorithm with the classical algorithm, and gives the test results. At the end of the paper, the operation efficiency of the algorithm is tested to verify that the algorithm can meet the requirements of real-time image processing speed of digital low light level devices.