Xingyu Cui

Xingyu Cui

Auto-generated profile, based on publicly available information

Xingyu Cui

School of Statistics, Beijing Normal University, Beijing, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
8 June 2023 in IEEE Access
Verified
Journal Article
Open access
XCXingyu Cui
Xingyu Cui
YLYong Li
Yong Li
LILI XULILI XU
LILI XU
Curve approximation is a challenging issue to precisely depict exquisite shapes of natural phenomena, in which the piecewise Bézier curve is one of the most widely utilized tools due to its beneficial properties. It is essential to determine the quantity and location of control points through the process of generating the mathematical representation of desired objects. This paper presents a new algorithm called adaptive extension fitting scheme (AEFS) to determine a piecewise Bézier curve that best fits a given sequence of data points as well as locate the coordinates of the connecting points between the pieces adaptively. Taking full advantage of the scalability of the Bézier curve segment, AEFS is effective in sequential knot searching within an impressively small computational consumption. The capability of the proposed stepwise extension strategy is deduced from rigorous theoretical proof, resulting in proper connecting points together with well-fitted Bézier curves. The proposed algorithm is evaluated by some popular benchmarks for curve fitting, and compared with several state-of-the-art approaches. Experimental results indicate that AEFS outperforms other models involved in terms of execution time, fitting accuracy, number of segments, and the authenticity of shape contours.

21 November 2024 in ACM Transactions on Asian and Low-Resource Language Information Processing
Verified
Journal Article
Open access
XCXingyu Cui
Xingyu Cui
YLYong Li
Yong Li
LILI XULILI XU
LILI XU
Seal characters are derived from ancient Chinese pictographs, naturally inheriting pictographic characteristics and complex structures. As the essential components of seal characters, seal strokes play a vital role in seal character recognition, composition, and writing, so accurate recognition of seal strokes can greatly promote the investigation of seal characters. Inspired by curve fitting, we propose a new model called the characteristic analysis neural network (CANN) for seal stroke recognition. Instead of indiscriminate grasping of feature information in regular neural networks, we design an efficient approximation technique based on the piecewise Bezier curves that can effectively facilitate structural compression and lossless feature extraction. The feature extraction capability of Bezier approximation helps the methodology achieve impressive recognition accuracy not only on the seal strokes but also on any curve-based symbols. Furthermore, the hierarchical structure of the deep learning strategy is inherited and improved for better performance with high generalisation. Experiments conducted on different types of strokes verify that CANN obtains superior performance on both seal strokes and other smooth symbols. The robustness and the effectiveness of CANN are also demonstrated with minimal learning cost compared to other state-of-art models.

26 July 2021
Verified
Conference Paper
Closed access
XCXingyu Cui
Xingyu Cui
Huifeng ZhangHuifeng Zhang
Huifeng Zhang
JHJiawei He
Jiawei He
In order to solve the difficulties of multiobjective optimization problems (MOPs) such as high dimensionality and complex calculation, this paper designs a multiobjective optimization algorithm of multi-subpopulation coevolution. In this paper, the MOPs is divided into several sub-problems, and multiple sub-populations are used to optimize the sub-problems separately, and an information exchange strategy is designed for coevolution among multiple subpopulations; Aiming at the problem of multiobjective particle swarm optimization easily falling into local optima, an adaptive Cauchy mutation is designed to enhance the diversity and convergence of the algorithm.