The firefly algorithm has become a hot issue in the research of wireless sensor networks (WSN) synchronization recently. In this paper, a clustering scheme is introduced to Reachback Firefly Algorithm (RFA), and this ...
详细信息
The firefly algorithm has become a hot issue in the research of wireless sensor networks (WSN) synchronization recently. In this paper, a clustering scheme is introduced to Reachback Firefly Algorithm (RFA), and this newly proposed algorithm is clustering firefly synchronization algorithm (CFSA). At the beginning of CFSA, the initial phases of all nodes in the network are sequenced for the purpose of calculating the number of clusters required. Then the entire network is divided into several clusters. Thus the original synchronization process can be decomposed into the following two steps: Cluster-intra synchronization and Cluster-inter synchronization. The simulation results show that CFSA improves the convergence rate of the system. Meanwhile, it effectively reduces the number of flashes, which leads to the mitigation in the overall network load.
The efficiency of multiple pattern matching is the core technology of Deep Packet Inspection and it is important to the real word of internet traffic *** this research we propose a new multiple pattern matching techni...
详细信息
The efficiency of multiple pattern matching is the core technology of Deep Packet Inspection and it is important to the real word of internet traffic *** this research we propose a new multiple pattern matching technique for the fixed pattern in the packet load,which is called I-HASH multiple various position pattern matching *** is used to improve the matching speed through the *** algorithm is implemented in our experiments and compared with the existing *** results demonstrate that our algorithm is much more effective than STRCMP algorithm,especially when the number of patterns is quiet *** will be extraordinarily helpful in the areas of Internet application identification system and network intrusion detection system and so on,which contain huge amounts of fixed patterns.
In this paper a novel moving object segmentation algorithm is *** algorithm utilizes an integrated mask-based background(BG) maintenance scheme.A rough foreground(FG) mask and a blockbased FG mask are integrated by an...
详细信息
In this paper a novel moving object segmentation algorithm is *** algorithm utilizes an integrated mask-based background(BG) maintenance scheme.A rough foreground(FG) mask and a blockbased FG mask are integrated by an OR operation to give the final update *** updating rates are used for different regions under different ***,by analyzing the distribution of pixel values of the temporal difference,we provide an effective detection scheme for sudden illumination change,after which the BG model is *** results based on the challenging I 2 R dataset show that our proposed method provides better performance in comparison with other classic and state-of-art algorithms such as GMM and Codebook,both qualitatively and *** to the overall metrics of F1 score,our method achieves 23.74% higher quality of FG segmentation than GMM.
This paper presents a new way for implicit rendering with particle systems.A seed particle needs to be found at first,which updates itself in a way of *** particles are initialized by this *** can set the number of **...
详细信息
This paper presents a new way for implicit rendering with particle systems.A seed particle needs to be found at first,which updates itself in a way of *** particles are initialized by this *** can set the number of *** are repulsion forces between the *** move in the direction of the forces,and update themselves in the way of cubefinding until they reach a uniform *** implicit surfaces get a steady and good sampling.A Crust mesh algorithm is used to connect the sampling points into triangle *** is preferable to represent the surfaces with meshes rather than ***-finding method is absolutely *** size of meshes varies with the topology of the *** demonstrate this method is useful and efficiency.
In this paper,we introduce an efficient adaptive intra-field deinterlacing framework using bilateral filter with consideration of pixel similarity between the interpolated pixel and the neighbor *** the proposed frame...
详细信息
In this paper,we introduce an efficient adaptive intra-field deinterlacing framework using bilateral filter with consideration of pixel similarity between the interpolated pixel and the neighbor *** the proposed framework,the low resolution image is first preprocessed using the simplest intra-field deinterlacing method,line average,due to its high efficiency and good performance,and then is decomposed using the fast bilateral filter into the detail and smooth layer which represent the small and large scale features,*** process smooth layer and detail layer *** detail layer,instead of estimating the edge orientations with some candidate directions as previous intra-field deinterlacing methods,such as edge-based line average,efficient edge-based line average etc.,we propose an adaptive but efficient deinterlacing method with consideration of pixel similarity,which avoids considering directional difference measures using limited candidate directions,resulting high *** with existing deinterlacing algorithms,the proposed algorithm improves peak signal-to-noise-ratio while maintaining high efficiency
A simple reversible watermarking scheme for 2D vector maps is presented in this *** embedding data,the proposed scheme applies an integer transform for a pair of coordinate values to embed 1-bit watermark and makes th...
详细信息
A simple reversible watermarking scheme for 2D vector maps is presented in this *** embedding data,the proposed scheme applies an integer transform for a pair of coordinate values to embed 1-bit watermark and makes the sum of the coordinate values *** extracting the embedded data,the proposed scheme gets the watermark bit and recovers the original data by using the invariant sum value and the parities of the sum value and the difference *** coordinate values not for embedding are *** the decoder,the marked pairs can be determined from the unmarked pairs by the ranges that their differences fall ***,the proposed scheme does not need to compress and embed the location ***,the computational complexity is low and the capacity is *** results show the proposed scheme has good performance.
This paper researches and formulates a topology optimization model in long-reach passive optical network(LRPON).The objective is to minimize the deployment cost with certain physical constraints.A nested genetic algor...
详细信息
This paper researches and formulates a topology optimization model in long-reach passive optical network(LRPON).The objective is to minimize the deployment cost with certain physical constraints.A nested genetic algorithm(NGA) is proposed to solve the topology optimization *** NGA consists of two loops,and the outer-loop GA(OLG) is a simple genetic algorithm(SGA) to solve the location problem of splitters,while the inner-loop GA(ILG) is a partheno-genetic algorithm(PGA) to complete the construction of the spanning ***,three scenarios with different network scales are simulated to examine the efficiency of the proposed algorithm.
We present a post-processing technique for correcting misrecognition results derived from a continuous speech recognizer with more sophisticated linguistic ***,we propose a novel confidence measure called word viabili...
详细信息
We present a post-processing technique for correcting misrecognition results derived from a continuous speech recognizer with more sophisticated linguistic ***,we propose a novel confidence measure called word viability that is based on word activation force(WAF) model,which has the ability to correct some syntactic and semantic errors by means of taking the information about the neighbors into ***,the error correction algorithm corrects recognition errors by first creating candidate list for errors,and then re-ranking the candidates with a combination of mutual information score,trigram score and word viability *** film experiments show that the combination of mutual information,trigram and word viability can effectively reduce the character error rate of speech recognition.
This paper proposes a novel omni-image Interpolation technique and a new method to evaluation its ***-images are taken by non-linear catadioptric camera and offer important scientific and engineering benefits but ofte...
详细信息
This paper proposes a novel omni-image Interpolation technique and a new method to evaluation its ***-images are taken by non-linear catadioptric camera and offer important scientific and engineering benefits but often at the expense of the reduced visual *** algorithms aiming at improving the resolution of omni-images are deemed as an effective approach to deal with such a lack of visual *** contribution of this paper is that we propose an interpolation algorithm which could not only enhance the visual quality but also maintain camera *** properties of the interpolated images are preserved by utilizing the epipolar geometry constraint of non-linear *** our experiment,good performance was found on four sets of omni-images using the proposed method compared with the standard bilinear algorithm and bicubic algorithm.
The system capacity of single-carrier frequency division multiple access (SC-FDMA) can be increased by allocating subcarriers to users who are in a good channel condition. However, there is a tradeoff between system c...
详细信息
The system capacity of single-carrier frequency division multiple access (SC-FDMA) can be increased by allocating subcarriers to users who are in a good channel condition. However, there is a tradeoff between system capacity and fairness among users. Nash bargaining solution (NBS) in cooperative game theory can be used to solve this tradeoff problem. However, very high computational complexity is required to find the NBS. In this paper, we propose a reduced complexity suboptimal NBS based subcarrier allocation, which requires lower computational complexity while achieving the system capacity and fairness among users similar to the NBS. The proposed suboptimal NBS subcarrier allocation is applied to distributed antenna network (DAN) using frequency- domain space-time transmit diversity (FD-STTD). Numerical computation results show that the proposed NBS based subcarrier allocation achieves the system capacity comparable to Proportionally Fair (PF) map while achieving a higher fairness than PF map.
暂无评论