The research on nonlinear filtering algorithm is an active orientation. In this paper, a novel iterative filtering algorithm based on Kazakov linearization is proposed, and the derivation of the algorithm based the Ga...
详细信息
The research on nonlinear filtering algorithm is an active orientation. In this paper, a novel iterative filtering algorithm based on Kazakov linearization is proposed, and the derivation of the algorithm based the Gauss-Newton method is addressed in detail. This algorithm is applied to computer simulation of the SLAM problem in the robot location field and simulation result has been compared with UKF algorithm. The simulation shows that Kazakov based nonlinear filter perform better than UKF algorithm.
In cognitive radios, spectrum sensing is employed as a means to increase spectrum usage awareness. Spectrum sensing algorithms must satisfy the desired performance requirements, in terms of probability of detection an...
详细信息
In cognitive radios, spectrum sensing is employed as a means to increase spectrum usage awareness. Spectrum sensing algorithms must satisfy the desired performance requirements, in terms of probability of detection and false alarm, with short sensing duration. In addition, low-complexity algorithms are sought, particularly in low-power cognitive radios. A mechanism to search available channels in the frequency domain is proposed in this paper. Rather than obtaining an accurate estimation of the spectrum within a certain frequency range, we focus here on the task of finding white spaces. The proposed technique is a steepest descent method, adapted to the problem of sensing white spaces. Based on an approximation on the right and left derivatives of a smoothed periodogram, the algorithmiteratively searches for a free channel by following the direction of steepest descent. The adaptation step is such that the algorithm produces large steps in flat spectrum regions and small steps in steep regions, in order not to miss narrow portions of the spectrum with free channels. Simulations are provided for the proposed algorithm in a scenario where IEEE 802.11g and IEEE 802.15.4 devices coexist. The performance and speed of convergence of the proposed algorithm are shown, providing a comparison with a system that performs random channel search.
Unstable dynamical systems can be viewed from a variety of perspectives. We discuss the potential of an input-output map associated with an unstable system to represent a bounded map from ℒ 2 (ℝ) to itself and then de...
详细信息
Unstable dynamical systems can be viewed from a variety of perspectives. We discuss the potential of an input-output map associated with an unstable system to represent a bounded map from ℒ 2 (ℝ) to itself and then develop criteria for optimal reduced order approximations to the original (unstable) system with respect to an ℒ 2 -induced Hilbert-Schmidt norm. Our optimality criteria extend the Meier-Luenberger interpolation conditions for optimal ℋ 2 approximation of stable dynamical systems. Based on this interpolation framework, we describe an iteratively corrected rational Krylov algorithm for ℒ 2 model reduction. A numerical example involving a hard-to-approximate full-order model illustrates the effectiveness of the proposed approach.
Extraction of breast contour is a crucial first step in computer aided diagnosis of mammograms. It has the advantage of allowing the search for abnormalities to be limited to the region of the breast without undue inf...
详细信息
Extraction of breast contour is a crucial first step in computer aided diagnosis of mammograms. It has the advantage of allowing the search for abnormalities to be limited to the region of the breast without undue influence from the background and also provides a reference for the alignment of views when two views are being compared. Breast region segmentation is difficult because of the tapering nature of the breast. This paper presents a marker-controlled watershed method for breast region segmentation on mammograms. It mainly consists of computation of the segmentation function and the internal and external markers. The segmentation function is determined on the smoothed morphological gradient image by morphological reconstruction, and markers are determined on basis of a developed Otsu method. Results are evaluated by comparison with manual borders drawn by radiologist for a set of 120 mammograms, comparing with other three segmentation methods. The mean ± std of the values of the area overlap metric for our method is 0.93 ± 0.03. The experimental results indicate that the breast regions extracted by our method accurately characterize the corresponding ground truth images.
Vehicle routing problem(VRP) is one of important research in the logistics ***,there are many researches on the VRP,but their don't consider the cost of ***,the conclusion doesn't meet *** paper studies on the...
详细信息
Vehicle routing problem(VRP) is one of important research in the logistics ***,there are many researches on the VRP,but their don't consider the cost of ***,the conclusion doesn't meet *** paper studies on the inventory routing problem(IRP)and uses one target function to describe these two conflicting problems,which are very important in the logistics *** paper establishes the model of single client and many clients' inventory routing *** optimizing iterative algorithm is presented to solve the *** to the model we can confirm the best quantity,efficiency and route of ***,an example is given to illustrate the efficiency of model and algorithm.
The default that the factor of pheromone remnant is constant can make the algorithm fall into the local optimal solution easily, a new factor of pheromone remnant is proposed which is varying with the iterative time. ...
详细信息
The default that the factor of pheromone remnant is constant can make the algorithm fall into the local optimal solution easily, a new factor of pheromone remnant is proposed which is varying with the iterative time. But this can not overcome the local one completely, the bit exchanging mode with the shifting windows is proposed by the analysis in the solution set. Above all an improved ant colony algorithm is got, then it applies in the TSP, the simulation shows that this algorithm can improve the ability of searching global optimization and overcome premature convergence. Comparison with the basic ant colony algorithm shows that the algorithm is effective.
Various scientific computations have become so complex, and thus computation tools play an important role. In this paper, we explore the state-of-the-art framework providing high-level matrix computation primitives wi...
详细信息
Various scientific computations have become so complex, and thus computation tools play an important role. In this paper, we explore the state-of-the-art framework providing high-level matrix computation primitives with MapReduce through the case study approach, and demonstrate these primitives with different computation engines to show the performance and scalability. We believe the opportunity for using MapReduce in scientific computation is even more promising than the success to date in the parallel systems literature.
ECG signal is non-stationary, base line drift and power interference are the important factors influencing ECG signal extraction in high accuracy and directly determine the accuracy of ECG signal extraction and perfor...
详细信息
ECG signal is non-stationary, base line drift and power interference are the important factors influencing ECG signal extraction in high accuracy and directly determine the accuracy of ECG signal extraction and performance of analyzing and processing ECG signal. Adaptive filtering method can realize effective extraction of non-stationary signals without knowing a priori knowledge about signal and noise, this paper presents an adaptive noise cancellation system for ECG signal base line filtering and power interference suppression, constructs an iterative time LMS algorithm combining variable and fixed step size, which effectively solves the problems of filtering SNR and convergence rate. The experiment results show that this method improves 26.36dB in SNR, eliminates base line drift and power interference effectively, extracts ECG signal accurately and converges quickly, has important practical value in medical clinical diagnosis.
This paper tries to provide a stability analysis approach for the single input rule modules (SIRMs) based type-2 fuzzy logic control systems. First, in the neighbor of the equilibrium point, the closed-form input-outp...
详细信息
This paper tries to provide a stability analysis approach for the single input rule modules (SIRMs) based type-2 fuzzy logic control systems. First, in the neighbor of the equilibrium point, the closed-form input-output mappings of type-2 SIRMs (T2SIRMs) are explored, and the derivatives of T2SIRMs at the equilibrium point are computed. Then, how to compute the Jacobian matrix of the SIRMs based type-2 fuzzy logic control systems, which is a fundamental step for local stability analysis, is presented. At last, two examples on stabilization control of the TORA system and the inverted pendulum system are given. The results in both examples demonstrate that the stability analysis results agree completely with the control results.
Reinforcement Programming (RP) is a new approach to automatically generating algorithms, that uses reinforcement learning techniques. This paper describes the RP approach and gives results of experiments using RP to g...
详细信息
Reinforcement Programming (RP) is a new approach to automatically generating algorithms, that uses reinforcement learning techniques. This paper describes the RP approach and gives results of experiments using RP to generate a generalized, in-place, iterative sort algorithm. The RP approach improves on earlier results that that use genetic programming (GP). The resulting algorithm is a novel algorithm that is more efficient than comparable sorting routines. RP learns the sort in fewer iterations than GP and with fewer resources. Results establish interesting empirical bounds on learning the sort algorithm: A list of size 4 is sufficient to learn the generalized sort algorithm. The training set only requires one element and learning took less than 200,000 iterations. RP has also been used to generate three binary addition algorithms: a full adder, a binary incrementer, and a binary adder.
暂无评论