On generalized adaptive neural filter

Linear filters have historically been used in the past as the most useful tools for suppressing noise in signal processing. It has been shown that the optimal filter which minimizes the mean square error (MSE) between the filter output and the desired output is a linear filter provided that the noise is additive white Gaussian noise (AWGN). However, in most signal processing applications, the noise in the channel through which a signal is transmitted is not AWGN; it is not stationary, and it may have unknown characteristics. To overcome the shortcomings of linear filters, nonlinear filters ranging from the median filters to stack filters have been developed. They have been successfully used in a number of applications, such as enhancing the signal-to-noise ratio of the telecommunication receivers, modeling the human vocal tract to synthesize speech in speech processing, and separating out the maternal and fetal electrocardiogram signals to diagnose prenatal ailments. In particular, stack filters have been shown to provide robust noise suppression, and are easily implementable in hardware, but configuring an optimal stack filter remains a challenge. This dissertation takes on this challenge by extending stack filters to a new class of nonlinear adaptive filters called generalized adaptive neural filters (GANFs). The objective of this work is to investigate their performance in terms of the mean absolute error criterion, to evaluate and predict the generalization of various discriminant functions employed for GANFs, and to address issues regarding their applications and implementation. It is shown that GANFs not only extend the class of stack filters, but also have better performance in terms of suppressing non-additive white Gaussian noise. Several results are drawn from the theoretical and experimental work: stack filters can be adaptively configured by neural networks; GANFs encompass a large class of nonlinear sliding-window filters which include stack filters; the mean absolute error (MAE) of the optimal GANF is upper-bounded by that of the optimal stack filter; a suitable class of discriminant functions can be determined before a training scheme is executed; VC dimension (VCdim) theory can be applied to determine the number of training samples; the algorithm presented in configuring GANFs is effective and robust

Rank Conditioned Rank Selection Filters for Signal Restoration

A class of nonlinear filters called rank conditioned rank selection (RCRS) filters is developed and analyzed in this paper. The RCRS filters are developed within the general framework of rank selection(RS) filters, which are filters constrained to output an order statistic from the observation set. Many previously proposed rank order based filters can be formulated as RS filters. The only difference between such filters is in the information used in deciding which order statistic to output. The information used by RCRS filters is the ranks of selected input samples, hence the name rank conditioned rank selection filters. The number of input sample ranks used is referred to as the order of the RCRS filter. The order can range from zero to the number of samples in the observation window, giving the filters valuable flexibility. Low-order filters can give good performance and are relatively simple to optimize and implement. If improved performance is demanded, the order can be increased but at the expense of filter simplicity. In this paper, many statistical and deterministic properties of the RCRS filters are presented. A procedure for optimizing over the class of RCRS filters is also presented. Finally, extensive computer simulation results that illustrate the performance of RCRS filters in comparison with other techniques in image restoration applications are presented

Simplification of the generalized adaptive neural filter and comparative studies with other nonlinear filters

Recently, a new class of adaptive filters called Generalized Adaptive Neural Filters (GANFs) has emerged. They share many characteristics in common with stack filters, include all stack filters as a subset. The GANFs allow a very efficient hardware implementation once they are trained. However, there are some problems associated with GANFs. Three of these arc slow training speeds and the difficulty in choosing a filter structure and neural operator. This thesis begins with a tutorial on filtering and traces the GANF development up through its origin -- the stack filter. After the GANF is covered in reasonable depth, its use as an image processing filter is examined. Its usefulness is determined based on simulation comparisons with other common filters. Also, some problems of GANFs are looked into. A brief study which investigates different types of neural networks and their applicability to GANFs is presented. Finally, some ideas on increasing the speed of the GANF are discussed. While these improvements do not completely solve the GANF\u27s problems, they make a measurable difference and bring the filter closer to reality

Morphological filter mean-absolute-error representation theorems and their application to optimal morphological filter design

The present thesis derives error representations and develops design methodologies for optimal mean-absolute-error (MAE) morphological-based filters. Four related morphological-based filter-types are treated. Three are translation-invariant, monotonically increasing operators, and our analysis is based on the Matheron (1975) representation. In this class we analyze conventional binary, conventional gray-scale, and computational morphological filters. The fourth filter class examined is that of binary translation invariant operators. Our analysis is based on the Banon and Barrera (1991) representation and hit-or-miss operator of Serra (1982). A starting point will be the optimal morphological filter paradigm of Dougherty (1992a,b) whose analysis de scribes the optimal filter by a system of nonlinear inequalities with no known method of solution, and thus reduces filter design to minimal search strategies. Although the search analysis is definitive, practical filter design remained elu sive because the search space can be prohibitively large if it not mitigated in some way. The present thesis extends from Dougherty\u27s starting point in several ways. Central to the thesis is the MAE analysis for the various filter settings, where in each case, a theorem is derived that expresses overall filter MAE as a sum of MAE values of individual structuring-element filters and MAE of combinations of unions (maxima) of those elements. Recursive forms of the theorems can be employed in a computer algorithm to rapidly evaluate combinations of structuring elements and search for an optimal filter basis. Although the MAE theorems provide a rapid means for examining the filter design space, the combinatoric nature of this space is, in general, too large for a exhaustive search. Another key contribution of this thesis concerns mitigation of the computational burden via design constraints. The resulting constrained filter will be suboptimal, but, if the constraints are imposed in a suitable man ner, there is little loss of filter performance in return for design tractability. Three constraint approaches developed here are (1) limiting the number of terms in the filter expansion, (2) constraining the observation window, and (3) employing structuring element libraries from which to search for an optimal basis. Another contribution of this thesis concerns the application of optimal morphological filters to image restoration. Statistical and deterministic image and degradation models for binary and low-level gray images were developed here that relate to actual problems in the optical character recognition and electronic printing fields. In the filter design process, these models are employed to generate realizations, from which we extract single-erosion and single-hit-or-miss MAE statistics. These realization-based statistics are utilized in the search for the optimal combination of structuring elements

Robust detail-preserving signal extraction

We discuss robust filtering procedures for signal extraction from noisy time series. Particular attention is paid to the preservation of relevant signal details like abrupt shifts. moving averages and running medians are widely used but have shortcomings when large spikes (outliers) or trends occur. Modifications like modified trimmed means and linear median hybrid filters combine advantages of both approaches, but they do not completely overcome the difficulties. Better solutions can be based on robust regression techniques, which even work in real time because of increased computational power and faster algorithms. Reviewing previous work we present filters for robust signal extraction and discuss their merits for preserving trends, abrupt shifts and local extremes as well as for the removal of outliers. --

Image convolution: a linear programming approach for filters design

AbstractImage analysis is a branch of signal analysis that focuses on the extraction of meaningful information from images through digital image processing techniques. Convolution is a technique used to enhance specific characteristics of an image, while deconvolution is its inverse process. In this work, we focus on the deconvolution process, defining a new approach to retrieve filters applied in the convolution phase. Given an image I and a filtered image $$I' = f(I)$$ I ′ = f ( I ) , we propose three mathematical formulations that, starting from I and $$I'$$ I ′ , are able to identify the filter $$f'$$ f ′ that minimizes the mean absolute error between $$I'$$ I ′ and $$f'(I)$$ f ′ ( I ) . Several tests were performed to investigate the applicability of our approaches in different scenarios. The results highlight that the proposed algorithms are able to identify the filter used in the convolution phase in several cases. Alternatively, the developed approaches can be used to verify whether a specific input image I can be transformed into a sample image $$I'$$ I ′ through a convolution filter while returning the desired filter as output

Design and implementation of generalized adaptive neural filters

Generalized Adaptive Neural Filters (GANF) are a class of adaptive non-linear filters. This thesis presents a hardware implementation of GANF. Two designs are considered: the single neuron implementation and the multi-neuron implementation. The GANF design includes the window generator, threshold decomposer, training and filtering unit. The designs are verified through a logic design/simulation tool, Logic Works

Real-time topology optimization via learnable mappings

In traditional topology optimization, the computing time required to iteratively update the material distribution within a design domain strongly depends on the complexity or size of the problem, limiting its application in real engineering contexts. This work proposes a multi-stage machine learning strategy that aims to predict an optimal topology and the related stress fields of interest, either in 2D or 3D, without resorting to any iterative analysis and design process. The overall topology optimization is treated as regression task in a low-dimensional latent space, that encodes the variability of the target designs. First, a fully-connected model is employed to surrogate the functional link between the parametric input space characterizing the design problem and the latent space representation of the corresponding optimal topology. The decoder branch of an autoencoder is then exploited to reconstruct the desired optimal topology from its latent representation. The deep learning models are trained on a dataset generated through a standard method of topology optimization implementing the solid isotropic material with penalization, for varying boundary and loading conditions. The underlying hypothesis behind the proposed strategy is that optimal topologies share enough common patterns to be compressed into small latent space representations without significant information loss. Results relevant to a 2D Messerschmitt-B\"olkow-Blohm beam and a 3D bridge case demonstrate the capabilities of the proposed framework to provide accurate optimal topology predictions in a fraction of a second