913 resultados para Markov map
Resumo:
This paper describes the light reflectance characteristics ofwaterhyacinth [Eichhornia crassipes (Mort.) Solms] and hydrilla [Hydrilla verticillata (L.F.) Royle] and the application of airborned videography with global positioning system (GPS) and geographic information system (GIS) technologies for distinguishing and mapping the distribution of these two aquatic weeds in waterways of southern Texas. Field reflectance measurements made at several locations showed that waterhyacinth generally had higher near-infrared (NIR) reflectance than associated plant species and water. Hydrilla had lower NIR reflectance than associated plant species and higher NIR reflectance than water. Reflectance measurements made on hydrilla plants submerged below the water surface had similar spectral characteristics to water. Waterhyacinth and hydrilla could be distinguished in color-infrared (CIR) video imagery where they had bright orange-red and reddish-brown image responses, respectively. Computer analysis of the imagery showed that waterhyacinth and hydrilla infestaions could be quantified. An accuracy assessment performed on the classified image showed an overall accuracy of 87.7%. Integration of the GPS with the video imagery permitted latitude/longitude coordinates of waterhyacinth and hydrilla infestation to be recorded on each image. A portion of the Rio Grande River in extreme southern Texas was flown with the video system to detect waterhyacinth and hydrilla infestaions. The GPS coordinates on the CIR video scenes depicting waterhyacinth and hydrilla infestations were entered into a GIS to map the distribution of these two noxious weeds in the Rio Grande River.
Resumo:
Methods for generating a new population are a fundamental component of estimation of distribution algorithms (EDAs). They serve to transfer the information contained in the probabilistic model to the new generated population. In EDAs based on Markov networks, methods for generating new populations usually discard information contained in the model to gain in efficiency. Other methods like Gibbs sampling use information about all interactions in the model but are computationally very costly. In this paper we propose new methods for generating new solutions in EDAs based on Markov networks. We introduce approaches based on inference methods for computing the most probable configurations and model-based template recombination. We show that the application of different variants of inference methods can increase the EDAs’ convergence rate and reduce the number of function evaluations needed to find the optimum of binary and non-binary discrete functions.
Resumo:
In this work the state of the art of the automatic dialogue strategy management using Markov decision processes (MDP) with reinforcement learning (RL) is described. Partially observable Markov decision processes (POMDP) are also described. To test the validity of these methods, two spoken dialogue systems have been developed. The first one is a spoken dialogue system for weather forecast providing, and the second one is a more complex system for train information. With the first system, comparisons between a rule-based system and an automatically trained system have been done, using a real corpus to train the automatic strategy. In the second system, the scalability of these methods when used in larger systems has been tested.