Bootstrapping Color Constancy

Bootstrapping provides a novel approach to training a neural network to estimate the chromaticity of the illuminant in a scene given image data alone. For initial training, the network requires feedback about the accuracy of the network’s current results. In the case of a network for color constancy, this feedback is the chromaticity of the incident scene illumination. In the past1, perfect feedback has been used, but in the bootstrapping method feedback with a considerable degree of random error can be used to train the network instead. In particular, the grayworld algorithm2, which only provides modest color constancy performance, is used to train a neural network which in the end performs better than the grayworld algorithm used to train it

A centralized feedback control model for resource management in wireless networks

In a wireless environment, guaranteeing QoS is challenging because applications at multiple devices share the same limited radio bandwidth. In this paper we introduce and study a resource management model for centralized wireless networks, using feedback control theory. Before applying in practice, the proposed model is evaluated using the well-known 20-sim dynamic system simulator. The experimental results show that flexible and efficient resource allocation can be achieved for a variety of system parameters and WLAN scenarios; however, care should be taken in setting the control parameters and coefficients

A Target Coverage Scheduling Scheme Based on Genetic Algorithms in Directional Sensor Networks

As a promising tool for monitoring the physical world, directional sensor networks (DSNs) consisting of a large number of directional sensors are attracting increasing attention. As directional sensors in DSNs have limited battery power and restricted angles of sensing range, maximizing the network lifetime while monitoring all the targets in a given area remains a challenge. A major technique to conserve the energy of directional sensors is to use a node wake-up scheduling protocol by which some sensors remain active to provide sensing services, while the others are inactive to conserve their energy. In this paper, we first address a Maximum Set Covers for DSNs (MSCD) problem, which is known to be NP-complete, and present a greedy algorithm-based target coverage scheduling scheme that can solve this problem by heuristics. This scheme is used as a baseline for comparison. We then propose a target coverage scheduling scheme based on a genetic algorithm that can find the optimal cover sets to extend the network lifetime while monitoring all targets by the evolutionary global search technique. To verify and evaluate these schemes, we conducted simulations and showed that the schemes can contribute to extending the network lifetime. Simulation results indicated that the genetic algorithm-based scheduling scheme had better performance than the greedy algorithm-based scheme in terms of maximizing network lifetime

Creating a informational cadastral system for the unincorporated areas

This paper is dedicated to a current issue in our country, which is the inventory of properties in the territorial administrative units. Along with the inventory has been achieved also transposition of analog textual information (on paper) in digital format, a process that brings a number of benefits, among which we can mention: the access to information can be done from anywhere, some information can be password protected and only certain people can access, data is accessible anytime, digital information can be easily updated. The general objective of this paper is the development of a database as the central element of Cadastral Informational System, which is a structured collection of data and informations, which is necessary and also sufficient to satisfy user requirements