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

Analysis of Human-Land Coupled Bearing Capacity of Qiangtang Meadow in Northern Tibet Based on Fuzzy Clustering Algorithm

Author

Listed:
  • ShiBao Li

Abstract

Aiming to address the problems of high energy consumption, low efficiency, low correlation between the analyzed and actual results, and poor rationality of research indexes in current methods of analysis of human-land coupled bearing capacity of meadows, a novel method of human-land coupled bearing capacity analysis of Qiangtang meadow in northern Tibet, based on fuzzy clustering algorithm, is proposed. Basic geographic information data in Tibet were acquired, the collected data images were registered by ENVI4.2 software, and the collected data were vectorized by ArcGIS 9.3 software to construct a basic geographic information database in Tibet. Based on the frequency domain processing algorithm, the geographic information image was suppressed by noise and filtered by using a high-pass filter to realize the geographic information data processing in the study area. The human-land coupled bearing capacity analysis of Qiangtang meadow in northern Tibet was evaluated through fuzzy clustering, bearing capacity evaluation, and bearing capacity calculation under the sharing of closure. The experimental results showed that the average running energy consumption of the method was 81 J, and 97% of the analyzed results were consistent with the actual situation. These results indicate that the operation efficiency of the method is high, and the rationality coefficient of the research index is large. The proposed method has superior performance and feasibility.

Suggested Citation

  • ShiBao Li, 2020. "Analysis of Human-Land Coupled Bearing Capacity of Qiangtang Meadow in Northern Tibet Based on Fuzzy Clustering Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-9, May.
  • Handle: RePEc:hin:jnlmpe:8231237
    DOI: 10.1155/2020/8231237
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2020/8231237.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2020/8231237.xml
    Download Restriction: no

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