Dan Wang

Dan Wang

Auto-generated profile, based on publicly available information

Dan Wang

College of Materials Science and Engineering, Sichuan University, Chengdu 610064, China

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
1 July 2020 in Pattern Recognition
Verified
Journal Article
Closed access
KHKun He
Kun He
DWDan Wang
Dan Wang
MTMiao Tong
Miao Tong
ZZZhijuan Zhu
Zhijuan Zhu

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

29 October 2018 in IEEE Access
Verified
Journal Article
Open access
KHKun He
Kun He
DWDan Wang
Dan Wang
MTMiao Tong
Miao Tong
XZXu Zhang
Xu Zhang
Interactive segmentation algorithms based on graph cuts can extract the foreground successfully from a simple scene. However, they are ineffective for complex-scene images. To improve the segmentation performance, we propose an interactive segmentation algorithm which combines the segmentation and the multiscale smoothing into a unified model. This model consists of the segmentation and the smoothing. The segmentation relies on the multiscale appearances which depend on the smoothing. In the smoothing part, the total variation is used to preserve geometric shape of the foreground, and captures different scale edges and appearances for segmentation. Combining the multiscale edges and appearances, we propose a novel Gibbs energy functional for segmentation. The exact global minima of the energy can be found by jointing the image smoothing and the optimization of segmentation. In this algorithm, the smoothing motivates that the foreground could be detected easily from a proper scale. Experimental results on the BSD300 dataset and Weizmann horse’s database indicate that, compared to the existing interactive segmentation algorithms, the proposed algorithm provides competitive performance in terms of segmentation accuracy.

1 September 2016 in Journal of Electronic Imaging
Verified
Journal Article
Open access
PDF file
KHKun He
Kun He
DWDan Wang
Dan Wang
XZXiuqing Zheng
Xiuqing Zheng
Nowadays, typical active contour models are widely applied in image segmentation. However, they perform badly on real images with inhomogeneous subregions. In order to overcome the drawback, this paper proposes an edge-preserving smoothing image segmentation algorithm. At first, this paper analyzes the edge-preserving smoothing conditions for image segmentation and constructs an edge-preserving smoothing model inspired by total variation. The proposed model has the ability to smooth inhomogeneous subregions and preserve edges. Then, a kind of clustering algorithm, which reasonably trades off edge-preserving and subregion-smoothing according to the local information, is employed to learn the edge-preserving parameter adaptively. At last, according to the confidence level of segmentation subregions, this paper constructs a smoothing convergence condition to avoid oversmoothing. Experiments indicate that the proposed algorithm has superior performance in precision, recall, and F-measure compared with other segmentation algorithms, and it is insensitive to noise and inhomogeneous-regions.