Chao Ma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chao Ma has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Jun Wu
School of Mathematics and Statistics, Huazhong University of Science and Technology, Wuhan, China
2 shared publications - Xue Li
Faculty of Innovation Engineering, Macau University of Science and Technology, Taipa, Macau 999078, P. R. China
2 shared publications Yan Han
School of Mathematics and Statistics, Zhaotong University, Zhaotong, China
2 shared publications- Baowei Wang
School of Mathematics and Statistics, Huazhong University of Science and Technology, Wuhan, China
1 shared publication - Beili Sun
Jiangsu Metabio Science & Technology Co., Ltd., Wuxi 214028, China
1 shared publication - Bo Wang
Jiaying University
1 shared publication
Latest Publications
- 22 July 2026
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- p. 1-12
A QUANTITATIVE DYNAMICAL BOREL–CANTELLI LEMMA FOR TWISTED RECURRENCE ON $[0,1]^d$ left bracket 0 comma 1 right bracket Superscript dLet $T:[0,1]^d \rightarrow [0,1]^d$ upper T colon left bracket 0 comma 1 right bracket Superscript d Baseline right arrow left bracket 0 comma 1 right bracket Superscript d be a piecewise expanding linear map such that each domain of linearity is a coordinate-parallel hyperrectangle that T sends to $[0,1]^d$ left bracket 0 comma 1 right bracket Superscript d . Let $\{\mathbf {r}_n\}$ StartSet bold r Subscript n Baseline EndSet be a sequence of vectors with $\mathbf {r}_n=(r_{n, 1}, \ldots , r_{n, d}) \in (\mathbb {R}_{\geq 0})^d$ bold r Subscript n Baseline equals left parenthesis r Subscript n comma 1 Baseline comma ellipsis comma r Subscript n comma d Baseline right parenthesis element of left parenthesis double struck upper R Subscript greater than or equals 0 Baseline right parenthesis Superscript d . Let $m_d$ m Subscript d denote d -dimensional Lebesgue measure. Let $\{f_n\}$ StartSet f Subscript n Baseline EndSet be a sequence of piecewise Lipschitz coordinate-wise vector functions on $[0,1]^d$ left bracket 0 comma 1 right bracket Superscript d with a uniform Lipschitz constant. For any given $\epsilon> 0$ epsilon greater than 0 , we obtain a unified counting function for the shrinking target and recurrence problems: $$ \begin{align*}\sum_{n=1}^N \mathbb{1}_{R(f_n(\mathbf{x}), \mathbf{r}_n)}(T^n \mathbf{x})=\Psi(N)+O(\Psi^{1 / 2}(N)(\log \Psi(N))^{3 / 2+\varepsilon})\end{align*} $$ for $m_d$ m Subscript d -almost every $\mathbf {x} \in [0,1]^d$ bold x element of left bracket 0 comma 1 right bracket Superscript d and for all $N\in \mathbb N$ upper N element of double struck upper N , where $\Psi (N):=2^d \sum _{n=1}^N r_{n, 1} \cdots r_{n, d}$ normal upper Psi left parenthesis upper N right parenthesis colon equals 2 Superscript d Baseline sigma summation Underscript n equals 1 Overscript upper N Endscripts r Subscript n comma 1 Baseline midline horizontal ellipsis r Subscript n comma d Baseline and $R(f_n(\mathbf {x}), \mathbf {r}_n)$ upper R left parenthesis f Subscript n Baseline left parenthesis bold x right parenthesis comma bold r Subscript n Baseline right parenthesis is a coordinate-parallel hyperrectangle centred at $f_n(\mathbf {x})$ f Subscript n Baseline left parenthesis bold x right parenthesis . Our result gives a unified statement to show that the quantitative dynamical Borel–Cantelli lemma can govern both the shrinking target and recurrence problems, thereby eliminating the need for separate treatments and different proofs. This result can also apply...- 22 July 2026
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- p. 1-12
A QUANTITATIVE DYNAMICAL BOREL–CANTELLI LEMMA FOR TWISTED RECURRENCE ON $[0,1]^d$ left bracket 0 comma 1 right bracket Superscript dLet $T:[0,1]^d \rightarrow [0,1]^d$ upper T colon left bracket 0 comma 1 right bracket Superscript d Baseline right arrow left bracket 0 comma 1 right bracket Superscript d be a piecewise expanding linear map such that each domain of linearity is a coordinate-parallel hyperrectangle that T sends to $[0,1]^d$ left bracket 0 comma 1 right bracket Superscript d . Let $\{\mathbf {r}_n\}$ StartSet bold r Subscript n Baseline EndSet be a sequence of vectors with $\mathbf {r}_n=(r_{n, 1}, \ldots , r_{n, d}) \in (\mathbb {R}_{\geq 0})^d$ bold r Subscript n Baseline equals left parenthesis r Subscript n comma 1 Baseline comma ellipsis comma r Subscript n comma d Baseline right parenthesis element of left parenthesis double struck upper R Subscript greater than or equals 0 Baseline right parenthesis Superscript d . Let $m_d$ m Subscript d denote d -dimensional Lebesgue measure. Let $\{f_n\}$ StartSet f Subscript n Baseline EndSet be a sequence of piecewise Lipschitz coordinate-wise vector functions on $[0,1]^d$ left bracket 0 comma 1 right bracket Superscript d with a uniform Lipschitz constant. For any given $\epsilon> 0$ epsilon greater than 0 , we obtain a unified counting function for the shrinking target and recurrence problems: $$ \begin{align*}\sum_{n=1}^N \mathbb{1}_{R(f_n(\mathbf{x}), \mathbf{r}_n)}(T^n \mathbf{x})=\Psi(N)+O(\Psi^{1 / 2}(N)(\log \Psi(N))^{3 / 2+\varepsilon})\end{align*} $$ for $m_d$ m Subscript d -almost every $\mathbf {x} \in [0,1]^d$ bold x element of left bracket 0 comma 1 right bracket Superscript d and for all $N\in \mathbb N$ upper N element of double struck upper N , where $\Psi (N):=2^d \sum _{n=1}^N r_{n, 1} \cdots r_{n, d}$ normal upper Psi left parenthesis upper N right parenthesis colon equals 2 Superscript d Baseline sigma summation Underscript n equals 1 Overscript upper N Endscripts r Subscript n comma 1 Baseline midline horizontal ellipsis r Subscript n comma d Baseline and $R(f_n(\mathbf {x}), \mathbf {r}_n)$ upper R left parenthesis f Subscript n Baseline left parenthesis bold x right parenthesis comma bold r Subscript n Baseline right parenthesis is a coordinate-parallel hyperrectangle centred at $f_n(\mathbf {x})$ f Subscript n Baseline left parenthesis bold x right parenthesis . Our result gives a unified statement to show that the quantitative dynamical Borel–Cantelli lemma can govern both the shrinking target and recurrence problems, thereby eliminating the need for separate treatments and different proofs. This result can also apply...- 12 February 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Wavelets, Multiresolution and Information Processing
- Vol. 24 (02)
Stereo image super-resolution with adaptive multi-scale cross-attention
Stereo image super-resolution aims to reconstruct high-resolution images from low-resolution stereo pairs by leveraging complementary information between binocular views, which is essential for a wide range of computer vision applications. To address the limitations in cross-view feature matching of existing methods, particularly in weak-textured regions, we propose the Adaptive Multi-Scale Cross-Attention Stereo Image Super-Resolution Network (AMCASSR). The network comprises two principal modules: the Adaptive Multi-Scale Cross-Attention (AMSCA) module, which enhances reconstruction performance in weak-textured regions by expanding the receptive field and adaptively fusing multi-scale features; and the Multi-Scale Cross-Attention Feature Block (MSCFB), which facilitates the integration of intra-view feature learning and cross-view interaction. Additionally, the network optimizes cross-view interaction while maintaining computational efficiency. Experimental evaluations on the KITTI2012, KITTI2015, Middlebury and Flickr1024 datasets show that AMCASSR achieves significant improvements in both PSNR and SSIM metrics over current state-of-the-art methods, especially in weak-textured regions. Validation on downstream tasks further supports its practical applicability in feature and stereo matching.
- 12 February 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Wavelets, Multiresolution and Information Processing
- Vol. 24 (02)
Stereo image super-resolution with adaptive multi-scale cross-attention
Stereo image super-resolution aims to reconstruct high-resolution images from low-resolution stereo pairs by leveraging complementary information between binocular views, which is essential for a wide range of computer vision applications. To address the limitations in cross-view feature matching of existing methods, particularly in weak-textured regions, we propose the Adaptive Multi-Scale Cross-Attention Stereo Image Super-Resolution Network (AMCASSR). The network comprises two principal modules: the Adaptive Multi-Scale Cross-Attention (AMSCA) module, which enhances reconstruction performance in weak-textured regions by expanding the receptive field and adaptively fusing multi-scale features; and the Multi-Scale Cross-Attention Feature Block (MSCFB), which facilitates the integration of intra-view feature learning and cross-view interaction. Additionally, the network optimizes cross-view interaction while maintaining computational efficiency. Experimental evaluations on the KITTI2012, KITTI2015, Middlebury and Flickr1024 datasets show that AMCASSR achieves significant improvements in both PSNR and SSIM metrics over current state-of-the-art methods, especially in weak-textured regions. Validation on downstream tasks further supports its practical applicability in feature and stereo matching.
- 15 October 2025
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 41 (10) , 2495-2510
Communication-Efficient Distributed Estimation and Computation Using Skew-Normal Distribution
- 15 October 2025
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 41 (10) , 2495-2510
Communication-Efficient Distributed Estimation and Computation Using Skew-Normal Distribution
- Open AccessQuantitative twisted recurrence properties for piecewise expanding maps on $[0,1]^d$Let $T:[0,1]^d \rightarrow[0,1]^d$ be a piecewise expanding map with an absolutely continuous (with respect to the $d$-dimensional Lebesgue measure $m_d$) $T$-invariant probability measure $μ$. Let $\left\{\mathbf{r}_n\right\}$ be a sequence of vectors satisfying the conditons that $\mathbf{r}_n=\left(r_{n, 1}, \ldots, r_{n, d}\right) \in\left(\mathbb{R}_{\geq 0}\right)^d$, the sequence $\left\{\frac{\max _{1 \leq i \leq d}\hspace{1ex}r_{n, i}}{\min _{1 \leq i \leq d}\hspace{1ex}r_{n, i}}\right\}$ is bounded and $\lim _{n \rightarrow \infty} \max _{1 \leq i \leq d}r_{n, i}=0$. Let $\left\{δ_n\right\}$ be a sequence of non-negative real numbers with $\lim _{n \rightarrow \infty} δ_n=0$. Under the assumptions that $μ$ is exponentially mixing and its density is sufficiently regular, we prove that the $μ$-measure of the following sets $$\mathcal{R}^f\left(\left\{\mathbf{r}_n\right\}\right)=\left\{\mathbf{x} \in[0,1]^d: T^n \mathbf{x} \in R\left(f(\mathbf{x}), \mathbf{r}_n\right) \text { for infinitely many } n \in \mathbb{N} \right\} $$ and $$\mathcal{R}^{f \times}\left(\left\{δ_n\right\}\right)=\left\{\mathbf{x} \in[0,1]^d: T^n \mathbf{x} \in H\left(f(\mathbf{x}), δ_n\right) \text { for infinitely many } n \in \mathbb{N} \right\}$$ obeys zero-full laws determined by the convergence or divergence of natural volume sums. Here, $R(f(\mathbf{x}), \mathbf{r}_n)$ and $H(f(\mathbf{x}), δ_n)$ represent targets as, respectively, coordinate-parallel hyperrectangles with bounded aspect ratio, and hyperboloids, both centered at $f(\mathbf{x})$. $f: [0,1]^d \rightarrow [0,1]^d$ is a piecewise Lipschitz vector function. Our results not only unify quantitative recurrence properties and the shrinking target problem for piecewise expanding maps on $[0,1]^d$, but also reveal that the two problems and cross-component recurrence can coexist in distinct directions on $[0,1]^d$.Open AccessQuantitative twisted recurrence properties for piecewise expanding maps on $[0,1]^d$Let $T:[0,1]^d \rightarrow[0,1]^d$ be a piecewise expanding map with an absolutely continuous (with respect to the $d$-dimensional Lebesgue measure $m_d$) $T$-invariant probability measure $μ$. Let $\left\{\mathbf{r}_n\right\}$ be a sequence of vectors satisfying the conditons that $\mathbf{r}_n=\left(r_{n, 1}, \ldots, r_{n, d}\right) \in\left(\mathbb{R}_{\geq 0}\right)^d$, the sequence $\left\{\frac{\max _{1 \leq i \leq d}\hspace{1ex}r_{n, i}}{\min _{1 \leq i \leq d}\hspace{1ex}r_{n, i}}\right\}$ is bounded and $\lim _{n \rightarrow \infty} \max _{1 \leq i \leq d}r_{n, i}=0$. Let $\left\{δ_n\right\}$ be a sequence of non-negative real numbers with $\lim _{n \rightarrow \infty} δ_n=0$. Under the assumptions that $μ$ is exponentially mixing and its density is sufficiently regular, we prove that the $μ$-measure of the following sets $$\mathcal{R}^f\left(\left\{\mathbf{r}_n\right\}\right)=\left\{\mathbf{x} \in[0,1]^d: T^n \mathbf{x} \in R\left(f(\mathbf{x}), \mathbf{r}_n\right) \text { for infinitely many } n \in \mathbb{N} \right\} $$ and $$\mathcal{R}^{f \times}\left(\left\{δ_n\right\}\right)=\left\{\mathbf{x} \in[0,1]^d: T^n \mathbf{x} \in H\left(f(\mathbf{x}), δ_n\right) \text { for infinitely many } n \in \mathbb{N} \right\}$$ obeys zero-full laws determined by the convergence or divergence of natural volume sums. Here, $R(f(\mathbf{x}), \mathbf{r}_n)$ and $H(f(\mathbf{x}), δ_n)$ represent targets as, respectively, coordinate-parallel hyperrectangles with bounded aspect ratio, and hyperboloids, both centered at $f(\mathbf{x})$. $f: [0,1]^d \rightarrow [0,1]^d$ is a piecewise Lipschitz vector function. Our results not only unify quantitative recurrence properties and the shrinking target problem for piecewise expanding maps on $[0,1]^d$, but also reveal that the two problems and cross-component recurrence can coexist in distinct directions on $[0,1]^d$.
- 6 February 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Wavelets, Multiresolution and Information Processing
- Vol. 23 (02)
Self-calibration of binocular camera extrinsic parameters based on structured feature points selection
The extraction of feature points is crucial to computer vision tasks like self-calibration of binocular camera extrinsic parameters, pose estimation and structure from motion (SFM). In the context of autonomous driving, there are numerous unstructured feature points, as well as structured feature points with shapes such as L-type, Y-type, Star-type and centroid. Typically, feature points are extracted without discrimination and used as inputs for feature-based visual algorithms in a generalized manner. However, the influence of the structural characteristics of these feature points on the performance of such algorithms remains largely unexplored. To address this issue, we propose a multi-stream feature point classification network based on circular patches extraction (CPE). CPE uses concentric circles centered on a given feature point to extract the intensity distribution features around that point. Subsequently, a series of circular patches are converted into square patches according to the order of radius and polar angle. Then, we have a multi-stream feature point classification network, where each stream receives a square patch as input to learn the intensity distribution features and classify the feature points into Y-type, centroid and unstructured categories. Finally, the influence of points with structure and without structure on related autonomous driving visual algorithms was verified in the experiment. Experimental results indicate that our proposed network can effectively classify based on the structure of feature points, which can enhance the performance of feature-based vision algorithms.
- 6 February 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Wavelets, Multiresolution and Information Processing
- Vol. 23 (02)
Self-calibration of binocular camera extrinsic parameters based on structured feature points selection
The extraction of feature points is crucial to computer vision tasks like self-calibration of binocular camera extrinsic parameters, pose estimation and structure from motion (SFM). In the context of autonomous driving, there are numerous unstructured feature points, as well as structured feature points with shapes such as L-type, Y-type, Star-type and centroid. Typically, feature points are extracted without discrimination and used as inputs for feature-based visual algorithms in a generalized manner. However, the influence of the structural characteristics of these feature points on the performance of such algorithms remains largely unexplored. To address this issue, we propose a multi-stream feature point classification network based on circular patches extraction (CPE). CPE uses concentric circles centered on a given feature point to extract the intensity distribution features around that point. Subsequently, a series of circular patches are converted into square patches according to the order of radius and polar angle. Then, we have a multi-stream feature point classification network, where each stream receives a square patch as input to learn the intensity distribution features and classify the feature points into Y-type, centroid and unstructured categories. Finally, the influence of points with structure and without structure on related autonomous driving visual algorithms was verified in the experiment. Experimental results indicate that our proposed network can effectively classify based on the structure of feature points, which can enhance the performance of feature-based vision algorithms.
- Open Access
- 10 October 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (20) , 3166
The Shrinking Target Problem for Nonautonomous Dynamical Systems Corresponding to Cantor Series Expansion over Formal Laurent Series
In this paper, we study the shrinking target problem regarding Q-Cantor series expansions of the formal Laurent series field. We provide the Hausdorff dimension of a very general shrinking target scheme generated by the nonautonomous dynamical system on the unit disk I.
- 10 October 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (20) , 3166
Open AccessThe Shrinking Target Problem for Nonautonomous Dynamical Systems Corresponding to Cantor Series Expansion over Formal Laurent Series
In this paper, we study the shrinking target problem regarding Q-Cantor series expansions of the formal Laurent series field. We provide the Hausdorff dimension of a very general shrinking target scheme generated by the nonautonomous dynamical system on the unit disk I.
- Open Access
- 23 June 2023
- Published by Springer Nature in Applied Mathematics-A Journal of Chinese Universities
- Vol. 38 (2) , 235-247
Generalized Kannan-type contraction and fixed point theorems
- 23 June 2023
- Published by Springer Nature in Applied Mathematics-A Journal of Chinese Universities
- Vol. 38 (2) , 235-247
Open AccessGeneralized Kannan-type contraction and fixed point theorems
- Open Access
An Efficient Self-Organized Detection System for Algae
Algal blooms have seriously affected the production and life of people and real-time detection of algae in water samples is a powerful measure to prevent algal blooms. The traditional manual detection of algae with a microscope is extremely time-consuming. In recent years, although there have been many studies using deep learning to classify and detect algae, most of them have focused on the relatively simple task of algal classification. In addition, some existing algal detection studies not only use small datasets containing limited algal species, but also only prove that object detection algorithms can be applied to algal detection tasks. These studies cannot implement the real-time detection of algae and timely warning of algal blooms. Therefore, this paper proposes an efficient self-organized detection system for algae. Benefiting from this system, we propose an interactive method to generate the algal detection dataset containing 28,329 images, 562,512 bounding boxes and 54 genera. Then, based on this dataset, we not only explore and compare the performance of 10 different versions of state-of-the-art object detection algorithms for algal detection, but also tune the detection system we built to its optimum state. In practical application, the system not only has good algal detection results, but also can complete the scanning, photographing and detection of a 2 cm × 2 cm, 0.1 mL algal slide specimen within five minutes (the resolution is 0.25886 m/pixel); such a task requires a well-trained algal expert to work continuously for more than three hours. The efficient algal self-organized detection system we built makes it possible to detect algae in real time. In the future, with the help of IoT, we can use various smart sensors, actuators and intelligent controllers to achieve real-time collection and wireless transmission of algal data, use the efficient algal self-organized detection system we built to implement real-time algal detection and upload the detection results to the cloud to realize timely warning of algal blooms.Open AccessAn Efficient Self-Organized Detection System for Algae
Algal blooms have seriously affected the production and life of people and real-time detection of algae in water samples is a powerful measure to prevent algal blooms. The traditional manual detection of algae with a microscope is extremely time-consuming. In recent years, although there have been many studies using deep learning to classify and detect algae, most of them have focused on the relatively simple task of algal classification. In addition, some existing algal detection studies not only use small datasets containing limited algal species, but also only prove that object detection algorithms can be applied to algal detection tasks. These studies cannot implement the real-time detection of algae and timely warning of algal blooms. Therefore, this paper proposes an efficient self-organized detection system for algae. Benefiting from this system, we propose an interactive method to generate the algal detection dataset containing 28,329 images, 562,512 bounding boxes and 54 genera. Then, based on this dataset, we not only explore and compare the performance of 10 different versions of state-of-the-art object detection algorithms for algal detection, but also tune the detection system we built to its optimum state. In practical application, the system not only has good algal detection results, but also can complete the scanning, photographing and detection of a 2 cm × 2 cm, 0.1 mL algal slide specimen within five minutes (the resolution is 0.25886 m/pixel); such a task requires a well-trained algal expert to work continuously for more than three hours. The efficient algal self-organized detection system we built makes it possible to detect algae in real time. In the future, with the help of IoT, we can use various smart sensors, actuators and intelligent controllers to achieve real-time collection and wireless transmission of algal data, use the efficient algal self-organized detection system we built to implement real-time algal detection and upload the detection results to the cloud to realize timely warning of algal blooms. - 22 August 2022
- Published by Springer Nature in Computational Economics
- Vol. 62 (4) , 1481-1504
A Comparison of Different Rules on Loans Evaluation in Peer-to-Peer Lending by Gradient Boosting Models Under Moving Windows with Two Timestamps
- 22 August 2022
- Published by Springer Nature in Computational Economics
- Vol. 62 (4) , 1481-1504
A Comparison of Different Rules on Loans Evaluation in Peer-to-Peer Lending by Gradient Boosting Models Under Moving Windows with Two Timestamps
- Open Access
- 2 January 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (1) , 127
On the Eventually Periodic Continued β-Fractions and Their Lévy Constants
In this paper, we consider continued -fractions with golden ratio base . We show that if the continued -fraction expansion of a non-negative real number is eventually periodic, then it is the root of a quadratic irreducible polynomial with the coefficients in and we conjecture the converse is false, which is different from Lagrange’s theorem for the regular continued fractions. We prove that the set of Lévy constants of the points with eventually periodic continued -fraction expansion is dense in [, +∞), where .- 2 January 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (1) , 127
Open AccessOn the Eventually Periodic Continued β-Fractions and Their Lévy Constants
In this paper, we consider continued -fractions with golden ratio base . We show that if the continued -fraction expansion of a non-negative real number is eventually periodic, then it is the root of a quadratic irreducible polynomial with the coefficients in and we conjecture the converse is false, which is different from Lagrange’s theorem for the regular continued fractions. We prove that the set of Lévy constants of the points with eventually periodic continued -fraction expansion is dense in [, +∞), where .