Obfuscation Based Privacy Preserving Representations are Recoverable Using Neighborhood Information

• URL: http://arxiv.org/abs/2409.11536v1
• Date: Tue, 17 Sep 2024 20:13:54 GMT
• Title: Obfuscation Based Privacy Preserving Representations are Recoverable Using Neighborhood Information
• Authors: Kunal Chelani, Assia Benbihi, Fredrik Kahl, Torsten Sattler, Zuzana Kukelova,
• Abstract summary: Research on privacy-preserving localization has focused on preventing inversion attacks on query image keypoints and the 3D points of the scene map. We point to a common weakness of these obfuscations that allows to recover approximations of the original point positions under the assumption of known neighborhoods. Our results show that these schemes should not be considered privacy-preserving, even though they are claimed to be privacy-preserving.
• Score: 43.14648227833812
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Rapid growth in the popularity of AR/VR/MR applications and cloud-based visual localization systems has given rise to an increased focus on the privacy of user content in the localization process. This privacy concern has been further escalated by the ability of deep neural networks to recover detailed images of a scene from a sparse set of 3D or 2D points and their descriptors - the so-called inversion attacks. Research on privacy-preserving localization has therefore focused on preventing these inversion attacks on both the query image keypoints and the 3D points of the scene map. To this end, several geometry obfuscation techniques that lift points to higher-dimensional spaces, i.e., lines or planes, or that swap coordinates between points % have been proposed. In this paper, we point to a common weakness of these obfuscations that allows to recover approximations of the original point positions under the assumption of known neighborhoods. We further show that these neighborhoods can be computed by learning to identify descriptors that co-occur in neighborhoods. Extensive experiments show that our approach for point recovery is practically applicable to all existing geometric obfuscation schemes. Our results show that these schemes should not be considered privacy-preserving, even though they are claimed to be privacy-preserving. Code will be available at \url{https://github.com/kunalchelani/RecoverPointsNeighborhood}.

Related papers

• DoubleTake: Geometry Guided Depth Estimation [17.464549832122714]
  Estimating depth from a sequence of posed RGB images is a fundamental computer vision task. We introduce a reconstruction which combines volume features with a hint of the prior geometry, rendered as a depth map from the current camera location. We demonstrate that our method can run at interactive speeds, state-of-the-art estimates of depth and 3D scene in both offline and incremental evaluation scenarios.
  arXiv  Detail & Related papers  (2024-06-26T14:29:05Z)
• Learning to Produce Semi-dense Correspondences for Visual Localization [11.415451542216559]
  This study addresses the challenge of performing visual localization in demanding conditions such as night-time scenarios, adverse weather, and seasonal changes. We propose a novel method that extracts reliable semi-dense 2D-3D matching points based on dense keypoint matches. The network utilizes both geometric and visual cues to effectively infer 3D coordinates for unobserved keypoints from the observed ones.
  arXiv  Detail & Related papers  (2024-02-13T10:40:10Z)
• Privacy-Preserving Representations are not Enough -- Recovering Scene Content from Camera Poses [63.12979986351964]
  Existing work on privacy-preserving localization aims to defend against an attacker who has access to a cloud-based service. We show that an attacker can learn about details of a scene without any access by simply querying a localization service.
  arXiv  Detail & Related papers  (2023-05-08T10:25:09Z)
• Flattening-Net: Deep Regular 2D Representation for 3D Point Cloud Analysis [66.49788145564004]
  We present an unsupervised deep neural architecture called Flattening-Net to represent irregular 3D point clouds of arbitrary geometry and topology. Our methods perform favorably against the current state-of-the-art competitors.
  arXiv  Detail & Related papers  (2022-12-17T15:05:25Z)
• Neural 3D Scene Reconstruction with the Manhattan-world Assumption [58.90559966227361]
  This paper addresses the challenge of reconstructing 3D indoor scenes from multi-view images. Planar constraints can be conveniently integrated into the recent implicit neural representation-based reconstruction methods. The proposed method outperforms previous methods by a large margin on 3D reconstruction quality.
  arXiv  Detail & Related papers  (2022-05-05T17:59:55Z)
• How Privacy-Preserving are Line Clouds? Recovering Scene Details from 3D Lines [49.06411148698547]
  This paper shows that a significant amount of information about the 3D scene geometry is preserved in line clouds. Our approach is based on the observation that the closest points between lines can yield a good approximation to the original 3D points.
  arXiv  Detail & Related papers  (2021-03-08T21:32:43Z)
• DH3D: Deep Hierarchical 3D Descriptors for Robust Large-Scale 6DoF Relocalization [56.15308829924527]
  We propose a Siamese network that jointly learns 3D local feature detection and description directly from raw 3D points. For detecting 3D keypoints we predict the discriminativeness of the local descriptors in an unsupervised manner. Experiments on various benchmarks demonstrate that our method achieves competitive results for both global point cloud retrieval and local point cloud registration.
  arXiv  Detail & Related papers  (2020-07-17T20:21:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.