TY - GEN
T1 - The class-specific down-looking target localization combining recognition and segmentation
AU - An, Meng
AU - Jiang, Zhiguo
AU - Zhao, Danpei
AU - Liu, Zhengyi
PY - 2010
Y1 - 2010
N2 - In the complex down-looking background, it is difficult to accurately localize various targets because of target deformation and background clutter. In this paper, we develop a target detection algorithm that incorporates bottom-up target segmentation and top-down target recognition. There are two main steps in the algorithm: hypotheses generation (top-down) and hypotheses verification (bottom-up). In the generation step, the study makes an improvement on shape feature, which is more robustness to target deformation. The improved shape feature is used to generate the hypotheses of target locations and figure-ground masks. In the hypotheses verification step, the study firstly computes feasible target segmentation that is consistent with top-down target hypotheses. And then a false positive pruning procedure is proposed. The study also finds the fact that the pruned false positive regions do not align with target segmentation for many down-looking targets. The experimental tasks demonstrate that the algorithm can be high precision and recall with a few positive target-training images and that the algorithm, and be generalized to many target classes.
AB - In the complex down-looking background, it is difficult to accurately localize various targets because of target deformation and background clutter. In this paper, we develop a target detection algorithm that incorporates bottom-up target segmentation and top-down target recognition. There are two main steps in the algorithm: hypotheses generation (top-down) and hypotheses verification (bottom-up). In the generation step, the study makes an improvement on shape feature, which is more robustness to target deformation. The improved shape feature is used to generate the hypotheses of target locations and figure-ground masks. In the hypotheses verification step, the study firstly computes feasible target segmentation that is consistent with top-down target hypotheses. And then a false positive pruning procedure is proposed. The study also finds the fact that the pruned false positive regions do not align with target segmentation for many down-looking targets. The experimental tasks demonstrate that the algorithm can be high precision and recall with a few positive target-training images and that the algorithm, and be generalized to many target classes.
KW - False positive pruning
KW - Hypotheses generation
KW - Hypotheses verification
KW - Shape context feature
KW - Target localization
UR - https://www.scopus.com/pages/publications/80053556827
U2 - 10.1109/ICOIP.2010.208
DO - 10.1109/ICOIP.2010.208
M3 - 会议稿件
AN - SCOPUS:80053556827
SN - 9780769542522
T3 - Proceedings - 2010 International Conference on Optoelectronics and Image Processing, ICOIP 2010
SP - 522
EP - 528
BT - Proceedings - 2010 International Conference on Optoelectronics and Image Processing, ICOIP 2010
T2 - 2010 International Conference on Optoelectronics and Image Processing, ICOIP 2010
Y2 - 11 November 2010 through 12 November 2010
ER -