Search

International audience; This work addresses the distributed consensus tracking problem for an extended class of high-order nonlinear multiagent networks with guaranteed performances over a directed graph. The adding one power integrator methodology is skillfully incorporated into the distributed protocol so as to tackle high powers in a distributed fashion. The distinguishing feature of the proposed design, besides guaranteeing closed-loop stability, is that some transient-state and steady-state metrics (e.g., maximum overshoot and convergence rate) can be preselected a priori by devising a novel performance function. More precisely, as opposed to conventional prescribed performance functions, a new asymmetry local tracking error-transformed variable is designed to circumvent the singularity problem and alleviate the computational burden caused by the conventional transformation function and its inverse function, and to solve the nondifferentiability issue that exists in most existing designs. Furthermore, the consensus tracking error is shown to converge to a residual set, whose size can be adjusted as small as desired through selecting proper parameters, while ensuring closed-loop stability and preassigned performances. One numerical and one practical example have been conducted to highlight the superiority of the proposed strategy.

International audience; Traditional hyperspectral (HS) pansharpening aims at fusing a HS image with its panchromatic (PAN) counterpart, to bring the spatial resolution of the HS image to that of the PAN image. However, in many practical applications, arbitrary resolution HS (ARHS) pansharpening is required, where the HS and PAN images need to be integrated to generate a pansharpened HS image with arbitrary resolution (usually higher than that of the PAN image). Such an innovative task brings forth new challenges for the pansharpening technique, mainly including how to reconstruct HS images beyond the training scale and how to guarantee spectral fidelity at any spatial resolutions. To tackle the challenges, we present a novel convolutional neural network (CNN)-based method for ARHS pansharpening called ARHS-CNN. It is based on a two-step relay optimization process, which is associated with a multilevel enhancement subnetwork and a rescaling subnetwork. With a careful design following the thread, our ARHS-CNN is able to pansharpen HS images to any spatial resolutions using just a single CNN model trained on a limited number of scales while meantime to keep spectral fidelity at those resolutions, which wins an obvious advantage over traditional pansharpening methods. Experimental results obtained on several datasets verify the excellent performance of our ARHS-CNN method.

International audience; Occlusion effect, an inherent problem of terrestrial laser scanning (TLS) measurements, limits the potential of TLS data in tree attribute estimation. Multiple scans seek to mitigate this effect to provide enhanced scan completeness. However, the numbers and locations of the scans (i.e., the scan design) are usually determined via a subjective assessment of the tree density, spatial patterns of trees, and attributes to be derived. These could cause suboptimal scan completeness and limit tree attribute estimation. This study proposed an iterative-mode scan design to minimize the occlusion effect. First, we introduced a PoTo index based on visibility analysis to evaluate how many trees can be scanned from a location and to select effective candidates for the optimal TLS location. Second, we introduced a cumulative degree of ring closure (CDRC) to quantify the scan completeness for each candidate and determine the optimal TLS location. The TLS data sets of virtual forests with field-measured and synthetic plot parameter settings were simulated according to iterative- and regular-mode designs by using a Heidelberg light detection and ranging (LiDAR) Operations Simulator (HELIOS). The results demonstrated that an iterative-mode design can improve the scan completeness of trees compared to the regular-mode design. The tree attribute (diameter at breast height (DBH), tree height, stem curve, and crown volume) estimates of the iterative-mode design were less erroneous than those of the regular-mode design (e.g., the root-mean-square error (RMSE) could decrease the stem curve estimation by 38 and the crown volume estimation by 15). This study suggests that the iterative-mode design can obtain an improved quality of the TLS data, especially for dense stands.

The randomization methods that are applied for privacy-preserving data mining are commonly subject to reconstruction, linkage, and semantic-related attacks. Some existing works employed random noise addition to realize probabilistic anonymity, aiming only at linkage attacks. Random noise addition is vulnerable to reconstruction attacks, and is unable to achieve semantic closeness, particularly on high-dimensional data, to prevent semantic-related attacks. For linkage attacks, the main security vulnerability of their proposed probabilistic anonymity lies in the assumption that the attacker had a priori knowledge of the quasi-identifiers of all individuals. When only some individuals leak their quasi-identifiers, the proposed model will become incapable, because the attacker can deploy a different linkage attack that has not been studied before. This type of attack is much easier to deploy and is thus very harmful. In this paper, we propose new frameworks of probabilistic $(1,k)$ - and $(k,k)$ -anonymity to defend against all these linkage attacks, and realize the frameworks on a hybrid randomization model. The model is also secure against reconstruction attacks. We further achieve statistical semantic closeness of high-dimensional data to prevent semantic-related attacks on the model. The frameworks also allow us to re-design the traditional $K$ -nearest neighbor algorithm to leverage the introduced data uncertainty and improve the mining results. This paper demonstrates the promising applications in large-scale and high-dimensional data mining in clouds, by providing high efficiency and security to protect data privacy, guaranteeing high data utility for mining purposes, on-time processing, and non-interactive data publishing.