SIFT is regarded as one of the most robust feature point detection algorithms in CV field. The feature point detection part, allocating final positions of all feature points, majorly defines the accuracy and stability...
详细信息
SIFT is regarded as one of the most robust feature point detection algorithms in CV field. The feature point detection part, allocating final positions of all feature points, majorly defines the accuracy and stability of the whole system. In this paper, we propose an FPGA-implementable hardware accelerator for this part. By introducing dual-pixel processing and the 3-stage-interpolation pipelined architecture with use of dual-port DDR2 memory access, we achieve to further improve process speed, meanwhile keeping high accuracy. By experiment, our system proves to reach max clock frequency of 145.0 MHz, processing up to 40 VGA images including memory operations. Compared with conventional work, hardware cost is slightly increased as trade-off for accelerated speed. High efficiency as 98.72% and high cover rate as 92.85% are kept by our proposal. Our proposal is suitable as a real-time SIFT system structure.
Community detection in networks receives much attention recently. Most of the previous works are for unipartite networks composed of only one type of nodes. In real world situations, however, there are many bipartite ...
详细信息
Community detection in networks receives much attention recently. Most of the previous works are for unipartite networks composed of only one type of nodes. In real world situations, however, there are many bipartite networks composed of two types of nodes. In this paper, we propose a fast algorithm called LP&BRIM for community detection in large-scale bipartite networks. It is based on a joint strategy of two developed algorithms -- label propagation (LP), a very fast community detection algorithm, and BRIM, an algorithm for generating better community structure by recursively inducing divisions between the two types of nodes in bipartite networks. Through experiments, we demonstrate that this new algorithm successfully finds meaningful community structures in large-scale bipartite networks in reasonable time limit.
Most anomaly detection methods can not be fit for the changing and complex network. High noise and updating normality profiles not in time will lead to high false alarm rate. In this paper, a new anomaly detection alg...
详细信息
Most anomaly detection methods can not be fit for the changing and complex network. High noise and updating normality profiles not in time will lead to high false alarm rate. In this paper, a new anomaly detection algorithm using improved hierarchy clustering, called ADIHC, is proposed in this paper. It applies an improved hierarchy clustering tree to organize clusters which are obtained by density-based partitioning method. We extend the clustering algorithm and apply branch and bound method for filtering noise. With the help of two advantages: filtering noise and updating normality profiles at any time, our algorithm is suitable for the changing and complex network. A series of experimental results on well known KDD Cup 1999 dataset indicate that ADIHC has superior performance of detection and meets more real-time requirements of intrusion detection system.
The solution to the problem of automatic defects detection in industrial software is covered in this paper. The results of the experiments with the existing tools are presented. These results stand for inadequate effi...
详细信息
The solution to the problem of automatic defects detection in industrial software is covered in this paper. The results of the experiments with the existing tools are presented. These results stand for inadequate efficiency of the implemented analysis. Existing source code static analysis methods and defects detection algorithms are covered. The program model and the analysis algorithms based on existing approaches are proposed. The problems of co-execution of different analysis algorithms are explored. The ways for improvement of analysis precision and algorithms performance are proposed. Advantages of the approaches developed are: soundness of a solution, full support of the features of target programming languages and analysis of the programs lacking full source code using annotations mechanism. The algorithms proposed in the paper are implemented in the automatic defects detection tool.
In this paper, a joint channel estimation and data detection algorithm is proposed for OFDM systems under doubly selective channels (DSCs). After representing the DSC using Karhunen-Loe¿ve basis expansion model (...
详细信息
In this paper, a joint channel estimation and data detection algorithm is proposed for OFDM systems under doubly selective channels (DSCs). After representing the DSC using Karhunen-Loe¿ve basis expansion model (K-L BEM), the proposed algorithm is developed based on the expectation-maximization (EM) algorithm. Basically, it is an iterative algorithm including two steps at each iteration. In the first step, the unknown coefficients in K-L BEM are first integrated out to obtain a function which only depends on data, and meanwhile, a maximum a posteriori (MAP) channel estimator is obtained. In the second step, data are directly detected by a novel approach based on the function obtained in the first step. Moreover, a Bayesian Cramer-Rao Lower Bound (BCRB) which is valid for any channel estimator is also derived to evaluate the performance of the proposed channel estimator. The effectiveness of the proposed algorithm is finally corroborated by simulation results.
A new type of automatic ship detection algorithm is proposed in this paper. By determining whether the local area is heterogeneous, simplex two-parameter CFAR algorithm based on Gauss-distribution or both two-paramete...
详细信息
A new type of automatic ship detection algorithm is proposed in this paper. By determining whether the local area is heterogeneous, simplex two-parameter CFAR algorithm based on Gauss-distribution or both two-parameter CFAR algorithm based on Gauss-distribution and two-parameter CFAR verification algorithm based on K-distribution are used to detect targets. This new type of algorithm keeps both the ability of traditional two-parameter CFAR algorithm' good features, such as small computation quantity, easy to implement and so on, and the detection accuracy in complex sea conditions at the same time.
In the target detection algorithm based on the bivariate cubic facet fitting (BCFF), the target position can be selected so that the position has the maximum value or energy value of the filtered result. However, in t...
详细信息
ISBN:
(纸本)9781424454167
In the target detection algorithm based on the bivariate cubic facet fitting (BCFF), the target position can be selected so that the position has the maximum value or energy value of the filtered result. However, in the cluttered environment, it may generate a large number of clutters. In this paper, we propose the target detection algorithm which applies the maximum local contrast as the target selection method. Our proposed algorithm can considerably improve the detection rate more than the method using the maximum energy value.
A novel general framework for distributed anomaly detection with theoretical performance guarantees is proposed. Our algorithmic approach combines existing anomaly detection procedures with a novel method for computin...
详细信息
A novel general framework for distributed anomaly detection with theoretical performance guarantees is proposed. Our algorithmic approach combines existing anomaly detection procedures with a novel method for computing global statistics using local sufficient statistics. Under a Gaussian assumption, our distributed algorithm is guaranteed to perform as well as its centralized counterpart, a condition we call `zero information loss'. We further report experimental results on synthetic as well as real-world data to demonstrate the viability of our approach.
The distributed hosts in the Internet are organized into a P2P network by chord protocol for detection. The detection node uses the CUSUMpsilas sensitivity to the slight change to detect the change in the amount of pa...
详细信息
The distributed hosts in the Internet are organized into a P2P network by chord protocol for detection. The detection node uses the CUSUMpsilas sensitivity to the slight change to detect the change in the amount of packets to destination address. Upon the abnormality detected, it is broadcast based on the node trust. The response nodes use space similarity algorithm to calculate the similarity between request node and response node. The victim end makes a comprehensive decision whether the DDoS attack *** scheme detects DDoS at the source end; it can prevent the DDoS attack by means of forged IP address and random IP address and trace the origin of the attack hosts. The experimental results indicate that our scheme has better performance than CUSUM and time similarity algorithm single deployed. It can reach as high as 96.1% detection rate and with only 6.9% false positives rate.
Ad Hoc network is a newly developed network without fixed infrastructure and a changing topology. Its vulnerability makes it prone to attacks, which brings greater challenges for intrusion detection for Ad Hoc. Throug...
详细信息
Ad Hoc network is a newly developed network without fixed infrastructure and a changing topology. Its vulnerability makes it prone to attacks, which brings greater challenges for intrusion detection for Ad Hoc. Through analyzing the existing intrusion detection techniques as well as the characteristics of Ad Hoc network, this paper has proposed an intrusion detection technique based on class association rules. The result has shown that this method is more accurate and efficient than other methods of its kind, especially for the hidden attack detection.
暂无评论