Jiang Xiong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jiang Xiong has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Huaqing Li
Southwest University
3 shared publications - Wei Zhang
Chongqing Engineering Research Center of Internet of Things and Intelligent Control Technology, Chongqing Three Gorges University, Wanzhou, China
2 shared publications - Yuming Feng
School of Computer Science and Engineering, Chongqing Sanxia University of Science and Technology, Wanzhou, Chongqing 404100, China
2 shared publications Chunzhe Zhao
School of Computer Science and Engineering, Chongqing Three Gorges University, 404000, China
1 shared publicationJing Zhong
Chongqing Three Gorges University
1 shared publication- Lara A. Thompson
Center for Biomechanical & Rehabilitation Engineering, Biomedical Engineering Program, School of Engineering and Applied Sciences, University of the District of Columbia, 4200 Connecticut Ave. NW, Washington, DC 20008, USA
1 shared publication
Latest Publications
- Open Access
- 13 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 207012-207023
Binary Codes Based on Non-Negative Matrix Factorization for Clustering and Retrieval
Traditional non-negative matrix factorization methods cannot learn the subspace from the high-dimensional data space composed of binary codes. One hopes to discover a compact parts-based representation composed of binary codes, which can uncover the intrinsic information and simultaneously respect the geometric structure of the original data. For this purpose, we introduce discrete hashing methods and propose a novel non-negative matrix factorization to generate binary codes from the original data. In this paper, we construct an affinity graph to encode the geometrical structure of the original data, and the learned binary code subspace achieved by matrix factorization respects the structure. The proposed problem can be formulated as a mixed integer optimization problem. Therefore, we transform it into several sub-problems including an integer optimization problem, two convex problems with the non-negative constraint and a quadratic programming problem. Optimizing each sub-problem alternately until we achieve a local optimal solution. Image clustering and retrieval on image datasets show the excellent performance of our method in comparison to other dimensional reduction methods.
- 13 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 207012-207023
Open AccessBinary Codes Based on Non-Negative Matrix Factorization for Clustering and Retrieval
Traditional non-negative matrix factorization methods cannot learn the subspace from the high-dimensional data space composed of binary codes. One hopes to discover a compact parts-based representation composed of binary codes, which can uncover the intrinsic information and simultaneously respect the geometric structure of the original data. For this purpose, we introduce discrete hashing methods and propose a novel non-negative matrix factorization to generate binary codes from the original data. In this paper, we construct an affinity graph to encode the geometrical structure of the original data, and the learned binary code subspace achieved by matrix factorization respects the structure. The proposed problem can be formulated as a mixed integer optimization problem. Therefore, we transform it into several sub-problems including an integer optimization problem, two convex problems with the non-negative constraint and a quadratic programming problem. Optimizing each sub-problem alternately until we achieve a local optimal solution. Image clustering and retrieval on image datasets show the excellent performance of our method in comparison to other dimensional reduction methods.
- 23 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 52 (2) , 748-757
Event-Triggering Interaction Scheme for Discrete-Time Decentralized Optimization With Nonuniform Step Sizes
In this article, we study the discrete-time decentralized optimization problems of multiagent systems by an event-triggering interaction scheme, in which each agent privately knows its local convex cost function, and collectively minimizes the total cost functions. The underlying interaction and the corresponding weight matrix are required to be undirected connected and doubly stochastic, respectively. To resolve this optimization problem collaboratively, we propose a decentralized event-triggering algorithm (DETA) that is based on the consensus theory and inexact gradient tracking technique. DETA involves each agent interacting with its neighboring agents only at some independent event-triggering sampling time instants. Under the assumptions that the global convex cost function is coercive and has Lipschitz continuous gradient, we prove that DETA steers all agents' states to an optimal solution even with nonuniform constant step sizes. Moreover, our analysis also shows that DETA converges at a rate of O(1/√t) if the step sizes are uniform and do not exceed some upper bounds. We illustrate the effectiveness of DETA on a canonical simple decentralized parameter estimation problem.
- 23 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 52 (2) , 748-757
Event-Triggering Interaction Scheme for Discrete-Time Decentralized Optimization With Nonuniform Step Sizes
In this article, we study the discrete-time decentralized optimization problems of multiagent systems by an event-triggering interaction scheme, in which each agent privately knows its local convex cost function, and collectively minimizes the total cost functions. The underlying interaction and the corresponding weight matrix are required to be undirected connected and doubly stochastic, respectively. To resolve this optimization problem collaboratively, we propose a decentralized event-triggering algorithm (DETA) that is based on the consensus theory and inexact gradient tracking technique. DETA involves each agent interacting with its neighboring agents only at some independent event-triggering sampling time instants. Under the assumptions that the global convex cost function is coercive and has Lipschitz continuous gradient, we prove that DETA steers all agents' states to an optimal solution even with nonuniform constant step sizes. Moreover, our analysis also shows that DETA converges at a rate of O(1/√t) if the step sizes are uniform and do not exceed some upper bounds. We illustrate the effectiveness of DETA on a canonical simple decentralized parameter estimation problem.
- Open Access
- 3 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 43466-43475
Distributed Event-Triggered Communication Scheme for Economic Dispatch Problem in Power System With Uncoordinated Step-Sizes
Inspired by the distributed economic dispatch problem (EDP) in power system, this paper considers a problem of optimizing a sum of m local convex cost functions on an undirected network of m agents. Each agent in the network privately knows its own local convex objective function and is subjected to both coupling linear constraint and individual box constraints. To be able to reduce the requirements for information exchange among agents, we propose a novel fully event-triggered based distributed primal-dual algorithm for the convex optimization problem. Our algorithm allows the use of uncoordinated step-sizes and assumes that each agent communicates with its neighboring agents (the corresponding variables are updated) only at some independent event-triggered sampling time instants. Under some relatively standard assumptions (strong convexity and smoothness) on the objective functions, our theoretical analysis proves that the proposed algorithm can linearly seek the exact optimal solution when the upper bound of the uncoordinated step-sizes is smaller than a certain constant. We also conduct a clear estimate of the rate. Finally, a simple numerical example on distributed economic dispatch problem in power system is provided to illustrate the effectiveness of our event-triggered based optimization algorithm and validate the correctness of the analysis process.
- 3 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 43466-43475
Open AccessDistributed Event-Triggered Communication Scheme for Economic Dispatch Problem in Power System With Uncoordinated Step-Sizes
Inspired by the distributed economic dispatch problem (EDP) in power system, this paper considers a problem of optimizing a sum of m local convex cost functions on an undirected network of m agents. Each agent in the network privately knows its own local convex objective function and is subjected to both coupling linear constraint and individual box constraints. To be able to reduce the requirements for information exchange among agents, we propose a novel fully event-triggered based distributed primal-dual algorithm for the convex optimization problem. Our algorithm allows the use of uncoordinated step-sizes and assumes that each agent communicates with its neighboring agents (the corresponding variables are updated) only at some independent event-triggered sampling time instants. Under some relatively standard assumptions (strong convexity and smoothness) on the objective functions, our theoretical analysis proves that the proposed algorithm can linearly seek the exact optimal solution when the upper bound of the uncoordinated step-sizes is smaller than a certain constant. We also conduct a clear estimate of the rate. Finally, a simple numerical example on distributed economic dispatch problem in power system is provided to illustrate the effectiveness of our event-triggered based optimization algorithm and validate the correctness of the analysis process.
- 31 May 2017
- Published by Springer Nature
- p. 206-214
An Enhanced K-Nearest Neighbor Classification Method Based on Maximal Coherence and Validity Ratings
- 31 May 2017
- Published by Springer Nature
- p. 206-214
An Enhanced K-Nearest Neighbor Classification Method Based on Maximal Coherence and Validity Ratings
- 1 July 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 31, 3852-3856
An efficient discrete form of active disturbance rejection controller
A novel efficient discrete form of the active disturbance rejection control (ADRC) algorithm is presented. The total amount of the options in the ADRC algorithm is reduced by introducing an equivalent form of the Euler discretization of ADRC. Then the original and the efficient discrete forms of ADRC are compared in the simulation experiments of nine different plants. With the new algorithm, the CPU time consumed by the controller decreases by an average of 15.37 percent, and the closed-loop performances are not degraded at all.
- 1 July 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 31, 3852-3856
An efficient discrete form of active disturbance rejection controller
A novel efficient discrete form of the active disturbance rejection control (ADRC) algorithm is presented. The total amount of the options in the ADRC algorithm is reduced by introducing an equivalent form of the Euler discretization of ADRC. Then the original and the efficient discrete forms of ADRC are compared in the simulation experiments of nine different plants. With the new algorithm, the CPU time consumed by the controller decreases by an average of 15.37 percent, and the closed-loop performances are not degraded at all.