TY - GEN
T1 - Finding regions of interest based on scale-space keypoint detection
AU - Zeng, Ming
AU - Yang, Ting
AU - Li, Youfu
AU - Meng, Qinghao
AU - Liu, Jian
AU - Han, Tiemao
PY - 2011
Y1 - 2011
N2 - One of the major challenges for modeling visual attention mechanisms is to extract visual cues for automatic detection perceptually important regions in a scene. Here, we propose a simple model for detecting regions of interest (ROI) inspired from keypoint analysis. We adopted the idea that the appearance of an interest region can be well characterized by the distribution of its local features (e.g., keypoints). ROI detection involves five steps: the input image is first decomposed into a set of low-level vision feature maps (e.g., intensity map, and two double-opponent color maps). Extrema in difference of Gaussian (DoG) scale space are then calculated for detecting the keypoints within each feature maps. The location and scale information of keypoints are integrated to create three conspicuity maps. These conspicuity maps are normalized and summed into an overall saliency map. Finally, a "small" number of salient locations are successively selected using a dynamical neural network. Experimental results show that the proposed model outperforms the Itti's model, a state-of-the-art competitive approach. © 2011 Springer-Verlag.
AB - One of the major challenges for modeling visual attention mechanisms is to extract visual cues for automatic detection perceptually important regions in a scene. Here, we propose a simple model for detecting regions of interest (ROI) inspired from keypoint analysis. We adopted the idea that the appearance of an interest region can be well characterized by the distribution of its local features (e.g., keypoints). ROI detection involves five steps: the input image is first decomposed into a set of low-level vision feature maps (e.g., intensity map, and two double-opponent color maps). Extrema in difference of Gaussian (DoG) scale space are then calculated for detecting the keypoints within each feature maps. The location and scale information of keypoints are integrated to create three conspicuity maps. These conspicuity maps are normalized and summed into an overall saliency map. Finally, a "small" number of salient locations are successively selected using a dynamical neural network. Experimental results show that the proposed model outperforms the Itti's model, a state-of-the-art competitive approach. © 2011 Springer-Verlag.
KW - regions of interest
KW - saliency map
KW - scale-space keypoint detection
UR - https://www.scopus.com/pages/publications/79960409015
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-79960409015&origin=recordpage
U2 - 10.1007/978-3-642-22456-0_61
DO - 10.1007/978-3-642-22456-0_61
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9783642224553
VL - 202 CCIS
T3 - Communications in Computer and Information Science
SP - 428
EP - 435
BT - Advances in Computer Science and Education Applications
T2 - 2011 International Conference on Computer Science and Education, CSE 2011
Y2 - 9 July 2011 through 10 July 2011
ER -