In this paper, we propose the local complexity estimation based filtering method in wavelet domain for MRI (magnetic resonance imaging) denoising. A threshold selection methodology is proposed in which the edge and detail preservation properties for each pixel are determined by the local complexity of the input image. In the proposed filtering method, the current wavelet kernel is compared with a threshold to identify the signal- or noise-dominant pixels in a scale providing a good visual quality avoiding blurred and over smoothened processed images. We present a comparative performance analysis with different wavelets to find the optimal wavelet for MRI denoising. Numerical experiments and visual results in simulated MR images degraded with Rician noise demonstrate that the proposed algorithm consistently outperforms other denoising methods by balancing the tradeoff between noise suppression and fine detail preservation. The proposed algorithm can enhance the contrast between regions allowing the delineation of the regions of interest between different textures or tissues in the processed images. The proposed approach produces a satisfactory result in the case of real MRI denoising by balancing the detail preservation and noise removal, by enhancing the contrast between the regions of the image. Additionally, the proposed algorithm is compared with other approaches in the case of Additive White Gaussian Noise (AWGN) using standard images to demonstrate that the proposed approach does not need to be adapted specifically to Rician or AWGN noise; it is an advantage of the proposed approach in comparison with other methods. Finally, the proposed scheme is simple, efficient and feasible for MRI denoising.
In the context of smart cities, there is a general benefit from monitoring close encounters among pedestrians. For instance, for the access control to office buildings, subway, commercial malls, etc., where a high amount of users may be present simultaneously, and keeping a strict record on each individual may be challenging. GPS tracking may not be available in many indoor cases; video surveillance may require expensive deployment (mainly due to the high-quality cameras and face recognition algorithms) and can be restrictive in case of low budget applications; RFID systems can be cumbersome and limited in the detection range. This information can later be used in many different scenarios. For instance, in case of earthquakes, fires, and accidents in general, the administration of the buildings can have a clear record of the people inside for victim searching activities. However, in the pandemic derived from the COVID-19 outbreak, a tracking that allows detecting of pedestrians in close range (a few meters) can be particularly useful to control the virus propagation. Hence, we propose a mobile clustering scheme where only a selected number of pedestrians (Cluster Heads) collect the information of the people around them (Cluster Members) in their trajectory inside the area of interest. Hence, a small number of transmissions are made to a control post, effectively limiting the collision probability and increasing the successful registration of people in close contact. Our proposal shows an increased success packet transmission probability and a reduced collision and idle slot probability, effectively improving the performance of the system compared to the case of direct transmissions from each node.
Peer-to-Peer (P2P) networks, as well as vehicular networks, have been extensively studied in the literature. However, the statistical characteristics of connection times among vehicles on the performance of a P2P network to allow Vehicle-to-Vehicle (V2V) communications have been largely overlooked. Specifically, the periods that vehicles remain connected to neighboring vehicles to directly communicate among them in different road characteristics (urban or highway) and road traffic conditions (low, medium, or high) are of main importance for the adequate performance of a P2P system. Indeed, these connection times establish the average number of peers and hence the bandwidth available in the communication system. These times have not been studied nor characterized before for the purpose of calculating the download probability and average download times, which are calculated in this work using a teletraffic analysis. We also present simulation results considering the CSMA/CA random access scheme established in the IEEE 802.11p communication protocol for V2V communications to investigate the effect of the random access protocol on the system performance.
To this date, the Fifth Generation (5G) of mobile communications has been deployed and has opened a great number of opportunities by increasing transmission rates (partialy through the use of MIMO systems), decreasing latency, providing the amount of bandwidth required for video services, Virual and Augmented Reality applications, and social media and providing a solid ground for the massive implementation of the Internet of Things (IoT), which we believe is still in its initial phases of development
Given the existence of techniques that disrupt conventional RF communication channels, the demand for innovative alternatives to electromagnetic-based communications is clear. Covert communication, which claims to conceals the communication channel, has been explored using bio-inspired sounds in aquatic environments, but its application in terrestrial areas is largely unexplored. This work develops a mathematical analysis of a wireless sensor network that operates stealthily in outdoor environments by using birdsong audio signals from local birds for covert communication. Stored bird sounds are modified to insert sensor data while altering the sound minimally, both in characteristics and random silence/song patterns. This paper introduces a technique that modifies a fourth-level coefficient detail with a wavelet transform, then applies an inverse transform to achieve imperceptible audio modifications. The mathematical analysis includes a statistical study of the On/Off periods of different birds’ songs and a Markov chain capturing the system’s main dynamics. We derive the system throughput to highlight the potential of using birdsong as a covert communication medium in terrestrial environments. Additionally, we compare the performance of the sound-based network to the RF-based network to identify the proposed system’s capabilities.