Patrik Kamencay

2D-3D Face Recognition Method Basedon a Modified CCA-PCA Algorithm

This paper presents a proposed methodology for face recognition based on an information theory approach to coding and decoding face images. In this paper, we propose a 2D-3D face-matching method based on a principal component analysis (PCA) algorithm using canonical correlation analysis (CCA) to learn the mapping between a 2D face image and 3D face data. This method makes it possible to match a 2D face image with enrolled 3D face data. Our proposed fusion algorithm is based on the PCA method, which is applied to extract base features. PCA feature-level fusion requires the extraction of different features from the source data before features are merged together. Experimental results on the TEXAS face image database have shown that the classification and recognition results based on the modified CCA-PCA method are superior to those based on the CCA method. Testing the 2D-3D face match results gave a recognition rate for the CCA method of a quite poor 55% while the modified CCA method based on PCA-level fusion achieved a very good recognition score of 85%.

Simple comparison of image segmentation algorithms based on evaluation criterion

In the image analysis, image segmentation is the operation that divides image into set of different segments. The paper deals about common color image segmentation techniques and methods. The advantages and disadvantage of each one will be described in this paper. At the end of the paper, the evaluation criterion will be introduced and applied on the algorithms results. Five most used image segmentation algorithms, namely, Efficient graph based, K-means, Mean shift, Expectation maximization and hybrid method are compared by designed criterion.

An Advanced Approach to Extraction of Colour Texture Features Based on GLCM

This paper discusses research in the area of texture image classification. More specifically, the combination of texture and colour features is researched. The principle objective is to create a robust descriptor for the extraction of colour texture features. The principles of two well-known methods for grey-level texture feature extraction, namely GLCM (grey-level co-occurrence matrix) and Gabor filters, are used in experiments. For the texture classification, the support vector machine is used. In the first approach, the methods are applied in separate channels in the colour image. The experimental results show the huge growth of precision for colour texture retrieval by GLCM. Therefore, the GLCM is modified for extracting probability matrices directly from the colour image. The method for 13 directions neighbourhood system is proposed and formulas for probability matrices computation are presented. The proposed method is called CLCM (colour-level co-occurrence matrices) and experimental results show that it is a powerful method for colour texture classification.

Improved face recognition method based on segmentation algorithm using SIFT-PCA

This paper provides an example of the face recognition using SIFT-PCA method and impact of Graph Based segmentation algorithm on recognition rate. Principle component analysis (PCA) is a multivariate technique that analyzes a face data in which observation are described by several inter-correlated dependent variables. The goal is to extract the important information from the face data, to represent it as a set of new orthogonal variables called principal components. The paper presents a proposed methodology for face recognition based on preprocessing face images using segmentation algorithm and SIFT (Scale Invariant Feature Transform) descriptor. The algorithm has been tested on 50 subjects (100 images). The proposed method first was tested on ESSEX face database and next on own segmented face database using SIFT-PCA. The experimental result shows that the segmentation in combination with SIFT-PCA has a positive effect for face recognition and accelerates the recognition PCA technique.

A comparison of key-point descriptors for the stereo matching algorithm

In this paper, the comparison of a novel key-point image descriptors such as DAISY, BRISK, A-KAZE and LATCH with the well-known SIFT and SURF descriptors are tested and compared for the stereo matching algorithm. The main idea of this paper is to present an independent, comparative study and some of the benefits and drawbacks of these most popular image descriptors on stereo images. These descriptors are the primary input for the image correspondence algorithm (stereo matching algorithm). On this assumption, it is possible to estimate depth information from two stereo images. Two sets of experiments are conducted for relative performance evaluations. In the first part of our experiments, the accuracy of stereo matching algorithm using descriptors is demonstrated. The overall time execution is evaluated in the second set of our experiments. The all experiments have been tested on Middlebury stereo-dataset using programming language Python. The experimental result shows that the DAISY descriptor provides better results as A-KAZE or LATCH. On the other hand, DAISY descriptor is slower than SURF. The algorithm based on a DAISY descriptor is effective for matching stereo image pair and these correspondences can be used as input for 3D reconstruction.

Automatic extraction of non-textual information in web document and their classification

This paper deals with research in the area of automatic extraction of textual and non-textual information and their classification. The main idea is to create a robust method for extraction of image and textual segments to obtain short web document. Thus, developed method consist of two data types extractions, where both image and text data extraction are using Document Object Model tree. Extracted objects are saved in separate databases followed the images analysis that define and describe image object from semantic point of view. Moreover, the semantic description of all modal objects are utilized to short web document creation. To accurate object classification, the fast and powerful hybrid segmentation algorithm based on Mean Shift and Believe Propagation principles are mentioned in this paper, too. Likewise, the image segmentation algorithm was integrated with SIFT descriptor. Finally, in order to obtain a semantic description of objects in static image, the SVM classification is used. The developed method was tested on real unsegmented and segmented images, too.

3D image reconstruction from 2D CT slices

In this paper, a 3D reconstruction algorithm using CT slices of human pelvis is presented. We propose the method for 3D image reconstruction that is based on a combination of the SURF (Speeded-Up Robust Features) descriptor and SSD (Sum of Squared Differences) matching algorithm using image segmentation with aim to obtain accurate 3D model of human pelvis. Firstly, we apply image filtering for noise removing and smoothing. Next, the filtered image is split into segments using Mean- Shift segmentation algorithm. Secondly, the edges using Canny edge detector are extracted. Then, for each segment we look at the associated corresponding points. The best corresponding points of all the segments using SURF-SSD method were obtained. The smaller is the value of SSD at a particular pixel, the more similarity exists between the first image and the second image in the neighborhood of that pixel. Finally, we have integrated the Mean-Shift segmentation algorithm with the SURF-SSD method. The obtained experimental results demonstrate that the SURF-SSD algorithm in combination with image segmentation provides accurate 3D model of human pelvis.

A stereo depth recovery method using belief propagation

Stereo vision refers to the ability to infer information on the 3D structure of scene from two or more images taken from different viewpoints. This paper describes procedure for depth map creating using rectified stereo images and segmentation algorithm belief propagation (BP). Very necessary steps to creating depth map are camera calibration and image rectification of the image pairs. Calibration of the stereoscopic cameras consists from a two parameters of a stereo system: intrinsic parameters, which characterize the transformation mapping an image point from camera to pixel coordinates in each camera and extrinsic parameters, which describe the relative position and orientation of the two cameras. The depth recovery is important problem of image analysis in the study of compute vision and is optimized by using the belief propagation techniques.

Depth map computation using hybrid segmentation algorithm

In this paper, a stereo matching algorithm based on image segments is presented. We propose the hybrid segmentation algorithm that is based on a combination of the Belief Propagation and Mean Shift algorithms with aim to refine the depth map by using a stereo pair of images. Firstly, a color based segmentation method is applied for segmenting the left image of the input stereo pair (reference image) into regions. The aim of the segmentation is to simplify representation of the image into the form that is easier to analyze and is able to locate objects in images. Secondly, results of the segmentation are used as an input of the local window-based matching method to determine the disparity estimate of each image pixel. The obtained experimental results demonstrate that the final depth map can be obtained by application of segment disparities to the original images.

Accurate wild animal recognition using PCA, LDA and LBPH

In this paper, the performances of image recognition methods such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA) and Local Binary Patterns Histograms (LBPH) are tested and compared for the image recognition of the input animal images. The main idea of this paper is to present an independent, comparative study and some of the benefits and drawbacks of these most popular image recognition methods. Two sets of experiments are conducted for relative performance evaluations. In the first part of our experiments, the recognition accuracy of PCA, LDA and LBPH is demonstrated. The overall time execution for animal recognition process is evaluated in the second set of our experiments. We conduct tests on created animal database. The all algorithms have been tested on 300 different subjects (60 images for each class). The experimental result shows that the PCA features provide better results as LDA and LBPH for large training set. On the other hand, LBPH is better than PCA and LDA for small training data set.