# Image storage, retrieval, compression and segmentation in a quantum system

Image storage, retrieval, compression and segmentation in a quantum system A set of quantum states for $$M$$ colors and another set of quantum states for $$N$$ coordinates are proposed in this paper to represent $$M$$ colors and coordinates of the $$N$$ pixels in an image respectively. We design an algorithm by which an image of $$N$$ pixels and $$m$$ different colors is stored in a quantum system just using $$2N+m$$ qubits. An algorithm for quantum image compression is proposed. Simulation result on the Lena image shows that compression ratio of lossless is 2.058. Moreover, an image segmentation algorithm based on quantum search quantum search which can find all solutions in the expected times in $$O(t\sqrt{N} )$$ is proposed, where $$N$$ is the number of pixels and $$t$$ is the number of targets to be segmented. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

# Image storage, retrieval, compression and segmentation in a quantum system

, Volume 12 (6) – Jan 9, 2013
22 pages

/lp/springer_journal/image-storage-retrieval-compression-and-segmentation-in-a-quantum-fn4R9765Ll
Publisher
Springer Journals
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-012-0521-5
Publisher site
See Article on Publisher Site

### Abstract

A set of quantum states for $$M$$ colors and another set of quantum states for $$N$$ coordinates are proposed in this paper to represent $$M$$ colors and coordinates of the $$N$$ pixels in an image respectively. We design an algorithm by which an image of $$N$$ pixels and $$m$$ different colors is stored in a quantum system just using $$2N+m$$ qubits. An algorithm for quantum image compression is proposed. Simulation result on the Lena image shows that compression ratio of lossless is 2.058. Moreover, an image segmentation algorithm based on quantum search quantum search which can find all solutions in the expected times in $$O(t\sqrt{N} )$$ is proposed, where $$N$$ is the number of pixels and $$t$$ is the number of targets to be segmented.

### Journal

Quantum Information ProcessingSpringer Journals

Published: Jan 9, 2013

### References

• Processing images in entangled quantum systems
Venegas-Andraca, SE; Ball, JL
• A flexible representation of quantum images for polynomial preparation, image compression, and processing operations
Le, PQ; Dong, F; Hirota, K

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations