<?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-03</publicationDate>
	<volume>12</volume>
	<issue>4</issue>
	<startPage>3</startPage>
	<endPage>15</endPage>
	<documentType>article</documentType>
	<title language="eng">A Fast and Hybrid Boundary Matching Algorithm for Temporal Error Concealment of Video Data</title>


	<authors>
	<author>
	<name>Seyed Mojtaba Marvasti-Zadeh</name>
	<email>mojtaba.marvasti@stu.yazd.ac.ir</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name>Hossein Ghanei yakhdan</name>
	<email>hghaneiy@yazd.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">Despite data resilient methods against error that are applied on video data in transmitter side, occurringerror along video data transferring for communication channels is inevitable. Error concealment is a useful method for improving the quality of damaged videos in receiver side. In this paper, a fast and hybrid boundary matching algorithm is presented for more accurate estimating of damaged motion vectors (MVs) from received video. The proposed algorithm performs the error concealment for each damaged macroblock (MB) according to the preference list of error concealment that it assigns. Then, boundary distortion for each candidate MBis calculated with classic and outer boundary matching criterionsfor each boundary pixel. After reconstructing of each damaged MB, the list of preference is updated. Moreover, depending on accuracy of each adjacent boundary from damaged MB, a special weight is given to them, through match process. Finally, the candidate MVwith the lowest boundary distortion is selected as MV of damaged MB. Experimental results show that the proposed algorithm increases the average of PSNR for different test sequences more than 1.8 dB in comparison with reference methods and without significant increasing in calculation time and with improving the quality of reconstructed videos.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-173-en.pdf</fullTextUrl>
	<keywords>
	<keyword>Temporal Error Concealment</keyword>
	<keyword>Motion Vector Estimation</keyword>
	<keyword>Hybrid Boundary Matching Algorithm</keyword>
	<keyword>Macroblock</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-03</publicationDate>
	<volume>12</volume>
	<issue>4</issue>
	<startPage>17</startPage>
	<endPage>31</endPage>
	<documentType>article</documentType>
	<title language="eng">Fall Detection Using Novel Tracking Method Based on Modified Contour Algorithm</title>


	<authors>
	<author>
	<name>Hamid Rajabi</name>
	<email>hamidrajabi2010@yahoo.com</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name>Manoochehr Nahvi</name>
	<email>, nahvi@guilan.ac.ir</email>
	<affiliationId>2</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
             University of Guilan    
	      </affiliationName>
	      <affiliationName affiliationId="2">
             University of Guilan    
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">The population of elderly people has growing trend in the developed or developing countries. Since the elderly are mainly associated with disability, this group of people exposed to dangerous events such as falling down. It is therefore needed to take care of these people against dangerous events. Intelligent video monitoring is a approach that may be able to give quick notification to the caregivers. For this purpose, in this paper, an approach using a novel tracking method based on modified contour algorithm is presented. The new method is able to conduct tracking and falling down detection in a realistic conditions in the presence of multiple motions. Simulations indicate that the proposed algorithm is able to identify the fall-down event with high accuracy and speed.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-183-en.pdf</fullTextUrl>
	<keywords>
	<keyword>fall detection algorithm</keyword>
	<keyword>contour</keyword>
	<keyword>machine vision</keyword>
	<keyword>tracking</keyword>
	<keyword>intelligent surveillance systems.</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-03</publicationDate>
	<volume>12</volume>
	<issue>4</issue>
	<startPage>33</startPage>
	<endPage>42</endPage>
	<documentType>article</documentType>
	<title language="eng">Improving Heuristic Guess and Determine Attack on TIPSY and SNOW 1.0 Stream Ciphers</title>


	<authors>
	<author>
	<name>Mohammad Sadegh Nemati Nia</name>
	<email>r.t1390razavie@chmail.ir</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name> </name>
	<email></email>
	<affiliationId>2</affiliationId>
	 </author>
	<author>
	<name> </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">Guess and determine attacks are general attacks on stream ciphers. These attacks are classified into ad-hoc and Heuristic Guess and Determine (HGD) attacks. One of the Advantages of HGD attack algorithm over ad-hoc attack is that it is designed algorithmically for a large class of stream ciphers while being powerful. In this paper, we use auxiliary polynomials in addition to the original equations as the inputs to the HGD attack on TIPSY and SNOW 1.0 stream ciphers. Based on the concept of guessed basis, the number of guesses in both HGD attack and the improved one on TIPSY is six, however the attack complexity is reduced from O(2102)to O(296). This amount is equal to that of ad-hoc attack, but the size of the guessed basis is improved from seven to six. Also, the complexity of GD attack on SNOW 1.0 of heuristic one with the guessed basis of size 6 and ad-hoc attack with the guessed basis of size 7areO(2202) and O(2224), respectively. However, the complexity and the size of guessed basis of the improved HGD attack are reduced to O(2160) and 5, respectively.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-261-en.pdf</fullTextUrl>
	<keywords>
	<keyword>Stream Cipher</keyword>
	<keyword>Guess and Determine attack</keyword>
	<keyword>TIPSY</keyword>
	<keyword>SNOW 1.0</keyword>
	<keyword>Computational Complexity</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-03</publicationDate>
	<volume>12</volume>
	<issue>4</issue>
	<startPage>43</startPage>
	<endPage>52</endPage>
	<documentType>article</documentType>
	<title language="eng">Sharif Text Editor: A Persian Editor and Spell Checker System</title>


	<authors>
	<author>
	<name> </name>
	<email>bahram@sharif.edu</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name> </name>
	<email></email>
	<affiliationId>2</affiliationId>
	 </author>
	<author>
	<name> </name>
	<email></email>
	<affiliationId>3</affiliationId>
	 </author>
	<author>
	<name> </name>
	<email></email>
	<affiliationId>4</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
                 
	      </affiliationName>
	      <affiliationName affiliationId="2">
                 
	      </affiliationName>
	      <affiliationName affiliationId="3">
                 
	      </affiliationName>
	      <affiliationName affiliationId="4">
                 
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">In this paper, we will introduce an intelligent system to edit and spell check Persian texts. The goal is editing and preprocessing Persian texts for natural language processing tasks. This system is based on an expandable and engineering approach and is composed of three subsystems: Persian text editor, spell checker and stemmer. These parts interact with each other to edit texts. To do this, the stemmer subsystem process each word in the text if the subsystem could not find a stem in the lexicon, the word will be recognized as an incorrect word. Then, the spell checker provides a list of suggestions to correct the wrong word. Subsequently, the editor subsystem edits the text based on the standards of the Academy of Persian Language and Literature. Our evaluation shows nearly 92%, 95% and 96% precision numbers for editor, stemmer and spell checker subsystems, respectively.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-250-en.pdf</fullTextUrl>
	<keywords>
	<keyword>Key words: Natural Language Processing</keyword>
	<keyword>automatic spell checking</keyword>
	<keyword>text editor</keyword>
	<keyword>stemmer</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-03</publicationDate>
	<volume>12</volume>
	<issue>4</issue>
	<startPage>53</startPage>
	<endPage>65</endPage>
	<documentType>article</documentType>
	<title language="eng">Supervised Probabilistic Principal Component Analysis Mixture Model in a Lossless Dimensionality Reduction Framework for Face Recognition</title>


	<authors>
	<author>
	<name>Somayeh Ahmadkhani</name>
	<email>s.ahmadkhani@eng.ui.ac.ir</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name>Peyman Adibi</name>
	<email>adibi@eng.ui.ac.ir</email>
	<affiliationId>2</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
             University of Isfahan    
	      </affiliationName>
	      <affiliationName affiliationId="2">
             University of Isfahan    
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">In this paper, we first proposed the supervised version of probabilistic principal component analysis mixture model. Then, we consider a learning predictive model with projection penalties, as an approach for dimensionality reduction without loss of information for face recognition. In the proposed method, first a local linear underlying manifold of data samples is obtained using the supervised probabilistic principal component analysis mixture model. Then, a support vector machine classifier with projection penalty is trained as a predictive model using this local linear manifold. Thus, the predictive model benefits from dimensionality reduction, while it loses minimum amount of useful information. To evaluate the proposed method, we used well-known face recognition databases. Gabor feature extraction method have been applied to these images. The experimental results show that the proposed method has a higher classification accuracy than many of the traditional methods which use predictive models after dimensionality reduction. It also works better than the projection penalty method with linear or nonlinear based dimensionality reduction models.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-259-en.pdf</fullTextUrl>
	<keywords>
	<keyword>Lossless Dimensionality Reduction</keyword>
	<keyword>Mixture Model</keyword>
	<keyword>Probabilistic Principal Component Analysis</keyword>
	<keyword>Supervised</keyword>
	<keyword>Projection Penalty</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-03</publicationDate>
	<volume>12</volume>
	<issue>4</issue>
	<startPage>67</startPage>
	<endPage>81</endPage>
	<documentType>article</documentType>
	<title language="eng">Structural parameter extraction of warp and weft woven fabric using wavelet-fuzzy method and genetic algorithm</title>


	<authors>
	<author>
	<name>Foruzan Fasahat</name>
	<email>ffesahat@yahoo.com</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name>Pedram Payvandy</name>
	<email>peivandi@yazd.ac.ir</email>
	<affiliationId>2</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
                 
	      </affiliationName>
	      <affiliationName affiliationId="2">
                 
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">Flexibility of woven fabric structure has caused many errors in yarn location detection using customary methods of image processing. On this line, proposing an adaptive method with fabric image properties is concentrated to extract its parameters. In this regards, using meta-heuristic algorithms seems applicable to correspond extraction algorithm of structural parameters to the image conditions. In this study, a new method is proposed for woven fabric image preprocessing and structural texture detection applying compound methods of signal processing, fuzzy clustering and genetic algorithm. Results indicate that proposed method is capable of detecting exact yarn location with mean precision of more than 73 percent in double-layered fabric images with uneven color pattern. In one-layered fabric images with low density weave and invariable color pattern, the mean precision is more than 84 percent.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-262-en.pdf</fullTextUrl>
	<keywords>
	<keyword>Genetic Algorithm</keyword>
	<keyword>Wavelet Transform</keyword>
	<keyword>Fuzzy c-means (FCM) clustering</keyword>
	<keyword>Image Processing</keyword>
	<keyword>Fabric Image</keyword>
	<keyword>Yarn Location.</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-03</publicationDate>
	<volume>12</volume>
	<issue>4</issue>
	<startPage>83</startPage>
	<endPage>94</endPage>
	<documentType>article</documentType>
	<title language="eng">automatic gender identification in persian text</title>


	<authors>
	<author>
	<name> </name>
	<email>meh_mor2003@yahoo.com</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name> </name>
	<email>bahrani@sharif.edu</email>
	<affiliationId>2</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
                 
	      </affiliationName>
	      <affiliationName affiliationId="2">
                 
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">Gigantic amount of textual data being transfers in web everyday. like other communities,cyberspace is vulnerable to attacks, false information and deception.it becomes increasingly important to design an efficient method to trace identity in this community.to investigate the problem of gender identification,we propose 48 feature,and design three machine learning algorithms.the results of study showed that ADtree classifier had accuracy up to 73.8%.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-104-en.pdf</fullTextUrl>
	<keywords>
	<keyword>gender identification</keyword>
	<keyword>author identification</keyword>
	<keyword>text mining</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-03</publicationDate>
	<volume>12</volume>
	<issue>4</issue>
	<startPage>95</startPage>
	<endPage>115</endPage>
	<documentType>article</documentType>
	<title language="eng">A Rule-Based Approach in Converting a Dependency Parse Tree into Phrase Structure Parse Tree for Persian</title>


	<authors>
	<author>
	<name>Fatemeh Soltanzadeh</name>
	<email>fatemeh.slt@gmail.com</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name>Mohammad Bahrani</name>
	<email>bahrani@sharif.edu</email>
	<affiliationId>2</affiliationId>
	 </author>
	<author>
	<name>Moharram Eslami</name>
	<email>meslami@znu.ac.ir</email>
	<affiliationId>3</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
             Sharif University of technology    
	      </affiliationName>
	      <affiliationName affiliationId="2">
             Sharif University of technology    
	      </affiliationName>
	      <affiliationName affiliationId="3">
             University of Zanjan    
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">In this paper, an automatic method in converting a dependency parse tree into an equivalent phrase structure one, is introduced for the Persian language. In first step, a rule-based algorithm was designed. Then, Persian specific dependency-to-phrase structure conversion rules merged to the algorithm. Subsequently, the Persian dependency treebank with about 30,000 sentences was used as an input for the algorithm and an equivalent phrase structure treebank was extracted. Finally, the statistical Stanford parser was trained using the developed treebank. Experimental results show a F1 of 96.05% for the conversion algorithm and an F1 of 86.01% for Persian factored model parser.</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-272-en.pdf</fullTextUrl>
	<keywords>
	<keyword>Conversion</keyword>
	<keyword>Dependency Grammar</keyword>
	<keyword>Phrase Structure Grammar</keyword>
	<keyword>Natural Language Processing</keyword>
	<keyword>Treebank</keyword>
	<keyword>Persian.</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-03</publicationDate>
	<volume>12</volume>
	<issue>4</issue>
	<startPage>117</startPage>
	<endPage>125</endPage>
	<documentType>article</documentType>
	<title language="eng">farsi word sense disambiguation with LDA Topic model</title>


	<authors>
	<author>
	<name> </name>
	<email>babakmasoudi282@yahoo.com</email>
	<affiliationId>1</affiliationId>
	 </author>
	<author>
	<name>saeid rahati ghochani</name>
	<email>RahatiMshdiau.ac.ir</email>
	<affiliationId>2</affiliationId>
	 </author>
	</authors>
	 <affiliationsList>
	      <affiliationName affiliationId="1">
                 
	      </affiliationName>
	      <affiliationName affiliationId="2">
                 
	      </affiliationName>
    </affiliationsList>


	<abstract language="eng">Word sense disambiguation is the task of identifying the correct sense for the word in a given context among a finite set of possible sense. In this paper a model for farsi word sense disambiguation is presented. The model use two group of features: first, all word and stop words around target word and topic models as second features. We extract topics from a farsi corpus with Latent Dirichlet Allocation (LDA) model. The system with a maximum entropy model achieved 97.67% precision for 4 high frequently farsi homograph words</abstract>
	<fullTextUrl format="pdf">http://jsdp.rcisp.ac.ir/article-1-58-en.pdf</fullTextUrl>
	<keywords>
	<keyword>Latent Dirichlet Allocation(LDA)</keyword>
	<keyword>Topic Model</keyword>
	<keyword>Maximum Entropy</keyword>
	<keyword>Word Sense Disambiguation</keyword>
	</keywords>


	</record>
 </records>
 
  
  
  
  
 