Search results for "Pattern recognition"
showing 10 items of 2301 documents
Sparse Manifold Clustering and Embedding to discriminate gene expression profiles of glioblastoma and meningioma tumors.
2013
Sparse Manifold Clustering and Embedding (SMCE) algorithm has been recently proposed for simultaneous clustering and dimensionality reduction of data on nonlinear manifolds using sparse representation techniques. In this work, SMCE algorithm is applied to the differential discrimination of Glioblastoma and Meningioma Tumors by means of their Gene Expression Profiles. Our purpose was to evaluate the robustness of this nonlinear manifold to classify gene expression profiles, characterized by the high-dimensionality of their representations and the low discrimination power of most of the genes. For this objective, we used SMCE to reduce the dimensionality of a preprocessed dataset of 35 single…
A multimodal retina-iris biometric system using the Levenshtein distance for spatial feature comparison
2020
Abstract The recent developments of information technologies, and the consequent need for access to distributed services and resources, require robust and reliable authentication systems. Biometric systems can guarantee high levels of security and multimodal techniques, which combine two or more biometric traits, warranting constraints that are more stringent during the access phases. This work proposes a novel multimodal biometric system based on iris and retina combination in the spatial domain. The proposed solution follows the alignment and recognition approach commonly adopted in computational linguistics and bioinformatics; in particular, features are extracted separately for iris and…
Novel Iris Biometric Watermarking Based on Singular Value Decomposition and Discrete Cosine Transform
2014
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2014/926170 A novel iris biometric watermarking scheme is proposed focusing on iris recognition instead of the traditional watermark for increasing the security of the digital products. The preprocess of iris image is to be done firstly, which generates the iris biometric template from person's eye images. And then the templates are to be on discrete cosine transform; the value of the discrete cosine is encoded to BCH error control coding. The host image is divided into four areas equally correspondingly. The BCH codes are embedded in the sing…
Quantitative comparison of motion history image variants for video-based depression assessment
2017
Abstract Depression is the most prevalent mood disorder and a leading cause of disability worldwide. Automated video-based analyses may afford objective measures to support clinical judgments. In the present paper, categorical depression assessment is addressed by proposing a novel variant of the Motion History Image (MHI) which considers Gabor-inhibited filtered data instead of the original image. Classification results obtained with this method on the AVEC’14 dataset are compared to those derived using (a) an earlier MHI variant, the Landmark Motion History Image (LMHI), and (b) the original MHI. The different motion representations were tested in several combinations of appearance-based …
2D ECG Image Based Biometric Identification Using Stacked Autoencoders
2021
The handcrafted features extraction methods have achieved remarkable results in ECG based biometric identification. However, they are sensitive to many factors: (1) intra and inter-individual variability, (2) heart rate variability, (3) powerline interference, baseline wander and muscle artifacts. To deal with these issues, deep learning approaches have been proposed to extract automatically the important features almost from original data without any preprocessing step (i.e., The original ECG signal mostly contains noise). Unlike conventional ECG based biometric approaches, which based either on fiducial and non-fiducial methods, the proposed approach can be implemented on end to end syste…
Local Directional Multi Radius Binary Pattern
2018
Face recognition becomes an important task performed routinely in our daily lives. This application is encouraged by the wide availability of powerful and low-cost desktop and embedded computing systems, while the need comes from the integration in too much real world systems including biometric authentication, surveillance, human-computer interaction, and multimedia management. This article proposes a new variant of LBP descriptor referred as Local Directional Multi Radius Binary Pattern (LDMRBP) as a robust and effective face descriptor. The proposed LDMRBP operator is built using new neighborhood topology and new pattern encoding scheme. The adopted face recognition system consists of th…
Bivariate nonlinear prediction to quantify the strength of complex dynamical interactions in short-term cardiovascular variability.
2005
A nonlinear prediction method for investigating the dynamic interdependence between short length time series is presented. The method is a generalization to bivariate prediction of the univariate approach based on nearest neighbor local linear approximation. Given the input and output series x and y, the relationship between a pattern of samples of x and a synchronous sample of y was approximated with a linear polynomial whose coefficients were estimated from an equation system including the nearest neighbor patterns in x and the corresponding samples in y. To avoid overfitting and waste of data, the training and testing stages of the prediction were designed through a specific out-of-sampl…
Blind deconvolution using TV regularization and Bregman iteration
2005
In this paper we formulate a new time dependent model for blind deconvolution based on a constrained variational model that uses the sum of the total variation norms of the signal and the kernel as a regularizing functional. We incorporate mass conservation and the nonnegativity of the kernel and the signal as additional constraints. We apply the idea of Bregman iterative regularization, first used for image restoration by Osher and colleagues [S.J. Osher, M. Burger, D. Goldfarb, J.J. Xu, and W. Yin, An iterated regularization method for total variation based on image restoration, UCLA CAM Report, 04-13, (2004)]. to recover finer scales. We also present an analytical study of the model disc…
Sparse Deconvolution Using Support Vector Machines
2008
Sparse deconvolution is a classical subject in digital signal processing, having many practical applications. Support vector machine (SVM) algorithms show a series of characteristics, such as sparse solutions and implicit regularization, which make them attractive for solving sparse deconvolution problems. Here, a sparse deconvolution algorithm based on the SVM framework for signal processing is presented and analyzed, including comparative evaluations of its performance from the points of view of estimation and detection capabilities, and of robustness with respect to non-Gaussian additive noise. Publicado
A sensor-data-based denoising framework for hyperspectral images
2015
Many denoising approaches extend image processing to a hyperspectral cube structure, but do not take into account a sensor model nor the format of the recording. We propose a denoising framework for hyperspectral images that uses sensor data to convert an acquisition to a representation facilitating the noise-estimation, namely the photon-corrected image. This photon corrected image format accounts for the most common noise contributions and is spatially proportional to spectral radiance values. The subsequent denoising is based on an extended variational denoising model, which is suited for a Poisson distributed noise. A spatially and spectrally adaptive total variation regularisation term…