arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2310.03038cs.CVcs.ETquant-ph
收藏

一种用于灰度视频的量子运动目标分割算法

A quantum moving target segmentation algorithm for grayscale video

School of Software, Nanjing University of Information Science and Technology(南京信息工程大学软件学院);School of Information Science and Engineering, Southeast University(东南大学信息科学与工程学院)

Wenjie Liu, Lu Wang, Qingshan Wu

AI总结:

针对灰度视频运动目标分割的实时性难题,提出基于量子电路的三帧差分、二值化与 AND 运算算法,实现 O(n^2+q) 复杂度,并经 IBM Q 验证 NISQ 可行性。

摘要:

运动目标分割(MTS)旨在分割出视频中的运动目标,然而在当前视频时代,经典算法面临实时处理的巨大挑战。一些学者已成功证明量子机制在某些视频处理任务中的优势,但尚未涉及运动目标分割。本文提出一种用于灰度视频的量子运动目标分割算法,该算法能够利用量子机制同时计算所有相邻帧中所有像素的差异,进而快速分割出运动目标。此外,设计了一种可行的量子比较器,用于依据阈值区分灰度值。随后详细设计了若干量子电路单元,包括三帧差分、二值化和 AND 运算,并将它们组合起来,构建用于分割运动目标的完整量子电路。对于包含 2^m 帧的量子视频(每帧为具有 q 个灰度级的 2^n×2^n 图像),本文算法的复杂度可降至 O(n^2+q)。与经典对应算法相比,这实现了指数级加速,同时其复杂度也优于现有量子算法。最后,在 IBM Q 上进行实验,以展示本文算法在含噪声中等规模量子(NISQ)时代的可行性。

英文摘要:

The moving target segmentation (MTS) aims to segment out moving targets in the video, however, the classical algorithm faces the huge challenge of real-time processing in the current video era. Some scholars have successfully demonstrated the quantum advantages in some video processing tasks, but not concerning moving target segmentation. In this paper, a quantum moving target segmentation algorithm for grayscale video is proposed, which can use quantum mechanism to simultaneously calculate the difference of all pixels in all adjacent frames and then quickly segment out the moving target. In addition, a feasible quantum comparator is designed to distinguish the grayscale values with the threshold. Then several quantum circuit units, including three-frame difference, binarization and AND operation, are designed in detail, and then are combined together to construct the complete quantum circuits for segmenting the moving target. For a quantum video with $2^m$ frames (every frame is a $2^n\times 2^n$ image with $q$ grayscale levels), the complexity of our algorithm can be reduced to O$(n^2 + q)$. Compared with the classic counterpart, it is an exponential speedup, while its complexity is also superior to the existing quantum algorithms. Finally, the experiment is conducted on IBM Q to show the feasibility of our algorithm in the noisy intermediate-scale quantum (NISQ) era.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑