# Invited lectures

## Content-based retrieval of compressed images

### Gerald Schaefer

Department of Computer Science, Loughborough University, Loughborough, U.K.

**Abstract. **
Content-based image retrieval allows search for pictures in large image
databases without keyword or text annotations. Rather features are extracted
directly from the images and used as indices for search and retrieval. Much
progress has been made in deriving useful image features with most of these
features being extracted from (uncompressed) pixel data. However, the vast
majority of images today are stored in compressed form due to limitations in
terms of storage and bandwidth resources. This in turn means that for image
retrieval to be performed the images first need to be decompressed in order
to calculate image features, hence adding to the computational complexity of
the indexing and retrieval processes.
Addressing this issue leads to a different approach, namely that of
compressed-domain image retrieval. Here, image feature extraction, and hence
image retrieval, is performed directly in the compressed domain of images.
In general there are two approaches to compressed-domain image retrieval.
The first is based on existing compression techniques and tries to extract
useful information from the compressed data streams produced by these. The
second approach is to develop so-called 4-th criterion compression
algorithms where the data in compressed form is directly visually meaningful
and can hence be employed for image retrieval.
In my talk, I will present some compressed-domain image retrieval techniques
that we have developed over the past years. In particular, I will present a
method for retrieving images compressed by vector quantisation that uses
codebook information as image features. Retrieval of losslessly compressed
images obtained using lossless JPEG, can be retrieved using information
derived from the Huffman coding tables of the compressed files. Finally, I
will present CVPIC, a 4-th criterion image compression technique and show
that compressed-domain image retrieval based on CVPIC is not only able to
match the performance of common retrieval techniques on uncompressed images,
but even clearly outperforms these.

## Simple Mathematical Models in Biometric Image Analysis

### Dr. Khalid Saeed, DSc, PhD, MSc, BSc Engg

Faculty of Physics and Applied Computer Science, AGH University of Science and Technology, Cracow, Poland
**Abstract. **
Biometrics is a science that deals with human identification on the basis of our biological features. Therefore, Biometrics belongs to Pattern Recognition and is part of it. Biometric examples are all features we are born with like facial image, finger-prints, iris of the eye, ... or the features we learn in our life like the way we write (signature), the way we walk (gait) or any of the behavioural characteristics. One of the basic steps in the procedure of pattern recognition for the right decision taken with high success rates of identification and verification is the way we furnish the characteristic points of the human biometric images. Once the biometric image is represented by the actual description, easy for implementation in the available popular computing systems, the recognition results will then be more satisfying. The characteristic points should cover all the essential information carried by the selected features that are necessary and in high percentage sufficient for human identification and/or verification.

A general study of all biometric categories will be discussed with examples. The methods of biometric image preprocessing will also be given in order to show the biometric image preparation for classification and recognition. The worked out algorithms with their mathematical approaches and models represented by the feature vectors will be shown.

During the talk, the author will present a method for image description derived from the theory of analytic functions. The original mathematical importance of Toeplitz matrices, which are positive definite, is in the theory of the classical Caratheodory coefficient problem, proved independently by Toeplitz and Caratheodory in 1911. Caratheodory investigated power series which are analytic in the unit circle and have a positive real part in the unit circle. This will take us to Caratheodory and Schur theorems, to their modified and developed assertions used in Electric Circuit Theory - Network Synthesis and applied by the author to the Digital Filter Realisation and then to Image processing. The contribution of Toeplitz and his matrices to the subject will also be discussed with examples on the use of the theory in Image description for the sake of their object recognition. The main idea is based on employing the mentioned above classes of analytic functions to build a mathematical model for image description for classification by either the determinants or matrix lowest eigenvalues. Both the matrix lowest eigenvalues and their determinant approaches will be discussed. How to construct the image feature vector by the aid of the matrix determinants sequence will be shown as a new method of image description. The matrices, in turn, are shown how to be formed from the geometric features of the object image, the object being one of the human biometric feature images or, as a general case in recognition systems, any other object under testing for recognition.

Download full extended abstract in PDF format.

# Special Sessions

## Presentation of SoSIReČR project

## Data Processing for Geocomputation

#### Chaired by

**Vít Voženílek**, Palacky University Olomouc

**Vaclav Snasel**, VSB-Technical University of Ostrava