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 a new information acquisition and processing technology, wireless sensor networks can achieve tasks with complex large-scale monitoring and tracking in wide range of applications, but the localization for node itself is the basis of most applications. APIT is a major localization algorithm of ranged free algorithms, but the algorithm has the problems of big localization errors and low coverage...
Intonation assessment is an important part of Chinese CALL system. Nowadays, most systems use the correlation and RMSE features to assess the quality of the intonation of a given speech. As correlation and RMSE assign unoptimized weights to different degrees of mismatching errors, they may lead to performance degradation. In this paper, we propose a new feature called sorted error vector (SEV) for...
Electrical dispersion compensation equalizer is a cost-effective element in optical communication OOK systems in the presence of chromatic dispersion. The optimization of training sequence and taps for the electrical adaptive decision feedback equalizer in a single-mode fiber communication system is studied in this paper.10-Gb/s transmission over 100 km and up to 180 km of single-mode fiber without...
The conflict between exploring and exploiting is an unsolved problem for genetic algorithm. This paper proposed an ant colony genetic algorithm based on pheromone diffusion. The algorithm selects several sources from every sub-population, and these sources will be reserved to next population. Every source produces pheromones and diffuses them around, aim to guide the individual optimization. This...
Since it is the most natural way for people to search a specific melody in large music database, query by humming/singing is attracting more and more researcherspsila attention in the field of content-based music information retrieval. In this task, note-based and frame-based similarity measures are two commonly used methods. However, in previous works, researchers always focus on one of the two methods...
F0 is an important tone features in the state-of-art tone recognition system. Traditionally, difference of F0 (F0), subsection slope and intercept, and subsection mean F0 and mean F0, are used to improve the recognition accuracy. In fact, all these features can be expressed as the linear transform of F0. The problem is to find the best coefficients for the transform. Linear discriminant analysis (LDA)...
Key frames play an important role in video abstraction. Clustering is a popular approach for key-frame extraction. In this paper, we propose a novel method for key-frame extraction based on dominant-set clustering. Compared with the existing clustering-based methods, the proposed method dynamically decides the number of key frames depending on the complexity of video shots, produces key frames in...
Query by humming (QBH) is an interactive tool for retrieving favored songs from a large database of known media via acoustic input. In this task, common method for measuring similarity between query and candidate is either by symbolic notation distance or by framed based dynamic programming. However, the former has disadvantage of error-prone to the noted symbolic feature extraction stage, while the...
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.