TY - GEN
T1 - Adaptive bandwidth mean shift object detection
AU - Chen, Xiaopeng
AU - Huang, Haiyan
AU - Zheng, Haibo
AU - Li, Chengrong
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
KW - ABMSOD
KW - Adaptive bandwidth mean shift
KW - Feature histogram
KW - Object detection
KW - Vision navigation
UR - http://www.scopus.com/inward/record.url?scp=58049107895&partnerID=8YFLogxK
U2 - 10.1109/RAMECH.2008.4681482
DO - 10.1109/RAMECH.2008.4681482
M3 - Conference contribution
AN - SCOPUS:58049107895
SN - 9781424416769
T3 - 2008 IEEE International Conference on Robotics, Automation and Mechatronics, RAM 2008
SP - 210
EP - 215
BT - 2008 IEEE International Conference on Robotics, Automation and Mechatronics, RAM 2008
T2 - 2008 IEEE International Conference on Robotics, Automation and Mechatronics, RAM 2008
Y2 - 21 September 2008 through 24 September 2008
ER -