The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Aiming at the wireless sensor network (WSN) positioning of the centroid localization algorithm with the problem of inaccurate positioning, this paper proposes an improved weighted centroid localization algorithm based on RSSI. This algorithm regard the distance between the unknown node and the reference of anchor nodes as the weight in centroid localization algorithm, make full use of the unknown...
In order to satisfy the increasing demands of wireless mobile communications, Long Term Evolution (LTE) has been proposed as an all-IP-based network to bring higher peak data rates and better spectral efficiency. As one of the sub-layers of LTE, Radio Link Control (RLC) layer is likely to congest or overflow due to handover or undesirable channel condition. In this paper, based on Random Early Detection...
This paper introduces the Particle Swarm Optimization (PSO) in order to solve the problem that the current stochastic and deterministic optimization methods have not yet obtained the perfect solution to avoid local optimal solution, and the optimal search convergence speed is slow. According to the special nature of Switched Reluctance Motor (SRM) and its design features, the paper enhances PSO global...
A gradient vector driven variable step size least-mean-square (GVD-VSS-LMS) algorithm is proposed in the context of under-modeling acoustic echo cancellation (AEC). The cost function is the mean square error. The gradient vector which takes into account the under-modeling noise and ambient noise is derived by differentiating the cost function with respect to the weight vector of the adaptive filter...
Based on the minimize spanning tree and Fiedler vector, a new feature matching algorithm is proposed in this paper. Firstly, a weighted complete graph is constructed with the feature points of each image respectively, then search the minimal spanning tree in each complete graph. Secondly, perform spectral decomposition on the Gaussian-weighted Laplace matrix of the minimize spanning tree respectively,...
In this paper, we proposed a variable step-size normalized least-mean-square (VSS-NLMS) algorithm in the context of acoustic echo cancellation (AEC), taking into account the under-modeling and double-talk scenarios simultaneously. The recursive relation for updating the tap-weight vector was derived, and the robustness of the algorithm was analyzed. The proposed algorithm requires neither any addition...
When intelligent robot with visual guiding is cutting steel plates, the reflection interference from the captured images is possibly leading to the failure of tracking, and therefore the image processing and analysis methods is require of high robustness. An algorithm of tracking image feature points with active structured light is proposed based on comprehensive applications with advanced template-matching...
Image registration is widely used in remote sensing image processing, medical image analysis and many other fields. Mutual information-based image registration technique gained much attention recently. However, during the optimization procedure, because of the influence of interpolation and the changes of overlapping areas in the images, the object function of the mutual information method may converge...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.