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.
Adaptive Multi-Rate (AMR) codec was standardized for GSM in 1999. AMR offers substantial improvement over previous GSM speech codecs in error robustness by adapting speech and channel coding depending on channel conditions. The Adaptive Multi-Rate speech codec is adopted as a standard for IMT-2000 by ETSI and 3GPP and consists of eight source codecs with bit rates from 4.75 to 12.2 kbit/s. In this...
In this paper a system is developed for face recognition processes. Preprocessing and face localization is necessary to obtain a high classification rate in face recognition tasks. In this study after preprocessing of face images, for omitting the redundant information such as background and hair, the oval shape of face is approximated by an ellipse using shape information. Then the parameters (orientation...
This paper compares performances of the Zernike moment invariant (ZMI) and wavelet transform features in the application of face recognition. In this study, after preprocessing and face localization of an image, we optimize the exact location of oval shape of face in the image with genetic algorithm which improves the recognition rate. High order ZMI and discrete wavelet transform (Haar wavelet) is...
The bandwidth-delay-constrained least-cost multicast routing is a challenging problem in high-speed multimedia networks. Computing such a constrained Steiner tree is an NP-complete problem. In this paper, we propose several novel solutions to this problem based on genetic algorithms (GA). The proposed solutions consist of six different schemes for genotype representation, and also several new heuristic...
Computing the bandwidth-delay-constrained least-cost multicast routing tree is an NP-complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm based on the genetic algorithms (GA). In the proposed algorithm, the connectivity matrix of edges is used for genotype representation. Some novel heuristics are also proposed for mutation, crossover, and creation of random individuals...
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.