Huseyin Ozkaramanli
Eastern Mediterranean University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Huseyin Ozkaramanli.
Journal of Visual Communication and Image Representation | 2007
Turgay Celik; Hasan Demirel; Huseyin Ozkaramanli; Mustafa Uyguroglu
In this paper, we propose a real-time fire-detector that combines foreground object information with color pixel statistics of fire. Simple adaptive background model of the scene is generated by using three Gaussian distributions, where each distribution corresponds to the pixel statistics in the respective color channel. The foreground information is extracted by using adaptive background subtraction algorithm, and then verified by the statistical fire color model to determine whether the detected foreground object is a fire candidate or not. A generic fire color model is constructed by statistical analysis of the sample images containing fire pixels. The first contribution of the paper is the application of real-time adaptive background subtraction method that aids the segmentation of the fire candidate pixels from the background. The second contribution is the use of a generic statistical model for refined fire-pixel classification. The two processes are combined to form the fire detection system and applied for the detection of fire in the consecutive frames of video sequences. The frame-processing rate of the detector is about 40 fps with image size of 176x144 pixels, and the algorithms correct detection rate is 98.89%.
EURASIP Journal on Advances in Signal Processing | 2008
Alaa Eleyan; Huseyin Ozkaramanli; Hasan Demirel
Complex approximately analytic wavelets provide a local multiscale description of images with good directional selectivity and invariance to shifts and in-plane rotations. Similar to Gabor wavelets, they are insensitive to illumination variations and facial expression changes. The complex wavelet transform is, however, less redundant and computationally efficient. In this paper, we first construct complex approximately analytic wavelets in the single-tree context, which possess Gabor-like characteristics. We, then, investigate the recently developed dual-tree complex wavelet transform (DT-CWT) and the single-tree complex wavelet transform (ST-CWT) for the face recognition problem. Extensive experiments are carried out on standard databases. The resulting complex wavelet-based feature vectors are as discriminating as the Gabor wavelet-derived features and at the same time are of lower dimension when compared with that of Gabor wavelets. In all experiments, on two well-known databases, namely, FERET and ORL databases, complex wavelets equaled or surpassed the performance of Gabor wavelets in recognition rate when equal number of orientations and scales is used. These findings indicate that complex wavelets can provide a successful alternative to Gabor wavelets for face recognition.
IEEE Transactions on Signal Processing | 2005
Runyi Yu; Huseyin Ozkaramanli
The condition on scaling filters of two orthogonal wavelet bases that render the corresponding wavelets as Hilbert transform pairs is re-examined in this note. Without making any pre-assumption on the relationship between the two scaling filters, the authors derive necessary and sufficient conditions for forming Hilbert transform pairs. They lead to new magnitude conditions and Selesnicks phase condition. Unique solutions to these conditions are concluded. It is shown that orthogonal wavelet bases form Hilbert transform pairs if and only if the two scaling filters are offset from one another by half a sample.
IEEE Transactions on Signal Processing | 2003
Huseyin Ozkaramanli; Runyi Yu
In this paper, the phase condition on the scaling filters of two wavelet bases that renders the corresponding wavelets as Hilbert transform pairs is studied. An alternative and equivalent phase condition is derived. With the equivalent condition and using Fourier series expansions, we show that the solution for which the corresponding scaling filters are offset from one another by a half sample is the only solution satisfying the phase condition.
Computer Vision and Image Understanding | 2008
Turgay Celik; Huseyin Ozkaramanli; Hasan Demirel
In this paper, we propose a novel method for facial feature extraction using the directional multiresolution decomposition offered by the complex wavelet transform. The dual-tree implementation of complex wavelet transform offered by Selesnick is used (DT-DWT(S)) [I.W., Selesnick, R.G. Baraniuk, N.C. Kingsbury, The dual-tree complex wavelet transform, IEEE Signal Processing Magazine, 6, s.l., IEEE, November 2005, vol. 22, pp. 123-151.]. In the dual-tree implementation, two parallel discrete wavelet transform (DWT) with different lowpass and highpass filters in different scales are used. The linear combination of subbands generated by two parallel DWT is used to generate 6 different directional subbands with complex coefficients. A test statistic, which is derived with absolute value of complex coefficient, whose distribution matches very closely with the directional information in the 6 subbands of the DT-DWT(S) is derived and used for detecting facial feature edges. The use of the complex wavelet transform is motivated by the fact that it helps eliminate the effects of non-uniform illumination, and the directional information provided by the different subbands makes it possible to detect edge features with different directionalities in the corresponding image. Edge information of facial area is enhanced using multiresolution structure of DT-DWT(S). The proposed method also employs an adaptive skin colour model instead of a predefined skin colour statistic. The model is developed with a unimodal Gaussian distribution using the skin region which is extracted excluding the detected edge map obtained from the DT-DWT(S). By combining the edge information obtained by using DT-DWT(S) and the non-skin areas obtained from the pixel statistics, the facial features are extracted. The algorithm is tested over the well known Carnegie Mellon University (CMU) and Marks Weber face databases. The average detection rate of the proposed method using DT-DWT(S) provides up to 9.6% improvement over the same method using discrete wavelet transform (DWT).
international conference on acoustics, speech, and signal processing | 2007
Turgay Celik; Huseyin Ozkaramanli; Hasan Demirel
In this paper, fuzzy logic enhanced generic color model for fire pixel classification is proposed. The model uses YCbCr color space to separate the luminance from the chrominance more effectively than color spaces such as RGB or rgb. Concepts from fuzzy logic are used to replace existing heuristic rules and make the classification more robust in effectively discriminating fire and fire like colored objects. Further discrimination between fire and non fire pixels are achieved by a statistically derived chrominance model which is expressed as a region in the chrominance plane. The performance of the model is tested on two large sets of images; one set contains fire while the other set contains no fire but has regions similar to fire color. The model achieves up to 99.00% correct fire detection rate with a 9.50% false alarm rate.
international conference on acoustics, speech, and signal processing | 2006
Turgay Celik; Hasan Demirel; Huseyin Ozkaramanli; Mustafa Uyguroglu
In this paper, we propose a real-time fire-detector which combines foreground information with statistical color information to detect fires. The foreground information which is obtained using adaptive background information is verified by the statistical color information to determine whether the detected foreground object is a candidate for fire or not. The output of the both stages is analyzed in consecutive frames which is the verification process of fire that uses the fact that fire never stays stable in visual appearance. The frame processing rate of the detector is about 30 fps with image size of 176times144 which enables the proposed detector to be applied for real-time applications
IEEE Transactions on Signal Processing | 2006
Runyi Yu; Huseyin Ozkaramanli
The forming of Hilbert transform pairs of biorthogonal wavelet bases of two-band filter banks is studied in this paper. We first derive necessary and sufficient conditions on the scaling filters that render two Hilbert transform pairs: one decomposition pair and one reconstruction pair. We show that the Hilbert transform pairs are achieved if and only if the decomposition scaling filter of one filter bank is half-sample delayed from that of the other filter bank; and the reconstruction scaling filter of the former is half-sample advanced from that of the latter. Hilbert transform pairs of wavelet bases are also characterized by equivalent relationships on the wavelet filters and the scaling functions associated with the two filter banks. An illustrative example is provided.
international conference on acoustics, speech, and signal processing | 2005
Turgay Celik; Cem Direkoglu; Huseyin Ozkaramanli; Hasan Demirel; Mustafa Uyguroglu
Facial feature extraction is a fundamental problem in image processing. Correct extraction of features is essential for the success of many applications. Typical feature extraction algorithms fail for low resolution images which do not contain sufficient facial detail. A region-based super-resolution aided facial feature extraction method for low resolution video sequences is described. The region based approach makes use of segmented faces as the region of interest whereby a significant reduction in computational burden of the super-resolution algorithm is achieved. The results indicate that the region-based super-resolution aided extraction algorithm provides significant performance improvement in terms of correct detection in accurately locating the facial feature points.
Signal Processing | 2002
Huseyin Ozkaramanli; Asim Bhatti; Bülent Bilgehan
Approximation order is an important feature of all wavelets. It implies that polynomials up to degree p - 1 are in the space spanned by the scaling function(s). In the scalar case, the scalar sum rules determine the approximation order or the left eigenvectors of the infinite down-sampled convolution matrix H determine the combinations of scaling functions required to produce the desired polynomial. For multi-wavelets the condition for approximation order is similar to the conditions in the scalar case. Generalized left eigenvectors of the matrix Hf; a finite portion of H determines the combinations of scaling functions that produce the desired superfunction from which polynomials of desired degree can be reproduced. The superfunctions in this work are taken to be B-splines. However, any refinable function can serve as the superfunction. The condition of approximation order is derived and new, symmetric, compactly supported and orthogonal multi-wavelets with approximation orders one, two, three and four are constructed.