360 resultados para Fast Algorithm


Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper proposes a denoising algorithm which performs non-local means bilateral filtering. As existing literature suggests, non-local means (NLM) is one of the widely used denoising techniques, but has a critical drawback of smoothing of edges. In order to improve this, we perform fast and efficient NLM using Approximate Nearest Neighbour Fields and improve the edge content in denoising by formulating a joint-bilateral filter. Using the proposed joint bilateral, we are able to denoise smooth regions using the NLM approach and efficient edge reconstruction is obtained from the bilateral filter. Furthermore, to avoid tedious parameter selection, we carry out a noise estimation before performing joint bilateral filtering. The proposed approach is observed to perform well on high noise images.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Three-dimensional (3-D) full-wave electromagnetic simulation using method of moments (MoM) under the framework of fast solver algorithms like fast multipole method (FMM) is often bottlenecked by the speed of convergence of the Krylov-subspace-based iterative process. This is primarily because the electric field integral equation (EFIE) matrix, even with cutting-edge preconditioning techniques, often exhibits bad spectral properties arising from frequency or geometry-based ill-conditioning, which render iterative solvers slow to converge or stagnate occasionally. In this communication, a novel technique to expedite the convergence of MoMmatrix solution at a specific frequency is proposed, by extracting and applying Eigen-vectors from a previously solved neighboring frequency in an augmented generalized minimum residual (AGMRES) iterative framework. This technique can be applied in unison with any preconditioner. Numerical results demonstrate up to 40% speed-up in convergence using the proposed Eigen-AGMRES method.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this work, spectrum sensing for cognitive radios is considered in the presence of multiple Primary Users (PU) using frequency-hopping communication over a set of frequency bands. The detection performance of the Fast Fourier Transform (FFT) Average Ratio (FAR) algorithm is obtained in closed-form, for a given FFT size and number of PUs. The effective throughput of the Secondary Users (SU) is formulated as an optimization problem with a constraint on the maximum allowable interference on the primary network. Given the hopping period of the PUs, the sensing duration that maximizes the SU throughput is derived. The results are validated using Monte Carlo simulations. Further, an implementation of the FAR algorithm on the Lyrtech (now, Nutaq) small form factor software defined radio development platform is presented, and the performance recorded through the hardware is observed to corroborate well with that obtained through simulations, allowing for implementation losses. (C) 2015 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Purpose: A prior image based temporally constrained reconstruction ( PITCR) algorithm was developed for obtaining accurate temperature maps having better volume coverage, and spatial, and temporal resolution than other algorithms for highly undersampled data in magnetic resonance (MR) thermometry. Methods: The proposed PITCR approach is an algorithm that gives weight to the prior image and performs accurate reconstruction in a dynamic imaging environment. The PITCR method is compared with the temporally constrained reconstruction (TCR) algorithm using pork muscle data. Results: The PITCR method provides superior performance compared to the TCR approach with highly undersampled data. The proposed approach is computationally expensive compared to the TCR approach, but this could be overcome by the advantage of reconstructing with fewer measurements. In the case of reconstruction of temperature maps from 16% of fully sampled data, the PITCR approach was 1.57x slower compared to the TCR approach, while the root mean square error using PITCR is 0.784 compared to 2.815 with the TCR scheme. Conclusions: The PITCR approach is able to perform more accurate reconstructions of temperature maps compared to the TCR approach with highly undersampled data in MR guided high intensity focused ultrasound. (C) 2015 American Association of Physicists in Medicine.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Climate change in response to a change in external forcing can be understood in terms of fast response to the imposed forcing and slow feedback associated with surface temperature change. Previous studies have investigated the characteristics of fast response and slow feedback for different forcing agents. Here we examine to what extent that fast response and slow feedback derived from time-mean results of climate model simulations can be used to infer total climate change. To achieve this goal, we develop a multivariate regression model of climate change, in which the change in a climate variable is represented by a linear combination of its sensitivity to CO2 forcing, solar forcing, and change in global mean surface temperature. We derive the parameters of the regression model using time-mean results from a set of HadCM3L climate model step-forcing simulations, and then use the regression model to emulate HadCM3L-simulated transient climate change. Our results show that the regression model emulates well HadCM3L-simulated temporal evolution and spatial distribution of climate change, including surface temperature, precipitation, runoff, soil moisture, cloudiness, and radiative fluxes under transient CO2 and/or solar forcing scenarios. Our findings suggest that temporal and spatial patterns of total change for the climate variables considered here can be represented well by the sum of fast response and slow feedback. Furthermore, by using a simple 1-D heat-diffusion climate model, we show that the temporal and spatial characteristics of climate change under transient forcing scenarios can be emulated well using information from step-forcing simulations alone.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Development of computationally efficient and accurate attitude rate estimation algorithm using low-cost commercially available star sensor arrays and processing unit for micro-satellite mission is presented. Our design reduces the computational load of least square (LS)-based rate estimation method while maintaining the same accuracy compared to other rate estimation approaches. Furthermore, rate estimation accuracy is improved by using recently developed fast and accurate second-order sliding mode observer (SOSMO) scheme. It also gives robust estimation in the presence of modeling uncertainties, unknown disturbances, and measurement noise. Simulation study shows that rate estimation accuracy achieved by our LS-based method is comparable with other methods for a typical commercially available star sensor array. The robustness analysis of SOSMO with respect to measurement noise is also presented in this paper. Simulation test bench for a practical scenario of satellite rate estimation uses moment-of-inertia variation and environmental disturbances affecting a typical micro-satellite at 500km circular orbit. Comparison studies of SOSMO with 1-SMO and pseudo-linear Kalman filter show that satisfactory estimation accuracy is achieved by SOSMO.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Ultra-fast two-step anodization method is developed for obtaining ordered nano-pores on aluminium (Al) foil. First anodization was carried out for 10 min, followed by 3 min of second anodization at high voltage (150 V) compared to previous reports of anodization times of 12 h (40-60 V). The pore dimensions on anodized alumina are 180 nm for pore diameter and 130 nm for inter-pore distance. It was evident that by increasing the anodization voltage to 150 V, the diameter of the pores formed was above 150 nm. The electrolyte and its temperature affect the shape and size of the pore formation. At lower anodization temperature, controlled pore formation was observed. The anodized samples were characterized using the field emission scanning electron microscope (FE-SEM) to determine the pore diameter and inter-pore distance. Using UV-Visible spectroscopy, the reflectance spectra of anodized samples were measured. The alumina (Al2O3) peaks were identified by x-ray diffraction (XRD) technique. The x-ray photo electron spectroscopy (XPS) analysis confirmed the Al 2p peak at 73.1 eV along with the oxygen O 1s at 530.9 eV and carbon traces C 1s at 283.6 eV.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An efficient density matrix renormalization group (DMRG) algorithm is presented and applied to Y junctions, systems with three arms of n sites that meet at a central site. The accuracy is comparable to DMRG of chains. As in chains, new sites are always bonded to the most recently added sites and the superblock Hamiltonian contains only new or once renormalized operators. Junctions of up to N = 3n + 1 approximate to 500 sites are studied with antiferromagnetic (AF) Heisenberg exchange J between nearest-neighbor spins S or electron transfer t between nearest neighbors in half-filled Hubbard models. Exchange or electron transfer is exclusively between sites in two sublattices with N-A not equal N-B. The ground state (GS) and spin densities rho(r) = < S-r(z)> at site r are quite different for junctions with S = 1/2, 1, 3/2, and 2. The GS has finite total spin S-G = 2S(S) for even (odd) N and for M-G = S-G in the S-G spin manifold, rho(r) > 0(< 0) at sites of the larger (smaller) sublattice. S = 1/2 junctions have delocalized states and decreasing spin densities with increasing N. S = 1 junctions have four localized S-z = 1/2 states at the end of each arm and centered on the junction, consistent with localized states in S = 1 chains with finite Haldane gap. The GS of S = 3/2 or 2 junctions of up to 500 spins is a spin density wave with increased amplitude at the ends of arms or near the junction. Quantum fluctuations completely suppress AF order in S = 1/2 or 1 junctions, as well as in half-filled Hubbard junctions, but reduce rather than suppress AF order in S = 3/2 or 2 junctions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A heterostructure of graphene and zinc oxide (ZnO) nanowires (NWs) is fabricated by sandwiching an array of ZnO NWs between two graphene layers for an ultraviolet (UV) photodetector. This unique structure allows NWs to be in direct contact with the graphene layers, minimizing the effect of the substrate or metal electrodes. In this device, graphene layers act as highly conducting electrodes with a high mobility of the generated charge carriers. An excellent sensitivity is demonstrated towards UV illumination, with a reversible photoresponse even for a short period of UV illumination. Response and recovery times of a few milliseconds demonstrated a much faster photoresponse than most of the conventional ZnO nanostructure-based photodetectors. It is shown that the generation of a built-in electric field between the interface of graphene and ZnO NWs effectively contributes to the separation of photogenerated electron-hole pairs for photocurrent generation without applying any external bias. Upon application of external bias voltage, the electric field further increases the drift velocity of photogenerated electrons by reducing the charge recombination rates, and results in an enhancement of the photocurrent. Therefore, the graphene-based heterostructure (G/ZnO NW/G) opens avenues to constructing a novel heterostructure with a combination of two functionally dissimilar materials.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A heterostructure of graphene and zinc oxide (ZnO) nanowires (NWs) is fabricated by sandwiching an array of ZnO NWs between two graphene layers for an ultraviolet (UV) photodetector. This unique structure allows NWs to be in direct contact with the graphene layers, minimizing the effect of the substrate or metal electrodes. In this device, graphene layers act as highly conducting electrodes with a high mobility of the generated charge carriers. An excellent sensitivity is demonstrated towards UV illumination, with a reversible photoresponse even for a short period of UV illumination. Response and recovery times of a few milliseconds demonstrated a much faster photoresponse than most of the conventional ZnO nanostructure-based photodetectors. It is shown that the generation of a built-in electric field between the interface of graphene and ZnO NWs effectively contributes to the separation of photogenerated electron-hole pairs for photocurrent generation without applying any external bias. Upon application of external bias voltage, the electric field further increases the drift velocity of photogenerated electrons by reducing the charge recombination rates, and results in an enhancement of the photocurrent. Therefore, the graphene-based heterostructure (G/ZnO NW/G) opens avenues to constructing a novel heterostructure with a combination of two functionally dissimilar materials.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper the soft lunar landing with minimum fuel expenditure is formulated as a nonlinear optimal guidance problem. The realization of pinpoint soft landing with terminal velocity and position constraints is achieved using Model Predictive Static Programming (MPSP). The high accuracy of the terminal conditions is ensured as the formulation of the MPSP inherently poses final conditions as a set of hard constraints. The computational efficiency and fast convergence make the MPSP preferable for fixed final time onboard optimal guidance algorithm. It has also been observed that the minimum fuel requirement strongly depends on the choice of the final time (a critical point that is not given due importance in many literature). Hence, to optimally select the final time, a neural network is used to learn the mapping between various initial conditions in the domain of interest and the corresponding optimal flight time. To generate the training data set, the optimal final time is computed offline using a gradient based optimization technique. The effectiveness of the proposed method is demonstrated with rigorous simulation results.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We develop a new dictionary learning algorithm called the l(1)-K-svp, by minimizing the l(1) distortion on the data term. The proposed formulation corresponds to maximum a posteriori estimation assuming a Laplacian prior on the coefficient matrix and additive noise, and is, in general, robust to non-Gaussian noise. The l(1) distortion is minimized by employing the iteratively reweighted least-squares algorithm. The dictionary atoms and the corresponding sparse coefficients are simultaneously estimated in the dictionary update step. Experimental results show that l(1)-K-SVD results in noise-robustness, faster convergence, and higher atom recovery rate than the method of optimal directions, K-SVD, and the robust dictionary learning algorithm (RDL), in Gaussian as well as non-Gaussian noise. For a fixed value of sparsity, number of dictionary atoms, and data dimension, l(1)-K-SVD outperforms K-SVD and RDL on small training sets. We also consider the generalized l(p), 0 < p < 1, data metric to tackle heavy-tailed/impulsive noise. In an image denoising application, l(1)-K-SVD was found to result in higher peak signal-to-noise ratio (PSNR) over K-SVD for Laplacian noise. The structural similarity index increases by 0.1 for low input PSNR, which is significant and demonstrates the efficacy of the proposed method. (C) 2015 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we present two new stochastic approximation algorithms for the problem of quantile estimation. The algorithms uses the characterization of the quantile provided in terms of an optimization problem in 1]. The algorithms take the shape of a stochastic gradient descent which minimizes the optimization problem. Asymptotic convergence of the algorithms to the true quantile is proven using the ODE method. The theoretical results are also supplemented through empirical evidence. The algorithms are shown to provide significant improvement in terms of memory requirement and accuracy.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Signals recorded from the brain often show rhythmic patterns at different frequencies, which are tightly coupled to the external stimuli as well as the internal state of the subject. In addition, these signals have very transient structures related to spiking or sudden onset of a stimulus, which have durations not exceeding tens of milliseconds. Further, brain signals are highly nonstationary because both behavioral state and external stimuli can change on a short time scale. It is therefore essential to study brain signals using techniques that can represent both rhythmic and transient components of the signal, something not always possible using standard signal processing techniques such as short time fourier transform, multitaper method, wavelet transform, or Hilbert transform. In this review, we describe a multiscale decomposition technique based on an over-complete dictionary called matching pursuit (MP), and show that it is able to capture both a sharp stimulus-onset transient and a sustained gamma rhythm in local field potential recorded from the primary visual cortex. We compare the performance of MP with other techniques and discuss its advantages and limitations. Data and codes for generating all time-frequency power spectra are provided.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Among the multiple advantages and applications of remote sensing, one of the most important uses is to solve the problem of crop classification, i.e., differentiating between various crop types. Satellite images are a reliable source for investigating the temporal changes in crop cultivated areas. In this letter, we propose a novel bat algorithm (BA)-based clustering approach for solving crop type classification problems using a multispectral satellite image. The proposed partitional clustering algorithm is used to extract information in the form of optimal cluster centers from training samples. The extracted cluster centers are then validated on test samples. A real-time multispectral satellite image and one benchmark data set from the University of California, Irvine (UCI) repository are used to demonstrate the robustness of the proposed algorithm. The performance of the BA is compared with two other nature-inspired metaheuristic techniques, namely, genetic algorithm and particle swarm optimization. The performance is also compared with the existing hybrid approach such as the BA with K-means. From the results obtained, it can be concluded that the BA can be successfully applied to solve crop type classification problems.