Adaptive transient solution of nonuniform multiconductor transmission lines using wavelets

Abstract—This paper presents a highly adaptive algorithm for the transient simulation of nonuniform interconnects loaded with arbitrary nonlinear and dynamic terminations. The discretization of the governing equations is obtained through a weak formula-tion using biorthogonal wavelet bases as trial and test functions. It is shown how the multiresolution properties of wavelets lead to very sparse approximations of the voltages and currents in typical transient analyzes. A simple yet effective time–space adaptive al-gorithm capable of selecting the minimal number of unknowns at each time iteration is described. Numerical results show the high degree of adaptivity of the proposed scheme. Index Terms—Electromagnetic (EM) transient analysis, multi-conductor transmission lines (TLs), wavelet transforms. I

On adaptive inference and confidence bands

The problem of existence of adaptive confidence bands for an unknown density $f$ that belongs to a nested scale of H\"{o}lder classes over $\mathbb{R}$ or $[0,1]$ is considered. Whereas honest adaptive inference in this problem is impossible already for a pair of H\"{o}lder balls $\Sigma(r),\Sigma(s),r\ne s$, of fixed radius, a nonparametric distinguishability condition is introduced under which adaptive confidence bands can be shown to exist. It is further shown that this condition is necessary and sufficient for the existence of honest asymptotic confidence bands, and that it is strictly weaker than similar analytic conditions recently employed in Gin\'{e} and Nickl [Ann. Statist. 38 (2010) 1122--1170]. The exceptional sets for which honest inference is not possible have vanishingly small probability under natural priors on H\"{o}lder balls $\Sigma(s)$. If no upper bound for the radius of the H\"{o}lder balls is known, a price for adaptation has to be paid, and near-optimal adaptation is possible for standard procedures. The implications of these findings for a general theory of adaptive inference are discussed.Comment: Published in at http://dx.doi.org/10.1214/11-AOS903 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org

A new class of wavelet networks for nonlinear system identification

A new class of wavelet networks (WNs) is proposed for nonlinear system identification. In the new networks, the model structure for a high-dimensional system is chosen to be a superimposition of a number of functions with fewer variables. By expanding each function using truncated wavelet decompositions, the multivariate nonlinear networks can be converted into linear-in-the-parameter regressions, which can be solved using least-squares type methods. An efficient model term selection approach based upon a forward orthogonal least squares (OLS) algorithm and the error reduction ratio (ERR) is applied to solve the linear-in-the-parameters problem in the present study. The main advantage of the new WN is that it exploits the attractive features of multiscale wavelet decompositions and the capability of traditional neural networks. By adopting the analysis of variance (ANOVA) expansion, WNs can now handle nonlinear identification problems in high dimensions

Spatially-adaptive sensing in nonparametric regression

While adaptive sensing has provided improved rates of convergence in sparse regression and classification, results in nonparametric regression have so far been restricted to quite specific classes of functions. In this paper, we describe an adaptive-sensing algorithm which is applicable to general nonparametric-regression problems. The algorithm is spatially adaptive, and achieves improved rates of convergence over spatially inhomogeneous functions. Over standard function classes, it likewise retains the spatial adaptivity properties of a uniform design

Development of retinal blood vessel segmentation methodology using wavelet transforms for assessment of diabetic retinopathy

Automated image processing has the potential to assist in the early detection of diabetes, by detecting changes in blood vessel diameter and patterns in the retina. This paper describes the development of segmentation methodology in the processing of retinal blood vessel images obtained using non-mydriatic colour photography. The methods used include wavelet analysis, supervised classifier probabilities and adaptive threshold procedures, as well as morphology-based techniques. We show highly accurate identification of blood vessels for the purpose of studying changes in the vessel network that can be utilized for detecting blood vessel diameter changes associated with the pathophysiology of diabetes. In conjunction with suitable feature extraction and automated classification methods, our segmentation method could form the basis of a quick and accurate test for diabetic retinopathy, which would have huge benefits in terms of improved access to screening people for risk or presence of diabetes

Adaptive Wavelet Collocation Method for Simulation of Time Dependent Maxwell's Equations

This paper investigates an adaptive wavelet collocation time domain method for the numerical solution of Maxwell's equations. In this method a computational grid is dynamically adapted at each time step by using the wavelet decomposition of the field at that time instant. In the regions where the fields are highly localized, the method assigns more grid points; and in the regions where the fields are sparse, there will be less grid points. On the adapted grid, update schemes with high spatial order and explicit time stepping are formulated. The method has high compression rate, which substantially reduces the computational cost allowing efficient use of computational resources. This adaptive wavelet collocation method is especially suitable for simulation of guided-wave optical devices

Compressive Imaging via Approximate Message Passing with Image Denoising

We consider compressive imaging problems, where images are reconstructed from a reduced number of linear measurements. Our objective is to improve over existing compressive imaging algorithms in terms of both reconstruction error and runtime. To pursue our objective, we propose compressive imaging algorithms that employ the approximate message passing (AMP) framework. AMP is an iterative signal reconstruction algorithm that performs scalar denoising at each iteration; in order for AMP to reconstruct the original input signal well, a good denoiser must be used. We apply two wavelet based image denoisers within AMP. The first denoiser is the "amplitude-scaleinvariant Bayes estimator" (ABE), and the second is an adaptive Wiener filter; we call our AMP based algorithms for compressive imaging AMP-ABE and AMP-Wiener. Numerical results show that both AMP-ABE and AMP-Wiener significantly improve over the state of the art in terms of runtime. In terms of reconstruction quality, AMP-Wiener offers lower mean square error (MSE) than existing compressive imaging algorithms. In contrast, AMP-ABE has higher MSE, because ABE does not denoise as well as the adaptive Wiener filter.Comment: 15 pages; 2 tables; 7 figures; to appear in IEEE Trans. Signal Proces