A Co-Prime Blur Scheme for Data Security in Video Surveillance

Christopher Thorpe, Feng Li, Zijia Li, Zhan Yu, David Saunders, Jingyi YuarXiv 2012 · OpenReview

TL;DR

This paper introduces a novel "Coprime Blurred Pair" (CBP) technique for video surveillance that blurs video streams to protect privacy while still allowing basic behavior to be observed. By using two "coprime" blur kernels, the original, unblurred video can be perfectly reconstructed only when both blurred streams are available, offering a multi-level security approach.

What Problem Does This Paper Address?

Video surveillance is increasingly prevalent, raising significant privacy concerns. Existing solutions often involve complete encryption, rendering the video useless for low-clearance users who might only need to observe general activity. This paper tackles the challenge of providing visual data in sensitive environments without compromising privacy, aiming to obscure personally identifiable features (like faces) while retaining the ability to recognize behavior. The goal is to allow low-clearance users to see general activity and high-clearance users to access the full, unblurred detail.

Methods

The core of the proposed method is a "Coprime Blurred Pair" (CBP) model. Instead of full encryption, the original latent video stream is blurred using two distinct, unknown blur kernels. These kernels are mathematically designed to be "coprime" when represented as bivariate polynomials in the z-domain. This coprimality is key to the deblurring process.

The deblurring algorithm involves several steps:

  1. Kernel Degree Estimation: The degree of the blur kernels is estimated by analyzing the singularity of Bézout matrices derived from the blurred image polynomials.
  2. 1D Coprime Factor Estimation: The 2D deblurring problem is decomposed into multiple 1D sub-problems. The blurred images are sampled on the unit circle in one dimension, and their 1D polynomial representations are used to compute 1D coprime factors (approximating the blur kernels).
  3. 2D Kernel Estimation: These 1D factors are combined to reconstruct the 2D blur kernels.
  4. Deblurring: Once the blur kernels are recovered, they are used to deblur the original video stream.

Crucially, the paper emphasizes that a single blurred stream is difficult to deblur, but having both streams and knowing the coprime relationship allows for efficient reconstruction. The algorithm is implemented on a GPU (using CUDA) to achieve real-time performance.

Datasets

Not discussed in the paper. The authors use their own generated blurred video sequences for evaluation, derived from common surveillance scenarios.

Key Insights and Ideas

  • Privacy through Obscurity, Not Erasure: The paper proposes a novel approach to privacy in surveillance by blurring sensitive details rather than completely encrypting the data. This allows for partial observation of activity by lower-clearance users.
  • The Power of Coprime Kernels: The mathematical property of coprime bivariate polynomials is ingeniously leveraged to enable blind deconvolution. This coprimality provides the necessary constraint to uniquely recover the blur kernels and the latent image from two blurred sequences.
  • Decomposition for Efficiency: Breaking down the complex 2D deblurring problem into multiple 1D sub-problems significantly improves computational efficiency and reduces memory requirements.
  • GPU Acceleration is Key: The real-time performance of the algorithm is heavily reliant on GPU implementation, demonstrating the practical feasibility of this privacy-preserving technique.
  • Multi-Level Security: The CBP model naturally supports multi-level security by controlling access to the second, private blurred stream, allowing for tiered access to information.

Key Results

  • The proposed CBP scheme effectively obscures sensitive identity information (like facial features) in public video streams.
  • The algorithm can faithfully reconstruct the original, unblurred video stream when both blurred sequences are available, even with large blur kernels (up to 25x25).
  • GPU implementation achieves frame rates exceeding 20fps for large kernel sizes, making it practical for real-time surveillance.
  • Running times for a 640x480 video with a 23x23 kernel are around 43.99ms, which is competitive with standard video frame rates.
  • Qualitative results show that blurred frames allow for observation of general behavior (e.g., clothing color, body posture, actions like making a phone call), while deblurred frames reveal fine details (e.g., glasses, shoe details, license plates).

Limitations and Future Work

  • Bandwidth Requirements: The approach requires double the bandwidth for transmitting two blurred video streams.
  • Computational Cost: While GPU acceleration is effective, the running time is proportional to the blur kernel size, which can limit the level of privacy achievable for a desired frame rate. This might also restrict some post-processing steps like facial recognition.
  • Future Work:
    • Decreasing the running time of expensive operations (like SVD) by optimizing the pipeline or exploring hybrid hardware solutions (e.g., FPGA).
  • Integrating with "z-cameras" to leverage depth information for more optimal blur kernel selection.
  • Extending the multi-level security concept to more granular access control.

Summary updated

Abstract

This paper presents a novel Coprime Blurred Pair (CBP) model for visual data-hiding for security in camera surveillance. While most previous approaches have focused on completely encrypting the video stream, we introduce a spatial encryption scheme by blurring the image/video contents to create a CBP. Our goal is to obscure detail in public video streams by blurring while allowing behavior to be recognized and to quickly deblur the stream so that details are available if behavior is recognized as suspicious. We create a CBP by blurring the same latent image with two unknown kernels. The two kernels are coprime when mapped to bivariate polynomials in the z domain. To deblur the CBP we first use the coprime constraint to approximate the kernels and sample the bivariate CBP polynomials in one dimension on the unit circle. At each sample point, we factor the 1D polynomial pair and compose the results into a 2D kernel matrix. Finally, we compute the inverse Fast Fourier Transform (FFT) of the kernel matrices to recover the coprime kernels and then the latent video stream. It is therefore only possible to deblur the video stream if a user has access to both streams. To improve the practicability of our algorithm, we implement our algorithm using a graphics processing unit (GPU) to decrypt the blurred video streams in real-time, and extensive experimental results demonstrate that our new scheme can effectively protect sensitive identity information in surveillance videos and faithfully reconstruct the unblurred video stream when two blurred sequences are available.
BibTeX
@misc{thorpe2012co,
  author = {Christopher Thorpe and Feng Li and Zijia Li and Zhan Yu and David Saunders and Jingyi Yu},
  title = {{A Co-Prime Blur Scheme for Data Security in Video Surveillance}},
  year = {2012},
  eprint = {1203.4874},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1203.4874},
}

Loading related content...

Figure