List of Articles
-
Open Access Article
1 - A New Corner Extraction Method and its Application to Vehicle De
E. Kabir M. Fathi H. Sadoghi YazdiCorner detection is employed in many areas of image processing and machine vision. Finding all corners, computing the exact position of the corner and robustness of the algorithm against noise are important criteria in corner detection. In this paper, using the singular MoreCorner detection is employed in many areas of image processing and machine vision. Finding all corners, computing the exact position of the corner and robustness of the algorithm against noise are important criteria in corner detection. In this paper, using the singular values of the matrix defined on the gradient of a small area of the image, a suitable corner is extracted. The proposed method in comparison with the computational method which is based on the eigenvalues of the cross correlation matrix of the gradient of image shows a better performance. It also yields good results in the presence of noise. These two methods were compared on the synthesized and real images of a traffic scene. The proposed method presented better results. Manuscript profile -
Open Access Article
2 - A Two Step Method for the Recognition of Printed Subwords
E. Kabir A. ebrahimiIn this paper a two step method for the recognition of printed subwords is proposed. Using characteristic loci features, the set of printed subwords are clustered into 300 clusters by k-means algorithm. Each cluster is represented by its mean. In the first step, each in MoreIn this paper a two step method for the recognition of printed subwords is proposed. Using characteristic loci features, the set of printed subwords are clustered into 300 clusters by k-means algorithm. Each cluster is represented by its mean. In the first step, each input is classified into 300 categories by minimum Euclidian distance from the cluster centers, and 10 closest clusters are found. In the second step, Fourier descriptors of the subword contour are used to classify the input subword into the members of these 10 clusters. The training set consists of 12700 Farsi subwords in 4 different fonts, Lotus, Mitra, Yagut and Zar, and 3 sizes of 10, 12 and 14. In a test, a set of 500 subwords was used. Considering the first class, top five and top ten classes, 71.4%, 95%, and 98.2% of these subwords were correctly classified. In the post processing, dots of the subword and their positions were used to improve the recognition results. This improved the recognition rate to 92.6%. Manuscript profile -
Open Access Article
3 - Adaptive Compression of Wide-Band Speech and Audio Using Wavelet Transform
M. H. SavojiThe design of a new codec at 32 kb/s for audio and high quality speech (bandwidth limited to 7 kHz and sampled at 16 kHz with 16 b/sample) is presented in this paper. This codec is a good substitute for the G721 ITU Standard and its 64 kb/s variant G722 that are based o MoreThe design of a new codec at 32 kb/s for audio and high quality speech (bandwidth limited to 7 kHz and sampled at 16 kHz with 16 b/sample) is presented in this paper. This codec is a good substitute for the G721 ITU Standard and its 64 kb/s variant G722 that are based on ADPCM and dating from the late 1980s. This new codec comprises adaptive wavelet transform coding, psycho-acoustic modeling, quantization and variable length entropy and run-length coding. The novelty here is the use of a parametric wavelet kernel and the way the wavelet packet tree (WPT) is expanded so that better matching is achieved with critical acoustic bands. The explicit kernel permits to control the sharpness of the basic half-band filter of which the filter used in the Fast Wavelet Transform (FWT) coding are derived. The psycho-acoustic modeling of MPEG1-Audio is used but instead of employing power spectrum for calculating the Signal-to-Mask ratio (S/M), we have directly used the energies of WPT output signals. As a consequence, the computation cost is reduced. The number of quantization bits in each band is controlled by the corresponding S/M ratio. The Variable Length Coding (VLC) used here is an extension of JPEG Huffman coding where some modifications are made to adapt this scheme to speech characteristics. The developed codec has the capability of reducing the bit-rate and controlling the required quality by changing the S/M ratios. Therefore, it can be used for fixed capacity channels by the same token. It is shown that this scheme has a very good quality at 32 kb/s and that the coded signal is quite indistinguishable from the PCM signal digitized at 16 kHz and 16 b/sample. Manuscript profile -
Open Access Article
4 - Speech Compression Based on Linear Prediction Model and Voiced and Unvoiced Cycles
K. YaghmaieVariable rate signal compression has found many applications where there is no serious limitation on delay and the signal parameters are not very susceptible to errors. Methods used to apply variable rate coding usually rely on the redundancies included in the signal. MoreVariable rate signal compression has found many applications where there is no serious limitation on delay and the signal parameters are not very susceptible to errors. Methods used to apply variable rate coding usually rely on the redundancies included in the signal. Such methods are different in final bit rate, quality of the synthetic signal and computational requirements. This paper presents a novel method for compression of speech signal in a variable scheme. Based on the known linear prediction method, a simple and efficient model is developed in which segments of the speech signal are classified as voiced or unvoiced using the innovative voiced and unvoiced cycle concept. Manuscript profile -
Open Access Article
5 - A New Evolutionary Estimation of Distribution Algorithm Based on Learning Automata
M. R. MeybodiIn order to overcome the poor behaviors of genetic algorithms in some problems other classes of evolutionary algorithms have been recently developed by researchers. Although these algorithms do not have the simplicity of classic genetic algorithms but they are superior MoreIn order to overcome the poor behaviors of genetic algorithms in some problems other classes of evolutionary algorithms have been recently developed by researchers. Although these algorithms do not have the simplicity of classic genetic algorithms but they are superior to genetic algorithms. The Probabilistic Model Building Genetic Algorithms or Estimation of Distribution Algorithms (EDAs) is one of these classes which is recently developed. In this paper we introduce a new estimation of distribution algorithm based on Learning Automata. The proposed algorithm is a model based search optimization method that uses a set of learning automata as a probabilistic model of the population of solutions in the search space. The proposed algorithm is a simple algorithm which has produced good results for the optimization problems considered in this problem. Manuscript profile -
Open Access Article
6 - Analysis, Design, and Fabrication of TEM Horn Antennas
Mohammad Khalaj-AmirhosseiniIn this paper, TEM horn antennas are reviewed as an ultra wideband antennas and then analyzed theoretically. The far zone fields, radiation patterns, directivity, and bandwidth of these antennas are determined. Also, the characteristic impedance and input reflection coe MoreIn this paper, TEM horn antennas are reviewed as an ultra wideband antennas and then analyzed theoretically. The far zone fields, radiation patterns, directivity, and bandwidth of these antennas are determined. Also, the characteristic impedance and input reflection coefficient of these antennas are determined using the taperd transmission lines model. Then some relations are introduced to optimum design of these antennas. Finally, two TEM horn antennas are designed and then are simulated, fabricated, and measured in an experiment. Manuscript profile