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

A class of adaptive directional image smoothing filters

Cataloged from PDF version of article.The gray level distribution around a pixel of an image usually tends to be more coherent in some directions compared to other directions. The idea of adaptive directional filtering is to estimate the direction of higher coherence around each pixel location and then to employ a window which approximates aline segment in that direction. Hence, the details of the image may be preserved while maintaining a satisfactory level of noise suppression performance. In this paper we describe a class of adaptive directional image smoothing filters based on generalized Gaussian distributions. We propose a measure of spread for the pixel values based on the maximum likelihood estimate of a scale parameter involved in the generalized Gaussian distribution. Several experimental results indicate a significant improvement compared to some standard filters. Copyright (C) 1996 Pattern Recognition Society

DeepWheat: Estimating Phenotypic Traits from Crop Images with Deep Learning

In this paper, we investigate estimating emergence and biomass traits from color images and elevation maps of wheat field plots. We employ a state-of-the-art deconvolutional network for segmentation and convolutional architectures, with residual and Inception-like layers, to estimate traits via high dimensional nonlinear regression. Evaluation was performed on two different species of wheat, grown in field plots for an experimental plant breeding study. Our framework achieves satisfactory performance with mean and standard deviation of absolute difference of 1.05 and 1.40 counts for emergence and 1.45 and 2.05 for biomass estimation. Our results for counting wheat plants from field images are better than the accuracy reported for the similar, but arguably less difficult, task of counting leaves from indoor images of rosette plants. Our results for biomass estimation, even with a very small dataset, improve upon all previously proposed approaches in the literature.Comment: WACV 2018 (Code repository: https://github.com/p2irc/deepwheat_WACV-2018

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

Wave-equation based seismic multiple attenuation

Reflection seismology is widely used to map the subsurface geological structure of the Earth. Seismic multiples can contaminate seismic data and are therefore due to be removed. For seismic multiple attenuation, wave-equation based methods are proved to be effective in most cases, which involve two aspects: multiple prediction and multiple subtraction. Targets of both aspects are to develop and apply a fully datadriven algorithm for multiple prediction, and a robust technique for multiple subtraction. Based on many schemes developed by others regarding to the targets, this thesis addresses and tackles the problems of wave-equation based seismic multiple attenuation by several approaches. First, the issue of multiple attenuation in land seismic data is discussed. Multiple Prediction through Inversion (MPTI) method is expanded to be applied in the poststack domain and in the CMP domain to handle the land data with low S/N ratio, irregular geometry and missing traces. A running smooth filter and an adaptive threshold K-NN (nearest neighbours) filter are proposed to help to employ MPTI on land data in the shot domain. Secondly, the result of multiple attenuation depends much upon the effectiveness of the adaptive subtraction. The expanded multi-channel matching (EMCM) filter is proved to be effective. In this thesis, several strategies are discussed to improve the result of EMCM. Among them, to model and subtract the multiples according to their orders is proved to be practical in enhancing the effect of EMCM, and a masking filter is adopted to preserve the energy of primaries. Moreover, an iterative application of EMCM is proposed to give the optimized result. Thirdly, with the limitation of current 3D seismic acquisition geometries, the sampling in the crossline direction is sparse. This seriously affects the application of the 3D multiple attenuation. To tackle the problem, a new approach which applies a trajectory stacking Radon transform along with the energy spectrum is proposed in this thesis. It can replace the time-consuming time-domain sparse inversion with similar effectiveness and much higher efficiency. Parallel computing is discussed in the thesis so as to enhance the efficiency of the strategies. The Message-Passing Interface (MPI) environment is implemented in most of the algorithms mentioned above and greatly improves the efficiency