2376280
A Radar Target Multi-feature Fusion Classifier Based on Rough Neural Network
Fusing Multi-feature will benefit radar target classification with much more belief. However, since radar target attributes such as high range resolution profiles, waveforms, frequency spectra, time-frequency spectra, higher order statistics, polarization spectra and flight path are of different dimensions, it is hard to make decision by fusing multi-feature directly. Fortunately, rough set makes decision by examining the fitness of each condition attribute separately, while neural network is powerful for dealing with nonlinear problems. With radial projection of target dimension, cruising velocity and height as condition attribute, a multi-feature rough neural network fusion classifier is presented. Simulation of the proposed classifier based on an information system with 25 targets belonging to 6 classes shows accuracy not less than 93%, while attributes are subjoined with typical radar errors.
35059796
A Unified Framework for Shot Boundary Detection
According to drawbacks of available algorithms,a new hierarchical and multiresolution approach to the detection and classification of scene breaks in video sequences is presented in this paper. This method gives a unified framework for different shots by using the multi-resolution analysis as mainstay. Firstly, the video clips are cut by FCM clustering method, then the fade and dissolve are detected using ECR and SCD algorithm in the high components and the low components respectively by integer-to-integer wavelet transform. Finally, according to the cut and the former detection of gradual changes, we use motion vectors in high-components of 3D-WT to detect the wipe transition. Experimental results with real video clips about 7h demonstrate that our method can detect and classify a variety of scene breaks, including cuts, fades and dissolves, even in sequences involving significant motions and flash.
11815466
A Wavelet Based Image Watermarking Scheme
A novel robust watermarking scheme based on wavelet transform is presented in this paper. The watermark is embedded into significant triplet of wavelet coefficients in the three lowest detail subband images. The embedding algorithm only needs to modify a small amount of the wavelet coefficients, which leads to very small distortion and guarantees the visual quality of the watermarked image. The performance of the proposed algorithm is tested on a series of normal attacks in image processing, such as JPEG compression, Gaussian noise addition, median filter, etc. The corresponding experimental results show that the proposed watermarking scheme has better performance.
33275321
A Shot Boundary Detection Method for News Video Based on Rough Sets and Fuzzy Clustering
With the rapid growing amount of multimedia, content-based infomation retrieval has become more and more important. As a crucial step in content-based news video indexing and retrieval system, shot boundary detection attracts much more research interests in recent years. To partition news video into shots, many metrics were constructed to measure the similarity among video frames based on all the available video features. However, too many features will reduce the efficiency of the shot boundary detection. Therefore, it is necessary to perform feature reduction for every decision of shot boundary. For this purpose, the classification method based on rough sets and fuzzy c-means clustering for feature reduction and rule generation is proposed. According to the particularity of news scenes, shot transition can be divided into three types: cut transition, gradual transition and no transition. The efficacy of the proposed method is extensively tested on more than 2 h of news programs and 98.0% recall with 96.6% precision have been achieved.
17081857
QC4 - A Clustering Evaluation Method
Many clustering algorithms have been developed and researchers need to be able to compare their effectiveness. For some clustering problems, like web page clustering, different algorithms produce clusterings with different characteristics: coarse vs fine granularity, disjoint vs overlapping, flat vs hierarchical. The lack of a clustering evaluation method that can evaluate clusterings with different characteristics has led to incomparable research and results. QC4 solves this by providing a new structure for defining general ideal clusterings and new measurements for evaluating clusterings with different characteristics with respect to a general ideal clustering. The paper describes QC4 and evaluates it within the web clustering domain by comparison to existing evaluation measurements on synthetic test cases and on real world web page clustering tasks. The synthetic test cases show that only QC4 can cope correctly with overlapping clusters, hierarchical clusterings, and all the difficult boundary cases. In the real world tasks, which represent simple clustering situations, QC4 is mostly consistent with the existing measurements and makes better conclusions in some cases.
40362881
A Knowledge Learning Approach to Information Extraction from Multiple Text Based Web Sites
This paper describes a learning/adaptive approach to automatically building knowledge bases for information extraction from text based web pages. A frame based representation is introduced to represent domain knowledge as knowledge unit frames. A frame learning algorithm is developed to automatically learn knowledge unit frames from training examples. Some training examples can be obtained by automatically parsing a number of tabular web pages in the same domain, which greatly reduced the amount of time consuming manual work. This approach was investigated on ten web sites of real estate advertisements and car advertisements and nearly all the information was successfully extracted with very few false alarms. These results suggest that both the knowledge unit frame representation and the frame learning algorithm work well, domain specific knowledge bases can be learned from training examples, and the domain specific knowledge base can be used for information extraction from flexible text-based semi-structured Web pages on multiple Web sites. The investigation of the knowledge representation on five other domains suggests that this approach can be easily applied to other domains by simply changing the training examples.
32198408
Modelling Citation Networks for Improving Scientific Paper Classification Performance
This paper describes an approach to the use of citation links to improve the scientific paper classification performance. In this approach, we develop two refinement functions, a linear label refinement (LLR) and a probabilistic label refinement (PLR), to model the citation link structures of the scientific papers for refining the class labels of the documents obtained by the content-based Naive Bayes classification method. The approach with the two new refinement models is examined and compared with the content-based Naive Bayes method on a standard paper classification data set with increasing training set sizes. The results suggest that both refinement models can significantly improve the system performance over the content-based method for all the training set sizes and that PLR is better than LLR when the training examples are sufficient.
13249479
Fair and efficient router congestion control
Congestion is a natural phenomenon in any network queuing system, and is unavoidable if the queuing system is operated near capacity. In this paper we study how to set the rules of a queuing system so that all the users have a self-interest in controlling congestion when it happens.Routers in the internet respond to local congestion by dropping packets. But if packets are dropped indiscriminately, the effect can be to encourage senders to actually increase their transmission rates, worsening the congestion and destabilizing the system. Alternatively, and only slightly more preferably, the effect can be to arbitrarily let a few insistent senders take over most of the router capacity.We approach this problem from first principles: a router packet-dropping protocol is a mechanism that sets up a game between the senders, who are in turn competing for link capacity. Our task is to design this mechanism so that the game equilibrium is desirable: high total rate is achieved and is shared widely among all senders. In addition, equilibrium should be reestablished quickly in response to changes in transmission rates. Our solution is based upon auction theory: in principle, although not always in practice, we drop packets of the highest-rate sender, in case of congestion. We will prove the game-theoretic merits of our method. We'll also describe a variant of the method with some further advantages that will be supported by network simulations.
16297828
Neural Networks for Scientific Paper Classification
This paper describes an approach to the use of neural networks for improving the scientific paper classification performance. On the basis of the initial classification results obtained from the content-based naive Bayes method, this approach uses neural networks to model the citation link structures of the scientific papers for refining the class labels of the documents. The approach is examined and compared with the naive Bayes method on a standard paper classification data set with increasing training set sizes. The results suggest that using citation link structures, neural networks can significantly improve the system performance over the content-based naive Bayes method for all the training set sizes