Advanced Materials Research Vols. 760-762

Abstract: The detection of small moving target in the context of complex background is a difficult issue. A method combining interframe differential registration and adaptive wiener filtering aimed to suppress background to detect moving object in complex background is proposed. The fixed background in the fore-and-aft frames can be filtered out by the interframe registration which preserves the moving target, parts of background and noise due to interframe movement and the gray-scale fluctuation. On one hand the complex background is estimated by an adaptive wiener filter, and the background suppression leaves the high-frequency regions containing the moving target in image. On the other hand, most of the high-frequency regions corresponding to non-target area are eliminated by the inter-frame registration in the differential images. The motion of target is continual in image sequences, while the position of the leaked background is relatively fixed and the noise is of small size. The fusion of the background suppression and inter-frame registration makes the discrimination of targets, background and noise possible. The small moving target is detected by trajectory association based on its interframe trajectory continuity. Experiment results verify the feasibility of the method.

Abstract: With the uprising deployment of large-scale environmental simulations, as well as the wide applications of the GIS data in the simulation models, the traditional modeling methods have been difficult to meet the requirements of terrain generation of large areas. In this paper, we study a new terrain database modeling process based on Celerity/TerraVista, which uses the techniques of image compression, block optimization, and level of detail (LOD) , for terrain generation of large areas. Tis new modeling process has been applied in our independently developed simulation system and has achieved good results.

Abstract: Based on the students spelling errors frequently in the assessment of curriculum design, this article using the method of the similarity degree of the string matching between the error string and the keyword, and then assess the pros and cons of the procedure. First, this paper introduces a simple similarity algorithm on the keywords as the core. Because its limitations, then discusses the similarity algorithm based on semantic tree. It analyzes both cases of be the same or different of the character number of two strings in detail. Finally, provides a specific example to verify the feasibility and accuracy of the algorithm.

Abstract: For streaming media proxy server systems which are geographically far apart, distributed streaming media proxy server clusters can be a good solution to reduce upward bandwidth consumption, shorten access distance, and improve service capacity; the key is to solve the coordination problem among the proxy servers. The decision problem of the user request dispatch actually belongs to NP-complete. This article proposes an online coordination algorithm for the distributed storage streaming media proxy servers, and discusses the relative deviation of the approximate solution from the optimal solution, to serve as a reference to the specific applications of clustered streaming media proxy servers.

Abstract: Fuzzy clustering analysis is a clustering algorithm based on function best practices, technology and optimal cost function using calculus. Fuzzy clustering, each sample is no longer belong to a class, but belong to a certain degree of membership of each class. In this paper, Web log sequential pattern mining knowledge gained, and visitors have the same browsing mode access to cutting the interaction of users with the Web information space. The paper presents analysis of Web log data mining based on improved fuzzy clustering algorithm. The experiment demonstrates the improved algorithm has better scalability.

Abstract: This paper proposes a method for optimizing the process planning with GA in ERP, analyzes the factors relating to production planning decisions in ERP. On this basis, builds the mathematical model of process planning and gives the step of solving mathematical model using GA through a specific example.

Abstract: As we all kown, The virtual machine placement is one kind of bin-packing problem. By optimizing placement of virtual machine. We can improve VM performance, enhance resource utilization, reduce energy comsumption. After analysis the existing virtual machine placement aglrithm. We propose a hybird virtual machine placement aglrithm (HTA) which based on network latency threshold for the requirement of low network latence and low VM migraiton ratio in Virtualized Desktop Infrastructure. It elect qualified node set based on network latency threshold and palce the virtual machines with load-balance policy, taking into account the preformance of the network and vitual machines. According to analysis and comparison. The simulation result show that the algorithm can effectively lessen the network latency and reduce the VM migration ratio.

Abstract: The curve-skeleton of an object is an important abstract geometrical and topological representation of its shape, which is extremely useful for pattern recognition and computer vision applications involving in shape analysis. In this paper, we propose an effective algorithm for extracting curve skeleton based on the definition and properties of curve skeleton from pixel cloud, which integrates the advantages of the visual main parts reliability for object recognition and the skeletons reduced-dimension for object representation. This algorithm can detect each pixel of the image, and find the salience value of each pixel; the salience value is the possibility of the pixel being a skeleton point. Then an appropriate threshold is selected to pruning the skeleton and to get the curve skeleton. In this way, the algorithm can be effective in reducing the number of non-skeleton pixels, and reduce the overall time of extracting skeleton. The experiments show that the skeleton keeps the topology of the target. And the corners of the skeleton are smoother and more natural. In additionally, it can effectively reduce redundant branches of skeleton.

Abstract: A general depth-first backtracking algorithm for graph isomorphism with the vertex partition and refinement technique is presented in this paper. The time complexity of this nondeterministic polynomial algorithm is O(nα+3) where nα is the number of backtracking points and (h-1)/2α (h+1)/2 for h=logn in the worst cases. The tests on many types of graphs validated the efficiency of this algorithm for graph isomorphism.

Abstract: Data field clustering algorithm possesses dynamic characteristics compared with other clustering algorithms. By changing the parameters of the data field model, the results can be dynamically adjusted to meet the target of feature extraction and knowledge discovery in different scales, but the selection and construction of data field model can give rise to different clustering results. This paper presents the different effectiveness of clustering based on various of data field models and its parameters, provides with the scheme to chose the best data field model fitting to the characteristics of the data radiation, and verifies that the best clustering effectiveness can be achieved with the value of radial energy in the golden section.