The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Thresholding is an important operation in image analysis which is used in many applications. One of the most efficient techniques for image segmentation is the entropy-based thresholding technique. A popular entropy-based thresholding method is the Kapur thresholding method. In this method, the criterion to select a suitable threshold is the maximization of the Kapur's entropies based on gray-level...
Implicit parallelism exists in a lot of intelligence algorithms. It is the causation of parallel search ability in results space of some algorithms. Implicit parallelism of algorithm is analyzed by physical theory and find that the uncertainty and high entropy state of algorithm are the root of the implicit parallelism. But the uncertainty is the cost of implicit parallelism. In other words, if an...
Energy analysis method of computational complexity is proposed. Entropy and quantum superposition theory are used to calculate the problem??s lower bound of energy consumption. Energy consumption and computational complexity are direct ratio. The computational complexity is decided only by initial state and final state of problem. The algorithm??s details are needless in this method. Energy analysis...
Estimation of Distribution Algorithms (EDAs) is new kinds of colony evolution algorithms. It produces its new generation by constructing probability distribution model through counting excellent information of individuals of present colony EDAs first, and then sampling the model. To solve the NP-Hard question as EDAs searching optimum network structure, a new Maximum Entropy Estimation of Distribution...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.