Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 11 of 11
Full-Text Articles in Computer Engineering
Visual Analysis Method Of Tobacco Quality Data Based On Dimension Reduction, Tian Dong, Guihua Shan, Xuebin Chi, Yanling Zhang, Weihua Feng, Jianwei Wang, Aiguo Wang, Wang Rui
Visual Analysis Method Of Tobacco Quality Data Based On Dimension Reduction, Tian Dong, Guihua Shan, Xuebin Chi, Yanling Zhang, Weihua Feng, Jianwei Wang, Aiguo Wang, Wang Rui
Journal of System Simulation
Abstract: In order to meet the requirements of tobacco leaf matching across regions in tobacco material selection, a visual analysis method of tobacco leaf quality data that incorporating dimension reduction and correlation analysis methods is developed. Through the dimension reduction algorithm, the comparison algorithm and the visual interaction method based on the classification of aroma area for tobacco leaf quality data, a visual analysis method for exploring space division and correlation analysis of tobacco leaf quality data is provided. National tobacco leaf quality data analysis cases and expert demonstrations show that the method can carry out the tobacco leaf quality …
Keyless Anti-Jamming Communication Via Randomized Dsss, Ahmad Alagil
Keyless Anti-Jamming Communication Via Randomized Dsss, Ahmad Alagil
USF Tampa Graduate Theses and Dissertations
Nowadays, wireless networking is ubiquitous. In wireless communication systems, multiple nodes exchange data during the transmission time. Due to the natural use of the communication channel, it is crucial to protect the physical layer to make wireless channels between nodes more reliable. Jamming attacks consider one of the most significant threats on wireless communication. Spread spectrum techniques have been widely used to mitigate the effects of the jammer. Traditional anti-jamming approaches like Frequency Hopping Spread Spectrum (FHSS) and Direct Sequence Spread Spectrum (DSSS) require a sender and a receiver to share a secret key prior to their communication. If this …
Low-Rank Sparse Subspace For Spectral Clustering, Xiaofeng Zhu, Shichao Zhang, Yonggang Li, Jilian Zhang, Lifeng Yang, Yue Fang
Low-Rank Sparse Subspace For Spectral Clustering, Xiaofeng Zhu, Shichao Zhang, Yonggang Li, Jilian Zhang, Lifeng Yang, Yue Fang
Research Collection School Of Computing and Information Systems
The current two-step clustering methods separately learn the similarity matrix and conduct k means clustering. Moreover, the similarity matrix is learnt from the original data, which usually contain noise. As a consequence, these clustering methods cannot achieve good clustering results. To address these issues, this paper proposes a new graph clustering methods (namely Low-rank Sparse Subspace clustering (LSS)) to simultaneously learn the similarity matrix and conduct the clustering from the low-dimensional feature space of the original data. Specifically, the proposed LSS integrates the learning of similarity matrix of the original feature space, the learning of similarity matrix of the low-dimensional …
Accurate And Compact Stochastic Computations By Exploiting Correlation, Hamdan Abdellatef, Mohamed Khalil Hani, Nasir Shaikh-Husin
Accurate And Compact Stochastic Computations By Exploiting Correlation, Hamdan Abdellatef, Mohamed Khalil Hani, Nasir Shaikh-Husin
Turkish Journal of Electrical Engineering and Computer Sciences
Recent studies have shown, contrary to what was previously believed, that by exploiting correlation in stochastic computing (SC) designs, more accurate SC circuits with low area cost can be realized. However, if these basic SC circuits or blocks are cascaded in series to form a large complex system, correlation between stochastic numbers (SNs) from one block to the next would be lost; thus, inaccuracies are introduced. In this study, we propose correlating circuits to be used in building complex correlated SC systems. One of the circuits is the correlator that restores lost correlations between two SNs due to previous processing. …
Chaotic Phase-Coded Waveforms With Space-Time Complementary Coding For Mimo Radar Applications, Sheng Hong, Fuhui Zhou, Yantao Dong, Zhixin Zhao, Yuhao Wang, Maosong Yan
Chaotic Phase-Coded Waveforms With Space-Time Complementary Coding For Mimo Radar Applications, Sheng Hong, Fuhui Zhou, Yantao Dong, Zhixin Zhao, Yuhao Wang, Maosong Yan
Electrical and Computer Engineering Faculty Publications
A framework for designing orthogonal chaotic phase-coded waveforms with space-time complementary coding (STCC) is proposed for multiple-input multiple-output (MIMO) radar applications. The phase-coded waveform set to be transmitted is generated with an arbitrary family size and an arbitrary code length by using chaotic sequences. Due to the properties of chaos, this chaotic waveform set has many advantages in performance, such as anti-interference and low probability of intercept. However, it cannot be directly exploited due to the high range sidelobes, mutual interferences, and Doppler intolerance. In order to widely implement it in practice, we optimize the chaotic phase-coded waveform set from …
On The Independence Of Statistical Randomness Tests Included In The Nist Test Suite, Fati̇h Sulak, Muhi̇ddi̇n Uğuz, Onur Koçak, Ali̇ Doğanaksoy
On The Independence Of Statistical Randomness Tests Included In The Nist Test Suite, Fati̇h Sulak, Muhi̇ddi̇n Uğuz, Onur Koçak, Ali̇ Doğanaksoy
Turkish Journal of Electrical Engineering and Computer Sciences
Random numbers and random sequences are used to produce vital parts of cryptographic algorithms such as encryption keys and therefore the generation and evaluation of random sequences in terms of randomness are vital. Test suites consisting of a number of statistical randomness tests are used to detect the nonrandom characteristics of the sequences. Construction of a test suite is not an easy task. On one hand, the coverage of a suite should be wide; that is, it should compare the sequence under consideration from many different points of view with true random sequences. On the other hand, an overpopulated suite …
Mutual Correlation Of Nist Statistical Randomness Tests And Comparison Of Their Sensitivities On Transformed Sequences, Ali̇ Doğanaksoy, Fati̇h Sulak, Muhi̇ddi̇n Uğuz, Okan Şeker, Zi̇ya Akcengi̇z
Mutual Correlation Of Nist Statistical Randomness Tests And Comparison Of Their Sensitivities On Transformed Sequences, Ali̇ Doğanaksoy, Fati̇h Sulak, Muhi̇ddi̇n Uğuz, Okan Şeker, Zi̇ya Akcengi̇z
Turkish Journal of Electrical Engineering and Computer Sciences
Random sequences are widely used in many cryptographic applications and hence their generation is one of the main research areas in cryptography. Statistical randomness tests are introduced to detect the weaknesses or nonrandom characteristics that a sequence under consideration may have. In the literature, there exist various statistical randomness tests and test suites, defined as a collection of tests. An efficient test suite should consist of a number of uncorrelated statistical tests each of which measures randomness from another point of view. `Being uncorrelated' is not a well-defined or well-understood concept in the literature. In this work, we apply Pearson's …
Recursive Non-Local Means Filter For Video Denoising With Poisson-Gaussian Noise, Redha A. Almahdi, Russell C. Hardie
Recursive Non-Local Means Filter For Video Denoising With Poisson-Gaussian Noise, Redha A. Almahdi, Russell C. Hardie
Electrical and Computer Engineering Faculty Publications
In this paper, we describe a new recursive Non-Local means (RNLM) algorithm for video denoising that has been developed by the current authors. Furthermore, we extend this work by incorporating a Poisson-Gaussian noise model. Our new RNLM method provides a computationally efficient means for video denoising, and yields improved performance compared with the single frame NLM and BM3D benchmarks methods. Non-Local means (NLM) based methods of denoising have been applied successfully in various image and video sequence denoising applications. However, direct extension of this method from 2D to 3D for video processing can be computationally demanding. The RNLM approach takes …
A Hybrid Approach To Aerial Video Image Registration, Karol T. Salva
A Hybrid Approach To Aerial Video Image Registration, Karol T. Salva
Browse all Theses and Dissertations
Many video processing applications, such as motion detection and tracking, rely on accurate and robust alignment between consecutive video frames. Traditional approaches to video image registration, such as pyramidal Kanade-Lucas-Tomasi (KLT) feature detection and tracking are fast and subpixel accurate, but are not robust to large inter-frame displacements due to rotation, scale, or translation. This thesis presents an alternative hybrid approach using normalized gradient correlation (NGC) in the frequency domain and normalized cross-correlation (NCC) in the spatial domain that is fast, accurate, and robust to large displacements. A scale space search is incorporated into NGC to enable more consistent recovery …
A User-Oriented Network Forensic Analyser: The Design Of A High-Level Protocol Analyser, D Joy, F Li, N L. Clarke, S M. Furnell
A User-Oriented Network Forensic Analyser: The Design Of A High-Level Protocol Analyser, D Joy, F Li, N L. Clarke, S M. Furnell
Australian Digital Forensics Conference
Network forensics is becoming an increasingly important tool in the investigation of cyber and computer-assisted crimes. Unfortunately, whilst much effort has been undertaken in developing computer forensic file system analysers (e.g. Encase and FTK), such focus has not been given to Network Forensic Analysis Tools (NFATs). The single biggest barrier to effective NFATs is the handling of large volumes of low-level traffic and being able to exact and interpret forensic artefacts and their context – for example, being able extract and render application-level objects (such as emails, web pages and documents) from the low-level TCP/IP traffic but also understand how …
Correlating Orphaned Windows Registry Data Structures, Damir Kahvedžić, Tahar Kechadi
Correlating Orphaned Windows Registry Data Structures, Damir Kahvedžić, Tahar Kechadi
Journal of Digital Forensics, Security and Law
Recently, it has been shown that deleted entries of the Microsoft Windows registry (keys) may still reside in the system files once the entries have been deleted from the active database. Investigating the complete keys in context may be extremely important from both a Forensic Investigation point of view and a legal point of view where a lack of context can bring doubt to an argument. In this paper we formalise the registry behaviour and show how a retrieved value may not maintain a relation to the part of the registry it belonged to and hence lose that context. We …