The sequencing classification technique has diverse applications, including genomic analysis, information retrieval, health informatics, finance, and abnormal d
31 July 2019 in Journal of Software: Evolution and Process
The removal of noise from images holds great significance as clear and denoised images are vital for various applications. Recent research efforts have been concentrated on the dehazing of single images. While conventional methods and deep learning approaches have been employed for daytime images, learning-based techniques have shown impressive dehazing results, albeit often with increased complexity. This has led to the persistence of prior-based methods, despite their slightly lower performance. To address this issue, we propose a novel deep learning-based dehazing method utilizing a self-supervised convolutional neural network (CNN). This approach incorporates both the input hazy image and the dark channel prior. By leveraging an encoder, the combined information of the dark channel prior and haze image is encoded into a condensed latent representation. Subsequently, a decoder is employed to reconstruct the clean image using these latent features. Our experimental results demonstrate that our proposed algorithm significantly enhances image quality, as indicated by improved peak signal-to-noise ratio (PSNR) and structural similarity index (SSIM) values. We perform both quantitative and qualitative comparisons with recently published techniques, showcasing the efficacy of our approach.
8 September 2022 in Computational Intelligence and Neuroscience
Lightweight Pattern Matching Method for DNA Sequencing in Internet of Medical Things: An area of medical science, that is, gaining prominence, is DNA sequencing. Genetic mutations responsible for the disease have been detected using DNA sequencing. The research is focusing on pattern identification methodologies for dealing with DNA-sequencing problems relating to various applications. A few examples of such problems are alignment and assembly of short reads from next generation sequencing (NGS), comparing DNA sequences, and determining the frequency of a pattern in a sequence. The approximate matching of DNA sequences is also well suited for many applications equivalent to the exact matching of the sequence since the DNA sequences are often subject to mutation. Consequently, recognizing pattern similarity becomes necessary. Furthermore, it can also be used in virtually every application that calls for pattern matching, for example, spell-checking, spam filtering, and search engines. According to the traditional approach, finding a similar pattern in the case where the sequence length is ls and the pattern length is lp occurs in O (lslp). This heavy processing is caused by comparing every character of the sequence repeatedly with the pattern. The research intended to reduce the time complexity of the pattern matching by introducing an approach named “optimized pattern similarity identification” (OPSI). This methodology constructs a table, entitled “shift beyond for avoiding redundant comparison” (SBARC), to bypass the characters in the texts that are already compared with the pattern. The table pertains to the information about the character distance to be skipped in the matching. OPSI discovers at most spots of similar patterns occur in the sequence (by ignoring è mismatches). The experiment resulted in the time complexity identified as O (ls. è). In comparison to the size of the pattern, the allowed number of mismatches will be much smaller. Aspects such as scalability, generalizability, and performance of the OPSI algorithm are discussed. In comparison with the hamming distance-based approximate pattern matching algorithm, the proposed algorithm is found to be 69% more efficient.