Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shifeng Guo

dblp:292/8765 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0000-0001-9638-4309ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Image and video processing · 50% Computational photography and imaging · 25% Geometric modeling and processing · 25%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational photography and imaging › tomographic imaging
computed tomography
0.912025
Ring Artifacts Removal Based on Implicit Neural Representation of Sinogram Data · IEEE Trans. Image Process. 2025
Image and video processing
image restoration
0.912025
Ring Artifacts Removal Based on Implicit Neural Representation of Sinogram Data · IEEE Trans. Image Process. 2025
Geometric modeling and processing
implicit neural representation
0.912025
Ring Artifacts Removal Based on Implicit Neural Representation of Sinogram Data · IEEE Trans. Image Process. 2025
Image and video processing › image restoration › compression artifact removal
ringing artifact removal
0.912025
Ring Artifacts Removal Based on Implicit Neural Representation of Sinogram Data · IEEE Trans. Image Process. 2025

Methods — techniques the papers use, named apart from their topics

unsupervised iterative correction · 0.9optimization constraint · 0.9implicit neural representation · 0.9
YearPublicationVenuePosition
2025 Ring Artifacts Removal Based on Implicit Neural Representation of Sinogram Data
abstract
Inconsistent responses of X-ray detector elements lead to stripe artifacts within the sinogram data, which subsequently manifest as ring artifacts in the reconstructed computed tomography (CT) images, severely degrading image quality. This paper presents a novel method for correcting stripe artifacts in the sinogram data by separating the sinogram into an Ideal Sinogram (IS) and Stripe Artifacts (SA), with both components parameterized through Implicit Neural Representations (INR). The proposed method leverages INR to correct defective pixel response values using implicit continuous functions while simultaneously learning stripe features in the angular direction of the sinogram data. These two components, IS and SA, are combined within an optimization constraint framework, achieving unsupervised iterative correction of stripe artifacts in the projection domain. Experimental results demonstrate that the proposed method significantly outperforms current state-of-the-art techniques in effectively removing ring artifacts while maintaining the clarity and fidelity of CT images, thereby enhancing the overall diagnostic quality of CT imaging.
Ligen Shi, Chang Liu 0026, Shifeng Guo, Xing Zhao 0006
IEEE Trans. Image Process.6
2022 Local Discriminant Subspace Learning for Gas Sensor Drift Problem
abstract
Sensor drift is one of the severe issues that gas sensors suffer from. To alleviate the sensor drift problem, a gas sensor drift compensation approach is proposed based on local discriminant subspace projection (LDSP). The proposed approach aims to find a subspace to reduce the distribution difference between two domains, i.e., the source and target domain. Similar to domain regularized component analysis (DRCA) which is a recently proposed sensor drift correction method, the mean distribution discrepancy is minimized in the common subspace in our approach. LDSP extends DRCA in two aspects, i.e., it not only takes the label information of the source data into consideration to reduce the possibility of the case that samples in the subspace with different class labels stay close to each other, but also borrows the idea of locality-preserving projection to deal with multimodal data. Specifically, inspired by local Fisher discriminant analysis (LFDA), the label information is utilized to maximize the local between-class variance of source data in the latent common subspace and simultaneously minimize the local within-class variance. The formulation of LDSP is a generalized eigenvalue problem that can be readily solved. The experimental results have shown the proposed method outperforms other gas sensor drift compensation methods in terms of classification accuracy on two public gas sensor drift datasets.
Zhengkun Yi, Wanfeng Shang, Tiantian Xu 0001, Shifeng Guo, Xinyu Wu 0001
IEEE Trans. Syst. Man Cybern. Syst.4
2021 Tactile Surface Roughness Categorization With Multineuron Spike Train Distance
abstract
Tactile sensing with spiking neural networks (SNNs) has attracted increasing attention in the past decades. In this article, a novel SNN framework is proposed for the tactile surface roughness categorization task. In contrast to supervised SNN methods such as ReSuMe and Tempotron that require prespecifying target spike trains, the presented method performs the classification through directly comparing the distance between multineuron spike trains. Unlike simple spike train fusion methods using average pairwise spike train distance or pooled spike train distance, the proposed method merges spike trains from different neurons with the multineuron spike train distance, which can capture the complex correlation of multiple spike trains. Specifically, the spike trains are generated via the Izhikevich neurons from tactile signals. The similarity of the multineuron spike trains is computed using the multineuron Victor–Purpura spike train distance, which can be efficiently implemented in an inductive manner. The classification can be performed by incorporating$k$-nearest neighbors and the multineuron spike train distance as a similarity metric. The proposed framework is quite general, i.e., other multineuron spike train distances and spike train kernel-based methods can be readily incorporated. The effectiveness of the proposed method has been demonstrated on a tactile data set by comparing it with various feature- and spike-based methods.Note to Practitioners—In the soft neuromorphic implementation of biomimetic tactile sensing and the development of the tactile sensing capability in neurobotic systems, the processing and analysis of spike-like tactile signals are quite common. Inspired by human tactile perception, this article proposes a novel supervised spiking neural network method for tactile sensing tasks. The traditional methods have to prespecify target spike trains, which is still an open question. In addition, the current ways to fuse spike trains from multiple neurons are far from mature. This article tackles these two problems using spike train similarity comparison with multineuron spike train distance. The direct spike train similarity comparison avoids the need to prespecify target spike trains. The multineuron spike train distance can inherently fuse spike trains from different neurons. It is demonstrated that the proposed method is able to effectively perform classification in a tactile roughness discrimination task.
Zhengkun Yi, Tiantian Xu 0001, Shifeng Guo, Wanfeng Shang, Xinyu Wu 0001
IEEE Trans Autom. Sci. Eng.3