Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Hindawi Limited  (2)
  • Guo, Jian  (2)
  • Han, Chong  (2)
Type of Medium
Publisher
  • Hindawi Limited  (2)
Person/Organisation
Language
Years
  • 1
    Online Resource
    Online Resource
    Hindawi Limited ; 2016
    In:  Mathematical Problems in Engineering Vol. 2016 ( 2016), p. 1-18
    In: Mathematical Problems in Engineering, Hindawi Limited, Vol. 2016 ( 2016), p. 1-18
    Abstract: Thresholding segmentation based on fuzzy entropy and intelligent optimization is one of the most commonly used and direct methods. This paper takes fuzzy Kapur’s entropy as the best optimal objective function, with modified quick artificial bee colony algorithm (MQABC) as the tool, performs fuzzy membership initialization operations through Pseudo Trapezoid-Shaped (PTS) membership function, and finally, according to the image’s spacial location information, conducts local information aggregation by way of median, average, and iterative average so as to achieve the final segmentation. The experimental results show that the proposed FMQABC (fuzzy based modified quick artificial bee colony algorithm) and FMQABCA (fuzzy based modified quick artificial bee colony and aggregation algorithm) can search out the best optimal threshold very effectively, precisely, and speedily and in particular show exciting efficiency in running time. This paper experimentally compares the proposed method with Kapur’s entropy-based Electromagnetism Optimization (EMO) method, standard ABC, and FDE (fuzzy entropy based differential evolution algorithm), respectively, and concludes that MQABCA is far more superior to the rest in terms of segmentation quality, iterations to convergence, and running time.
    Type of Medium: Online Resource
    ISSN: 1024-123X , 1563-5147
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2016
    detail.hit.zdb_id: 2014442-8
    SSG: 11
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Hindawi Limited ; 2022
    In:  Wireless Communications and Mobile Computing Vol. 2022 ( 2022-2-8), p. 1-20
    In: Wireless Communications and Mobile Computing, Hindawi Limited, Vol. 2022 ( 2022-2-8), p. 1-20
    Abstract: A wireless sensor network (WSN) is one of the most typical applications of the Internet of Things (IoT). Missing values exist in the sensor data streams unavoidably because of the way WSNs work and the environments they are deployed in. In most cases, imputing missing values is the universally adopted approach before making further data processing. There are different ways to implement it, among which the exploitation of correlation information hidden in the sensor data interests many researchers, and lots of results have emerged. Researching in the same way, in this paper, we propose VTN imputation, an online missing data imputation algorithm based on virtual temporal neighbors. Firstly, the virtual temporal neighbor (VTN) in the sensor data stream is defined, and the calculation method is given. Next, the VTN imputation algorithm, which applies VTN to make estimates for missing values by regression is presented. Finally, we make experiments to evaluate the performance of imputing accuracy and computation time for our algorithm on three different real sensor datasets. The experiment results show that the VTN imputation algorithm benefited from the fuller exploitation of the correlation in sensor data and obtained better accuracy of imputation and acceptable processing time in the real applications of WSNs.
    Type of Medium: Online Resource
    ISSN: 1530-8677 , 1530-8669
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2022
    detail.hit.zdb_id: 2045240-8
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages