Feature detection algorithm based on a visual system model

被引:46
|
作者
Peli, E [1 ]
机构
[1] Harvard Univ, Sch Med, Schepens Eye Res Inst, Boston, MA 02114 USA
基金
美国国家航空航天局;
关键词
biological systems; edge detection; image matching; image processing; machine vision;
D O I
10.1109/5.982407
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
An algorithm for the detection of visually relevant luminance features is presented. The algorithm is motivated and directed by current models of the visual system. The algorithm detects edges (sharp luminance transitions) and narrow bars (luminance cusps) and marks them with the proper polarity. The image is first bandpass filtered with oriented filters at a number of scales an octave apart. The suprathreshold image contrast details at each scale are then identified and are compared across scales to find locations in which the signal polarity (sign) is identical at all scales. representing a minimal level of phase congruence across scales. These locations maintain the polarity of the bandpass-filtered image. The result is a polarity-preserving features map representing the edges with pairs of light and dark lines or curves on corresponding sides of the contour Similarly. bar,features are detected and represented with single curves of the proper polarity. The algorithm is implemented without free (fitted) parameters. All parameters are directly derived from visual models and from measurements on human observers. The algorithm is shown to be robust with respect to variations in filter parameters anti requires no use of quadrature filters or Hilbert transforms. The possible utility of such art algorithm within the visual system and in computer vision applications is discussed.
引用
收藏
页码:78 / 93
页数:16
相关论文
共 50 条
  • [1] Visual detection algorithm of water line based on feature fusion
    Zhang Zhen
    Zhou Yang
    Liang Chongzheng
    Li Huabao
    Zhu Jiabin
    PROCEEDINGS OF 2019 14TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONIC MEASUREMENT & INSTRUMENTS (ICEMI), 2019, : 474 - 481
  • [2] Video saliency detection algorithm based on biological visual feature and visual psychology theory
    Fang Zhi-Ming
    Cui Rong-Yi
    Jin Jing-Xuan
    ACTA PHYSICA SINICA, 2017, 66 (10)
  • [3] A Visual Feature Mismatch Detection Algorithm for Optical Flow-Based Visual Odometry
    Li, Ruichen
    Shen, Han
    Wang, Linan
    Liu, Congyi
    Yi, Xiaojian
    UNMANNED SYSTEMS, 2024,
  • [4] Visual saliency landmark detection algorithm based on DNN feature extraction
    Zhao Chunhui
    Zhou Yihui
    Wei Yanyan
    Jiang Shan
    Yu Changbin
    PROCEEDINGS OF THE 35TH CHINESE CONTROL CONFERENCE 2016, 2016, : 5551 - 5556
  • [5] Vehicle detection algorithm based on visual saliency feature and sparse representation
    Research Institute of Automotive Engineering, Jiangsu University, Zhenjiang, China
    不详
    J. Comput. Inf. Syst., 5 (1765-1772):
  • [6] Automatic Model Based Face Feature Detection System
    Chew, Wei Jen
    Ang, Li-Minn
    Seng, Kah Phooi
    INTERNATIONAL SYMPOSIUM OF INFORMATION TECHNOLOGY 2008, VOLS 1-4, PROCEEDINGS: COGNITIVE INFORMATICS: BRIDGING NATURAL AND ARTIFICIAL KNOWLEDGE, 2008, : 1089 - 1094
  • [7] Spatial Feature Based Shadow Detection In Visual Traffic Surveillance System
    Xu, Shaohua
    Zhao, Yong
    Yu, Chunyu
    Shen, Ling
    2008 ISECS INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT, VOL 1, PROCEEDINGS, 2008, : 477 - +
  • [8] A new feature selection model based on ID3 and bees algorithm for intrusion detection system
    Eesa, Adel Sabry
    Orman, Zeynep
    Brifcani, Adnan Mohsin Abdulazeez
    TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2015, 23 (02) : 615 - 622
  • [9] Corner detection based on human visual system model
    Lü, XG
    Zhou, J
    CHINESE JOURNAL OF ELECTRONICS, 2001, 10 (01): : 35 - 37
  • [10] Evolutionary Algorithm-based Feature Selection for an Intrusion Detection System
    Singh, Devendra Kumar
    Shrivastava, Manish
    ENGINEERING TECHNOLOGY & APPLIED SCIENCE RESEARCH, 2021, 11 (03) : 7130 - 7134