Fei Chen

Dr. Fei Chen

orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
1 December 2015
Verified
Conference Paper
Closed access
FCFei Chen
Fei Chen
LZLei Zhang
Lei Zhang
HYHuimin Yu
Huimin Yu
Natural image modeling plays a key role in many vision problems such as image denoising. Image priors are widely used to regularize the denoising process, which is an ill-posed inverse problem. One category of denoising methods exploit the priors (e.g., TV, sparsity) learned from external clean images to reconstruct the given noisy image, while another category of methods exploit the internal prior (e.g., self-similarity) to reconstruct the latent image. Though the internal prior based methods have achieved impressive denoising results, the improvement of visual quality will become very difficult with the increase of noise level. In this paper, we propose to exploit image external patch prior and internal self-similarity prior jointly, and develop an external patch prior guided internal clustering algorithm for image denoising. It is known that natural image patches form multiple subspaces. By utilizing Gaussian mixture models (GMMs) learning, image similar patches can be clustered and the subspaces can be learned. The learned GMMs from clean images are then used to guide the clustering of noisy-patches of the input noisy images, followed by a low-rank approximation process to estimate the latent subspace for image recovery. Numerical experiments show that the proposed method outperforms many state-of-the-art denoising algorithms such as BM3D and WNNM.

13 February 2023 in Information Sciences
Verified
Journal Article
Closed access
MYMing Yang
Ming Yang
HCHang Cheng
Hang Cheng
FCFei Chen
Fei Chen
Ximeng LiuXimeng Liu
Ximeng Liu
MWMeiqing Wang
Meiqing Wang
XLXibin Li
Xibin Li

1 June 2013
Verified
Conference Paper
Open access
FCFei Chen
Fei Chen
HYHuimin Yu
Huimin Yu
RHRoland Hu
Roland Hu
XZXunxun Zeng
Xunxun Zeng
In this paper we introduce a new shape-driven approach for object segmentation. Given a training set of shapes, we first use deep Boltzmann machine to learn the hierarchical architecture of shape priors. This learned hierarchical architecture is then used to model shape variations of global and local structures in an energetic form. Finally, it is applied to data-driven variational methods to perform object extraction of corrupted data based on shape probabilistic representation. Experiments demonstrate that our model can be applied to dataset of arbitrary prior shapes, and can cope with image noise and clutter, as well as partial occlusions.

4 January 2024 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
FCFei Chen
Fei Chen
GCGene Cheung
Gene Cheung
XZXue Zhang
Xue Zhang
In the graph signal processing (GSP) literature, graph Laplacian regularizer (GLR) was used for signal restoration to promote piecewise smooth / constant reconstruction with respect to an underlying graph. However, for signals slowly varying across graph kernels, GLR suffers from an undesirable “staircase” effect. In this paper, focusing on manifold graphs—collections of uniform discrete samples on low-dimensional continuous manifolds—we generalize GLR to gradient graph Laplacian regularizer (GGLR) that promotes planar / piecewise planar (PWP) signal reconstruction. Specifically, for a graph endowed with sampling coordinates (e.g., 2D images, 3D point clouds), we first define a gradient operator, using which we construct a gradient graph for nodes’ gradients in the sampling manifold space. This maps to a gradient-induced nodal graph (GNG) and a positive semi-definite (PSD) Laplacian matrix with planar signals as the 0 frequencies. For manifold graphs without explicit sampling coordinates, we propose a graph embedding method to obtain node coordinates via fast eigenvector computation. We derive the means-square-error minimizing weight parameter for GGLR efficiently, trading off bias and variance of the signal estimate. Experimental results show that GGLR outperformed previous graph signal priors like GLR and graph total variation (GTV) in a range of graph signal restoration tasks.

22 October 2012 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
FCFei Chen
Fei Chen
HYHuimin Yu
Huimin Yu
Hao HuHao Hu
Hao Hu
In this paper, a novel variational model based on prior shapes for simultaneous object classification and segmentation is proposed. Given a set of training shapes of multiple object classes, a sparse linear combination of training shapes in a low-dimensional representation is used to regularize the target shape in variational image segmentation. By minimizing the proposed variational functional, the model is able to automatically select the reference shapes that best represent the object by sparse recovery and accurately segment the image, taking into account both the image information and the shape priors. For some applications under an appropriate size of training set, the proposed model allows artificial enlargement of the training set by including a certain number of transformed shapes for transformation invariance, and then the model remains jointly convex and can handle the case of overlapping or multiple objects presented in an image within a small range. Numerical experiments show promising results and the potential of the method for object classification and segmentation.

14 March 2024 in Information Processing & Management
Verified
Journal Article
Closed access
TWTingqiang Wang
Tingqiang Wang
HCHang Cheng
Hang Cheng
Ximeng LiuXimeng Liu
Ximeng Liu
YXYongliang Xu
Yongliang Xu
FCFei Chen
Fei Chen
JCJiaoling Chen
Jiaoling Chen