Jiao-Fen Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jiao-Fen Li has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
- Xue-Lin Zhou
School of Mathematics and Statistics, Yunan University, Kunming, China
5 shared publications Wen Li
School of Mathematical Sciences South China Normal University Guangzhou China
4 shared publicationsXi-Yan Hu
Hunan University
4 shared publicationsXue-Lin Zhou
4 shared publications- Chaoqian Li
School of Mathematics and Statistics, Yunan University, Kunming, China
3 shared publications Xue-Feng Duan
School of Mathematics and Computing Science , Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, Guilin University of Electronic Technology, Guilin 541004
3 shared publications
Latest Publications
- 15 November 2026
- Published by Elsevier in Applied Mathematical Modelling
Riemannian Optimization for Parameter Estimation in Maximum-Likelihood Factor Analysis
- 15 November 2026
- Published by Elsevier in Applied Mathematical Modelling
Riemannian Optimization for Parameter Estimation in Maximum-Likelihood Factor Analysis
- Open Access
A DNA-Based Image Encryption Scheme Using Optimized Lorenz–Sprott Hyperchaotic System
Chaotic systems have been widely investigated for color image encryption because of their nonlinear dynamics, initial-condition sensitivity, and pseudorandom behavior. However, locating numerically robust parameter regions in high-dimensional hyperchaotic systems remains difficult, while many DNA-based schemes employ fixed or weakly varying rules. This study proposes a color image encryption scheme combining a 6D Lorenz–Sprott system optimized by particle swarm optimization (PSO), symbol-level feedback-dependent DNA transformation, and bidirectional cross-channel chained diffusion. The second-largest Lyapunov exponent is used as the optimization objective to locate parameter sets with at least two positive exponents. The selected system has the Lyapunov spectrum (0.8118, 0.2736, −0.0013, −4.8957, −8.5499, −12.6746) and retains two positive exponents under refined numerical settings and ±1% single-parameter perturbations. One hundred independently initialized sequences satisfy all 15 categories of the NIST SP 800-22 test suite. Tests on six images and three secret keys achieve exact reconstruction in all 18 cases. Across 180 randomly located one-bit plaintext perturbations, the mean NPCR and UACI are 99.6089% and 33.4554%, respectively. For the tested Baboon case, perturbing any initial-state component by approximately 10−14 prevents meaningful plaintext recovery. Ablation results further demonstrate the contributions of dynamic DNA transformation and bidirectional diffusion. The proposed scheme therefore provides reproducible hyperchaotic parameter modulation and strong empirical statistical and differential performance.
Open AccessA DNA-Based Image Encryption Scheme Using Optimized Lorenz–Sprott Hyperchaotic System
Chaotic systems have been widely investigated for color image encryption because of their nonlinear dynamics, initial-condition sensitivity, and pseudorandom behavior. However, locating numerically robust parameter regions in high-dimensional hyperchaotic systems remains difficult, while many DNA-based schemes employ fixed or weakly varying rules. This study proposes a color image encryption scheme combining a 6D Lorenz–Sprott system optimized by particle swarm optimization (PSO), symbol-level feedback-dependent DNA transformation, and bidirectional cross-channel chained diffusion. The second-largest Lyapunov exponent is used as the optimization objective to locate parameter sets with at least two positive exponents. The selected system has the Lyapunov spectrum (0.8118, 0.2736, −0.0013, −4.8957, −8.5499, −12.6746) and retains two positive exponents under refined numerical settings and ±1% single-parameter perturbations. One hundred independently initialized sequences satisfy all 15 categories of the NIST SP 800-22 test suite. Tests on six images and three secret keys achieve exact reconstruction in all 18 cases. Across 180 randomly located one-bit plaintext perturbations, the mean NPCR and UACI are 99.6089% and 33.4554%, respectively. For the tested Baboon case, perturbing any initial-state component by approximately 10−14 prevents meaningful plaintext recovery. Ablation results further demonstrate the contributions of dynamic DNA transformation and bidirectional diffusion. The proposed scheme therefore provides reproducible hyperchaotic parameter modulation and strong empirical statistical and differential performance.
- 23 February 2026
- Published by Springer Nature in Statistics and Computing
- Vol. 36 (2) , 92
An efficient iterative method for direct INDSCAL with missing values in metric multidimensional scaling
- 23 February 2026
- Published by Springer Nature in Statistics and Computing
- Vol. 36 (2) , 92
An efficient iterative method for direct INDSCAL with missing values in metric multidimensional scaling
- Open Access
- 20 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (16) , 2680
ε-Algorithm Accelerated Fixed-Point Iteration for the Three-Way GIPSCAL Problem in Asymmetric MDS
The Generalized Inner Product SCALing (GIPSCAL) model is a specialized tool for analyzing square asymmetric tables within asymmetric multidimensional scaling (MDS), with applications in sociology (e.g., social mobility tables) and marketing (e.g., brand switching data). This paper presents the development of an efficient numerical algorithm for solving the three-way GIPSCAL problem. We focus on vector -algorithm-accelerated fixed-point iterations, detailing the underlying acceleration principles. Extensive numerical experiments show that the proposed method achieves acceleration performance comparable to polynomial extrapolation and Anderson acceleration. Furthermore, compared to continuous-time projected gradient flow methods and first- and second-order Riemannian optimization algorithms from the Manopt toolbox, our approach demonstrates superior computational efficiency and scalability.- 20 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (16) , 2680
Open Accessε-Algorithm Accelerated Fixed-Point Iteration for the Three-Way GIPSCAL Problem in Asymmetric MDS
The Generalized Inner Product SCALing (GIPSCAL) model is a specialized tool for analyzing square asymmetric tables within asymmetric multidimensional scaling (MDS), with applications in sociology (e.g., social mobility tables) and marketing (e.g., brand switching data). This paper presents the development of an efficient numerical algorithm for solving the three-way GIPSCAL problem. We focus on vector -algorithm-accelerated fixed-point iterations, detailing the underlying acceleration principles. Extensive numerical experiments show that the proposed method achieves acceleration performance comparable to polynomial extrapolation and Anderson acceleration. Furthermore, compared to continuous-time projected gradient flow methods and first- and second-order Riemannian optimization algorithms from the Manopt toolbox, our approach demonstrates superior computational efficiency and scalability. - 3 July 2025
- Published by Oxford University Press (OUP) in IMA Journal of Numerical Analysis
A Riemannian inexact Newton method for solving the orthogonal INDSCAL problem in multidimensional scaling
The well-known individual differences scaling (INDSCAL) model is intended for simultaneous metric multidimensional scaling (MDS) of several doubly centered matrices of squared dissimilarities. In this work the problem of fitting the orthogonal INDSCAL model to the data is reformulated and studied as a matrix optimization problem on the product manifold of orthonormal and diagonal matrices. A Riemannian inexact Newton method is proposed to address the underlying problem, with the global and quadratic convergence of the proposed method established under some mild assumptions. Furthermore, the positive definiteness condition of the Riemannian Hessian of the objective function at a solution is derived. Some numerical experiments are provided to illustrate the efficiency of the proposed method.
- 3 July 2025
- Published by Oxford University Press (OUP) in IMA Journal of Numerical Analysis
A Riemannian inexact Newton method for solving the orthogonal INDSCAL problem in multidimensional scaling
The well-known individual differences scaling (INDSCAL) model is intended for simultaneous metric multidimensional scaling (MDS) of several doubly centered matrices of squared dissimilarities. In this work the problem of fitting the orthogonal INDSCAL model to the data is reformulated and studied as a matrix optimization problem on the product manifold of orthonormal and diagonal matrices. A Riemannian inexact Newton method is proposed to address the underlying problem, with the global and quadratic convergence of the proposed method established under some mild assumptions. Furthermore, the positive definiteness condition of the Riemannian Hessian of the objective function at a solution is derived. Some numerical experiments are provided to illustrate the efficiency of the proposed method.
- 28 June 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 102 (1) , 425-466
An efficient algorithm for fitting the three-way GIPSCAL problem with missing values from asymmetric multidimensional scaling
- 28 June 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 102 (1) , 425-466
An efficient algorithm for fitting the three-way GIPSCAL problem with missing values from asymmetric multidimensional scaling
- 19 May 2025
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 65 (2) , 1-37
A trust-region approach for iteration solution of the direct fitting metric MDS
- 19 May 2025
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 65 (2) , 1-37
A trust-region approach for iteration solution of the direct fitting metric MDS
- 20 March 2025
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 32 (2)
Riemannian Conjugate Gradient Algorithms for Solving λ$ \boldsymbol{\lambda} $‐Approximation of Stochastic Tensors and ApplicationsIn this paper, we propose an optimal ‐approximation model of stochastic tensors arising from higher‐order Markov chains. For exploring a fast solver, we first transform the proposed model into a Riemannian optimization problem equivalently. Then we design two Riemannian optimization algorithms for solving the equivalent problem. Finally, some applications to approximate the solution of higher‐order Markov chains are given. Several numerical examples including the practical data are given to demonstrate the efficiency of the proposed method.
- 20 March 2025
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 32 (2)
Riemannian Conjugate Gradient Algorithms for Solving λ$ \boldsymbol{\lambda} $‐Approximation of Stochastic Tensors and ApplicationsIn this paper, we propose an optimal ‐approximation model of stochastic tensors arising from higher‐order Markov chains. For exploring a fast solver, we first transform the proposed model into a Riemannian optimization problem equivalently. Then we design two Riemannian optimization algorithms for solving the equivalent problem. Finally, some applications to approximate the solution of higher‐order Markov chains are given. Several numerical examples including the practical data are given to demonstrate the efficiency of the proposed method.
- Open Access
- 16 August 2024
- Published by Springer Nature in Research Square
A Riemannian Inexact-Newton Method for Solving the Orthogonal INDSCAL Problem in Multidimensional Scaling
The well-known individual differences scaling (INDSCAL) model is intended for simultaneous metric multidimensional scaling (MDS) of several doubly centered matrices of squared dissimilarities. In this work, the problem of fitting the orthogonal INDSCAL model to the data is reformulated and studied as a matrix optimization problem on the product manifold of orthonormal and diagonal matrices. A Riemannian inexact Newton method is proposed to address the underlying problem, with the global and quadratic convergence of the proposed method established under some mild assumptions. Furthermore, the positive definiteness condition of the Riemannian Hessian of the objective function at a solution is derived. Some numerical experiments are provided to illustrate the efficiency of the proposed method. Mathematics subject classification: 15A24; 15A57; 65F10; 65F30
- 16 August 2024
- Published by Springer Nature in Research Square
Open AccessA Riemannian Inexact-Newton Method for Solving the Orthogonal INDSCAL Problem in Multidimensional Scaling
The well-known individual differences scaling (INDSCAL) model is intended for simultaneous metric multidimensional scaling (MDS) of several doubly centered matrices of squared dissimilarities. In this work, the problem of fitting the orthogonal INDSCAL model to the data is reformulated and studied as a matrix optimization problem on the product manifold of orthonormal and diagonal matrices. A Riemannian inexact Newton method is proposed to address the underlying problem, with the global and quadratic convergence of the proposed method established under some mild assumptions. Furthermore, the positive definiteness condition of the Riemannian Hessian of the objective function at a solution is derived. Some numerical experiments are provided to illustrate the efficiency of the proposed method. Mathematics subject classification: 15A24; 15A57; 65F10; 65F30
- Open Access
- 29 June 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (13) , 7684
Action Recognition via Adaptive Semi-Supervised Feature Analysis
This study presents a new semi-supervised action recognition method via adaptive feature analysis. We assume that action videos can be regarded as data points in embedding manifold subspace, and their matching problem can be quantified through a specific Grassmannian kernel function while integrating feature correlation exploration and data similarity measurement into a joint framework. By maximizing the intra-class compactness based on labeled data, our algorithm can learn multiple features and leverage unlabeled data to enhance recognition. We introduce the Grassmannian kernels and the Projected Barzilai–Borwein (PBB) method to train a subspace projection matrix as a classifier. Experiment results show our method has outperformed the compared approaches when a few labeled training samples are available.
- 29 June 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (13) , 7684
Open AccessAction Recognition via Adaptive Semi-Supervised Feature Analysis
This study presents a new semi-supervised action recognition method via adaptive feature analysis. We assume that action videos can be regarded as data points in embedding manifold subspace, and their matching problem can be quantified through a specific Grassmannian kernel function while integrating feature correlation exploration and data similarity measurement into a joint framework. By maximizing the intra-class compactness based on labeled data, our algorithm can learn multiple features and leverage unlabeled data to enhance recognition. We introduce the Grassmannian kernels and the Projected Barzilai–Borwein (PBB) method to train a subspace projection matrix as a classifier. Experiment results show our method has outperformed the compared approaches when a few labeled training samples are available.