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.
QoS provisioning for Audio-Video traffic in WLANs respecting different priorities was one of the reasons for introduction of the intra-AC prioritization service in the IEEE 802.11aa amendment. However, observations show that as the service is realized by each node independently, with worsening of transmission conditions both types of Video traffic are corrupted. To overcome this issue, basing on two...
In this paper, a new robust optimization algorithm is proposed. The new approach includes the concept of contour lines which share a local peak and uses the information of the contour areas. The validity was evaluated by mathematic function and applied to optimal design of permanent magnet synchronous motor (PMSM).
In recent years parallel computing has been widely employed for both science research and commercial applications. For parallel systems such as many-core or computer clusters, it is inevitable to have one or more computing node failures due to random errors or injected attacks. Usually a diagnosis mechanism is able to locate several defective nodes through a number of tests and the analysis of those...
Corresponding points matching is a one of the primitive problems in computer vision and image processing which is used in a vast verity of applications such as stereo vision, image registration, object detection, motion analysis and image retrieval. In this paper, we present a new framework to improve the performance of interest points matching using not only the feature descriptors of keypoints,...
In this paper a new formulation of the robust graph coloring problem (RGCP) is proposed. In opposition to classical GCP defined for the given graph G(V,E) not only elements of E but also E can be subject of color conflicts in edge vertices. Conflicts in E are assigned penalties 0<P(e)<1. In addition to satisfying constraints related to the number of colors and/or a threshold of the acceptable...
This article provides an effective way to alleviate the long running defect of multi-objective intelligent optimization algorithms and enhance its ability to solve the robust optimization (RO) design. It describes the implementation of parallel computing for intelligent optimization algorithms based on the MATLAB Parallel Computing Toolbox (PCT) and Distributed Computing Server (DCS). In order to...
For the traditional problems of template drift and the low efficiency of algorithms in video image target tracking applications. A new template tracking algorithms based on active drift correction is proposed. The algorithm incorporates a drift correction term and a target tracking term. By adding a drift correction term into the traditional affine image alignment algorithms and update the template...
Unauthorized use of digital contents has become a problem in recent years. In particular, spread of illegally copied software is getting serious. Conventional approaches have drawbacks that they hamper the convenience of legitimate users. In this study, we bring up another idea "identifying the person who illegally distributed a fraud software code" so as not to limit the rights of innocent...
An algorithm to insert augmented reality in sports scenes is presented. The goal is to augment an image to the scene so that it appears as a part of the original scene. The proposed algorithm uses the homography relationship between the image coordinates and the world coordinates, then utilizes the Sift algorithm to find the corresponding points between two frames. By using the homography map we can...
Sliding mode control (SMC) has been considered as an effective tool in different studies for control systems. The robustness of SMC against the disturbances and model uncertainties makes the system stable. However, the chattering phenomenon degrades the system performances, it may even lead to instability. This paper deals with the second order sliding mode the twisting and super-twisting algorithm...
In research of the copyright protection of digital text, according to the shortage of poor robustness and weakness of attack resistance for the existing text watermark, Chinese machine code and information gain strategy have been introduced into text zero-watermark scheme, which puts forward the text zero-watermark based on the Chinese Edit Distance, constructs the construction and detection process...
Inspired by the structures and the ideas of natural immune system, a new instruction detection model was presented. In the model, it affects capability of the system that how to distribute the detectors over the network. The distributed condition of the detectors was analyzed, research into the performance of the strategy in the abstract and give realization methods of the three strategies. The result...
A matching which saturates all the vertices of a graph is called a perfect matching. Let GB=(U, W) be a bipartite graph with bipartitions U and W, where |U| = |W|-1 and |U|>=1. Bipartite graph GB is called critical bipartite graph if the following property holds: graph GB has a perfect matching after removing any vertex of W. Critical bipartite graph plays an important role in the design of robust...
Symmetric triple diagonal matrix has always been an active research field. It is of great significance to the theoretical study of computation and its practical application. Based on Jacobi transformation, the paper combines with the symmetric and triple diagonal, and introduces the computation of one-side Jacobi. Then it provides a one-side Jacobi parallel algorithm for symmetric triple diagonal...
In order to improve real-time and robustness of the lane detection and get more ideal lane, in the image preprocessing, the filter is used in strengthening lane information of the binary image, reducing the noise and removing irrelevant information. The lane edge detection is by using Canny operator, then the corner detection method is used in getting the Image corners coordinates and finally using...
Classic colLision detection methods adopt hierarchical structure based on bounding box, judgment intersection efficiency is key factor that effects colLision detection efficiency. A fast approach to judging basic element intersection in polygons meshing is presented to improve judgment intersection efficiency. First, this approach discusses the clamping-edge pair existence form in each polygon basic...
Watermarking provides an efficient method for copyright protection. This paper discusses the digital watermark technology which is based on Arnold and wavelet transform. After the Arnold transform of embedded watermark information, then embeds it into host gray images with discrete wavelet transform. Emulational experiments are done in Matlab, Experimental results demonstrate that this watermarking...
The polygon orientation identification and point-in-polygon query algorithm for GIS polygon is in the course of improvement. Robust algorithms are presented in this paper. By comparing the serial number of polygon's four (or three, two) extreme points, the polygon's orientation can be identified, the main computation in the new algorithm is only integers' comparison. By finding the shortest point...
This article first introduces the basic principle and model of ant colony algorithm which is a kind of swarm intelligence algorithm, then analyzes the defect in large-scale optimization problems of basic ant colony algorithm, and concludes with an improved algorithm to improve execution efficiency and solution quality in solving large-scale problems.
A defect d-matching in a graph G is a matching covering all but d vertices in G. Let G = (U, W) be a bipartite graph with bipartition U, W and |W|≥|U|. Let k, d be non-negative integers such that k + d = |W| ≥-|U|. If deleting any k vertices from W, the remaining subgraph of G contains a defect d-matching, then G is said to be (k, 0, d)-extendable. (k, 0, d)-extendable bipartite graphs find applications...
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.