4 research outputs found

    Advanced Diagnostic Technique for Alzheimer’s Disease using MRI Top-Ranked Volume and Surface-based Features

    Get PDF
    Background: Alzheimer’s disease (AD) is the most dominant type of dementia that has not been treated completely yet. Few Alzheimer‘s patients are correctly diagnosed on time. Therefore, diagnostic tools are needed for better and more efficient diagnoses. Objective: This study aimed to develop an efficient automated method to differentiate Alzheimer’s patients from normal elderly and present the essential features with accurate Alzheimer’s diagnosis.Material and Methods: In this analytical study, 154 Magnetic Resonance Imaging (MRI) scans were obtained from the Alzheimer’s Disease Neuroimaging Initiative (ADNI) database, preprocessed, and normalized by the head size for extracting features (volume, cortical thickness, Sulci depth, and Gyrification Index Features (GIF). Relief-F algorithm, t-test, and one way-ANOVA were used for feature ranking to obtain the most effective features representing the AD for the classification process. Finally, in the classification step, four classifiers were used with 10 folds cross-validation as follows: Gaussian Support Vector Machine (GSVM), Linear Support Vector Machine (LSVM), Weighted K-Nearest Neighbors (W-KNN), and Decision Tree algorithm. Results: The LSVM classifier and W-KNN produce a testing accuracy of 100% with only seven features. Additionally, GSVM and decision tree produce a testing accuracy of 97.83% and 93.48%, respectively.  Conclusion: The proposed system represents an automatic and highly accurate AD detection with a few reliable and effective features and minimum time

    NEW HIDING TECHNIQUE IN DIGITAL SIGNATURE BASED ON ZIGZAG TRANSFORM AND CHAOTIC MAPS

    Get PDF
    Abstract This paper presents a novel approach to digital signature by integrating the ElGamal or Schnorr digital signature algorithms, chaotic systems, and scanning techniques. Briefly, ZZBCRP is a zigzag transformation that is used firstly to construct a permuted transaction, which technique starts from any random position and intersects in both directions, which is more complex than zigzag transform techniques. Then using ElGamal or Schnorr signature schemes based on chaotic maps. This modification aims to make private key and random number dependent on discrete chaotic maps. Even if the private key chosen is small, it is easy by using the huge amount of points in chaotic maps 2-D or 3-D to extract strong and unique key. This change complicates the relationship between the private key, public key and the transaction signature. A two-dimensional trigonometric discrete chaotic map is used that integrated Logistic-sine-cosine maps, and a three-dimensional hyperchaotic map (3-D SCC) which are based on a sine map. Our performance analysis shows that compared to schemes; this scheme not only improves the level of efficiency but also assures safety. The performance analysis shows that our scheme is not only more efficient compared to other related systems, but also safer

    A compact ultra wideband bandpass filter using arrow coupled lines with defected ground structure

    Get PDF
    A new ultra wideband bandpass filter (UWB-BPF) using arrow coupled lines and U-slot defected ground structures (U-DGS) is proposed. The input and output feeding lines are connected to the coupled lines placed on the conductor side of the substrate while the U-slot DGS was etched from the ground side below. The effect of U-DGS slot dimensions on the operating bandpass of the filter was studied. The filter was simulated using both IE3D and HFSS simulators. The simulation results are in good agreement with the realized filter. The filter operating passband extended over the UWB frequency 3.0–9.5 GHz while the group delay variation in the passband is in the range of 0.5°

    A Novel Dynamic Mathematical Model Applied in Hash Function Based on DNA Algorithm and Chaotic Maps

    No full text
    This paper aims to improve SHA-512 security without increasing complexity; therefore, we focused on hash functions depending on DNA sequences and chaotic maps. After analysis of 45 various chaotic map types, only 5 types are selected in this proposal—namely, improved logistic, cosine logistic map, logistic sine system, tent sine system, and hybrid. Using DNA features and binary coding technology with complementary rules to hide information is a key challenge. This article proposes improving SHA-512 in two aspects: the modification of original hash buffer values, and the modification of additive constants Kt. This proposal is to make hash buffer values (a, b, c, d, e, f, g, and h) and Kt dependent on one-dimensional discrete chaotic maps and DNA sequences instead of constant. This modification complicates the relationship between the original message and hash value, making it unexpected. The performance of the proposed hash function is tested and analyzed the confusion, diffusion, and distributive and compared with the original SHA-512. The performance of security is analyzed by collision analysis, for which the maximum number of hits is only three, showing that the proposed hash function enhances the security and robustness of SHA-512. The statistical data and experimental analysis indicate that the proposed scheme has good properties and satisfies high-performance requirements for secure hash functions
    corecore