The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
As the state-of-the-art ConvNet-based image retrieval method, spatial search has shown excellent retrieval performance and outperformed other competitors. A key component of this method is a weighted combination of distances evaluated at different regions of a query image. However, these weights are currently manually tuned, by a trial-and-error based exhaustive search. This not only incurs a lengthy...
Radar emitter recognition is an important and challenging subject in radar signal analysis and processing. In this work, an ambiguity function (AF) representative-slice based feature extraction and optimization algorithm is presented for unintentional modulation recognition of moving radar emitters. It considers near-zero slices of AF as representative feature set of radar emitters, which not only...
Radar emitter identification has attracted increasing interests in the last decade. The class-dependent method in to optimize time-frequency kernel of ambiguity function (AF) needs to rank kernel points in the whole AF plane and is sensitive to sampling data length. In this paper, an ambiguity function zero-slice based feature optimization algorithm is proposed for radar emitter recognition. It efficiently...
This paper proposes a novel multi-class cluster support vector machine, which borrows ideas of nonparallel hyperplanes from generalized eigenvalue support vector machines. For a k-class classification problem, it trains k nonparallel hyperplanes respectively, and each one lies as close as possible to self-class while apart from the rest classes as far as possible. Then, the label of a new sample is...
Classification can often benefit from efficient feature selection. However, the presence of linearly nonseparable data, quick response requirement, small sample problem and noisy features makes the feature selection quite challenging. In this work, a class separability criterion is developed in a high-dimensional kernel space, and feature selection is performed by the maximization of this criterion...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.