Bio-inspired log-polar based color image pattern analysis in multiple frequency channels

The main topic addressed in this thesis is to implement color image pattern recognition based on the lateral inhibition subtraction phenomenon combined with a complex log-polar mapping in multiple spatial frequency channels. It is shown that the individual red, green and blue channels have different recognition performances when put in the context of former work done by Dragan Vidacic. It is observed that the green channel performs better than the other two channels, with the blue channel having the poorest performance. Following the application of a contrast stretching function the object recognition performance is improved in all channels. Multiple spatial frequency filters were designed to simulate the filtering channels that occur in the human visual system. Following these preprocessing steps Dragan Vidacic\u27s methodology is followed in order to determine the benefits that are obtained from the preprocessing steps being investigated. It is shown that performance gains are realized by using such preprocessing steps

Correlation Filters with Limited Boundaries

Correlation filters take advantage of specific properties in the Fourier domain allowing them to be estimated efficiently: O(NDlogD) in the frequency domain, versus O(D^3 + ND^2) spatially where D is signal length, and N is the number of signals. Recent extensions to correlation filters, such as MOSSE, have reignited interest of their use in the vision community due to their robustness and attractive computational properties. In this paper we demonstrate, however, that this computational efficiency comes at a cost. Specifically, we demonstrate that only 1/D proportion of shifted examples are unaffected by boundary effects which has a dramatic effect on detection/tracking performance. In this paper, we propose a novel approach to correlation filter estimation that: (i) takes advantage of inherent computational redundancies in the frequency domain, and (ii) dramatically reduces boundary effects. Impressive object tracking and detection results are presented in terms of both accuracy and computational efficiency.Comment: 8 pages, 6 figures, 2 table

Pattern recognition employing spatially variant unconstrained correlation filters

A spatial domain Optimal Trade-off Maximum Average Correlation Height (SPOT-MACH) filter is proposed in this thesis. The proposed technique uses a pre-defined fixed size kernel rather than using estimation techniques. The spatial domain implementation of OT-MACH offers the advantage that it does not have shift invariance imposed on it as the kernel can be modified depending upon its position within the input image. This allows normalization of the kernel and allows inclusion of a space domain non-linearity to improve performance. The proposed SPOT-MACH filter can be used to maximize the height of the correlation peak in the presence of distortions of the training object and provide resistance to background clutter. One of the major characteristics of the SPOT-MACH filter is that it can be tuned to maximize the height and sharpness of the correlation peak by using trade-offs between distortion tolerance, peak sharpness and the ability to suppress clutter noise. A number of non-parametric local regression techniques offer a simplified approach to pattern recognition problems which employ linear filtering using low pass filters designed using moving window local approximations. In most of these cases the algorithms search for a region of interest near the point of estimation for various prevailing conditions which fit the required criteria. These estimates are calculated for a defined window size which is determined as being the largest area within which the estimators do not widely vary from the criteria. The only drawback in this approach is that the window size is directly proportional to the required computational resources and would adversely affect the performance of the system if the moving window size is not proportionate to the resources. The proposed filter employs an optimization technique using low-pass filtering to highlight the potential region of interests in the image and then restricts the movement of the kernel to these regions to allow target identification and to use less computational resources. Also another optimization technique is also proposed which is based on an entropy filter which measures the degree of randomness between two changing scenes and would return the area where change has occurred i.e. the target object might be present. This approach gives a more accurate region of interest than the low-pass filtering approach. Apart from the software based optimization approaches two hardware based enhancement techniques have also been proposed in this thesis. One of the approaches employs Field Programmable Gate Array (FPGA) to perform correlation process employing the inbuilt multipliers and look up tables and the other one uses Graphical Processing Unit (GPU) to do parallel processing of the input scene. Also in this thesis a detailed analysis of SPOT-MACH has been carried out by comparing with popular feature based techniques like Scale Invariant Feature Transform (SIFT) and a comparison matrix has been created. The proposed filter uses a two-staged approach using speed optimizations and then detection of targets from input scenes. Both visible and Forward Looking Infrared (FLIR) imagery data sets have been used to test the performance of filter

Subspace-Based Holistic Registration for Low-Resolution Facial Images

Subspace-based holistic registration is introduced as an alternative to landmark-based face registration, which has a poor performance on low-resolution images, as obtained in camera surveillance applications. The proposed registration method finds the alignment by maximizing the similarity score between a probe and a gallery image. We use a novel probabilistic framework for both user-independent as well as user-specific face registration. The similarity is calculated using the probability that the face image is correctly aligned in a face subspace, but additionally we take the probability into account that the face is misaligned based on the residual error in the dimensions perpendicular to the face subspace. We perform extensive experiments on the FRGCv2 database to evaluate the impact that the face registration methods have on face recognition. Subspace-based holistic registration on low-resolution images can improve face recognition in comparison with landmark-based registration on high-resolution images. The performance of the tested face recognition methods after subspace-based holistic registration on a low-resolution version of the FRGC database is similar to that after manual registration

Correlation filters for detection of cellular nuclei in histopathology images

Nuclei detection in histology images is an essential part of computer aided diagnosis of cancers and tumors. It is a challenging task due to diverse and complicated structures of cells. In this work, we present an automated technique for detection of cellular nuclei in hematoxylin and eosin stained histopathology images. Our proposed approach is based on kernelized correlation filters. Correlation filters have been widely used in object detection and tracking applications but their strength has not been explored in the medical imaging domain up till now. Our experimental results show that the proposed scheme gives state of the art accuracy and can learn complex nuclear morphologies. Like deep learning approaches, the proposed filters do not require engineering of image features as they can operate directly on histopathology images without significant preprocessing. However, unlike deep learning methods, the large-margin correlation filters developed in this work are interpretable, computationally efficient and do not require specialized or expensive computing hardware. Availability: A cloud based webserver of the proposed method and its python implementation can be accessed at the following URL: http://faculty.pieas.edu.pk/fayyaz/software.html#corehist

Average of Synthetic Exact Filters

This paper introduces a class of correlation filters called Average of Synthetic Exact Filters (ASEF). For ASEF, the correlation output is completely specified for each training image. This is in marked contrast to prior methods such as Synthetic Discriminant Functions (SDFs) which only spec-ify a single output value per training image. Advantages of ASEF training include: insenitivity to over-fitting, greater flexibility with regard to training images, and more robust behavior in the presence of structured backgrounds. The theory and design of ASEF filters is presented using eye localization on the FERET database as an example task. ASEF is compared to other popular correlation filters in-cluding SDF, MACE, OTF, and UMACE, and with other eye localization methods including Gabor Jets and the OpenCV Cascade Classifier. ASEF is shown to outperform all these methods, locating the eye to within the radius of the iris ap-proximately 98.5 % of the time. 1