IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/1849995.html
   My bibliography  Save this article

An Image Saliency Detection Method Based on Combining Global and Local Information

Author

Listed:
  • Hangxu Yang
  • Yongjian Gong
  • Kai Wang
  • Zaoli Yang

Abstract

In the field of computer vision, image saliency target detection can not only improve the accuracy of image detection but also accelerate the speed of image detection. In order to solve the existing problems of the saliency target detection algorithms at present, such as inconspicuous texture details and incomplete edge contour display, this paper proposes a saliency target detection algorithm integrating multiple information. The algorithm consists of three processes: preprocessing process, multi-information extraction process, and fusion optimization process. The frequency domain features of the image are calculated, the algorithm calculates the frequency domain features of the image, introduces power law transform and feature normalization, improves the frequency domain features of the image, saves the information of the target region, and inhibits the information of the background region. On three public MSRA, SED2, and ECSSD image datasets, the proposed algorithm is compared with other classical algorithms in subjective and objective comparison experiments. Experimental results show that the proposed algorithm can not only accurately and comprehensively extract significant target regions but also retain more texture information and complete edge information while satisfying the human visual experience. All evaluation indexes are significantly better than the comparison algorithm, showing good reliability and adaptability.

Suggested Citation

  • Hangxu Yang & Yongjian Gong & Kai Wang & Zaoli Yang, 2022. "An Image Saliency Detection Method Based on Combining Global and Local Information," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-13, April.
  • Handle: RePEc:hin:jnlmpe:1849995
    DOI: 10.1155/2022/1849995
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/1849995.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/1849995.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/1849995?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:1849995. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.