Jing Qin

Dr. Jing Qin

Department of Mathematics, University of Kentucky, Lexington, KY 40506, USA
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
1 January 2014 in SIAM Journal on Imaging Sciences
Verified
Journal Article
Closed access
WGWeihong Guo
Weihong Guo
JQJing Qin
Jing Qin
WYWotao Yin
Wotao Yin
It is a challenging task to reconstruct images from their noisy, blurry, and/or incomplete measurements, especially those with important details and features such as medical magnetic resonance (MR) and CT images. We propose a novel regularization model that integrates two recently developed regularization tools: total generalized variation (TGV) by Bredies, Kunisch, and Pock; and shearlet transform by Labate, Lim, Kutyniok, and Weiss. The proposed model recovers both edges and fine details of images much better than the existing regularization models based on the total variation (TV) and wavelets. Specifically, while TV preserves sharp edges but suffers from oil painting artifacts, TGV “selectively regularizes” different image regions at different levels and thus largely avoids oil painting artifacts. Unlike the wavelet transform, which represents isotropic image features much more sparsely than anisotropic ones, the shearlet transform can efficiently represent anisotropic features such as edges, curves, ...

25 August 2020 in Journal of Mathematical Imaging and Vision
Verified
Journal Article
Closed access
PDF file
MCMujibur Rahman Chowdhury
Mujibur Rahman Chowdhury
JQJing Qin
Jing Qin
YLYifei Lou
Yifei Lou

1 January 2020 in Inverse Problems and Imaging
Verified
Journal Article
Open access
PDF file
MCMujibur Rahman Chowdhury
Mujibur Rahman Chowdhury
JZJun Zhang
Jun Zhang
JQJing Qin
Jing Qin
YLYifei Lou
Yifei Lou
Poisson noise is an important type of electronic noise that is present in a variety of photon-limited imaging systems. Different from the Gaussian noise, Poisson noise depends on the image intensity, which makes image restoration very challenging. Moreover, complex geometry of images desires a regularization that is capable of preserving piecewise smoothness. In this paper, we propose a Poisson denoising model based on the fractional-order total variation (FOTV). The existence and uniqueness of a solution to the model are established. To solve the problem efficiently, we propose three numerical algorithms based on the Chambolle-Pock primal-dual method, a forward-backward splitting scheme, and the alternating direction method of multipliers (ADMM), each with guaranteed convergence. Various experimental results are provided to demonstrate the effectiveness and efficiency of our proposed methods over the state-of-the-art in Poisson denoising.

1 January 2021 in SIAM Journal on Imaging Sciences
Verified
Journal Article
Closed access
XCXuemei Chen
Xuemei Chen
JQJing Qin
Jing Qin
Tensor recovery has recently arisen in a lot of application fields, such as transportation, medical imaging, and remote sensing. Under the assumption that signals possess sparse and/or low-rank str...

18 September 2020 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
JQJing Qin
Jing Qin
HLHarlin Lee
Harlin Lee
JCJocelyn T. Chi
Jocelyn T. Chi
LDLucas Drumetz
Lucas Drumetz
Jocelyn  ChanussotJocelyn Chanussot
Jocelyn Chanussot
ABAndrea L. Bertozzi
Andrea L. Bertozzi
Remote sensing data from hyperspectral cameras suffer from limited spatial resolution, in which a single pixel of a hyperspectral image may contain information from several materials in the field of view. Blind hyperspectral image unmixing is the process of identifying the pure spectra of individual materials (i.e., endmembers) and their proportions (i.e., abundances) at each pixel. In this article, we propose a novel blind hyperspectral unmixing model based on the graph total variation (gTV) regularization, which can be solved efficiently by the alternating direction method of multipliers (ADMM). To further alleviate the computational cost, we apply the Nyström method to approximate a fully connected graph by a small subset of sampled points. Furthermore, we adopt the Merriman–Bence–Osher (MBO) scheme to solve the gTV-involved subproblem in ADMM by decomposing a gray-scale image into a bitwise form. A variety of numerical experiments on synthetic and real hyperspectral images are conducted, showcasing the potential of the proposed method in terms of identification accuracy and computational efficiency.

6 March 2021 in Journal of Scientific Computing
Verified
Journal Article
Closed access
PDF file
WGWeihong Guo
Weihong Guo
YLYifei Lou
Yifei Lou
JQJing Qin
Jing Qin
MYMing Yan
Ming Yan