Tiled Sparse Coding in Eigenspaces for Image Classification

2021 ◽  
Author(s):  
Juan E Arco ◽  
Andrés Ortiz ◽  
Javier Ramírez ◽  
Yu-Dong Zhang ◽  
Juan M Górriz
Keyword(s):  
Sparse Coding ◽  
Computational Cost ◽  
Learning Approaches ◽  
Classification Framework ◽  
Large Databases ◽  
Class Context ◽  
Control Versus ◽  
Complex Solutions ◽  
Aided Diagnosis ◽  
High Computational Cost

The automation in the diagnosis of medical images is currently a challenging task. The use of Computer Aided Diagnosis (CAD) systems can be a powerful tool for clinicians, especially in situations when hospitals are overflowed. These tools are usually based on artificial intelligence (AI), a field that has been recently revolutionized by deep learning approaches. blackThese alternatives usually obtain a large performance based on complex solutions, leading to a high computational cost and the need of having large databases. In this work, we propose a classification framework based on sparse coding. Images are blackfirst partitioned into different tiles, and a dictionary is built after applying PCA to these tiles. The original signals are then transformed as a linear combination of the elements of the dictionary. blackThen, they are reconstructed by iteratively deactivating the elements associated with each component. Classification is finally performed employing as features the subsequent reconstruction errors. Performance is evaluated in a real context where distinguishing between four different pathologies: control versus bacterial pneumonia versus viral pneumonia versus COVID-19. blackOur system differentiates between pneumonia patients and controls with an accuracy of 97.74%, whereas in the 4-class context the accuracy is 86.73%. The excellent results and the pioneering use of sparse coding in this scenario evidence that our proposal can assist clinicians when their workload is high.

scholarly journals Iterative machine learning applied to annotation of text datasets

2021 ◽  
Author(s):  
Thiago Abdo ◽  
Fabiano Silva
Keyword(s):  
Machine Learning ◽  
Deep Learning ◽  
Learning Algorithms ◽  
Computational Cost ◽  
Machine Learning Techniques ◽  
Learning Approaches ◽  
Learning Techniques ◽  
The Creation ◽  
The Impact ◽  
High Computational Cost

The purpose of this paper is to analyze the use of different machine learning approaches and algorithms to be integrated as an automated assistance on a tool to aid the creation of new annotated datasets. We evaluate how they scale in an environment without dedicated machine learning hardware. In particular, we study the impact over a dataset with few examples and one that is being constructed. We experiment using deep learning algorithms (Bert) and classical learning algorithms with a lower computational cost (W2V and Glove combined with RF and SVM). Our experiments show that deep learning algorithms have a performance advantage over classical techniques. However, deep learning algorithms have a high computational cost, making them inadequate to an environment with reduced hardware resources. Simulations using Active and Iterative machine learning techniques to assist the creation of new datasets are conducted. For these simulations, we use the classical learning algorithms because of their computational cost. The knowledge gathered with our experimental evaluation aims to support the creation of a tool for building new text datasets.

scholarly journals Computational Offloading in FOG computing using Machine Learning Approaches

2020 ◽  
pp. 82-88
Author(s):  
Najmus Saqib ◽  
Nadeem Yousuf Khanday
Keyword(s):  
Machine Learning ◽  
Fog Computing ◽  
Computational Cost ◽  
Security And Privacy ◽  
Computation Offloading ◽  
Learning Approaches ◽  
Computational Requirement ◽  
The Common ◽  
Computational Offloading ◽  
High Computational Cost

Computation offloading is a prominent exposition for the mobile devices that lack the computational power to execute applications that require a high computational cost. There are several criteria on which computational offloading can be performed. The common measures’ being load harmonizing at the servers on which task is to be computed, energy management, security and privacy of tasks to be offloaded and the most important being the computational requirement of the task. That being said more and more solutions for offloading use various machine learning (ML) and deep learning (DL) algorithms for predicting the best nodes off to which task is to be offloaded improving the performance of offloading by reducing the delay in computing the tasks. We present various computational offloading techniques which use ML and DL. Also, we describe numerous middleware technologies and the criteria's that are crucial for offloading in specific developments.

An Alternate Algorithm for (3x3) Median Filtering of Digital Images

2012 ◽  
Vol 2 (1) ◽  
pp. 7-9 ◽  
Author(s):  
Satinderjit Singh
Keyword(s):  
Median Filter ◽  
Computational Cost ◽  
Spatial Coherence ◽  
General Purpose ◽  
Median Filtering ◽  
Basic Algorithm ◽  
Temporal Complexity ◽  
Filter Kernel ◽  
One Step ◽  
High Computational Cost

Median filtering is a commonly used technique in image processing. The main problem of the median filter is its high computational cost (for sorting N pixels, the temporal complexity is O(N·log N), even with the most efficient sorting algorithms). When the median filter must be carried out in real time, the software implementation in general-purpose processorsdoes not usually give good results. This Paper presents an efficient algorithm for median filtering with a 3x3 filter kernel with only about 9 comparisons per pixel using spatial coherence between neighboring filter computations. The basic algorithm calculates two medians in one step and reuses sorted slices of three vertical neighboring pixels. An extension of this algorithm for 2D spatial coherence is also examined, which calculates four medians per step.

Methods for studying dissolved oxygen levels in coastal and estuarine waters receiving combined sewer overflows

1995 ◽  
Vol 32 (2) ◽  
pp. 95-103
Author(s):  
José A. Revilla ◽  
Kalin N. Koev ◽  
Rafael Díaz ◽  
César Álvarez ◽  
Antonio Roldán
Keyword(s):  
Dissolved Oxygen ◽  
Coastal Waters ◽  
Computational Cost ◽  
Oxygen Deficit ◽  
Alternative Methods ◽  
Coastal Zones ◽  
Combined Sewer Overflows ◽  
Sewer Systems ◽  
Combined Sewer ◽  
High Computational Cost

One factor in determining the transport capacity of coastal interceptors in Combined Sewer Systems (CSS) is the reduction of Dissolved Oxygen (DO) in coastal waters originating from the overflows. The study of the evolution of DO in coastal zones is complex. The high computational cost of using mathematical models discriminates against the required probabilistic analysis being undertaken. Alternative methods, based on such mathematical modelling, employed in a limited number of cases, are therefore needed. In this paper two alternative methods are presented for the study of oxygen deficit resulting from overflows of CSS. In the first, statistical analyses focus on the causes of the deficit (the volume discharged). The second concentrates on the effects (the concentrations of oxygen in the sea). Both methods have been applied in a study of the coastal interceptor at Pasajes Estuary (Guipúzcoa, Spain) with similar results.

scholarly journals Visualizing Profiles of Large Datasets of Weighted and Mixed Data

Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 891
Author(s):  
Aurea Grané ◽  
Alpha A. Sow-Barry
Keyword(s):  
Multidimensional Scaling ◽  
Random Sample ◽  
Simulation Study ◽  
Clustering Algorithm ◽  
Computational Cost ◽  
Interpolation Formula ◽  
Large Datasets ◽  
Mixed Data ◽  
Multivariate Techniques ◽  
High Computational Cost

This work provides a procedure with which to construct and visualize profiles, i.e., groups of individuals with similar characteristics, for weighted and mixed data by combining two classical multivariate techniques, multidimensional scaling (MDS) and the k-prototypes clustering algorithm. The well-known drawback of classical MDS in large datasets is circumvented by selecting a small random sample of the dataset, whose individuals are clustered by means of an adapted version of the k-prototypes algorithm and mapped via classical MDS. Gower’s interpolation formula is used to project remaining individuals onto the previous configuration. In all the process, Gower’s distance is used to measure the proximity between individuals. The methodology is illustrated on a real dataset, obtained from the Survey of Health, Ageing and Retirement in Europe (SHARE), which was carried out in 19 countries and represents over 124 million aged individuals in Europe. The performance of the method was evaluated through a simulation study, whose results point out that the new proposal solves the high computational cost of the classical MDS with low error.

Reliability and reliability-based sensitivity analysis of self-centering buckling restrained braces using meta-models

2021 ◽  
pp. 1045389X2110263
Author(s):  
Seyede Vahide Hashemi ◽  
Mahmoud Miri ◽  
Mohsen Rashki ◽  
Sadegh Etedali
Keyword(s):  
Failure Probability ◽  
Limit State ◽  
Computational Cost ◽  
Sensitivity Analyses ◽  
State Function ◽  
Reliability Indices ◽  
Buckling Restrained Brace ◽  
Polynomial Response Surface ◽  
Nonlinear Dynamic Analyses ◽  
High Computational Cost

This paper aims to carry out sensitivity analyses to study how the effect of each design variable on the performance of self-centering buckling restrained brace (SC-BRB) and the corresponding buckling restrained brace (BRB) without shape memory alloy (SMA) rods. Furthermore, the reliability analyses of BRB and SC-BRB are performed in this study. Considering the high computational cost of the simulation methods, three Meta-models including the Kriging, radial basis function (RBF), and polynomial response surface (PRSM) are utilized to construct the surrogate models. For this aim, the nonlinear dynamic analyses are conducted on both BRB and SC-BRB by using OpenSees software. The results showed that the SMA area, SMA length ratio, and BRB core area have the most effect on the failure probability of SC-BRB. It is concluded that Kriging-based Monte Carlo Simulation (MCS) gives the best performance to estimate the limit state function (LSF) of BRB and SC-BRB in the reliability analysis procedures. Considering the effects of changing the maximum cyclic loading on the failure probability computation and comparison of the failure probability for different LSFs, it is also found that the reliability indices of SC-BRB were always higher than the corresponding reliability indices determined for BRB which confirms the performance superiority of SC-BRB than BRB.

scholarly journals Non-parallel dictionary learning for voice conversion using non-negative Tucker decomposition

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Yuki Takashima ◽  
Toru Nakashika ◽  
Tetsuya Takiguchi ◽  
Yasuo Ariki
Keyword(s):  
Dictionary Learning ◽  
Computational Cost ◽  
Tensor Decomposition ◽  
Gaussian Mixture ◽  
Voice Conversion ◽  
Specific Information ◽  
Learning Method ◽  
Tucker Decomposition ◽  
Parallel Data ◽  
High Computational Cost

Abstract Voice conversion (VC) is a technique of exclusively converting speaker-specific information in the source speech while preserving the associated phonemic information. Non-negative matrix factorization (NMF)-based VC has been widely researched because of the natural-sounding voice it achieves when compared with conventional Gaussian mixture model-based VC. In conventional NMF-VC, models are trained using parallel data which results in the speech data requiring elaborate pre-processing to generate parallel data. NMF-VC also tends to be an extensive model as this method has several parallel exemplars for the dictionary matrix, leading to a high computational cost. In this study, an innovative parallel dictionary-learning method using non-negative Tucker decomposition (NTD) is proposed. The proposed method uses tensor decomposition and decomposes an input observation into a set of mode matrices and one core tensor. The proposed NTD-based dictionary-learning method estimates the dictionary matrix for NMF-VC without using parallel data. The experimental results show that the proposed method outperforms other methods in both parallel and non-parallel settings.

scholarly journals A NOTE ON PHASING LONG GENOMIC REGIONS USING LOCAL HAPLOTYPE PREDICTIONS

2006 ◽  
Vol 04 (03) ◽  
pp. 639-647 ◽  
Author(s):  
ELEAZAR ESKIN ◽  
RODED SHARAN ◽  
ERAN HALPERIN
Keyword(s):  
Large Scale ◽  
Computational Cost ◽  
Nucleotide Polymorphisms ◽  
Single Nucleotide ◽  
Novel Approach ◽  
Maximum Likelihood Criterion ◽  
The Common ◽  
Genomic Regions ◽  
High Computational Cost ◽  
Combining Information

The common approaches for haplotype inference from genotype data are targeted toward phasing short genomic regions. Longer regions are often tackled in a heuristic manner, due to the high computational cost. Here, we describe a novel approach for phasing genotypes over long regions, which is based on combining information from local predictions on short, overlapping regions. The phasing is done in a way, which maximizes a natural maximum likelihood criterion. Among other things, this criterion takes into account the physical length between neighboring single nucleotide polymorphisms. The approach is very efficient and is applied to several large scale datasets and is shown to be successful in two recent benchmarking studies (Zaitlen et al., in press; Marchini et al., in preparation). Our method is publicly available via a webserver at .

scholarly journals Plant Leaf Disease Recognition Using Depth-Wise Separable Convolution-Based Models

Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 511
Author(s):  
Syed Mohammad Minhaz Hossain ◽  
Kaushik Deb ◽  
Pranab Kumar Dhar ◽  
Takeshi Koshiba
Keyword(s):  
State Of The Art ◽  
Computational Cost ◽  
Region Of Interest ◽  
Number Of Clusters ◽  
Plant Leaf ◽  
Leaf Disease ◽  
Automatic Initialization ◽  
Adequate Accuracy ◽  
Model Size ◽  
High Computational Cost

Proper plant leaf disease (PLD) detection is challenging in complex backgrounds and under different capture conditions. For this reason, initially, modified adaptive centroid-based segmentation (ACS) is used to trace the proper region of interest (ROI). Automatic initialization of the number of clusters (K) using modified ACS before recognition increases tracing ROI’s scalability even for symmetrical features in various plants. Besides, convolutional neural network (CNN)-based PLD recognition models achieve adequate accuracy to some extent. However, memory requirements (large-scaled parameters) and the high computational cost of CNN-based PLD models are burning issues for the memory restricted mobile and IoT-based devices. Therefore, after tracing ROIs, three proposed depth-wise separable convolutional PLD (DSCPLD) models, such as segmented modified DSCPLD (S-modified MobileNet), segmented reduced DSCPLD (S-reduced MobileNet), and segmented extended DSCPLD (S-extended MobileNet), are utilized to represent the constructive trade-off among accuracy, model size, and computational latency. Moreover, we have compared our proposed DSCPLD recognition models with state-of-the-art models, such as MobileNet, VGG16, VGG19, and AlexNet. Among segmented-based DSCPLD models, S-modified MobileNet achieves the best accuracy of 99.55% and F1-sore of 97.07%. Besides, we have simulated our DSCPLD models using both full plant leaf images and segmented plant leaf images and conclude that, after using modified ACS, all models increase their accuracy and F1-score. Furthermore, a new plant leaf dataset containing 6580 images of eight plants was used to experiment with several depth-wise separable convolution models.

Heterogeneous Influence Maximization Through Community Detection in Social Networks

2021 ◽  
Vol 12 (4) ◽  
pp. 118-131
Author(s):  
Jaya Krishna Raguru ◽  
Devi Prasad Sharma
Keyword(s):  
Community Detection ◽  
Greedy Algorithms ◽  
Computational Cost ◽  
Optimal Solution ◽  
Influence Maximization ◽  
Centrality Measures ◽  
Influence Spread ◽  
Real World Datasets ◽  
Initial Seed ◽  
High Computational Cost

The problem of identifying a seed set composed of K nodes that increase influence spread over a social network is known as influence maximization (IM). Past works showed this problem to be NP-hard and an optimal solution to this problem using greedy algorithms achieved only 63% of spread. However, this approach is expensive and suffered from performance issues like high computational cost. Furthermore, in a network with communities, IM spread is not always certain. In this paper, heterogeneous influence maximization through community detection (HIMCD) algorithm is proposed. This approach addresses initial seed nodes selection in communities using various centrality measures, and these seed nodes act as sources for influence spread. A parallel influence maximization is applied with the aid of seed node set contained in each group. In this approach, graph is partitioned and IM computations are done in a distributed manner. Extensive experiments with two real-world datasets reveals that HCDIM achieves substantial performance improvement over state-of-the-art techniques.

Sign in / Sign up

Export Citation Format

Share Document