15959526
Cut-and-Paste Editing over 3D Meshes
A novel direct cut-and-paste editing method over 3D triangular meshes is proposed in this paper. The source feature mesh is transferred to the position where it is to be pasted through the corresponding planes. The planes are created using the least squares approximation. To decrease the distortion of pasting region, the local mesh representation is used, and the pasted region is reconstructed in the least squares sense. Then, the boundary vertices of the source feature mesh are connected with the target mesh. This method is applicable to source geometry features with non-zero genus. It can be performed at interactive rates and produces less distortion and natural results
17229395
Region-of-interest coding of 3D mesh based on wavelet transform
A scheme for the region of interest (ROI) coding of 3D meshes is proposed for the first time. The ROI is encoded with higher fidelity than the rest region, and the "priority" of ROI relative to the rest region (background, BG) can be specified by encoder or decoder (user). Wavelet transform is used on 3D mesh and zerotrees are adopted to organize the coefficients. The wavelet coefficients of ROI are scaled up and encoded with a modified set partitioning in hierarchical trees (SPIHT) algorithm. In additional, a fast algorithm is proposed for creating the ROI mask. Once the quality of reconstructed ROI becomes high enough, the transmission can be intermitted and much transmission bandwidth and storage space will be saved consequently.
17309491
Multi-resolution Meshes Deformation Based on Pyramid Coordinates
In this paper, we present a technique for multi-resolution meshes deformation based on pyramid coordinates. Pyramid coordinates are rotation invariant, and can achieve low distortion editing for large deformations. Their drawback is that the reconstruction process is nonlinear and time consuming especially for large meshes. In order to decrease the computational cost, the proposed method reduces the number of vertices involved in the deformation. We first construct a simplified mesh using a modified CPM algorithm; then edit the simplified meshes by pyramid coordinates based mesh detail presentation; finally, series of details are added to the deformed simplified mesh. Our algorithm can generate natural looking deformations more efficiently than the original pyramid coordinates method.
28818922
An Effective PSO-Based Hybrid Algorithm for Multiobjective Permutation Flow Shop Scheduling
This paper proposes a hybrid algorithm based on particle swarm optimization (PSO) for a multiobjective permutation flow shop scheduling problem, which is a typical NP-hard combinatorial optimization problem with strong engineering backgrounds. Not only does the proposed multiobjective algorithm (named MOPSO) apply the parallel evolution mechanism of PSO characterized by individual improvement, population cooperation, and competition to effectively perform exploration but it also utilizes several adaptive local search methods to perform exploitation. First, to make PSO suitable for solving scheduling problems, a ranked-order value (ROV) rule based on a random key technique to convert the continuous position values of particles to job permutations is presented. Second, a multiobjective local search based on the Nawaz-Enscore-Ham heuristic is applied to good solutions with a specified probability to enhance the exploitation ability. Third, to enrich the searching behavior and to avoid premature convergence, a multiobjective local search based on simulated annealing with multiple different neighborhoods is designed, and an adaptive meta-Lamarckian learning strategy is employed to decide which neighborhood will be used. Due to the fusion of multiple different searching operations, good solutions approximating the real Pareto front can be obtained. In addition, MOPSO adopts a random weighted linear sum function to aggregate multiple objectives to a single one for solution evaluation and for guiding the evolution process in the multiobjective sense. Due to the randomness of weights, searching direction can be enriched, and solutions with good diversity can be obtained. Simulation results and comparisons based on a variety of instances demonstrate the effectiveness, efficiency, and robustness of the proposed hybrid algorithm.
12116264
Analyzing the Subjective Interestingness of Association Rules
Association rules, a class of important regularities in databases, have proven very useful in practical applications, but association-rule-mining algorithms tend to produce huge numbers of rules, most of which are of no interest. Users have considerable difficulty manually analyzing so many rules to identify the truly interesting ones. To solve that problem, we have developed a new approach to help them find interesting rules (in particular, unexpected rules) from a set of discovered association rules. This interestingness analysis system (IAS) leverages the user's existing domain knowledge to analyze discovered associations and then rank discovered rules according to various interestingness criteria, such as conformity and various types of unexpectedness. This article describes how we have implemented this technique and used it successfully in a number of applications.
18163134
Noise-Analysis Based Threshold-Choosing Algorithm in Motion Estimation
A novel threshold choosing method for the threshold-based skip mechanism is presented, in which the threshold is obtained from the analysis of the video device induced noise variance. Simulation results show that the proposed method can remarkably reduce the computation time consumption with only marginal performance penalty.
7558736
An Adaptive Schedule Medium Access Control for Wireless Sensor Networks
Many media access control (MAC) protocols for wireless sensor networks (WSNs) such as sensor MAC (S-MAC) and carrier sense multiple access with minimum preamble sampling (CSMA-MPS) exploit listen/sleep cycles to conserve energy. The cycles of nodes influence the network performances such as energy efficiency, packet latency and throughput in WSNs. In this paper, an adaptive schedule medium access control (AS-MAC) for WSNs is presented. AS-MAC introduces the adaptation of the cycles in MAC layer to the data traffic. The effect of the protocol is that it can decrease the latency, improve the throughput and energy efficiency when traffic is dynamic. We also compare AS-MAC with S-MAC and CSMA-MPS through simulations and the results show it has better performances than the former protocols.
44873280
Twi-Map Support Vector Machine for Multi-classification Problems
In this paper, a novel method called Twi-Map Support Vector Machines (TMSVM) for multi-classification problems is presented. Our ideas are as follows: Firstly, the training data set is mapped into a high-dimensional feature space. Secondly, we calculate the distances between the training data points and hyperplanes. Thirdly, we view the new vector consisting of the distances as new training data point. Finally, we map the new training data points into another high-dimensional feature space with the same kernel function and construct the optimal hyperplanes. In order to examine the training accuracy and the generalization performance of the proposed algorithm, One-against-One algorithm, Fuzzy Least Square Support Vector Machine (FLS-SVM) and the proposed algorithm are applied to five UCI data sets. Comparison results obtained by using three algorithms are given. The results show that the training accuracy and the testing one of the proposed algorithm are higher than those of One-against-One and FLS-SVM.