Search results for "METHODOLOGIE"
showing 10 items of 2141 documents
An efficient upper bound of the rotation distance of binary trees
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.
Fast comparison of DNA sequences by oligonucleotide profiling
2008
Provisional abstact and full-text PDF files correspond to the article as it appeared upon acceptance. Fully formatted PDF and final abstract will be made available soon.
Protein Interaction Networks and Disease: Highlights of the 3rd Challenges in Computational Biology Meeting
2017
Cellular functions are managed by a complex network of protein interactions, the malfunction of which may derive in disease phenotypes. In spite of the incompleteness and noise present in our current protein interaction maps, computational biologists are making strenuous efforts to extract knowledge from these intricate networks and, through their integration with other types of biological data, expedite the development of novel and more effective treatments against human disorders. The 3rd Challenges in Computational Biology meeting revolved around the Protein Interaction Networks and Disease subject, bringing expert network biologists to the city of Mainz, Germany to debate the current st…
A Coclustering Approach for Mining Large Protein-Protein Interaction Networks
2012
Several approaches have been presented in the literature to cluster Protein-Protein Interaction (PPI) networks. They can be grouped in two main categories: those allowing a protein to participate in different clusters and those generating only nonoverlapping clusters. In both cases, a challenging task is to find a suitable compromise between the biological relevance of the results and a comprehensive coverage of the analyzed networks. Indeed, methods returning high accurate results are often able to cover only small parts of the input PPI network, especially when low-characterized networks are considered. We present a coclustering-based technique able to generate both overlapping and nonove…
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…
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…
A biproportional filter to compare technical and allocation coefficient variations
1997
International audience; In input-output analysis there are two alternate possibilities between Leontief's mechanism (fixed technical coefficients) and Ghosh's mechanism (fixed allocation coefficients). Testing the long term consistency of these mechanisms entails comparing input-output matrices over time. This paper challenges the value of proportional filters (separate comparison of column and row coefficients) and introduces the biproportional filter which allows simultaneous comparison of column and rows. An application is proposed using French input-output tables for 1980 and 1993. The stability of column coefficients cannot be taken for granted and generally, for any sector, both rows …
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