Search results for "ComputingMethodologies_PATTERNRECOGNITION"
showing 10 items of 296 documents
Cluster-based active learning for compact image classification
2010
In this paper, we consider active sampling to label pixels grouped with hierarchical clustering. The objective of the method is to match the data relationships discovered by the clustering algorithm with the user's desired class semantics. The first is represented as a complete tree to be pruned and the second is iteratively provided by the user. The active learning algorithm proposed searches the pruning of the tree that best matches the labels of the sampled points. By choosing the part of the tree to sample from according to current pruning's uncertainty, sampling is focused on most uncertain clusters. This way, large clusters for which the class membership is already fixed are no longer…
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…
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…
Processing of rock core microtomography images: Using seven different machine learning algorithms
2016
The abilities of machine learning algorithms to process X-ray microtomographic rock images were determined. The study focused on the use of unsupervised, supervised, and ensemble clustering techniques, to segment X-ray computer microtomography rock images and to estimate the pore spaces and pore size diameters in the rocks. The unsupervised k-means technique gave the fastest processing time and the supervised least squares support vector machine technique gave the slowest processing time. Multiphase assemblages of solid phases (minerals and finely grained minerals) and the pore phase were found on visual inspection of the images. In general, the accuracy in terms of porosity values and pore…
Alternating model trees
2015
Model tree induction is a popular method for tackling regression problems requiring interpretable models. Model trees are decision trees with multiple linear regression models at the leaf nodes. In this paper, we propose a method for growing alternating model trees, a form of option tree for regression problems. The motivation is that alternating decision trees achieve high accuracy in classification problems because they represent an ensemble classifier as a single tree structure. As in alternating decision trees for classification, our alternating model trees for regression contain splitter and prediction nodes, but we use simple linear regression functions as opposed to constant predicto…
Bagging and Boosting with Dynamic Integration of Classifiers
2000
One approach in classification tasks is to use machine learning techniques to derive classifiers using learning instances. The co-operation of several base classifiers as a decision committee has succeeded to reduce classification error. The main current decision committee learning approaches boosting and bagging use resampling with the training set and they can be used with different machine learning techniques which derive base classifiers. Boosting uses a kind of weighted voting and bagging uses equal weight voting as a combining method. Both do not take into account the local aspects that the base classifiers may have inside the problem space. We have proposed a dynamic integration tech…
Real-time flaw detection on a complex object: comparison of results using classification with a support vector machine, boosting, and hyperrectangle-…
2006
We present a classification work performed on industrial parts using artificial vision, a support vector machine (SVM), boost- ing, and a combination of classifiers. The object to be controlled is a coated heater used in television sets. Our project consists of detect- ing anomalies under manufacturer production, as well as in classi- fying the anomalies among 20 listed categories. Manufacturer speci- fications require a minimum of ten inspections per second without a decrease in the quality of the produced parts. This problem is ad- dressed by using a classification system relying on real-time ma- chine vision. To fulfill both real-time and quality constraints, three classification algorit…