Xiaopeng Chen

Xiaopeng Chen

Auto-generated profile, based on publicly available information

Xiaopeng Chen

Department of Industrial Engineering, Pusan National University, Busan, Republic of Korea

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
1 September 2008
Verified
Conference Paper
Closed access
XCXiaopeng Chen
Xiaopeng Chen
HHHaiyan Huang
Haiyan Huang
HZHaibo Zheng
Haibo Zheng
CLChengrong Li
Chengrong Li
In this paper, a novel adaptive bandwidth mean shift algorithm toward 2D object detection (ABMSOD) is proposed. It can not only identify whether an object of certain classes exists or not, but also get the scale and orientation besides position very fast. The feature histogram weighted by a kernel with adaptive bandwidth is used for representing the target object model and the candidate object model. Features such as color, texture, gradient and so on can be used. A single piece of image is enough to build a model by calculating the weighted feature histogram of the object in the image. There is no exhaustive training. The similarity of the target model and the candidate model is measured by the Bhattacharyya coefficient. After gathering the models of targets, the algorithm can be used for object detection. In the first step, the algorithm searches the whole image to find the rough positions of possible candidate objects. If the similarities are all below a certain threshold, it reports no object existence. If the similarities are above the threshold, the second step or the adaptive bandwidth mean shift search step is executed to find the best position, orientation and scale of these objects. Experiments show that it successfully detects the position, scale and orientation of objects.

3 July 2024 in Engineering Optimization
Verified
Journal Article
Closed access
XCXiaopeng Chen
Xiaopeng Chen
Xuehong GaoXuehong Gao
Xuehong Gao
CLChong Li
Chong Li
Chanseok ParkChanseok Park
Chanseok Park

17 August 2023 in IEEE Access
Verified
Journal Article
Open access
XCXiaopeng Chen
Xiaopeng Chen
Chanseok ParkChanseok Park
Chanseok Park
Xuehong GaoXuehong Gao
Xuehong Gao
BKBosung Kim
Bosung Kim
The K-means algorithm, widely used in cluster analysis, is a centroid-based clustering method known for its high efficiency and scalability. However, in realistic situations, the operating environment is susceptible to contamination issues caused by outliers and distribution departures, which may lead to clustering results from K-means that are distorted or rendered invalid. In this paper, we introduce three other alternative algorithms, including K-weighted-medians, K-weighted-L 2 -medians, and K-weighted-HLs, to address these issues under the consideration of data with weights. The impact of contamination is investigated by examining the estimation effects on optimal cluster centroids. We explore the robustness of the clustering algorithms from the perspective of the breakdown point, and then conduct experiments on simulated and real datasets to evaluate their performance using new numerical metrics. The results demonstrate the effectiveness of the proposed K-weighted-HLs algorithm, surpassing other algorithms in scenarios involving both contamination issues.

6 January 2026 in Engineering Optimization
Verified
Journal Article
Closed access
XCXiaopeng Chen
Xiaopeng Chen
XLXianglong Liang
Xianglong Liang
Xuehong GaoXuehong Gao
Xuehong Gao
TXTianli Xiao
Tianli Xiao
Chanseok ParkChanseok Park
Chanseok Park


1 July 2019
Verified
Conference Paper
Closed access
SFShilong Feng
Shilong Feng
HXHaoqin Xie
Haoqin Xie
HYHongbo Yin
Hongbo Yin
XCXiaopeng Chen
Xiaopeng Chen
DYDeshun Yang
Deshun Yang
PCPatrick P. K. Chan
Patrick P. K. Chan
The objective of metric learning is to search a suitable metric for measuring distance or similarity between samples. Usually, it aims to minimize the distance between samples of same class and maximizes the distance between samples of different classes. However, most metric learning methods do not consider the sizes of classes, which may cause negative impact on the performance in classification since the size of a cluster is usually ignored in the distance comparison. In this work, we propose a triplet loss with variance constraint. Our method focuses not only on the distances between samples but also on the sizes of classes. The size difference between classes is also minimized in our objective function. The experimental results confirm that our method outperforms the one without the class size variance.