Revisiting Geometric Obfuscation with Dual Convergent Lines for Privacy-Preserving Image Queries in Visual Localization

• URL: http://arxiv.org/abs/2604.22310v1
• Date: Fri, 24 Apr 2026 07:44:57 GMT
• Title: Revisiting Geometric Obfuscation with Dual Convergent Lines for Privacy-Preserving Image Queries in Visual Localization
• Abstract summary: Privacy-Preserving Image Queries (PPIQ) are an emerging mechanism for cloud-based visual localization.<n>Main approaches for PPIQ, primarily geometry-based and segmentation-based obfuscation, both suffer from privacy attacks.<n>We introduce Dual Convergent Lines, a novel keypoint obfuscation method demonstrating strong resilience against such attack.
• Score: 7.9971883411780285
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Privacy-Preserving Image Queries (PPIQ) are an emerging mechanism for cloud-based visual localization, enabling pose estimation from obfuscated features instead of private images or raw keypoints. However, the main approaches for PPIQ, primarily geometry-based and segmentation-based obfuscation, both suffer from vulnerabilities to recent privacy attacks. In particular, a fundamental limitation of geometry-based obfuscation is that the spatial distribution of obfuscated neighboring lines still effectively surrounds the original keypoint location, providing exploitable cues for recovering the original points. We revisit this geometric paradigm and introduce Dual Convergent Lines (DCL), a novel keypoint obfuscation method demonstrating strong resilience against such attack. DCL places two fixed anchors on a central partition line and lifts each keypoint to a line originating from one of them, with the active anchor determined by the keypoint's location. This arrangement invalidates the geometry-recovery attack by making its optimization ill-posed: Neighboring lines either misleadingly converge to one anchor, yielding a trivial solution, or become near-parallel at the partition boundary, yielding an unstable high-variance solution. Both outcomes thwart point recovery. DCL is also compatible with an existing line-based solver, enabling deployment in traditional localization pipelines. Experiments on both indoor and large-scale outdoor datasets demonstrate DCL's robustness against privacy attacks, efficiency, and scalability, while achieving practical localization performance.

Related papers

• Cross-Coordinate Correspondence Pruning for Image-to-Point Cloud Registration [70.44225088078274]
  We propose a novel Cross-Coordinate Correspondences Pruning (CCP) strategy to acquire sufficient inliers while ensuring a low outlier ratio.<n>Our method achieves a significant performance improvement, surpassing existing state-of-the-art methods by at least 8.6% in Registration Recall across various benchmarks.
  arXiv  Detail & Related papers  (2026-07-19T11:45:14Z)
• LCPNet: Latent Consistent Proximal Unfolding Network for Infrared Small Target Detection [50.3892176822492]
  Infrared small target detection (IRSTD) aims to identify long distance small targets from complex infrared backgrounds.<n>Deep learning methods have improved IRSTD by learning discriminative image-to-mask mappings.<n>Deep unfolding methods partially address this issue by embedding model-driven iterations into neural networks.<n>We propose Latent Consistent Proximal unfolding network (LCPNet) to address these limitations.
  arXiv  Detail & Related papers  (2026-07-06T02:15:09Z)
• Privacy-Preserving Decentralized Cooperative Localization with Range-Only Measurements: A Convex Optimization Based Approach [12.542964150821321]
  Traditional cooperative approaches require sharing explicit spatial coordinates across the network.<n>We propose a privacy-preserving Decentralized Cooperative localization framework based on convex optimization.<n>Our framework outperforms existing SDP-based localization method in accuracy, while guaranteeing operational privacy and maintaining highly scalable, parallelizable computation.
  arXiv  Detail & Related papers  (2026-06-29T00:39:51Z)
• From Measurement to Mitigation: Quantifying and Reducing Identity Leakage in Image Representation Encoders with Linear Subspace Removal [9.492715910999749]
  We propose a benchmark of visual embeddings that reports open-set verification at low false-accept rates and a one-shot linear projector that removes an estimated identity subspace.<n>Across CelebA-20 and VGGFace2, we show that these encoders are robust under open-set linear probes.<n>Our results establish the first attacker-calibrated facial privacy audit of non-FR encoders.
  arXiv  Detail & Related papers  (2026-04-07T01:03:51Z)
• IoUCert: Robustness Verification for Anchor-based Object Detectors [58.35703549470485]
  We introduce IoUCert, a novel formal verification framework designed specifically to overcome these bottlenecks in anchor-based object detection architectures.<n>We show that our method enables the robustness verification of realistic, anchor-based models including SSD, YOLOv2, and YOLOv3 variants against various input perturbations.
  arXiv  Detail & Related papers  (2026-03-03T14:36:46Z)
• Thinking with Images as Continuous Actions: Numerical Visual Chain-of-Thought [55.65577137924979]
  We propose a framework that enables MLLMs to reason over images using continuous numerical coordinates.<n> NV-CoT expands the MLLM action space from discrete vocabulary tokens to a continuous Euclidean space.<n>Experiments on three benchmarks demonstrate that NV-CoT significantly improves localization precision and final answer accuracy.
  arXiv  Detail & Related papers  (2026-02-27T12:04:07Z)
• Learning Fine-Grained Correspondence with Cross-Perspective Perception for Open-Vocabulary 6D Object Pose Estimation [14.262846967061947]
  Fine-grained Correspondence Pose Estimation (FiCoP) is a framework that transitions from noise-prone global matching to spatially-constrained patch-level correspondence.<n>FiCoP improves Average Recall by 8.0% and 6.1%, respectively, compared to the state-of-the-art method.
  arXiv  Detail & Related papers  (2026-01-20T03:48:54Z)
• Enhancing CLIP Robustness via Cross-Modality Alignment [54.01929554563447]
  We propose Cross-modality Alignment, an optimal transport-based framework for vision-language models.<n> COLA restores global image-text alignment and local structural consistency in the feature space.<n> COLA is training-free and compatible with existing fine-tuned models.
  arXiv  Detail & Related papers  (2025-10-28T03:47:44Z)
• A Divide-and-Conquer Approach for Global Orientation of Non-Watertight Scene-Level Point Clouds Using 0-1 Integer Optimization [18.15181405364316]
  Orienting point clouds is a fundamental problem in computer graphics and 3D vision.<n>We propose DACPO (Divide-And-Conquer Point Orientation), a novel framework for scalable and robust point cloud orientation.<n>We show how DACPO segments the input point cloud into smaller, manageable blocks, processes each block independently, and integrates the results through a global optimization stage.
  arXiv  Detail & Related papers  (2025-05-29T14:21:22Z)
• DiffCom: Decoupled Sparse Priors Guided Diffusion Compression for Point Clouds [54.96190721255167]
  Lossy compression relies on an autoencoder to transform a point cloud into latent points for storage.<n>We propose a diffusion-based framework guided by sparse priors that achieves high reconstruction quality, especially at lows.
  arXiv  Detail & Related papers  (2024-11-21T05:41:35Z)
• Obfuscation Based Privacy Preserving Representations are Recoverable Using Neighborhood Information [43.14648227833812]
  Research on privacy-preserving localization has focused on preventing inversion attacks on query image keypoints and the 3D points of the scene map.<n>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.<n>Our results show that these schemes should not be considered privacy-preserving, even though they are claimed to be privacy-preserving.
  arXiv  Detail & Related papers  (2024-09-17T20:13:54Z)
• GLACE: Global Local Accelerated Coordinate Encoding [66.87005863868181]
  Scene coordinate regression methods are effective in small-scale scenes but face significant challenges in large-scale scenes. We propose GLACE, which integrates pre-trained global and local encodings and enables SCR to scale to large scenes with only a single small-sized network. Our method achieves state-of-the-art results on large-scale scenes with a low-map-size model.
  arXiv  Detail & Related papers  (2024-06-06T17:59:50Z)
• Parameter-efficient Fine-tuning in Hyperspherical Space for Open-vocabulary Semantic Segmentation [10.502680141980642]
  Open-vocabulary semantic segmentation seeks to label each pixel in an image with arbitrary text descriptions.<n> vision-language foundation models, especially CLIP, have emerged as powerful tools for acquiring open-vocabulary capabilities.<n>H-CLIP achieves new SOTA open-vocabulary semantic segmentation results while only requiring updating approximately 4% of the total parameters of CLIP.
  arXiv  Detail & Related papers  (2024-05-29T07:41:34Z)

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.