Denoising of Computed tomography (CT) images is a critical aspect of image processing that is expected to improve the performance of Computer‐aided diagnosis (CAD) systems. However, the use of complex imaging modalities such as CT imaging to ascertain pancreatic cancer is vulnerable to gaussian and poisson noises, making image denoising an imperative step for the accurate performance of CAD systems. This paper presents a Bilateral median based autoencoder network (BMAuto‐Net) constructed with intermediate batch normalization layers and dropout factors to eliminate gaussian noise from the CT images. The skip connections adjoining the network, prevent performance degradation that generally occurs in most autoencoder architectures. Based on the presented study, BMAuto‐Net is reckoned to outperform other traditional filters and autoencoders. The performance measurement of the proposed architecture is performed using the peak signal‐to‐noise ratio (PSNR), mean squared error (MSE), and structured similarity index (SSIM) metric values. The Cancer imaging archive (TCIA) dataset consisting of 19 000 CT images is used to validate the performance of the architecture with average PSNR values of 30.01, 30.53, and 30.52, MSE values of 98.23, 98.87, and 98.94, and SSIM of values of 0.67, 0.60, and 0.57 for noise factors (NFs) of 0.1, 0.3, and 0.5 respectively.

With the increasing advancements in the technology, our lives have become significantly more convenient. We now have automated many things. One example of such things is the automated number plate recognition system. There are many ways to perform the ANPR (Automatic Number Plate Recognition). Performing ANPR in wild still remains a big challenge. This review focuses on some techniques that have tried to overcome this challenge.

Abstract

This paper provides an introduction to a quantum search algorithm, known as Grover's Algorithm, for unsorted search purposes. The algorithm is implemented in a search space of 4 qubits using the Python-based Qiskit SDK by IBM. While providing detailed proof, the computational complexity of the algorithm is generalized to n qubits. The implementation results obtained from the IBM QASM Simulator and IBMQ Santiago quantum backend are analyzed and compared. Finally, the paper discusses the challenges faced in implementation and real-life applications of the algorithm hitherto. Overall, the implementation and analysis depict the advantages of this quantum search algorithm over its classical counterparts.

No abstract