arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.04705cs.CVcs.LGquant-ph
收藏

基于量子傅里叶逆变换的无监督图像分割算法

Inverse Quantum Fourier Transform Inspired Algorithm for Unsupervised Image Segmentation

Prairie View A&M University(普雷里维尤农工大学)

Taoreed Akinola, Xiangfang Li, Richard Wilkins, Pamela Obiomon, Lijun Qian

摘要:

图像分割是计算机视觉中一个非常热门和重要的课题。在本文中,逆量子傅立叶变换(IQFT)的图像分割进行了探索,并提出了一种新的IQFT启发算法,并利用IQFT的底层数学结构实现。具体地说,该方法利用图像中像素的相位信息,将像素的强度编码成量子比特相对相位,并应用IQFT将像素自动有效地分类到不同的片段中。据我们所知,这是首次尝试使用IQFT进行无监督图像分割。与基于深度学习的方法相比,该方法具有较低的计算成本,更重要的是它不需要训练,因此适合于实时应用。所提出的方法的性能进行了比较,与K-均值和Otsu阈值。在PASCAL VOC 2012分割基准和xVIEW 2挑战数据集上,所提出的方法在平均交叉联合(mIOU)方面优于它们高达50%。

英文摘要:

Image segmentation is a very popular and important task in computer vision. In this paper, inverse quantum Fourier transform (IQFT) for image segmentation has been explored and a novel IQFT-inspired algorithm is proposed and implemented by leveraging the underlying mathematical structure of the IQFT. Specifically, the proposed method takes advantage of the phase information of the pixels in the image by encoding the pixels' intensity into qubit relative phases and applying IQFT to classify the pixels into different segments automatically and efficiently. To the best of our knowledge, this is the first attempt of using IQFT for unsupervised image segmentation. The proposed method has low computational cost comparing to the deep learning-based methods and more importantly it does not require training, thus make it suitable for real-time applications. The performance of the proposed method is compared with K-means and Otsu-thresholding. The proposed method outperforms both of them on the PASCAL VOC 2012 segmentation benchmark and the xVIEW2 challenge dataset by as much as 50% in terms of mean Intersection-Over-Union (mIOU).

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

↑