Multi-dimensional color image storage and retrieval for a normal arbitrary quantum superposition state

Multi-dimensional color image storage and retrieval for a normal arbitrary quantum superposition... Multi-dimensional color image processing has two difficulties: One is that a large number of bits are needed to store multi-dimensional color images, such as, a three-dimensional color image of $$1024 \times 1024 \times 1024$$ 1024 × 1024 × 1024 needs $$1024 \times 1024 \times 1024 \times 24$$ 1024 × 1024 × 1024 × 24  bits. The other one is that the efficiency or accuracy of image segmentation is not high enough for some images to be used in content-based image search. In order to solve the above problems, this paper proposes a new representation for multi-dimensional color image, called a $$(n\,+\,1)$$ ( n + 1 ) -qubit normal arbitrary quantum superposition state (NAQSS), where $$n$$ n qubits represent colors and coordinates of $${2^n}$$ 2 n pixels (e.g., represent a three-dimensional color image of $$1024 \times 1024 \times 1024$$ 1024 × 1024 × 1024 only using 30 qubits), and the remaining 1 qubit represents an image segmentation information to improve the accuracy of image segmentation. And then we design a general quantum circuit to create the NAQSS state in order to store a multi-dimensional color image in a quantum system and propose a quantum circuit simplification algorithm to reduce the number of the quantum gates of the general quantum circuit. Finally, different strategies to retrieve a whole image or the target sub-image of an image from a quantum system are studied, including Monte Carlo sampling and improved Grover’s algorithm which can search out a coordinate of a target sub-image only running in $$O(\sqrt{N/r} )$$ O ( N / r ) where $$N$$ N and $$r$$ r are the numbers of pixels of an image and a target sub-image, respectively. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Multi-dimensional color image storage and retrieval for a normal arbitrary quantum superposition state

Loading next page...
 
/lp/springer-journals/multi-dimensional-color-image-storage-and-retrieval-for-a-normal-0KCAzXptUz
Publisher
Springer US
Copyright
Copyright © 2013 by Springer Science+Business Media New York
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-013-0705-7
Publisher site
See Article on Publisher Site

Abstract

Multi-dimensional color image processing has two difficulties: One is that a large number of bits are needed to store multi-dimensional color images, such as, a three-dimensional color image of $$1024 \times 1024 \times 1024$$ 1024 × 1024 × 1024 needs $$1024 \times 1024 \times 1024 \times 24$$ 1024 × 1024 × 1024 × 24  bits. The other one is that the efficiency or accuracy of image segmentation is not high enough for some images to be used in content-based image search. In order to solve the above problems, this paper proposes a new representation for multi-dimensional color image, called a $$(n\,+\,1)$$ ( n + 1 ) -qubit normal arbitrary quantum superposition state (NAQSS), where $$n$$ n qubits represent colors and coordinates of $${2^n}$$ 2 n pixels (e.g., represent a three-dimensional color image of $$1024 \times 1024 \times 1024$$ 1024 × 1024 × 1024 only using 30 qubits), and the remaining 1 qubit represents an image segmentation information to improve the accuracy of image segmentation. And then we design a general quantum circuit to create the NAQSS state in order to store a multi-dimensional color image in a quantum system and propose a quantum circuit simplification algorithm to reduce the number of the quantum gates of the general quantum circuit. Finally, different strategies to retrieve a whole image or the target sub-image of an image from a quantum system are studied, including Monte Carlo sampling and improved Grover’s algorithm which can search out a coordinate of a target sub-image only running in $$O(\sqrt{N/r} )$$ O ( N / r ) where $$N$$ N and $$r$$ r are the numbers of pixels of an image and a target sub-image, respectively.

Journal

Quantum Information ProcessingSpringer Journals

Published: Dec 7, 2013

References

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
discover and read the research
that matters to you.

Enjoy affordable access to
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.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off