Image segmentation algorithm is to divide the images into several regions with specific and unique characteristics, and is an important technology to extract the interested target. Image segmentation is the key step t...
详细信息
ISBN:
(纸本)9781509010660
Image segmentation algorithm is to divide the images into several regions with specific and unique characteristics, and is an important technology to extract the interested target. Image segmentation is the key step to realize the research from general image processing into image analysis, and is vital preprocessing method of image recognition and computer vision. We cannot obtain correct recognition if we do not have correct segmentation. Nevertheless, the only basis of segmentation process is brightness or color of pixels in an image. In the processing of computer automatic segmentation, we experience several problems, such as uneven illumination, effect of noise, indistinct part in image, and shadow, and these factors may cause false segmentation. In order to overcome the disadvantages of the traditional segmentation algorithm, in this paper, we propose a novel segmentation algorithm based on Markov Random Field. The segmentation algorithm proposed in this paper is based on Markov Random Field Mode and Bayesian theory, and we determine the objective function in image segmentation problem on the basis of optimality criterion of statistical decision and estimation theory. Some optimization algorithms are used to obtain the maximum possible distribution of Markov Random Field which satisfy these conditions. The experimental result reflects the effectiveness and robustness of our algorithm. As a supplement, we analyze the development trend of the Markov Random Field theory.
Through the study of various problems in the elimination game, with unity 3D technology which has the advantages of convenient interactive graphical development environment and the cross-platform features, and C# scri...
详细信息
ISBN:
(纸本)9781509023059
Through the study of various problems in the elimination game, with unity 3D technology which has the advantages of convenient interactive graphical development environment and the cross-platform features, and C# scripting language is simple, safety, efficient, this paper carefully investigated and described the candy elimination of categories in mobile Android game algorithm design, AI design and the game development process. To achieve the level of the game options, multiple candy elimination, special effects, scores of statistics, and other functions. For the development of such games or other games with a certain guidance and reference.
With the rapid development of RFID technologies,RFID has been introduced into applications such as supply chain management,inventory control,sampling inspection,3-D positioning and object ***,the reader accesses all t...
详细信息
ISBN:
(纸本)9781509009107
With the rapid development of RFID technologies,RFID has been introduced into applications such as supply chain management,inventory control,sampling inspection,3-D positioning and object ***,the reader accesses all the tags in its interrogation region while some applications may only need to identify the tags in a specified area which is smaller than the reader's interrogation *** paper concerns the essential problem of estimating cardinality of tags in the specified *** key novelty of our solution builds on an estimation synopsis that can capture key counting information by moving the reader as well as a simple *** the help of this data structure,a BS can be obtained which only contains the target *** computing the number of 1 in the BS,we can easily get cardinality |E| of the tags in the specified *** conduct extensive experiments to examine this design and the results shows that our solution achieves high *** it not requires any modification of tags and can be implemented with only one reader and some passive RFID tags,the proposed method is easy to deploy in a practical system.
A multistage graph is center problem of computer science, many coordination and consistency problems can be convert into multistage graph problem. We obtained the fitness function by coding the vertex of multistage gr...
详细信息
ISBN:
(纸本)9781467397148
A multistage graph is center problem of computer science, many coordination and consistency problems can be convert into multistage graph problem. We obtained the fitness function by coding the vertex of multistage graph, and designed the genetic algorithm for solving multistage graph problem. Experiment results show that this algorithm is very effective and feasible.
Many important properties of materials such as strength, ductility, hardness and conductivity are determined by the microstructures of the material. During the formation of these microstructures, grain coarsening play...
详细信息
ISBN:
(纸本)9781467388153
Many important properties of materials such as strength, ductility, hardness and conductivity are determined by the microstructures of the material. During the formation of these microstructures, grain coarsening plays an important role. The Cahn-Hilliard equation has been applied extensively to simulate the coarsening kinetics of a two-phase microstructure. It is well accepted that the limited capabilities in conducting large scale, long time simulations constitute bottlenecks in predicting microstructure evolution based on the phase field approach. We present here a scalable time integration algorithm with large step-sizes and its efficient implementation on the Sunway TaihuLight supercomputer. The highly nonlinear and severely stiff Cahn-Hilliard equations with degenerate mobility for microstructure evolution are solved at extreme scale, demonstrating that the latest advent of high performance computing platform and the new advances in algorithm design are now offering us the possibility to simulate the coarsening dynamics accurately at unprecedented spatial and time scales.
Exploration of the search space through the optimisation of phenotypic diversity is of increasing interest within the field of evolutionary robotics. Novelty search and the more recent MAP-Elites are two state of the ...
详细信息
ISBN:
(纸本)9783319458236;9783319458229
Exploration of the search space through the optimisation of phenotypic diversity is of increasing interest within the field of evolutionary robotics. Novelty search and the more recent MAP-Elites are two state of the art evolutionary algorithms which diversify low dimensional phenotypic traits for divergent exploration. In this paper we introduce a novel alternative for rapid divergent search of the feature space. Unlike previous phenotypic search procedures, our proposed Spatial, Hierarchical, Illuminated Neuro-Evolution (SHINE) algorithm utilises a tree structure for the maintenance and selection of potential candidates. SHINE penalises previous solutions in more crowded areas of the landscape. Our experimental results show that SHINE significantly outperforms novelty search and MAP-Elites in both performance and exploration. We conclude that the SHINE algorithm is a viable method for rapid divergent search of low dimensional, phenotypic landscapes.
In this paper a control strategy of three-phase semiconductor converter of electrical energy for ground fault capacitive current compensation in ungrounded distribution networks is described. A mathematical average mo...
详细信息
ISBN:
(纸本)9781509008551
In this paper a control strategy of three-phase semiconductor converter of electrical energy for ground fault capacitive current compensation in ungrounded distribution networks is described. A mathematical average model of the inverter is obtained. Used decomposition method of the three phase voltage and current into instantaneous positive, negative and zero sequences based on Hilbert transform are described. A control algorithm of converter with using of three phase system decomposition into symmetrical components is designed. The controller of each sequence uses dq0 frame rotating and PI (proportional integral) controllers. The simulation results of inverter with capacitive current compensation in the short circuit mode are presented.
In this paper(1) we argue that flexible algorithm frameworks can be useful to capture the wide variety of algorithmic components for heuristic algorithms and serve as basic experimental frameworks. One of the utilitie...
详细信息
ISBN:
(纸本)9781450343237
In this paper(1) we argue that flexible algorithm frameworks can be useful to capture the wide variety of algorithmic components for heuristic algorithms and serve as basic experimental frameworks. One of the utilities is that they can implement the wide variety of different algorithm components and their alternative choices for single stochastic local search methods and we are currently extending existing frameworks in that direction. We exemplify this approach considering the example of Simulated Annealing (SA). In fact, a wide variety of design choices of SA algorithms has been proposed in the literature and algorithm frameworks may (i) simply collect potentially all available choices, (ii) provide a tool for the experimental analysis of specific algorithms and component choices, and (iii) allow the generation of new algorithm variants by combining exisiting components in new ways. We show some limited computational experiments that show the benefit of tuning in this context and the way conclusions on the performance of algorithms are altered in this way.
The rapid development of the Internet of Things (IoT) has increased the requirement on the processing capabilities of sensors, mobile phones and smart devices. Meanwhile, energy efficiency techniques are in desperate ...
详细信息
ISBN:
(纸本)9781509053032
The rapid development of the Internet of Things (IoT) has increased the requirement on the processing capabilities of sensors, mobile phones and smart devices. Meanwhile, energy efficiency techniques are in desperate need as most devices in the IoT systems are battery powered. Following the above two trends, this work explores the memory system energy efficiency for a general multi-core architecture. This architecture integrates a local memory in each processing core, with a large off-chip memory shared among multiple cores. Decisions need to be made on whether tasks will be executed with the shared memory or the local memory to minimize the total energy consumption within real-time constraints. This paper proposes optimal schemes as well as a polynomial-time approximation algorithm with constant ratio. The complexity analysis of the problem for different task and system models is also presented. Experimental results show that the proposed approximation algorithm performs close to the optimal solution in average.
Novelty search is an evolutionary approach which promotes phenotypic diversity in a population. Novelty search has been successfully applied to a wide range of domains and a number of variants have been proposed. Here...
详细信息
ISBN:
(纸本)9781450343237
Novelty search is an evolutionary approach which promotes phenotypic diversity in a population. Novelty search has been successfully applied to a wide range of domains and a number of variants have been proposed. Here we introduce Multiple Assessment Directed Novelty Search (MADNS), which exploits the notion that a diverse population optimised through phenotypic novelty may contain solutions to multiple conflicting objectives. We show that by utilising the MADNS algorithm, an evolutionary trajectory may be simultaneously directed towards conflicting objectives. We conclude that, through applying MADNS and MC-MADNS, a divergent evolutionary trajectory may be directed to provide simultaneous solutions to multiple conflicting problems in domains with large potential for exploration.
暂无评论