Search results for "algorithm"
showing 10 items of 4887 documents
Topology Inference and Signal Representation Using Dictionary Learning
2019
This paper presents a Joint Graph Learning and Signal Representation algorithm, called JGLSR, for simultaneous topology learning and graph signal representation via a learned over-complete dictionary. The proposed algorithm alternates between three main steps: sparse coding, dictionary learning, and graph topology inference. We introduce the “transformed graph” which can be considered as a projected graph in the transform domain spanned by the dictionary atoms. Simulation results via synthetic and real data show that the proposed approach has a higher performance when compared to the well-known algorithms for joint undirected graph topology inference and signal representation, when there is…
SCCF Parameter and Similarity Measure Optimization and Evaluation
2019
Neighborhood-based Collaborative Filtering (CF) is one of the most successful and widely used recommendation approaches; however, it suffers from major flaws especially under sparse environments. Traditional similarity measures used by neighborhood-based CF to find similar users or items are not suitable in sparse datasets. Sparse Subspace Clustering and common liking rate in CF (SCCF), a recently published research, proposed a tunable similarity measure oriented towards sparse datasets; however, its performance can be maximized and requires further analysis and investigation. In this paper, we propose and evaluate the performance of a new tuning mechanism, using the Mean Absolute Error (MA…
Automatic estimation of Purkinje-Myocardial junction hot-spots from noisy endocardial samples: A simulation study
2017
The reconstruction of the ventricular cardiac conduction system (CCS) from patient-specific data is a challenging problem. High-resolution imaging techniques have allowed only the segmentation of proximal sections of the CCS from images acquired ex vivo. In this paper, we present an algorithm to estimate the location of a set of Purkinje-myocardial junctions (PMJs) from electro-anatomical maps, as those acquired during radio-frequency ablation procedures. The method requires a mesh representing the myocardium with local activation time measurements on a subset of nodes. We calculate the backwards propagation of the electrical signal from the measurement points to all the points in the mesh …
Simple computation of the approximated modulation transfer function (MTF) using spreadsheet-software: method and evaluation in five maxillofacial CBC…
2019
OBJECTIVES: To develop a simple way to compute the approximated modulation transfer function (MTF) manually using conventional spreadsheet software. METHODS: Basing on an edge-image a method was developed, facilitating computation of the edge spread and line spread function in open-source spreadsheet software (Gnumeric; http://projects.gnome.org/gnumeric/downloads.shtml). By means of the integrated fast Fourier transformation Fourier coefficients are obtained from the line spread function which can then be plotted vs spatial frequency to obtain MTF-plots. For the experimental evaluation an edge test object was exposed in five commercial CBCT devices for maxillofacial applications. RESULTS: …
PyDSC: a simple tool to treat differential scanning calorimetry data
2020
AbstractHerein, we describe an open-source, Python-based, script to treat the output of differential scanning calorimetry (DSC) experiments, called pyDSC, available free of charge for download at https://github.com/leonardo-chiappisi/pyDSC under a GNU General Public License v3.0. The main aim of this program is to provide the community with a simple program to analyze raw DSC data. Key features include the correction from spurious signals, and, most importantly, the baseline is computed with a robust, physically consistent approach. We also show that the baseline correction routine implemented in the script is significantly more reproducible than different standard ones proposed by propriet…
Approximate 3-Dimensional Electrical Impedance Imaging
2001
We discuss a new approach to three-dimensional electrical impedance imaging based on a reduction of the information to be demanded from a reconstruction algorithm. Images are obtained from a single measurement by suitably simplifying the geometry of the measuring chamber and by restricting the nature of the object to be imaged and the information required from the image. In particular we seek to establish the existence or non-existence of a single object (or a small number of objects) in a homogeneous background and the location of the former in the (x,y)-plane defined by the measuring electrodes. Given in addition the conductivity of the object rough estimates of its position along the z-a…
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment.
2007
Abstract Background Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. However, the alignment methods seem inadequate for post-genomic studies since they do not scale well with data set size and they seem to be confined only to genomic and proteomic sequences. Therefore, alignment-free similarity measures are actively pursued. Among those, USM (Universal Similarity Metric) has gained prominence. It is based on the deep theory of Kolmogorov Complexity and universality is its most novel striking feature. Since it can only be approximated via data compression, USM is a methodology rath…
Errors Arising in Computer Simulation Methods
2014
The goal of this introductory chapter is to discuss in general terms different classes of errors arising in computer simulation methods and to direct the reader to the chapters and sections of the book where these errors are analyzed. Moreover, we describe the error estimation methodology applied in this book.
Cryptanalysis of Knapsack Cipher Using Ant Colony Optimization
2018
Ant Colony Optimization is a search metaheuristic inspired by the behavior of real ant colonies and shown their effectiveness, robustness to solve a wide variety of complex problems. In this paper, we present a novel Ant Colony Optimization (ACO) based attack for cryptanalysis of knapsack cipher algorithm. A Cipher-text only attack is used to discover the plaintext from the cipher-text. Moreover, our approach allows us to break knapsack cryptosystem in a minimum search space when compared with other techniques. Experimental results prove that ACO can be used as an effective tool to attack knapsack cipher.