<?xml version="1.0" encoding="utf-8"?>
 <records>
	<record>
	<language>per</language>
	<publisher>Research Center on Developing Advanced Technologies</publisher>
	<journalTitle>Signal and Data Processing</journalTitle>
	<issn>2538-4201</issn>
	<eissn>2538-421X</eissn>
	<publicationDate>2016-06</publicationDate>
	<volume>13</volume>
	<issue>1</issue>
	<startPage>3</startPage>
	<endPage>14</endPage>
	<documentType>article</documentType>
	<title language="eng">Image Encryption Algorithm based on Recursive Cellular Automata</title>


	<authors>
	<author>
	<name> </name>
	<email>zmehrnahad@gmail.com</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name> </name>
	<email>alatif@yazd.ac.ir</email>
	<affiliationId>2</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
                 
	      </affiliationName>
	      <affiliationName affiliationId="2">
                 
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">In this paper, a new structure for image encryption using recursive cellular automatais presented. The image encryption contains three recursive cellular automata in three steps, individually. At the first step, the image is blocked and the pixels are substituted. In the next step, pixels are scrambledby the second cellular automata and at the last step, the blocks are attachedtogether and the pixels substitute by the third cellular automata. Due to reversibility of cellular automata, the decryption of the image is possible by doing the steps reversely. The experimental results show that the encrypted image is not comprehend visually, also this algorithmhas satisfactory performance in terms of quantitative assessment from some other schemes.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-266-en.pdf</fullTextUrl>
	<keywords>
	<keyword>Cryptography</keyword>
	<keyword>Cellular Automata</keyword>
	<keyword>Recursive Cellular Automata</keyword>
	</keywords>


	</record>
	<record>
	<language>per</language>
	<publisher>Research Center on Developing Advanced Technologies</publisher>
	<journalTitle>Signal and Data Processing</journalTitle>
	<issn>2538-4201</issn>
	<eissn>2538-421X</eissn>
	<publicationDate>2016-06</publicationDate>
	<volume>13</volume>
	<issue>1</issue>
	<startPage>15</startPage>
	<endPage>25</endPage>
	<documentType>article</documentType>
	<title language="eng">image denoising using adaptive switching filter based on extreme learning machine</title>


	<authors>
	<author>
	<name>majid khorashadizadeh</name>
	<email>smkh1985@gmail.com</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name>ali mohammad latif</name>
	<email>alatif@yazduni.ac.ir</email>
	<affiliationId>2</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
             yazd university    
	      </affiliationName>
	      <affiliationName affiliationId="2">
             yazd university    
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">In this paper a new efficient method for detecting the impulse noise from the corrupted image using extreme learning machine (ELM) is proposed. An improved version of the standard median filter is suggested to remove the detected noisy pixel. The performance of proposed detector is evaluated using classification accuracy. The results show that our detector is robust even at higher noise density. Results illustrate that proposed filter provides better performance in terms of PSNR than many other median filter variants for Salt and pepper noise. . The suggested technique yields significantly good results both in objective and subjective judgments of image quality.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-294-en.pdf</fullTextUrl>
	<keywords>
	</keywords>


	</record>
	<record>
	<language>per</language>
	<publisher>Research Center on Developing Advanced Technologies</publisher>
	<journalTitle>Signal and Data Processing</journalTitle>
	<issn>2538-4201</issn>
	<eissn>2538-421X</eissn>
	<publicationDate>2016-06</publicationDate>
	<volume>13</volume>
	<issue>1</issue>
	<startPage>27</startPage>
	<endPage>38</endPage>
	<documentType>article</documentType>
	<title language="eng">Automatic Labeling of Semantic Roles in Persian Sentences using Dependency Trees</title>


	<authors>
	<author>
	<name>Morteza Rezaei Sharifabadi</name>
	<email>mrezaeis@mehr.sharif.edu</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name>Parvaneh Khosravizadeh</name>
	<email>khosravizadeh@sharif.edu</email>
	<affiliationId>2</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
             Sharif University of Technology    
	      </affiliationName>
	      <affiliationName affiliationId="2">
             Sharif University of Technology    
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">Automatic identification of words with semantic roles (such as Agent, Patient, Source, etc.) in sentences and attaching correct semantic roles to them, may lead to improvement in many natural language processing tasks including information extraction, question answering, text summarization and machine translation. Semantic role labeling systems usually take advantage of syntactic parsing and therefor the syntactic representation chosen affects the overall performance of the system. In this research, we present a semantic role labeling system based on full syntactic parsing. For this purpose, we use a dependency parser and machine learning methods. In our system, we have made an effort to overcome the problems of previous semantic role labelers for Persian, which all are based on shallow syntactic parsing. The outcome of the system is promising.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-279-en.pdf</fullTextUrl>
	<keywords>
	<keyword>semantic role labeling</keyword>
	<keyword>shallow semantic parsing</keyword>
	<keyword>dependency grammar</keyword>
	<keyword>Persian language</keyword>
	<keyword>natural language processing</keyword>
	<keyword>computational linguistics</keyword>
	</keywords>


	</record>
	<record>
	<language>per</language>
	<publisher>Research Center on Developing Advanced Technologies</publisher>
	<journalTitle>Signal and Data Processing</journalTitle>
	<issn>2538-4201</issn>
	<eissn>2538-421X</eissn>
	<publicationDate>2016-06</publicationDate>
	<volume>13</volume>
	<issue>1</issue>
	<startPage>39</startPage>
	<endPage>56</endPage>
	<documentType>article</documentType>
	<title language="eng">Deep Modular Neural Networks with Double Spatio-temporal َAssociation Structure for Persian Continuous Speech Recognition</title>


	<authors>
	<author>
	<name>Zohreh Ansari</name>
	<email>z_ansari@aut.ac.ir</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name>Ali Seyyedsalehi</name>
	<email>ssalehi@aut.ac.ir</email>
	<affiliationId>2</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
             Amirkabir University of Technology    
	      </affiliationName>
	      <affiliationName affiliationId="2">
             Amirkabir University of Technology    
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">In this article, growable deep modular neural networks for continuous speech recognition are introduced. These networks can be grown to implement the spatio-temporal information of the frame sequences at their input layer as well as their labels at the output layer at the same time. The trained neural network with such double spatio-temporal association structure can learn the phonetic sequence subspace. Therefore, it can filter out invalid phonetic sequences in its own structure and output valid sequences. To evaluate the performance of these growable neural networks, we used FARSDAT and BIG FARSDAT datasets. Experimental results on FARSDAT show that deep modular neural networks outperform the phone accuracy rate of GMM-HMM models with an absolute improvement of 2.7%. Moreover, developing deep modular neural networks to a double spatio-temporal association structure improves their result by 5.1%. As there is no phonetic labeling for BIG FARSDAT, a semi-supervised learning algorithm is proposed to fine-tune the neural network with double spatio-temporal structure on this dataset, which achieves a comparable result with HMMs.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-277-en.pdf</fullTextUrl>
	<keywords>
	<keyword>Deep neural networks</keyword>
	<keyword>Modular neural networks</keyword>
	<keyword>Pre-training</keyword>
	<keyword>Semi-supervised learning</keyword>
	<keyword>Continuous speech recognition</keyword>
	</keywords>


	</record>
	<record>
	<language>per</language>
	<publisher>Research Center on Developing Advanced Technologies</publisher>
	<journalTitle>Signal and Data Processing</journalTitle>
	<issn>2538-4201</issn>
	<eissn>2538-421X</eissn>
	<publicationDate>2016-06</publicationDate>
	<volume>13</volume>
	<issue>1</issue>
	<startPage>57</startPage>
	<endPage>70</endPage>
	<documentType>article</documentType>
	<title language="eng">Fast estimation of warping factor in the vocal tract length normalization using obtained scores of gender detection modeling</title>


	<authors>
	<author>
	<name>Yasser Shekofteh</name>
	<email>y_shekofteh@yahoo.com</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name>Hasan Gholipor</name>
	<email>y_shekofteh</email>
	<affiliationId>2</affiliationId>
	 </author>
	<author>
	<name>M.Mohsen Goodarzi</name>
	<email>y_shekofteh</email>
	<affiliationId>3</affiliationId>
	 </author>
	<author>
	<name>Jahanshah kabudian</name>
	<email>y_shekofteh</email>
	<affiliationId>4</affiliationId>
	 </author>
	<author>
	<name>Farshad Almasganj</name>
	<email>y_shekofteh</email>
	<affiliationId>5</affiliationId>
	 </author>
	<author>
	<name>Shaghayegh Reza</name>
	<email>y_shekofteh</email>
	<affiliationId>6</affiliationId>
	 </author>
	<author>
	<name>Iman Sarraf</name>
	<email>y_shekofteh</email>
	<affiliationId>7</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
             rcdat    
	      </affiliationName>
	      <affiliationName affiliationId="2">
             rcdat    
	      </affiliationName>
	      <affiliationName affiliationId="3">
             rcdat    
	      </affiliationName>
	      <affiliationName affiliationId="4">
             rcdat    
	      </affiliationName>
	      <affiliationName affiliationId="5">
             rcdat    
	      </affiliationName>
	      <affiliationName affiliationId="6">
             rcdat    
	      </affiliationName>
	      <affiliationName affiliationId="7">
             rcdat    
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">The performance of automatic speech recognition (ASR) systems is adversely affected by the variations in speakers, audio channels and environmental conditions. Making these systems robust to these variations is still a big challenge. One of the main sources of variations in the speakers is the differences between their Vocal Tract Length (VTL). Vocal Tract Length Normalization (VTLN) is an effective method introduced to cope with this variation. In this method, the speech spectrum of each speaker is frequency warped according to a specific warping factor of that speaker.&#160;In this paper, we first developed the common search-based method to obtain the appropriate warping factor over a HMM-based Persian continuous speech recognition system. Then pointing out the computational cost of search-based method, we proposed a linear regression process for estimating warping factor based on the scores generated by our gender detection system. Experimental results over a Persian conversational speech database shown an improvement about 0.54 percent in word recognition accuracy as well as a significant reduction in computational cost of estimating warping factor, compared to search-based approach.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-254-en.pdf</fullTextUrl>
	<keywords>
	<keyword>speech recognition</keyword>
	<keyword>Vocal Tract Length Normalization</keyword>
	<keyword>gender detection</keyword>
	<keyword>linear regression</keyword>
	<keyword>warping factor</keyword>
	</keywords>


	</record>
	<record>
	<language>per</language>
	<publisher>Research Center on Developing Advanced Technologies</publisher>
	<journalTitle>Signal and Data Processing</journalTitle>
	<issn>2538-4201</issn>
	<eissn>2538-421X</eissn>
	<publicationDate>2016-06</publicationDate>
	<volume>13</volume>
	<issue>1</issue>
	<startPage>71</startPage>
	<endPage>85</endPage>
	<documentType>article</documentType>
	<title language="eng">Design a Sentence Based Plagiarism Detection System by Evidences Fusion in Persian Text</title>


	<authors>
	<author>
	<name>Hamid Ahangarbahan</name>
	<email></email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name>Gholam Ali Montazer</name>
	<email>montazer@modares.ac.ir</email>
	<affiliationId>2</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
             Tarbiat Modares University    
	      </affiliationName>
	      <affiliationName affiliationId="2">
             Tarbiat Modares University    
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">Today, there are many documents on Internet, such that users can generate new documents by coping them and existing Plagiarism Detection systems (PDS) couldn&#39;t detect all kind of plagiarism. The main challenge is finding a suitable algorithm to improving the amount of similar documents and their assessing time. It&#8217;s difficult to do assessing similarity in Persian texts that different characteristics affect on it and also many of them are ambiguous. For this reason Dempster - Shefer (Evidence) theory has been used in this paper. The proposed system will assess in a two-level and in the first stage, sentences will divide in general and expert terms and then assessing by suitable measures and domain ontology. These results will be delivered to first level as &#34;basic belief&#34; and will be integrated by using a Dempster combination rule to create one of the second level inputs. In second level, the previous level result and another similarity measures will be weighted and combined belief and plausibility functions for final assessment will be distinguished. This system has been used for real data assessment and compared the actual results shows that the precision between the system results and actual results is about 90%, which implies that the system can be used as Plagiarism Detection System.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-276-en.pdf</fullTextUrl>
	<keywords>
	<keyword>Plagiarism</keyword>
	<keyword>Data fusion</keyword>
	<keyword>Evidence theory</keyword>
	<keyword>Similarity Measures</keyword>
	<keyword>Semantic Similarity</keyword>
	</keywords>


	</record>
	<record>
	<language>per</language>
	<publisher>Research Center on Developing Advanced Technologies</publisher>
	<journalTitle>Signal and Data Processing</journalTitle>
	<issn>2538-4201</issn>
	<eissn>2538-421X</eissn>
	<publicationDate>2016-06</publicationDate>
	<volume>13</volume>
	<issue>1</issue>
	<startPage>87</startPage>
	<endPage>100</endPage>
	<documentType>article</documentType>
	<title language="eng">Improved Clustering Persian Text Based on Keyword Using Linguistic and Thesaurus Knowledge</title>


	<authors>
	<author>
	<name> </name>
	<email>parvin@iust.ac.ir</email>
	<affiliationId>1</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
                 
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">Persian words in writing with a diverse and cover all modes of grammatical words with the recruitment of a series of specific rules because it is impossible to extract keywords automatically from Persian texts difficult and complex. This thesis has attempted to use linguistic information and thesaurus, keywords Mnatry be provided. Using the symbol system is structured network can be keywords, including the exchange of words, words and words with hierarchical relationships complete the package has increased. Therefore the agreement between users and search keywords text search and recall is increased. In the first stage non-important words are removed and the public. Supervision in the text are words and more words to clarify the relative importance of using a blower numerical weight is assigned to each word that indicates the effectiveness of the word in connection with the subject and compared with the other words used in the text. Particularly complex operation that makes use of thesaurus keywords are extracted Mnytry that kind of hierarchical category scientific literature in the field of information retrieval is indicated. Test results on different topics several text accurately represents the proposed method and the ability to extract the keywords in accordance with user demand.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-139-en.pdf</fullTextUrl>
	<keywords>
	<keyword>Keyword Extraction</keyword>
	<keyword>Thesaurus</keyword>
	<keyword>Computational Linguistic</keyword>
	<keyword>Information Retrieval</keyword>
	</keywords>


	</record>
	<record>
	<language>per</language>
	<publisher>Research Center on Developing Advanced Technologies</publisher>
	<journalTitle>Signal and Data Processing</journalTitle>
	<issn>2538-4201</issn>
	<eissn>2538-421X</eissn>
	<publicationDate>2016-06</publicationDate>
	<volume>13</volume>
	<issue>1</issue>
	<startPage>101</startPage>
	<endPage>114</endPage>
	<documentType>article</documentType>
	<title language="eng">Construction and Training of Artificial Neural Networks using Evolution Strategy with Parallel Populations</title>


	<authors>
	<author>
	<name>Fardin Ahmadizar</name>
	<email>f.ahmadizar@uok.ac.ir</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name>Khabat Soltanian</name>
	<email></email>
	<affiliationId>2</affiliationId>
	 </author>
	<author>
	<name>Fardin AkhlaghianTab</name>
	<email></email>
	<affiliationId>3</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
                 
	      </affiliationName>
	      <affiliationName affiliationId="2">
                 
	      </affiliationName>
	      <affiliationName affiliationId="3">
                 
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">Application of artificial neural networks (ANN) in areas such as classification of images and audio signals shows the ability of this artificial intelligence technique for solving practical problems. Construction and training of ANNs is usually a time-consuming and hard process. A suitable neural model must be able to learn the training data and also have the generalization ability. In this paper, multiple parallel populations are used for construction of ANN and evolution strategy for its training, so that in each population a particular ANN architecture is evolved. By using a bi-criteria selection method based on error and complexity of ANNs, the proposed algorithm can produce simple ANNs that have high generalization ability. To assess the performance of the algorithm, 7 benchmark classification problems have been used. It has then been compared against the existing evolutionary algorithms that train and/or construct ANNs. Experimental results show the efficiency and robustness of the proposed algorithm compared to the other methods. In this paper, the impact of parallel populations, the bi-criteria selection method, and the crossover operator on the algorithm performance has been analyzed. A key advantage of the proposed algorithm is the use of parallel computing by means of multiple populations.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-110-en.pdf</fullTextUrl>
	<keywords>
	<keyword>Artificial Neural Networks</keyword>
	<keyword>Evolution Strategy</keyword>
	<keyword>Parallel Populations</keyword>
	</keywords>


	</record>
	<record>
	<language>per</language>
	<publisher>Research Center on Developing Advanced Technologies</publisher>
	<journalTitle>Signal and Data Processing</journalTitle>
	<issn>2538-4201</issn>
	<eissn>2538-421X</eissn>
	<publicationDate>2016-06</publicationDate>
	<volume>13</volume>
	<issue>1</issue>
	<startPage>115</startPage>
	<endPage>125</endPage>
	<documentType>article</documentType>
	<title language="eng">Hyperspectral Images Sub-Pixel Classification Based on Pixel-Swapping Algorithm Extension and Its Evaluation</title>


	<authors>
	<author>
	<name> </name>
	<email>hamid_dehyahoo.com</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name> </name>
	<email>ahmad.madanchi@gmail.com</email>
	<affiliationId>2</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
                 
	      </affiliationName>
	      <affiliationName affiliationId="2">
                 
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">The capability of the matter identification is developed considerably in hyperspectral images. The spectral reflectance of surfaces in these imaging systems in the visible and near infrared range of the electromagnetic spectrum is recorded in extremely narrow and continuous bands. But for some reasons, such as existence the mixed pixels and low spatial resolution of these images, is difficult to land cover accurate position identify. The soft classification methods provide the estimation of the membership value of various classes within mixed pixels. But, by using these methods, the matter information extraction is possible only and position information extraction in sub-pixel level is impossible. In recent years, in order to solve this problem, some methods that are called SRM, have been developed for positioning the extracted membership values by soft classification process in sub-pixels for producing a higher spatial resolution land use map. In this paper, pixel-swapping method is used as the latest SRM algorithms, and with repetition the binary case of this algorithm for each class, this algorithm has been generalized and developed for multi-class. Another main point in sub-pixel classification is the performance evaluation of these classifiers. Because of the influence of various parameters in the sub-pixel classification, the evaluation of this process is very complex. Hence, as a main and innovative activity in this paper, the Influence of the neighborhood level and the zoom factor as two important parameters in the extension pixel-swapping method has been simulated and analyzed. For this purpose, in this paper a framework for evaluating the sub-pixel classification performance based on dependent on and independent on soft classification error is proposed.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-30-en.pdf</fullTextUrl>
	<keywords>
	<keyword>Hyperspectral image</keyword>
	<keyword>Sub-pixel classification</keyword>
	<keyword>Sub-pixel classification evaluation</keyword>
	<keyword>Pixel-swapping method</keyword>
	<keyword>SRM algorithm</keyword>
	</keywords>


	</record>
	<record>
	<language>per</language>
	<publisher>Research Center on Developing Advanced Technologies</publisher>
	<journalTitle>Signal and Data Processing</journalTitle>
	<issn>2538-4201</issn>
	<eissn>2538-421X</eissn>
	<publicationDate>2016-06</publicationDate>
	<volume>13</volume>
	<issue>1</issue>
	<startPage>127</startPage>
	<endPage>138</endPage>
	<documentType>article</documentType>
	<title language="eng">A New Approach to Retinal Vessel Segmentation by Using Computational Model of Simple Cells in Primary Visual Cortex</title>


	<authors>
	<author>
	<name>Mohsen Zardadi</name>
	<email>zardadi@birjand.ac.ir</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name>Naser Mehrshad</name>
	<email>nmehrshad@birjand.ac.ir</email>
	<affiliationId>2</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
                 
	      </affiliationName>
	      <affiliationName affiliationId="2">
             Faculty of Engineering    
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">In this paper, a new unsupervised algorithm for automatic retinal blood vessel extraction is presented. A pre-processing step is introduced to eliminating optic disk and back ground noise. Blood vessel highlighting is prepared by a new method inspired by simple cells in human visual system. An adaptive threshold is introduced as an activation function of simple cells. Post-processing step is used as a final stage at the output of simple cells to eliminating exudates which is detected as blood vessels. The results on DRIVE database demonstrate that the performance of the proposed algorithm is comparable with state-of-the-art techniques in terms of execution time and extracted vessels.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-230-en.pdf</fullTextUrl>
	<keywords>
	<keyword>retinal vessel segmentation</keyword>
	<keyword>medical assistance systems</keyword>
	<keyword>retinal simple cell model</keyword>
	<keyword>DRIVE database</keyword>
	</keywords>


	</record>
 </records>
 
  
  
  
  
 