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.
The Sequential Probability Ratio Test (SPRT) is a classical detector for problems with an unfixed sample size. Though it is optimal under some conditions, SPRT can be directly used only for a binary hypothesis with exactly known distributions. In this paper, sequential detection problem with an uncertain hypothesis distribution is considered, in which the uncertain distribution is formulated in a...
For improving the accuracy of the traditional maximum entropy threshold segmentation algorithm, an improved maximum entropy segmentation algorithm is proposed. Firstly, it determines the possible range of an optimal segmentation threshold according to a simple statistical method, so as to reduce the interference of the background and magnify the proportion of the target region. Secondly, in a certain...
In order to solve the problem of GA's slow convergence in the VQ codebook design due to the strong global search ability and the complex computation, a hybrid algorithm based on the GA-LBG algorithm is adopted because the LBG algorithm as an iterative algorithm based on the nearest neighbor rule and the centroid rule owns the advantage of fast convergence. In the simulation experiment, MFCC extracted...
A tag-collision problem (or missed reads) in Radio Frequency Identification (RFID) system is the event that a reader cannot identify the tag if many tags respond to a reader at the same time. The so-called M-ary (M=2, 4, 8, ...) query tree protocols were proposed for tag collision arbitration. Mathys et al. showed that ternary (M=3) query tree will bring about the optimum performance for tag identification...
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.