Kun He

Kun He


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
4 December 2019 in IEEE Access
Verified
Journal Article
Open access
KHKun He
Kun He
DWDan Wang
Dan Wang
BWBin Wang
Bin Wang
BFBen Feng
Ben Feng
CLChenyu Li
Chenyu Li

1 February 2021 in Computer Methods and Programs in Biomedicine
Verified
Journal Article
Closed access
DWDan Wang
Dan Wang
KHKun He
Kun He
BWBin Wang
Bin Wang
XLXiaoju Liu
Xiaoju Liu
JZJiliu Zhou
Jiliu Zhou

9 October 2020 in Symmetry
Verified
Journal Article
Open access
PDF file
YSYao Su
Yao Su
KHKun He
Kun He
DWDan Wang
Dan Wang
TPTong Peng
Tong Peng
The level set method can segment symmetrical or asymmetrical objects in real images according to image features. However, the segmentation performance varies with feature scale. In order to improve the segmentation effect, we propose an improved level set method on the multiscale edges, which combines the level set method with image multi-scale decomposition to form a unified model. In this model, the segmentation relies on multiscale edges, and the multiscale edges depend on multiscale decomposition. A novel total variation regularization is proposed in multiscale decomposition to preserve edges. The multiscale edges obtained by the multiscale decomposition are integrated into the segmentation process, and the object can be easily extracted from a proper scale. Experimental results indicate that this method has superior performance in precision, recall and F-measure, compared with relative edge-based segmentation methods, and is insensitive to noise and inhomogeneous sub-regions.

9 February 2022 in IET Image Processing
Verified
Journal Article
Open access
PDF file
TPTong Peng
Tong Peng
KHKun He
Kun He
YSYao Su
Yao Su
ZHZiwei Hui
Ziwei Hui
The traditional foreground‐background segmentation models mainly depend on the low‐level features of the image, while ignoring the visual effect. Combining visual perception and local features, a top‐down segmentation model is proposed. This model regards foreground‐background segmentation as a reasoning problem based on visual perception, and calculates the association between two‐pixel blocks through Kullback–Leibler divergence, which solves the ill‐posed problem of traditional single‐pixel recognition. Meanwhile, local features are used to optimize the overall segmentation results in detail and improve the segmentation accuracy. The experimental results on the CMU‐Cornell iCoseg database and the BSDS500 database show that visual perception and local features can help improve the segmentation performance to a certain extent.

1 January 2009
Verified
Conference Paper
Closed access
CLChang Liu
Chang Liu
JZJiLiu Zhou
JiLiu Zhou
KHKun He
Kun He
YZYanLi Zhu
YanLi Zhu
DWDongFang Wang
DongFang Wang
JXJianPing Xia
JianPing Xia
The paper propose a new non-linear dimensionality reduction algorithm based on locally linear embedding called supervised locally linear embedding in tensor space (SLLE/T), in which the local manifold structure within same class are preserved and the separability between different classes is enforced by maximizing distance of each point with its neighbors. To keep structure of data, we introduce tensor representation and reduce SLLE/T into the optimization problem based on HOSVD which is desirable to solve the out of sample problem. We also prove SLLE/T can be united in the graph embedding framework. The comparison experiments on face recognition indicate that SLLE/T outperform most popular dimensionality reduction algorithms both vectorization and tensor version.

24 May 2022 in Symmetry
Verified
Journal Article
Open access
PDF file
BFBEN FENG
BEN FENG
KHKun He
Kun He
The human eyes observe an image through perceptual units surrounded by symmetrical or asymmetrical object contours at a proper scale, which enables them to quickly extract the foreground of the image. Inspired by this characteristic, a model combined with multiscale perceptual grouping and unit-based segmentation is proposed in this paper. In the multiscale perceptual grouping part, a novel total variation regularization is proposed to smooth the image into different scales, which removes the inhomogeneity and preserves the edges. To simulate perceptual units surrounded by contours, the watershed method is utilized to cluster pixels into groups. The scale of smoothness is determined by the number of perceptual units. In the segmentation part, perceptual units are regarded as the basic element instead of discrete pixels in the graph cut. The appearance models of the foreground and background are constructed by combining the perceptual units. According to the relationship between perceptual units and the appearance model, the foreground can be segmented through a minimum-cut/maximum-flow algorithm. The experiment conducted on the CMU-Cornell iCoseg database shows that the proposed model has a promising performance.