14294426
Gigabit packet classification by using lookahead caching
Hashing is a widely used method to perform fast lookup. Several schemes have been proposed to support Internet lookup that includes IP lookup and packet classification. Rectangular search is a well-known packet classification scheme based on multiple hash accesses for different filter length. It shows good scalability with respect to the number of filters; however, the lookup performance is not satisfactory. For example, through experiments, each packet classification takes about 40 hash accesses in a 100,000-filter database and each hash access may take more than one memory access. Obviously, this is insufficient to provide gigabits throughput. We proposed a novel "lookahead caching" which can significantly improve the performance of the hash-based algorithm. The basic idea is to find out the unmatched case for each incoming packet, thus it is different from the traditional caching mechanism. The experimental results indicate that the proposed scheme can improve the performance by a factor of two. The scheme can be further enhanced using parallel processing.
15398175
Hardware-based Packet Classification Made Fast and Efficient
To achieve fast packet classification, a hardware-based scheme, cross-producting recurrence (CPR), based on a formerly proposed cross-producting scheme is proposed. This scheme simplifies the classification procedure and decrease the distinct combinations of fields by hierarchically decomposing the multi-dimensional space. In the new scheme, the multi-dimensional space is endowed with a hierarchical property which self-divides into several smaller subspaces, whereas the procedure of packet classification is translated into repeatedly searching for matching subspaces. The required storage of the proposed scheme is significantly reduced since the distinct fields of subspaces is controlled by a pre-defined configuration and can be much less than that of the filters. The experimental results demonstrate the effectiveness and scalability of the proposed scheme
17343502
IAMC architecture and prototyping: a progress report
Internet Accessible Mathematical Computation (IAMC) is a distributed framework to supply mathematical computing powers over the Internet. Presented are conceptual and experimental work on the IAMC architecture, a client prototype (Dragonfly), client GUI, a server prototype (Starfish), the Mathematical Computation Protocol (MCP), mathematical data encoding, and the external compute engine interface.
206412947
A Fast and Flexible Thinning Algorithm
A fast serial and parallel algorithm for thinning digital patterns is presented. The processing speed is faster than previous algorithms in that it reads pixels along the edge of the input pattern rather than all pixels in each iteration. Using this algorithm, an experiment is conducted and the patterns such as 'X', 'H', 'A', 'moving body', and 'leaf' are tested. The results show that this algorithm is faster, structure-preserving, and more flexible in that it can be done either sequentially or in parallel. >
13452585
Robust Clustering based on Winner-Population Markov Chain
In this paper, we propose an unsupervised genetic clustering algorithm, which produces a new chromosome without any conventional genetic operators, and instead according to the gene reproducing probabilities determined by Markov chain modeling. Selection of cluster centers from the dataset enables construction of a look-up table that saves the distances between all pairs of data points. The experimental results show that the proposed algorithm not only solves the premature problem to provide a more stable clustering performance in terms of number of clusters and clustering results, but also improves the time efficiency
52809451
Improving Face Recognition by Online Image Alignment
Face recognition accuracy is affected by many factors. This paper studies one of the factors, and provides a reliable image alignment for face recognition. For this purpose, a performance metric is extracted from an analysis of face recognition similarity scores. The metric varies with face alignment, and has a relationship with the actual recognition accuracy. Our method adjusts face alignment online by selecting an alignment candidate corresponding to the largest performance metric. The experimental results show that the presented method can improve the accuracy and robustness of current face recognition systems
8428215
A Tennis Video Indexing Approach Through Pattern Discovery in Interactive Process
Tennis game is a mutual and interactive process between the two opponents, and audiences are usually interested in how the players oppose and compete with each other. However, previous works on tennis video indexing are mainly based on analyses of player’s behavior, such as movement and gesture, and seldom provide information of the match process. In this paper, a novel approach is proposed for tennis video indexing by mining the salient patterns in the match process. The match is first characterized by a time sequence of players’ joint movements, based on which an unsupervised way is performed to extract the sub-sequences with high occurrence frequencies. These sub-sequences, called patterns, reflect the technical styles and tactics of the players, and offer an effective manner to organize the video. Evaluations on four hour broadcasting tennis videos show very promising results.