IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i15p2767-d880120.html
   My bibliography  Save this article

A Parallel Convolution and Decision Fusion-Based Flower Classification Method

Author

Listed:
  • Lianyin Jia

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China
    Yunnan Key Laboratory of Artificial Intelligence, Kunming University of Science and Technology, Kunming 650500, China)

  • Hongsong Zhai

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China)

  • Xiaohui Yuan

    (College of Engineering, University of North Texas, Denton, TX 76203, USA)

  • Ying Jiang

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China)

  • Jiaman Ding

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China)

Abstract

Flower classification is of great significance to the fields of plants, food, and medicine. However, due to the inherent inter-class similarity and intra-class differences of flowers, it is a difficult task to accurately classify them. To this end, this paper proposes a novel flower classification method that combines enhanced VGG16 (E-VGG16) with decision fusion. Firstly, facing the shortcomings of the VGG16, an enhanced E-VGG16 is proposed. E-VGG16 introduces a parallel convolution block designed in this paper on VGG16 combined with several other optimizations to improve the quality of extracted features. Secondly, considering the limited decision-making ability of a single E-VGG16 variant, parallel convolutional blocks are embedded in different positions of E-VGG16 to obtain multiple E-VGG16 variants. By introducing information entropy to fuse multiple E-VGG16 variants for decision-making, the classification accuracy is further improved. The experimental results on the Oxford Flower102 and Oxford Flower17 public datasets show that the classification accuracy of our method reaches 97.69% and 98.38%, respectively, which significantly outperforms the state-of-the-art methods.

Suggested Citation

  • Lianyin Jia & Hongsong Zhai & Xiaohui Yuan & Ying Jiang & Jiaman Ding, 2022. "A Parallel Convolution and Decision Fusion-Based Flower Classification Method," Mathematics, MDPI, vol. 10(15), pages 1-15, August.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:15:p:2767-:d:880120
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/15/2767/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/15/2767/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:10:y:2022:i:15:p:2767-:d:880120. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.