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

Computer Image Content Retrieval considering K-Means Clustering Algorithm

Author

Listed:
  • Miao Yu
  • Xiaojie Liu
  • Sagheer Abbas

Abstract

The traditional computer image content retrieval technology can only meet the specific requirements of customers; because of its general features, it cannot comply with the requirements of various environments, purposes, and time simultaneously. This study presents a computer image content retrieval method for a K-means clustering algorithm (KCA). The information collected by computer is preprocessed by K-means clustering algorithm, and the unacquired computer image is labeled based on the optimal learning order according to the KCA. The K-means clustering algorithm classifies the color, pattern, shape, and content of computer images and takes advantage of the invariance advantages of image content retrieval such as scale, rotation, illumination, and blur correction to effectively solve the recurring problems of computer images during retrieval and increase its accuracy. The results of the experiment indicate that the proposed K-means clustering algorithm can enhance the efficiency and performance effectively during image retrieval by computer as compared to the traditional content search algorithm and also help to quickly converge to the query content; it also shows that KCA has good robustness.

Suggested Citation

  • Miao Yu & Xiaojie Liu & Sagheer Abbas, 2022. "Computer Image Content Retrieval considering K-Means Clustering Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-7, May.
  • Handle: RePEc:hin:jnlmpe:7914842
    DOI: 10.1155/2022/7914842
    as

    Download full text from publisher

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

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

    File URL: https://libkey.io/10.1155/2022/7914842?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:7914842. 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.