Measuring Membership Privacy on Aggregate Location Time-Series

While location data is extremely valuable for various applications, disclosing it prompts serious threats to individuals' privacy. To limit such concerns, organizations often provide analysts with aggregate time-series that indicate, e.g., how many people are in a location at a time interval, rather than raw individual traces. In this paper, we perform a measurement study to understand Membership Inference Attacks (MIAs) on aggregate location time-series, where an adversary tries to infer whether a specific user contributed to the aggregates. We find that the volume of contributed data, as well as the regularity and particularity of users' mobility patterns, play a crucial role in the attack's success. We experiment with a wide range of defenses based on generalization, hiding, and perturbation, and evaluate their ability to thwart the attack vis-a-vis the utility loss they introduce for various mobility analytics tasks. Our results show that some defenses fail across the board, while others work for specific tasks on aggregate location time-series. For instance, suppressing small counts can be used for ranking hotspots, data generalization for forecasting traffic, hotspot discovery, and map inference, while sampling is effective for location labeling and anomaly detection when the dataset is sparse. Differentially private techniques provide reasonable accuracy only in very specific settings, e.g., discovering hotspots and forecasting their traffic, and more so when using weaker privacy notions like crowd-blending privacy. Overall, our measurements show that there does not exist a unique generic defense that can preserve the utility of the analytics for arbitrary applications, and provide useful insights regarding the disclosure of sanitized aggregate location time-series

Development Of A High Performance Mosaicing And Super-Resolution Algorithm

In this dissertation, a high-performance mosaicing and super-resolution algorithm is described. The scale invariant feature transform (SIFT)-based mosaicing algorithm builds an initial mosaic which is iteratively updated by the robust super resolution algorithm to achieve the final high-resolution mosaic. Two different types of datasets are used for testing: high altitude balloon data and unmanned aerial vehicle data. To evaluate our algorithm, five performance metrics are employed: mean square error, peak signal to noise ratio, singular value decomposition, slope of reciprocal singular value curve, and cumulative probability of blur detection. Extensive testing shows that the proposed algorithm is effective in improving the captured aerial data and the performance metrics are accurate in quantifying the evaluation of the algorithm

The Shannon Entropy Trend of a Fish System Estimated by a Machine Vision Approach Seems to Reflect the Molar Se:Hg Ratio of Its Feed

The present study investigates the suitability of a machine vision-based method to detect deviations in the Shannon entropy (SE) of a European seabass (Dicentrarchus labrax) biological system fed with different selenium: mercury (Se:Hg) molar ratios. Four groups of fish were fed during 14 days with commercial feed (control) and with the same feed spiked with 0.5, 5 and 10 mg of MeHg per kg, giving Se: Hg molar ratios of 29.5 (control-C-1); 6.6, 0.8 and 0.4 (C-2, C-3 and C-4). The basal SE of C-1 and C-2 (Se:Hg > 1) tended to increase during the experimental period, while that of C-3 and C-4 (Se:Hg < 1) tended to decrease. In addition, the differences in the SE of the four systems in response to a stochastic event minus that of the respective basal states were less pronounced in the systems fed with Se: Hg molar ratios lower than one (C-3 and C-4). These results indicate that the SE may be a suitable indicator for the prediction of seafood safety and fish health (i.e., the Se: Hg molar ratio and not the Hg concentration alone) prior to the displaying of pathological symptoms. We hope that this work can serve as a first step for further investigations to confirm and validate the present results prior to their potential implementation in practical settings.We wish to thank Grupo Tinamenor (Cantabria, Spain) for providing the European seabass. Jose Antonio Carrero, of the Department of Analytical Chemistry of the University of the Basque Country, UPV-EHU, measured the concentrations of Hg and Se in the feeds by ICP-MS. The work was supported by grants from the Spanish MINECO (RTC-2014-2837-2-"SELATUN: Minimizacion de la problematica del mercurio del atun y valorizacion del atun como alimento saludable, Programa Retos-Colaboracion 2014" and CTM2012-40203-C02-01-"BMW: Biomarcadores estandar de base cientifica en mejillon para diagnosticar y monitorizar los efectos biologicos de la polucion en el Golfo de Bizkaia: implementacion de la DEME"), Euskampus Fundazioa-Campus of International Excellence (307615SAA2) and from the Basque Government Elkartek Grant KK-2016/00057-"MAROMEGA: Nuevas alternativas para la produccion de omega-3 a partir derecursos marinos". The funding sources had no involvement in the preparation of this manuscript. We would like to express our gratitude to the three anonymous reviewers for their useful comments in order to improve this manuscript

Weighted and filtered mutual information: A Metric for the automated creation of panoramas from views of complex scenes

To contribute a novel approach in the field of image registration and panorama creation, this algorithm foregoes any scene knowledge, requiring only modest scene overlap and an acceptable amount of entropy within each overlapping view. The weighted and filtered mutual information (WFMI) algorithm has been developed for multiple stationary, color, surveillance video camera views and relies on color gradients for feature correspondence. This is a novel extension of well-established maximization of mutual information (MMI) algorithms. Where MMI algorithms are typically applied to high altitude photography and medical imaging (scenes with relatively simple shapes and affine relationships between views), the WFMI algorithm has been designed for scenes with occluded objects and significant parallax variation between non-affine related views. Despite these typically non-affine surveillance scenarios, searching in the affine space for a homography is a practical assumption that provides computational efficiency and accurate results, even with complex scene views. The WFMI algorithm can perfectly register affine views, performs exceptionally well with near-affine related views, and in complex scene views (well beyond affine constraints) the WFMI algorithm provides an accurate estimate of the overlap regions between the views. The WFMI algorithm uses simple calculations (vector field color gradient, Laplacian filtering, and feature histograms) to generate the WFMI metric and provide the optimal affine relationship. This algorithm is unique when compared to typical MMI algorithms and modern registration algorithms because it avoids almost all a priori knowledge and calculations, while still providing an accurate or useful estimate for realistic scenes. With mutual information weighting and the Laplacian filtering operation, the WFMI algorithm overcomes the failures of typical MMI algorithms in scenes where complex or occluded shapes do not provide sufficiently large peaks in the mutual information maps to determine the overlap region. This work has currently been applied to individual video frames and it will be shown that future work could easily extend the algorithm into utilizing motion information or temporal frame registrations to enhance scenes with smaller overlap regions, lower entropy, or even more significant parallax and occlusion variations between views

Forecasts of cohort mortality after age 50

-