Fast Bilateral Filtering for Denoising Large 3D Images

Enhanced Wavelet-Based Medical Image Denoising with Bayesian-Optimized Bilateral Filtering

Medical image denoising is essential for improving the clarity and accuracy of diagnostic images. In this paper, we present an enhanced wavelet-based method for medical image denoising, aiming to effectively remove noise while preserving critical image details. After applying wavelet denoising, a bilateral filter is utilized as a post-processing step to further enhance image quality by reducing noise while maintaining edge sharpness. The bilateral filter's effectiveness heavily depends on its parameters, which must be carefully optimized. To achieve this, we employ Bayesian optimization, a powerful technique that efficiently identifies the optimal filter parameters, ensuring the best balance between noise reduction and detail preservation. The experimental results demonstrate a significant improvement in image denoising performance, validating the effectiveness of our approach.

Local Adaptive Image Filtering Based on Recursive Dilation Segmentation

This paper introduces a simple but effective image filtering method, namely, local adaptive image filtering (LAIF), based on an image segmentation method, i.e., recursive dilation segmentation (RDS). The algorithm is motivated by the observation that for the pixel to be smoothed, only the similar pixels nearby are utilized to obtain the filtering result. Relying on this observation, similar pixels are partitioned by RDS before applying a locally adaptive filter to smooth the image. More specifically, by directly taking the spatial information between adjacent pixels into consideration in a recursive dilation way, RDS is firstly proposed to partition the guided image into several regions, so that the pixels belonging to the same segmentation region share a similar property. Then, guided by the iterative segmented results, the input image can be easily filtered via a local adaptive filtering technique, which smooths each pixel by selectively averaging its local similar pixels. It is worth mentioning that RDS makes full use of multiple integrated information including pixel intensity, hue information, and especially spatial adjacent information, leading to more robust filtering results. In addition, the application of LAIF in the remote sensing field has achieved outstanding results, specifically in areas such as image dehazing, denoising, enhancement, and edge preservation, among others. Experimental results show that the proposed LAIF can be successfully applied to various filtering-based tasks with favorable performance against state-of-the-art methods.

Selective Guidance Normal Filter for Geometric Texture Removal

There is typically a trade-off between removing the detailed appearance (i.e., geometric textures) and preserving the intrinsic properties (i.e., geometric structures) of 3D surfaces. The conventional use of mesh vertex/facet-centered patches in many filters leads to side-effects including remnant textures, improperly filtered structures, and distorted shapes. We propose a selective guidance normal filter (SGNF) which adapts the Relative Total Variation (RTV) to a maximal/minimal scheme (mmRTV). The mmRTV measures the geometric flatness of surface patches, which helps in finding adaptive patches whose boundaries are aligned with the facet being processed. The adaptive patches provide selective guidance normals, which are subsequently used for normal filtering. The filtering smooths out the geometric textures by using guidance normals estimated from patches with maximal RTV (the least flatness), and preserves the geometric structures by using normals estimated from patches with minimal RTV (the most flatness). This simple yet effective modification of the RTV makes our SGNF specialized rather than trade off between texture removal and structure preservation, which is distinct from existing mesh filters. Experiments show that our approach is visually and numerically comparable to the state-of-the-art mesh filters, in most cases. In addition, the mmRTV is generally applicable to bas-relief modeling and image texture removal.

Deep Learning Driven Noise Reduction for Reduced Flux Computed Tomography

Deep neural networks have received considerable attention in clinical imaging, particularly with respect to the reduction of radiation risk. Lowering the radiation dose by reducing the photon flux inevitably results in the degradation of the scanned image quality. Thus, researchers have sought to exploit deep convolutional neural networks (DCNNs) to map low-quality, low-dose images to higher-dose, higher-quality images, thereby minimizing the associated radiation hazard. Conversely, computed tomography (CT) measurements of geomaterials are not limited by the radiation dose. In contrast to the human body, however, geomaterials may be comprised of high-density constituents causing increased attenuation of the X-rays. Consequently, higher-dose images are required to obtain an acceptable scan quality. The problem of prolonged acquisition times is particularly severe for micro-CT based scanning technologies. Depending on the sample size and exposure time settings, a single scan may require several hours to complete. This is of particular concern if phenomena with an exponential temperature dependency are to be elucidated. A process may happen too fast to be adequately captured by CT scanning. To address the aforementioned issues, we apply DCNNs to improve the quality of rock CT images and reduce exposure times by more than 60%, simultaneously. We highlight current results based on micro-CT derived datasets and apply transfer learning to improve DCNN results without increasing training time. The approach is applicable to any computed tomography technology. Furthermore, we contrast the performance of the DCNN trained by minimizing different loss functions such as mean squared error and structural similarity index.

Machine learning-enabled non-destructive paper chromogenic array detection of multiplexed viable pathogens on food

Fast and simultaneous identification of multiple viable pathogens on food is critical to public health. Here we report a pathogen identification system using a paper chromogenic array (PCA) enabled by machine learning. The PCA consists of a paper substrate impregnated with 23 chromogenic dyes and dye combinations, which undergo colour changes on exposure to volatile organic compounds emitted by pathogens of interest. These colour changes are digitized and used to train a multi-layer neural network (NN), endowing it with high-accuracy (91-95%) strain-specific pathogen identification and quantification capabilities. The trained PCA-NN system can distinguish between viable Escherichia coli, E. coli O157:H7 and other viable pathogens, and can simultaneously identify both E. coli O157:H7 and Listeria monocytogenes on fresh-cut romaine lettuce, which represents a realistic and complex environment. This approach has the potential to advance non-destructive pathogen detection and identification on food, without enrichment, culturing, incubation or other sample preparation steps.

Simplified Welch Algorithm for Spectrum Monitoring

Power Spectral Density (PSD) is an essential representation of the signal spectrum that depicts the power measurement content versus frequency. PSD is typically used to characterize broadband random signals and has a variety of usages in many fields like physics, engineering, biomedical, etc. This paper proposes a simple and practical method to estimate the PSD based on the Welch algorithm for spectrum monitoring. The proposed method can be easily implemented in most of software-based systems or low-level Field-Programmable Gate Arrays (FPGAs) and yields a smooth overview of the spectrum. The original Welch method utilizes the average of the amplitude squared of the previous Fast Fourier Transform (FFT) samples for better estimation of frequency components and noise reduction. Replacing the simple moving average with a weighted moving average can significantly reduce the complexity of the Welch’s method. In this way, the amount of required Random Access Memory (RAM) is reduced from K (where K is the number of FFT packets in averaging) to one. This new method allows users to adjust the dependency of the PSD on the previous observed FFTs and its smoothness by setting only one feedback parameter without any hardware change. The obtained results show that the algorithm gives a clear spectrum, even in the noisy situation because of the significant Signal to Noise Ratio (SNR) enhancement. The trade-off between spectrum accuracy and time convergence of the modified algorithm is also fully analysed. In addition, a simple solution based on Xilinx Intellectual Property (IP), which converts the proposed method to a practical spectrum analyzer device, is presented. This modified algorithm is validated by comparing it with two standard and reliable spectrum analyzers, Rohde & Schwarz (R&S) and Tektronix RSA600. The modified design can track any signal type as the other spectrum analyzers, and it has better performance in situations where the power of the desired signal is weak or where the signal is mixed with the background noise. It can display the spectrum when the input signal power is 5 dB lower than the visible threshold level of R&S and Tektronix. In both narrowband and wideband scenarios, the new implemented design can still display frequency components 5 dB higher than the noise, while the output spectrum of other analyzers is completely covered by noise.

A Real-Time Physical Progress Measurement Method for Schedule Performance Control Using Vision, an AR Marker and Machine Learning in a Ship Block Assembly Process

Progress control is a key technology for successfully carrying out a project by predicting possible problems, particularly production delays, and establishing measures to avoid them (decision-making). However, shipyard progress management is still dependent on the empirical judgment of the manager, and this has led to delays in delivery, which raises ship production costs. Therefore, this paper proposes a methodology for shipyard ship block assembly plants that enables objective process progress measurement based on real-time work performance data, rather than the empirical judgment of a site manager. In particular, an IoT-based physical progress measurement method that can automatically measure work performance without human intervention is presented for the mounting and welding activities of ship block assembly work. Both an augmented reality (AR) marker-based image analysis system and a welding machine time-series data-based machine learning model are presented for measuring the performances of the mounting and welding activities. In addition, the physical progress measurement method proposed in this study was applied to the ship block assembly plant of shipyard H to verify its validity.

Gaussian Lifting for Fast Bilateral and Nonlocal Means Filtering

Recently, many fast implementations of the bilateral and the nonlocal filters were proposed based on lattice and vector quantization, e.g. clustering, in higher dimensions. However, these approaches can still be inefficient owing to the complexities in the resampling process or in filtering the high-dimensional resampled signal. In contrast, simply scalar resampling the high-dimensional signal after decorrelation presents the opportunity to filter signals using multi-rate signal processing techniques. Cis work proposes the Gaussian lifting framework for efficient and accurate bilateral and nonlocal means filtering, appealing to the similarities between separable wavelet transforms and Gaussian pyramids. Accurately implementing the filter is important not only for image processing applications, but also for a number of recently proposed bilateralregularized inverse problems, where the accuracy of the solutions depends ultimately on an accurate filter implementation. We show that our Gaussian lifting approach filters images more accurately and efficiently across many filter scales. Adaptive lifting schemes for bilateral and nonlocal means filtering are also explored.

Fast Adaptive Bilateral Filtering

In the classical bilateral filter, a fixed Gaussian range kernel is used along with a spatial kernel for edge-preserving smoothing. We consider a generalization of this filter, the so-called adaptive bilateral filter, where the center and width of the Gaussian range kernel are allowed to change from pixel to pixel. Though this variant was originally proposed for sharpening and noise removal, it can also be used for other applications, such as artifact removal and texture filtering. Similar to the bilateral filter, the brute-force implementation of its adaptive counterpart requires intense computations. While several fast algorithms have been proposed in the literature for bilateral filtering, most of them work only with a fixed range kernel. In this paper, we propose a fast algorithm for adaptive bilateral filtering, whose complexity does not scale with the spatial filter width. This is based on the observation that the concerned filtering can be performed purely in range space using an appropriately defined local histogram. We show that by replacing the histogram with a polynomial and the finite range-space sum with an integral, we can approximate the filter using analytic functions. In particular, an efficient algorithm is derived using the following innovations: the polynomial is fitted by matching its moments to those of the target histogram (this is done using fast convolutions), and the analytic functions are recursively computed using integration-by-parts. Our algorithm can accelerate the brute-force implementation by at least , without perceptible distortions in the visual quality. We demonstrate the effectiveness of our algorithm for sharpening, JPEG deblocking, and texture filtering.

Improved Recursive Geodesic Distance Computation for Edge Preserving Filter

All known recursive filters based on the geodesic distance affinity are realized by two 1D recursions applied in two orthogonal directions of the image plane. The 2D extension of the filter is not valid and has theoretically drawbacks, which lead to known artifacts. In this paper, a maximum influence propagation method is proposed to approximate the 2D extension for the geodesic distance-based recursive filter. The method allows to partially overcome the drawbacks of the 1D recursion approach. We show that our improved recursion better approximates the true geodesic distance filter, and the application of this improved filter for image denoising outperforms the existing recursive implementation of the geodesic distance. As an application, we consider a geodesic distance-based filter for image denoising. Experimental evaluation of our denoising method demonstrates comparable and for several test images better results, than state-of-the-art approaches, while our algorithm is considerably faster with computational complexity O(8P).