25 resultados para population based incremental learning (PBIL) method
Resumo:
Traditional image reconstruction methods in rapid dynamic diffuse optical tomography employ l(2)-norm-based regularization, which is known to remove the high-frequency components in the reconstructed images and make them appear smooth. The contrast recovery in these type of methods is typically dependent on the iterative nature of method employed, where the nonlinear iterative technique is known to perform better in comparison to linear techniques (noniterative) with a caveat that nonlinear techniques are computationally complex. Assuming that there is a linear dependency of solution between successive frames resulted in a linear inverse problem. This new framework with the combination of l(1)-norm based regularization can provide better robustness to noise and provide better contrast recovery compared to conventional l(2)-based techniques. Moreover, it is shown that the proposed l(1)-based technique is computationally efficient compared to its counterpart (l(2)-based one). The proposed framework requires a reasonably close estimate of the actual solution for the initial frame, and any suboptimal estimate leads to erroneous reconstruction results for the subsequent frames.
Resumo:
This work proposes a boosting-based transfer learning approach for head-pose classification from multiple, low-resolution views. Head-pose classification performance is adversely affected when the source (training) and target (test) data arise from different distributions (due to change in face appearance, lighting, etc). Under such conditions, we employ Xferboost, a Logitboost-based transfer learning framework that integrates knowledge from a few labeled target samples with the source model to effectively minimize misclassifications on the target data. Experiments confirm that the Xferboost framework can improve classification performance by up to 6%, when knowledge is transferred between the CLEAR and FBK four-view headpose datasets.
Resumo:
A new automatic algorithm for the assessment of mixed mode crack growth rate characteristics is presented based on the concept of an equivalent crack. The residual ligament size approach is introduced to implementation this algorithm for identifying the crack tip position on a curved path with respect to the drop potential signal. The automatic algorithm accounting for the curvilinear crack trajectory and employing an electrical potential difference was calibrated with respect to the optical measurements for the growing crack under cyclic mixed mode loading conditions. The effectiveness of the proposed algorithm is confirmed by fatigue tests performed on ST3 steel compact tension-shear specimens in the full range of mode mixities from pure mode Ito pure mode II. (C) 2015 Elsevier Ltd. All rights reserved.
Resumo:
An adaptive learning scheme, based on a fuzzy approximation to the gradient descent method for training a pattern classifier using unlabeled samples, is described. The objective function defined for the fuzzy ISODATA clustering procedure is used as the loss function for computing the gradient. Learning is based on simultaneous fuzzy decisionmaking and estimation. It uses conditional fuzzy measures on unlabeled samples. An exponential membership function is assumed for each class, and the parameters constituting these membership functions are estimated, using the gradient, in a recursive fashion. The induced possibility of occurrence of each class is useful for estimation and is computed using 1) the membership of the new sample in that class and 2) the previously computed average possibility of occurrence of the same class. An inductive entropy measure is defined in terms of induced possibility distribution to measure the extent of learning. The method is illustrated with relevant examples.
Resumo:
Support Vector Machines(SVMs) are hyperplane classifiers defined in a kernel induced feature space. The data size dependent training time complexity of SVMs usually prohibits its use in applications involving more than a few thousands of data points. In this paper we propose a novel kernel based incremental data clustering approach and its use for scaling Non-linear Support Vector Machines to handle large data sets. The clustering method introduced can find cluster abstractions of the training data in a kernel induced feature space. These cluster abstractions are then used for selective sampling based training of Support Vector Machines to reduce the training time without compromising the generalization performance. Experiments done with real world datasets show that this approach gives good generalization performance at reasonable computational expense.
Resumo:
Clustering has been the most popular method for data exploration. Clustering is partitioning the data set into sub-partitions based on some measures say the distance measure, each partition has its own significant information. There are a number of algorithms explored for this purpose, one such algorithm is the Particle Swarm Optimization(PSO) which is a population based heuristic search technique derived from swarm intelligence. In this paper we present an improved version of the Particle Swarm Optimization where, each feature of the data set is given significance accordingly by adding some random weights, which also minimizes the distortions in the dataset if any. The performance of the above proposed algorithm is evaluated using some benchmark datasets from Machine Learning Repository. The experimental results shows that our proposed methodology performs significantly better than the previously performed experiments.
Resumo:
Data clustering is a common technique for statistical data analysis, which is used in many fields, including machine learning and data mining. Clustering is grouping of a data set or more precisely, the partitioning of a data set into subsets (clusters), so that the data in each subset (ideally) share some common trait according to some defined distance measure. In this paper we present the genetically improved version of particle swarm optimization algorithm which is a population based heuristic search technique derived from the analysis of the particle swarm intelligence and the concepts of genetic algorithms (GA). The algorithm combines the concepts of PSO such as velocity and position update rules together with the concepts of GA such as selection, crossover and mutation. The performance of the above proposed algorithm is evaluated using some benchmark datasets from Machine Learning Repository. The performance of our method is better than k-means and PSO algorithm.
Resumo:
Error estimates for the error reproducing kernel method (ERKM) are provided. The ERKM is a mesh-free functional approximation scheme [A. Shaw, D. Roy, A NURBS-based error reproducing kernel method with applications in solid mechanics, Computational Mechanics (2006), to appear (available online)], wherein a targeted function and its derivatives are first approximated via non-uniform rational B-splines (NURBS) basis function. Errors in the NURBS approximation are then reproduced via a family of non-NURBS basis functions, constructed using a polynomial reproduction condition, and added to the NURBS approximation of the function obtained in the first step. In addition to the derivation of error estimates, convergence studies are undertaken for a couple of test boundary value problems with known exact solutions. The ERKM is next applied to a one-dimensional Burgers equation where, time evolution leads to a breakdown of the continuous solution and the appearance of a shock. Many available mesh-free schemes appear to be unable to capture this shock without numerical instability. However, given that any desired order of continuity is achievable through NURBS approximations, the ERKM can even accurately approximate functions with discontinuous derivatives. Moreover, due to the variation diminishing property of NURBS, it has advantages in representing sharp changes in gradients. This paper is focused on demonstrating this ability of ERKM via some numerical examples. Comparisons of some of the results with those via the standard form of the reproducing kernel particle method (RKPM) demonstrate the relative numerical advantages and accuracy of the ERKM.
Resumo:
Background: The gene encoding for uncoupling protein-1 (UCP1) is considered to be a candidate gene for type 2 diabetes because of its role in thermogenesis and energy expenditure. The objective of the study was to examine whether genetic variations in the UCP1 gene are associated with type 2 diabetes and its related traits in Asian Indians. Methods: The study subjects, 810 type 2 diabetic subjects and 990 normal glucose tolerant (NGT) subjects, were chosen from the Chennai Urban Rural Epidemiological Study (CURES), an ongoing population-based study in southern India. The polymorphisms were genotyped using the polymerase chain reaction-restriction fragment length polymorphism (PCR-RFLP) method. Linkage disequilibrium (LD) was estimated from the estimates of haplotypic frequencies. Results: The three polymorphisms, namely -3826A -> G, an A -> C transition in the 5'-untranslated region (UTR) and Met229Leu, were not associated with type 2 diabetes. However, the frequency of the A-C-Met (-3826A -> G-5'UTR A -> C-Met229Leu) haplotype was significantly higher among the type 2 diabetic subjects (2.67%) compared with the NGT subjects (1.45%, P < 0.01). The odds ratio for type 2 diabetes for the individuals carrying the haplotype A-C-Met was 1.82 (95% confidence interval, 1.29-2.78, P = 0.009). Conclusions: The haplotype, A-C-Met, in the UCP1 gene is significantly associated with the increased genetic risk for developing type 2 diabetes in Asian Indians.
Resumo:
Skew correction of complex document images is a difficult task. We propose an edge-based connected component approach for robust skew correction of documents with complex layout and content. The algorithm essentially consists of two steps - an 'initialization' step to determine the image orientation from the centroids of the connected components and a 'search' step to find the actual skew of the image. During initialization, we choose two different sets of points regularly spaced across the the image, one from the left to right and the other from top to bottom. The image orientation is determined from the slope between the two succesive nearest neighbors of each of the points in the chosen set. The search step finds succesive nearest neighbors that satisfy the parameters obtained in the initialization step. The final skew is determined from the slopes obtained in the 'search' step. Unlike other connected component based methods, the proposed method does not require any binarization step that generally precedes connected component analysis. The method works well for scanned documents with complex layout of any skew with a precision of 0.5 degrees.
Resumo:
Randomness in the source condition other than the heterogeneity in the system parameters can also be a major source of uncertainty in the concentration field. Hence, a more general form of the problem formulation is necessary to consider randomness in both source condition and system parameters. When the source varies with time, the unsteady problem, can be solved using the unit response function. In the case of random system parameters, the response function becomes a random function and depends on the randomness in the system parameters. In the present study, the source is modelled as a random discrete process with either a fixed interval or a random interval (the Poisson process). In this study, an attempt is made to assess the relative effects of various types of source uncertainties on the probabilistic behaviour of the concentration in a porous medium while the system parameters are also modelled as random fields. Analytical expressions of mean and covariance of concentration due to random discrete source are derived in terms of mean and covariance of unit response function. The probabilistic behaviour of the random response function is obtained by using a perturbation-based stochastic finite element method (SFEM), which performs well for mild heterogeneity. The proposed method is applied for analysing both the 1-D as well as the 3-D solute transport problems. The results obtained with SFEM are compared with the Monte Carlo simulation for 1-D problems.
Resumo:
Peroxisome proliferator activated receptor-gamma 2 (PPARG2) is a nuclear hormone receptor of ligand-dependent ranscription factor involved in adipogenesis and a molecular target of the insulin sensitizers thiazolidinediones. We addressed the question of whether the 3 variants (-1279G/A, Pro12Ala, and His478His) in the PPARG2 gene are associated with type 2 diabetes mellitus and its related traits in a South Indian population. The study subjects (1000 type 2 diabetes mellitus and 1000 normal glucose-tolerant subjects) were chosen randomly from the Chennai Urban Rural Epidemiology Study, an ongoing population-based study in southern India. The variants were screened by single-stranded conformational variant, direct sequencing, and restriction fragment length polymorphism. Linkage disequilibrium was estimated from the estimates of haplotypic frequencies. The -1279G/A, Pro12Ala, and His478His variants of the PPARG2 gene were not associated with type 2 diabetes mellitus. However, the 2-loci analyses showed that, in the presence of Pro/Pro genotype of the Pro12Ala variant, the -1279G/A promoter variant showed increased susceptibility to type 2 diabetes mellitus (odds ratio, 2.092; 95% confidence interval, 1.22-3.59; P = .008), whereas in the presence of 12Ala allele, the -1279G/A showed a protective effect against type 2 diabetes mellitus (odds ratio, 0.270; 95% confidence interval, 0.15-0.49; P < .0001). The 3-loci haplotype analysis showed that the A-Ala-T (-1279G/A-Pro12Ala-His478His) haplotype was associated with a reduced risk of type 2 diabetes mellitus (P < .0001). Although our data indicate that the PPARG2 gene variants, independently, have no association with type 2 diabetes mellitus, the 2-loci genotype analysis involving -1279G/A and Pro12Ala variants and the 3-loci haplotype analysis have shown a significant association with type 2 diabetes mellitus in this South Indian population. (C) 2010 Elsevier Inc. All rights reserved.
Resumo:
In this paper, elastic wave propagation is studied in a nanocomposite reinforced with multiwall carbon nanotubes (CNTs). Analysis is performed on a representative volume element of square cross section. The frequency content of the exciting signal is at the terahertz level. Here, the composite is modeled as a higher order shear deformable beam using layerwise theory, to account for partial shear stress transfer between the CNTs and the matrix. The walls of the multiwall CNTs are considered to be connected throughout their length by distributed springs, whose stiffness is governed by the van der Waals force acting between the walls of nanotubes. The analyses in both the frequency and time domains are done using the wavelet-based spectral finite element method (WSFEM). The method uses the Daubechies wavelet basis approximation in time to reduce the governing PDE to a set of ODEs. These transformed ODEs are solved using a finite element (FE) technique by deriving an exact interpolating function in the transformed domain to obtain the exact dynamic stiffness matrix. Numerical analyses are performed to study the spectrum and dispersion relations for different matrix materials and also for different beam models. The effects of partial shear stress transfer between CNTs and matrix on the frequency response function (FRF) and the time response due to broadband impulse loading are investigated for different matrix materials. The simultaneous existence of four coupled propagating modes in a double-walled CNT-composite is also captured using modulated sinusoidal excitation.
Resumo:
Sandalwood is an economically important aromatic tree belonging to the family Santalaceae. The trees are used mainly for their fragrant heartwood and oil that have immense potential for foreign exchange. Very little information is available on the genetic diversity in this species. Hence studies were initiated and genetic diversity estimated using RAPD markers in 51 genotypes of Santalum album procured from different geographcial regions of India and three exotic lines of S. spicatum from Australia. Eleven selected Operon primers (10mer) generated a total of 156 consistent and unambiguous amplification products ranging from 200bp to 4kb. Rare and genotype specific bands were identified which could be effectively used to distinguish the genotypes. Genetic relationships within the genotypes were evaluated by generating a dissimilarity matrix based on Ward's method (Squared Euclidean distance). The phenetic dendrogram and the Principal Component Analysis generated, separated the 51 Indian genotypes from the three Australian lines. The cluster analysis indicated that sandalwood germplasm within India constitutes a broad genetic base with values of genetic dissimilarity ranging from 15 to 91 %. A core collection of 21 selected individuals revealed the same diversity of the entire population. The results show that RAPD analysis is an efficient marker technology for estimating genetic diversity and relatedness, thereby enabling the formulation of appropriate strategies for conservation, germplasm management, and selection of diverse parents for sandalwood improvement programmes.
Resumo:
Non-Identical Duplicate video detection is a challenging research problem. Non-Identical Duplicate video are a pair of videos that are not exactly identical but are almost similar.In this paper, we evaluate two methods - Keyframe -based and Tomography-based methods to determine the Non-Identical Duplicate videos. These two methods make use of the existing scale based shift invariant (SIFT) method to find the match between the key frames in first method, and the cross-sections through the temporal axis of the videos in second method.We provide extensive experimental results and the analysis of accuracy and efficiency of the above two methods on a data set of Non- Identical Duplicate video-pair.