No abstract

Air pollution is one of the prime adverse environmental outcomes of urbanization and industrialization. The first step toward air pollution mitigation is monitoring and identifying its source(s). The deployment of a sensor array always involves a tradeoff between cost and performance. The performance of the network heavily depends on optimal deployment of the sensors. The latter is known as the location–allocation problem. Here, a new approach drawing on information theory is presented, in which air pollution levels at different locations are computed using a Lagrangian atmospheric dispersion model under various meteorological conditions. The sensors are then placed in those locations identified as the most informative. Specifically, entropy is used to quantify the locations’ informativity. This entropy method is compared to two commonly used heuristics for solving the location–allocation problem. In the first, sensors are randomly deployed; in the second, the sensors are placed according to maximal cumulative pollution levels (i.e., hot spots). Two simulated scenarios were evaluated: one containing point sources and buildings and the other containing line sources (i.e., roads). The entropy method resulted in superior sensor deployment in terms of source apportionment and dense pollution field reconstruction from the sparse sensors’ network measurements.

No abstract

Data analysis has increasingly relied on machine learning in recent years. Since machines implement mathematical algorithms without knowing the physical nature of the problem, they may be accurate but lack the flexibility to move across different domains. This manuscript presents a machine-educating approach where a machine is equipped with a physical model, universal building blocks, and an unlabeled dataset from which it derives its decision criteria. Here, the concept of machine education is deployed to identify thin layers of organic materials using hyperspectral imaging (HSI). The measured spectra formed a nonlinear mixture of the unknown background materials and the target material spectra. The machine was educated to resolve this nonlinear mixing and identify the spectral signature of the target materials. The inputs for educating and testing the machine were a nonlinear mixing model, the spectra of the pure target materials (which are problem invariant), and the unlabeled HSI data. The educated machine is accurate, and its generalization capabilities outperform classical machines. When using the educated machine, the number of falsely identified samples is ~ 100 times lower than the classical machine. The probability for detection with the educated machine is 96% compared to 90% with the classical machine.

<p>Urbanization and industrialization processes are accompanied by adverse environmental effects, such as air pollution. The first action in reducing air pollution is the detection of its source(s). This is achievable through monitoring. When deploying a sensor array, one must balance between the array's cost and performance. This optimization problem is known as the location-allocation problem. Here, a new solution approach, which draws its foundation from information theory is presented. The core of the method is air-pollution levels computed by a dispersion model in various meteorological conditions. The sensors are then placed in the locations which information theory identifies as the most uncertain. The method is compared with two other heuristics typically applied for solving the location-allocation problem. In the first, sensors are randomly deployed, in the second, the sensors are placed according to the maximal cumulative pollution levels (i.e., hot spot). For the comparison two simulated scenes were evaluated, one contains point sources and buildings, and the other also contains line sources (i.e., roads). It shows that the Entropy method resulted in a superior sensors' deployment compared to the other two approaches in terms of source apportionment and dense pollution field reconstruction from the sensors' network measurements.</p>