Return to search

A Unique-Bit-Pattern-Based Indexing Strategy for Image Rotation and Reflection in Image Databases

A symbolic image database system is a system in which a large amount of image data and their related information are represented by both symbolic images and physical images. Spatial relationships are important issues for similarity-based retrieval in many image database applications. How to perceive spatial relationships among the components in a symbolic image is an important criterion to find a match between the symbolic image of the scene object and the one being store as a modal in the symbolic image database. With the popularity of digital cameras and the related image processing software, a sequence of images are often rotated or flipped. That is, those images are transformed in the rotation orientation or the reflection direction. A robust spatial similarity framework should be able to recognize image variants such as translation, scaling, rotation, and arbitrary variants. Current retrieval by spatial similarity algorithms can be classified into symbolic projection methods, geometric methods, and graph-matching methods. Symbolic projection could preserve the useful spatial information of objects, such as width, height, and location. However, many iconic indexing strategies based on symbolic projection are sensitive to rotation or reflection. Therefore, these strategies may miss the qualified images, when the query is issued in the orientation different from the orientation of the database images. To solve this problem, researchers derived the rule of the change of spatial relationships in image transformation, and proposed a function to map the spatial relationship to its related transformed one. However, this mapping consists of several conditional statements, which is time-consuming. Thus, in this dissertation, first, we classify the mapping into three cases and carefully assign a 16-bit unique bit pattern to each spatial relationship. Based on the assignment, we can easily do the mapping through our proposed bit operation, intra-exchange, which is a CPU operation and needs only the complexity of O(1). Moreover, we propose an efficient iconic index strategy, called Unique
Bit Pattern matrix strategy (UBP matrix strategy) to record the
spatial information. In this way, when doing similarity retrieval, we do not need to reconstruct the original image from the UBP matrix in order to obtain the indexes of the rotated and flipped image. Conversely, we can directly derive the index of the rotated or flipped image from the index of the original one through bit operations and the matrix manipulation. Thus, our proposed strategy can do similarity retrieval without missing the qualified database images. In our performance study, first, we analyze the time
complexity of the similarity retrieval process of our proposed strategy. Then, the efficiency of our proposed strategy according to the simulation results is presented. We show that our strategy outperforms those mapping strategies based on different number of objects in an image. According to the different number of objects in an image, the percentage of improvement is between 13.64% and 53.23%.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0616108-125342
Date16 June 2008
CreatorsYeh, Wei-horng
ContributorsWei-pang Yang, Ye-in Chang, Chung-nan Lee, Tei-wei Kuo, Suh-yin Lee, Chiang Lee, San-yin Hwang
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0616108-125342
Rightsunrestricted, Copyright information available at source archive

Page generated in 0.002 seconds