A User Oriented Image Retrieval System using Halftoning BBTC

The objective of this paper is to develop a system for content based image retrieval (CBIR) by accomplishing the benefits of low complexity Ordered Dither Block Truncation Coding based on half toning technique for the generation of image content descriptor. In the encoding step ODBTC compresses an image block into corresponding quantizes and bitmap image. Two image features are proposed to index an image namely co-occurrence features and bitmap patterns which are generated using ODBTC encoded data streams without performing the decoding process. The CCF and BPF of an image are simply derived from the two quantizes and bitmap respectively by including visual codebooks. The proposed system based on block truncation coding image retrieval method is not only convenient for an image compression but it also satisfy the demands of users by offering effective descriptor to index images in CBIR system

Batik Image Retrieval Using ODBTC Feature and Particle Swarm Optimization

This paper proposes an effective and efficient approach to Batik image retrieval using Ordered Dither Block Truncation Coding (ODBTC) feature. Similarity degree between two images can be easily investigated under similarity distance score between their feature descriptors. As documented in the experimental section, the feature descriptor outperforms the former existing schemes under Batik image database. The Particle Swarm Optimization (PSO) iteratively searches the optimal similarity weighting constants to further improve the image retrieval performance. Thus, a set of retrieved images become more satisfactory and acceptable for user desire and preference

Sistem dapatan semula imej untuk aplikasi perubatan

Dapatan semula imej (DSI) adalah sistem pencarian imej yang menggunakan ciri-ciri tertentu atau konteks khusus dalam sesuatu imej. Dalam bidang perubatan, sistem DSI digunakan untuk menyediakan imej yang diperlukan secara tepat dan pantas kepada pakar perubatan. Proses itu biasanya berlaku pada dan ketika diagnosis dan rawatan penyakit dilakukan. Sistem dapatan semula yang awal dan masih digunakan dengan meluas dalam bidang perubatan adalah sistem DSI berdasarkan teks (TBIRS). TBIRS menggunakan kata kunci dalam konteks sesuatu imej dan ia memerlukan anotasi teks secara manual. Proses anotasi teks adalah tugas yang memerihkan lebih-lebih lagi jika melibatkan pangkalan data yang besar. Ini memungkinkan kebarangkalian berlakunya kesilapan manusia adalah tinggi. Untuk mengatasi masalah yang dinyatakan, sistem DSI berdasarkan kandungan (CBIRS) dengan pengindeksan automatik adalah dicadangkan. Kaedah ini melibatkan pemprosesan imej perubatan berdasarkan komputer yang menggunakan fitur visual imej seperti warna, bentuk dan tesktur. Namun begitu, umum mengetahui bahawa suatu algoritma tertentu dalam CBIRS adalah khusus untuk satu modaliti sahaja dan melibatkan bahagian yang tertentu. Ini ditambahkan pula bahawa CBIRS telah mengabaikan persepsi manusia dalam tugas menakrif sesuatu imej dan akibatnya, menyebabkan wujudnya masalah jurang semantik. Oleh itu, sistem DSI hibrid (HBIRS) yang menggabungkan kekuatan kedua-dua TBIRS dan CBIRS telah diperkenalkan bagi menangani masalah jurang semantik khususnya dan sekaligus memantapkan sistem DSI amnya. Satu kerangka sistem DSI yang cekap iaitu HBIRS juga telah dicadangkan. Walau bagaimanapun, kajian ini hanya melibatkan TBIRS dan CBIRS bagi aplikasi perubatan, dan prototaip TBIRS yang dikaji menggunakan imej X-Ray turut dicadangkan

Dimension reduction of image and audio space

The reduction of data necessary for storage or transmission is a desirable goal in the digital video and audio domain. Compression schemes strive to reduce the amount of storage space or bandwidth necessary to keep or move the data. Data reduction can be accomplished so that visually or audibly unnecessary data is removed or recoded thus aiding the compression phase of the data processing. The characterization and identification of data that can be successfully removed or reduced is the purpose of this work. New philosophy, theory and methods for data processing are presented towards the goal of data reduction. The philosophy and theory developed in this work establish a foundation for high speed data reduction suitable for multi-media applications. The developed methods encompass motion detection and edge detection as features of the systems. The philosophy of energy flow analysis in video processing enables the consideration of noise in digital video data. Research into noise versus motion leads to an efficient and successful method of identifying motion in a sequence. The research of the underlying statistical properties of vector quantization provides an insight into the performance characteristics of vector quantization and leads to successful improvements in application. The underlying statistical properties of the vector quantization process are analyzed and three theorems are developed and proved. The theorems establish the statistical distributions and probability densities of various metrics of the vector quantization process. From these properties, an intelligent and efficient algorithm design is developed and tested. The performance improvements in both time and quality are established through algorithm analysis and empirical testing. The empirical results are presented

Theory and realization of novel algorithms for random sampling in digital signal processing

Random sampling is a technique which overcomes the alias problem in regular sampling. The randomization, however, destroys the symmetry property of the transform kernel of the discrete Fourier transform. Hence, when transforming a randomly sampled sequence to its frequency spectrum, the Fast Fourier transform cannot be applied and the computational complexity is N(^2). The objectives of this research project are (1) To devise sampling methods for random sampling such that computation may be reduced while the anti-alias property of random sampling is maintained : Two methods of inserting limited regularities into the randomized sampling grids are proposed. They are parallel additive random sampling and hybrid additive random sampling, both of which can save at least 75% of the multiplications required. The algorithms also lend themselves to the implementation by a multiprocessor system, which will further enhance the speed of the evaluation. (2) To study the auto-correlation sequence of a randomly sampled sequence as an alternative means to confirm its anti-alias property : The anti-alias property of the two proposed methods can be confirmed by using convolution in the frequency domain. However, the same conclusion is also reached by analysing in the spatial domain the auto-correlation of such sample sequences. A technique to evaluate the auto-correlation sequence of a randomly sampled sequence with a regular step size is proposed. The technique may also serve as an algorithm to convert a randomly sampled sequence to a regularly spaced sequence having a desired Nyquist frequency. (3) To provide a rapid spectral estimation using a coarse kernel : The approximate method proposed by Mason in 1980, which trades the accuracy for the speed of the computation, is introduced for making random sampling more attractive. (4) To suggest possible applications for random and pseudo-random sampling : To fully exploit its advantages, random sampling has been adopted in measurement Random sampling is a technique which overcomes the alias problem in regular sampling. The randomization, however, destroys the symmetry property of the transform kernel of the discrete Fourier transform. Hence, when transforming a randomly sampled sequence to its frequency spectrum, the Fast Fourier transform cannot be applied and the computational complexity is N"^. The objectives of this research project are (1) To devise sampling methods for random sampling such that computation may be reduced while the anti-alias property of random sampling is maintained : Two methods of inserting limited regularities into the randomized sampling grids are proposed. They are parallel additive random sampling and hybrid additive random sampling, both of which can save at least 75% , of the multiplications required. The algorithms also lend themselves to the implementation by a multiprocessor system, which will further enhance the speed of the evaluation. (2) To study the auto-correlation sequence of a randomly sampled sequence as an alternative means to confirm its anti-alias property : The anti-alias property of the two proposed methods can be confirmed by using convolution in the frequency domain. However, the same conclusion is also reached by analysing in the spatial domain the auto-correlation of such sample sequences. A technique to evaluate the auto-correlation sequence of a randomly sampled sequence with a regular step size is proposed. The technique may also serve as an algorithm to convert a randomly sampled sequence to a regularly spaced sequence having a desired Nyquist frequency. (3) To provide a rapid spectral estimation using a coarse kernel : The approximate method proposed by Mason in 1980, which trades the accuracy for the speed of the computation, is introduced for making random sampling more attractive. (4) To suggest possible applications for random and pseudo-random sampling : To fully exploit its advantages, random sampling has been adopted in measurement instruments where computing a spectrum is either minimal or not required. Such applications in instrumentation are easily found in the literature. In this thesis, two applications in digital signal processing are introduced. (5) To suggest an inverse transformation for random sampling so as to complete a two-way process and to broaden its scope of application. Apart from the above, a case study of realizing in a transputer network the prime factor algorithm with regular sampling is given in Chapter 2 and a rough estimation of the signal-to-noise ratio for a spectrum obtained from random sampling is found in Chapter 3. Although random sampling is alias-free, problems in computational complexity and noise prevent it from being adopted widely in engineering applications. In the conclusions, the criteria for adopting random sampling are put forward and the directions for its development are discussed

Pattern Recognition

Pattern recognition is a very wide research field. It involves factors as diverse as sensors, feature extraction, pattern classification, decision fusion, applications and others. The signals processed are commonly one, two or three dimensional, the processing is done in real- time or takes hours and days, some systems look for one narrow object class, others search huge databases for entries with at least a small amount of similarity. No single person can claim expertise across the whole field, which develops rapidly, updates its paradigms and comprehends several philosophical approaches. This book reflects this diversity by presenting a selection of recent developments within the area of pattern recognition and related fields. It covers theoretical advances in classification and feature extraction as well as application-oriented works. Authors of these 25 works present and advocate recent achievements of their research related to the field of pattern recognition

Pattern Recognition

A wealth of advanced pattern recognition algorithms are emerging from the interdiscipline between technologies of effective visual features and the human-brain cognition process. Effective visual features are made possible through the rapid developments in appropriate sensor equipments, novel filter designs, and viable information processing architectures. While the understanding of human-brain cognition process broadens the way in which the computer can perform pattern recognition tasks. The present book is intended to collect representative researches around the globe focusing on low-level vision, filter design, features and image descriptors, data mining and analysis, and biologically inspired algorithms. The 27 chapters coved in this book disclose recent advances and new ideas in promoting the techniques, technology and applications of pattern recognition