Jigen Peng
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
Jigen Peng has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Junxiong Jia
School of Mathematics and Statistics, Xian Jiaotong University, Xian, China
12 shared publications - Kexue Li
Xi’an Jiaotong University
10 shared publications - Jinghuai Gao
School of Information and Communications Engineering, Xian Jiaotong University, Xian, China
6 shared publications - Zhan-Dong Mei
School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an, China
6 shared publications - Yang Zhang
Xi'an Technological University North Institute of Information Engineering; Xi'an P. R. China
4 shared publications - Shigang Yue
School of Computing and Mathematical Sciences, University of Leicester, Leicester LE1 7RH, UK
3 shared publications
Latest Publications
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 15 (2) , 201-228
Posterior contraction for empirical bayesian approach to inverse problems under non-diagonal assumption
We investigate an empirical Bayesian nonparametric approach to a family of linear inverse problems with Gaussian prior and Gaussian noise. We consider a class of Gaussian prior probability measures with covariance operator indexed by a hyperparameter that quantifies regularity. By introducing two auxiliary problems, we construct an empirical Bayes method and prove that this method can automatically select the hyperparameter. In addition, we show that this adaptive Bayes procedure provides optimal contraction rates up to a slowly varying term and an arbitrarily small constant, without knowledge about the regularity index. Our method needs not the prior covariance, noise covariance and forward operator have a common basis in their singular value decomposition, enlarging the application range compared with the existing results. A simple simulation example is given that illustrates the effectiveness of the proposed method.
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 15 (2) , 201-228
Posterior contraction for empirical bayesian approach to inverse problems under non-diagonal assumption
We investigate an empirical Bayesian nonparametric approach to a family of linear inverse problems with Gaussian prior and Gaussian noise. We consider a class of Gaussian prior probability measures with covariance operator indexed by a hyperparameter that quantifies regularity. By introducing two auxiliary problems, we construct an empirical Bayes method and prove that this method can automatically select the hyperparameter. In addition, we show that this adaptive Bayes procedure provides optimal contraction rates up to a slowly varying term and an arbitrarily small constant, without knowledge about the regularity index. Our method needs not the prior covariance, noise covariance and forward operator have a common basis in their singular value decomposition, enlarging the application range compared with the existing results. A simple simulation example is given that illustrates the effectiveness of the proposed method.
- Open Access
Posterior contraction for empirical Bayesian approach to inverse problems under non-diagonal assumption
We investigate an empirical Bayesian nonparametric approach to a family of linear inverse problems with Gaussian prior and Gaussian noise. We consider a class of Gaussian prior probability measures with covariance operator indexed by a hyperparameter that quantifies regularity. By introducing two auxiliary problems, we construct an empirical Bayes method and prove that this method can automatically select the hyperparameter. In addition, we show that this adaptive Bayes procedure provides optimal contraction rates up to a slowly varying term and an arbitrarily small constant, without knowledge about the regularity index. Our method needs not the prior covariance, noise covariance and forward operator have a common basis in their singular value decomposition, enlarging the application range compared with the existing results.
Open AccessPosterior contraction for empirical Bayesian approach to inverse problems under non-diagonal assumption
We investigate an empirical Bayesian nonparametric approach to a family of linear inverse problems with Gaussian prior and Gaussian noise. We consider a class of Gaussian prior probability measures with covariance operator indexed by a hyperparameter that quantifies regularity. By introducing two auxiliary problems, we construct an empirical Bayes method and prove that this method can automatically select the hyperparameter. In addition, we show that this adaptive Bayes procedure provides optimal contraction rates up to a slowly varying term and an arbitrarily small constant, without knowledge about the regularity index. Our method needs not the prior covariance, noise covariance and forward operator have a common basis in their singular value decomposition, enlarging the application range compared with the existing results.
- 1 September 2019
- Published by World Scientific Pub Co Pte Ltd in Journal of Theoretical and Computational Acoustics
- Vol. 27 (03) , 1850030
Modeling Attenuation of Diffusive-Viscous Wave Using Reflectivity Method
Seismic waves in earth materials are subject to attenuation and dispersion in a broad range of frequencies. The commonly accepted mechanism of intrinsic attenuation and dispersion is the presence of fluids in the pore space of rocks. The diffusive-viscous model was proposed to explain low-frequency seismic anomalies related to hydrocarbon reservoirs. But, the model is only a description of compressional wave. In this work, we firstly discuss the extended elastic diffusive-viscous model. Then, we extend reflectivity method to the diffusive-viscous medium. Finally, we present two numerical models to simulate the attenuation of diffusive-viscous wave in horizontal and dip multi-layered media compared with the results of viscoelastic wave. The modeling results show that the diffusive-viscous wave has strong amplitude attenuation and phase shift when it propagates across absorptive layers.
- 1 September 2019
- Published by World Scientific Pub Co Pte Ltd in Journal of Theoretical and Computational Acoustics
- Vol. 27 (03) , 1850030
Modeling Attenuation of Diffusive-Viscous Wave Using Reflectivity Method
Seismic waves in earth materials are subject to attenuation and dispersion in a broad range of frequencies. The commonly accepted mechanism of intrinsic attenuation and dispersion is the presence of fluids in the pore space of rocks. The diffusive-viscous model was proposed to explain low-frequency seismic anomalies related to hydrocarbon reservoirs. But, the model is only a description of compressional wave. In this work, we firstly discuss the extended elastic diffusive-viscous model. Then, we extend reflectivity method to the diffusive-viscous medium. Finally, we present two numerical models to simulate the attenuation of diffusive-viscous wave in horizontal and dip multi-layered media compared with the results of viscoelastic wave. The modeling results show that the diffusive-viscous wave has strong amplitude attenuation and phase shift when it propagates across absorptive layers.
- 15 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 31 (5) , 1626-1637
Minimization of Fraction Function Penalty in Compressed Sensing
In this paper, we study the minimization problem of a non-convex sparsity-promoting penalty function, i.e., fraction function, in compressed sensing. First, we discuss the equivalence of ℓ₀ minimization and fraction function minimization. It is proved that the optimal solution to fraction function minimization solves ℓ₀ minimization and the optimal solution to the regularization problem also solves fraction function minimization if the certain conditions are satisfied, which is similar to the regularization problem in a convex optimization theory. Second, we study the properties of the optimal solution to the regularization problem, including the first-order and second-order optimality conditions and the lower and upper bounds of the absolute value for its nonzero entries. Finally, we derive the closed-form representation of the optimal solution to the regularization problem and propose an iterative FP thresholding algorithm to solve the regularization problem. We also provide a series of experiments to assess the performance of the FP algorithm, and the experimental results show that the FP algorithm performs well in sparse signal recovery with and without measurement noise.
- 15 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 31 (5) , 1626-1637
Minimization of Fraction Function Penalty in Compressed Sensing
In this paper, we study the minimization problem of a non-convex sparsity-promoting penalty function, i.e., fraction function, in compressed sensing. First, we discuss the equivalence of ℓ₀ minimization and fraction function minimization. It is proved that the optimal solution to fraction function minimization solves ℓ₀ minimization and the optimal solution to the regularization problem also solves fraction function minimization if the certain conditions are satisfied, which is similar to the regularization problem in a convex optimization theory. Second, we study the properties of the optimal solution to the regularization problem, including the first-order and second-order optimality conditions and the lower and upper bounds of the absolute value for its nonzero entries. Finally, we derive the closed-form representation of the optimal solution to the regularization problem and propose an iterative FP thresholding algorithm to solve the regularization problem. We also provide a series of experiments to assess the performance of the FP algorithm, and the experimental results show that the FP algorithm performs well in sparse signal recovery with and without measurement noise.
- 1 October 2018
- Published by Elsevier in Neural Networks
- Vol. 106, 127-143
Shaping the collision selectivity in a looming sensitive neuron model with parallel ON and OFF pathways and spike frequency adaptation
- 1 October 2018
- Published by Elsevier in Neural Networks
- Vol. 106, 127-143
Shaping the collision selectivity in a looming sensitive neuron model with parallel ON and OFF pathways and spike frequency adaptation
- Open Access
An Improved LPTC Neural Model for Background Motion Direction Estimation
A class of specialized neurons, called lobula plate tangential cells (LPTCs) has been shown to respond strongly to wide-field motion. The classic model, elementary motion detector (EMD) and its improved model, two-quadrant detector (TQD) have been proposed to simulate LPTCs. Although EMD and TQD can percept background motion, their outputs are so cluttered that it is difficult to discriminate actual motion direction of the background. In this paper, we propose a max operation mechanism to model a newly-found transmedullary neuron Tm9 whose physiological properties do not map onto EMD and TQD. This proposed max operation mechanism is able to improve the detection performance of TQD in cluttered background by filtering out irrelevant motion signals. We will demonstrate the functionality of this proposed mechanism in wide-field motion perception.
Open AccessAn Improved LPTC Neural Model for Background Motion Direction Estimation
A class of specialized neurons, called lobula plate tangential cells (LPTCs) has been shown to respond strongly to wide-field motion. The classic model, elementary motion detector (EMD) and its improved model, two-quadrant detector (TQD) have been proposed to simulate LPTCs. Although EMD and TQD can percept background motion, their outputs are so cluttered that it is difficult to discriminate actual motion direction of the background. In this paper, we propose a max operation mechanism to model a newly-found transmedullary neuron Tm9 whose physiological properties do not map onto EMD and TQD. This proposed max operation mechanism is able to improve the detection performance of TQD in cluttered background by filtering out irrelevant motion signals. We will demonstrate the functionality of this proposed mechanism in wide-field motion perception.
- 8 June 2017
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 96 (3) , 353-360
TWO NEW LOWER BOUNDS FOR THE SPARK OF A MATRIX
The $l_{0}$ -minimisation problem has attracted much attention in recent years with the development of compressive sensing. The spark of a matrix is an important measure that can determine whether a given sparse vector is the solution of an $l_{0}$ -minimisation problem. However, its calculation involves a combinatorial search over all possible subsets of columns of the matrix, which is an NP-hard problem. We use Weyl’s theorem to give two new lower bounds for the spark of a matrix. One is based on the mutual coherence and the other on the coherence function. Numerical examples are given to show that the new bounds can be significantly better than existing ones.- 8 June 2017
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 96 (3) , 353-360
TWO NEW LOWER BOUNDS FOR THE SPARK OF A MATRIX
The $l_{0}$ -minimisation problem has attracted much attention in recent years with the development of compressive sensing. The spark of a matrix is an important measure that can determine whether a given sparse vector is the solution of an $l_{0}$ -minimisation problem. However, its calculation involves a combinatorial search over all possible subsets of columns of the matrix, which is an NP-hard problem. We use Weyl’s theorem to give two new lower bounds for the spark of a matrix. One is based on the mutual coherence and the other on the coherence function. Numerical examples are given to show that the new bounds can be significantly better than existing ones.- 13 March 2017
- Published by Cambridge University Press (CUP) in The ANZIAM Journal
- Vol. 58 (3-4) , 324-332
PINNING SYNCHRONIZATION OF FRACTIONAL-ORDER COMPLEX NETWORKS BY A SINGLE CONTROLLER
We investigate the state feedback pinning synchronization of fractional-order complex networks. Based on the stability theory of fractional-order differential systems and state feedback control by a single controller, synchronization conditions for fractional-order complex networks are given. We assume that the coupling matrix is irreducible, and provide a numerical example to illustrate the validity of the proposed conclusions.
- 13 March 2017
- Published by Cambridge University Press (CUP) in The ANZIAM Journal
- Vol. 58 (3-4) , 324-332
PINNING SYNCHRONIZATION OF FRACTIONAL-ORDER COMPLEX NETWORKS BY A SINGLE CONTROLLER
We investigate the state feedback pinning synchronization of fractional-order complex networks. Based on the stability theory of fractional-order differential systems and state feedback control by a single controller, synchronization conditions for fractional-order complex networks are given. We assume that the coupling matrix is irreducible, and provide a numerical example to illustrate the validity of the proposed conclusions.
- Open Access
- 3 January 2017
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2017 (1)
A Preconditioning Technique for First‐Order Primal‐Dual Splitting Method in Convex Optimization
We introduce a preconditioning technique for the first‐order primal‐dual splitting method. The primal‐dual splitting method offers a very general framework for solving a large class of optimization problems arising in image processing. The key idea of the preconditioning technique is that the constant iterative parameters are updated self‐adaptively in the iteration process. We also give a simple and easy way to choose the diagonal preconditioners while the convergence of the iterative algorithm is maintained. The efficiency of the proposed method is demonstrated on an image denoising problem. Numerical results show that the preconditioned iterative algorithm performs better than the original one.
- 3 January 2017
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2017 (1)
Open AccessA Preconditioning Technique for First‐Order Primal‐Dual Splitting Method in Convex Optimization
We introduce a preconditioning technique for the first‐order primal‐dual splitting method. The primal‐dual splitting method offers a very general framework for solving a large class of optimization problems arising in image processing. The key idea of the preconditioning technique is that the constant iterative parameters are updated self‐adaptively in the iteration process. We also give a simple and easy way to choose the diagonal preconditioners while the convergence of the iterative algorithm is maintained. The efficiency of the proposed method is demonstrated on an image denoising problem. Numerical results show that the preconditioned iterative algorithm performs better than the original one.
- Open Access
- 1 January 2017
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems
- Vol. 37 (10) , 5105-5125
Explosive solutions of parabolic stochastic partial differential equations with lévy noise
In this paper, we study the explosive solutions to a class of parbolic stochastic semilinear differential equations driven by a Lévy type noise. The sufficient conditions are presented to guarantee the existence of a unique positive solution of the stochastic partial differential equation under investigation. Moreover, we show that positive solutions will blow up in finite time in mean Lp-norm sense, provided that the initial data, the nonlinear term and the multiplicative noise satisfies some conditions. Several examples are presented to illustrate the theory. Finally, we establish a global existence theorem based on a Lyapunov functional and prove that a stochastic Allen-Cahn equation driven by Lévy noise has a global solution.
- 1 January 2017
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems
- Vol. 37 (10) , 5105-5125
Open AccessExplosive solutions of parabolic stochastic partial differential equations with lévy noise
In this paper, we study the explosive solutions to a class of parbolic stochastic semilinear differential equations driven by a Lévy type noise. The sufficient conditions are presented to guarantee the existence of a unique positive solution of the stochastic partial differential equation under investigation. Moreover, we show that positive solutions will blow up in finite time in mean Lp-norm sense, provided that the initial data, the nonlinear term and the multiplicative noise satisfies some conditions. Several examples are presented to illustrate the theory. Finally, we establish a global existence theorem based on a Lyapunov functional and prove that a stochastic Allen-Cahn equation driven by Lévy noise has a global solution.