<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" 

"journalpublishing3.dtd">

<article 
article-type="research-article"
dtd-version="3.0" xml:lang="en" 
xmlns:mml="http://www.w3.org/1998/Math/MathML"
xmlns:xlink="http://www.w3.org/1999/xlink" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
>

<front>

<journal-meta>

  <journal-id journal-id-type="publisher">1</journal-id>
  <issn>2538-4201</issn>

  <publisher>

	<publisher-name>Research Center on Developing Advanced Technologies</publisher-name>
  </publisher>

</journal-meta>



<article-meta>

  <article-id pub-id-type="publisher-id">714</article-id>

  <article-categories>
	<subj-group>
	  <subject>Paper</subject>

	</subj-group>
  </article-categories>

  <title-group>
	<article-title>Pars Morph: A Persian Morphological Analyzer</article-title>

  </title-group>

  


  <contrib-group>

  
	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname>Mavaji</surname>
		<given-names>Vahid</given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname>Vazirnezhad</surname>
		<given-names>Bahram</given-names>
	  </name> 
	</contrib> 
	

  </contrib-group>

  
			<aff>

			
	</aff>
 
 
  


  <pub-date pub-type="pub">

	<day>1</day>
	<month>9</month>

	<year>2011</year>

  </pub-date>

  <volume>8</volume>

  <issue>1</issue>

  <fpage>3</fpage>

  <lpage>8</lpage>

  
			  <history>

				<date date-type="received">

				  <day>22</day>
				  <month>09</month>
				  <year>2011</year>
				</date>

			  </history>

		
			  <history>

				<date date-type="accepted">

				  <day>19</day>
				  <month>02</month>
				  <year>2018</year>
				</date>

			  </history>

		
</article-meta>

</front>



<body>

In this paper, the theoretical foundation, the way of implementation and the uses of Pars Morph, a Persian morphological analyzer is introduced. Pars Morph is a rule-based Persian morphological analysis system, which analyzes the internal structure of word in Persian and determines the grammatical category and function of the word parts. Pars Morph being in link with a lexicon covering about 45000 lexemes and based on morphological rules in Persian can analyze the structure of complex lexemes and their possible inflected forms and even out-of-lexicon words. Accuracy rate of the first version of Pars Morph is about 95% which could be enhanced to 100% by applying the regulations on Persian language homographs, some syntactic features and typical features of Persian script. Pars Morph can be used in pure linguistics studies as well as in automatic analysis of Persian language.
</body>

</article>


  <article-id pub-id-type="publisher-id">708</article-id>

  <article-categories>
	<subj-group>
	  <subject>Paper</subject>

	</subj-group>
  </article-categories>

  <title-group>
	<article-title>The role of Time Conjunctions in the Identification of Temporal Relations between Tensed-Verb Events in the Contemporary Persian Corpus</article-title>

  </title-group>

  


  <contrib-group>

  
	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

  </contrib-group>

  
			<aff>

			
	</aff>
 
 
  


  <pub-date pub-type="pub">

	<day>1</day>
	<month>9</month>

	<year>2011</year>

  </pub-date>

  <volume>8</volume>

  <issue>1</issue>

  <fpage>9</fpage>

  <lpage>16</lpage>

  
			  <history>

				<date date-type="received">

				  <day>22</day>
				  <month>09</month>
				  <year>2011</year>
				</date>

			  </history>

		
			  <history>

				<date date-type="accepted">

				  <day>19</day>
				  <month>02</month>
				  <year>2018</year>
				</date>

			  </history>

		
</article-meta>

</front>



<body>

This paper involves in prediction of temporal relation between tensed-verb events on the basis of conjunctions in texts. For this purpose, tensed verb event data were extracted from Contemporary Persian Corpus and were examined carefully. The temporal relations between events were identified. After analyzing data on the basis of temporal relation according to Bird&#8217;s and Allen&#8217;s categorization, it was revealed that temporal conjunctions can be categorized in 4 categories: determined, biased, pseudo random and random. Determined signals can predicate the temporal relation between the events accurately. Biased signals predicate one set of relations with a good estimation, Pseudo random signals doesn&#8217;t show any orientation toward any kinds of temporal relation and random signals make almost all kinds of relations possible. The results show that Bird&#8217;s prediction on the basis of signals is more desirable than Allen&#8217;s.

																		
																		&#160;
</body>

</article>


  <article-id pub-id-type="publisher-id">713</article-id>

  <article-categories>
	<subj-group>
	  <subject>Paper</subject>

	</subj-group>
  </article-categories>

  <title-group>
	<article-title>Using Persian Stemmer in Information Retrieval System</article-title>

  </title-group>

  


  <contrib-group>

  
	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname>Faili</surname>
		<given-names>Heshaam</given-names>
	  </name> 
	</contrib> 
	

  </contrib-group>

  
			<aff>

			
	</aff>
 
 
  


  <pub-date pub-type="pub">

	<day>1</day>
	<month>9</month>

	<year>2011</year>

  </pub-date>

  <volume>8</volume>

  <issue>1</issue>

  <fpage>17</fpage>

  <lpage>24</lpage>

  
			  <history>

				<date date-type="received">

				  <day>22</day>
				  <month>09</month>
				  <year>2011</year>
				</date>

			  </history>

		
			  <history>

				<date date-type="accepted">

				  <day>19</day>
				  <month>02</month>
				  <year>2018</year>
				</date>

			  </history>

		
</article-meta>

</front>



<body>

Using the language-specific behavior in information retrieval systems can improve the quality of the retrieved results significantly. Part of the word that remains after removing its affixes is called stem. Stemming process can be used for improving the relevancy of the results in information retrieval system. Different morphological variants of words (plural, past tense&#8230;) will be mapped into their stem which can be used in the searching process of information retrieval tasks. Using the stem instead of the surface of the word reduces the size of the index file significantly. In this paper, an algorithm for stemming Persian words is described and its effect on information retrieval system is evaluated with different ranking methods. By using Persian Porter stemmer with just 43 rules, the size of index file reduced about 5% while the mean average precision of the retrieval information system improved about 5%.
</body>

</article>


  <article-id pub-id-type="publisher-id">711</article-id>

  <article-categories>
	<subj-group>
	  <subject>Paper</subject>

	</subj-group>
  </article-categories>

  <title-group>
	<article-title>Image Enhancement Using Gamma Correction</article-title>

  </title-group>

  


  <contrib-group>

  
	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

  </contrib-group>

  
			<aff>

			
	</aff>
 
 
  


  <pub-date pub-type="pub">

	<day>1</day>
	<month>9</month>

	<year>2011</year>

  </pub-date>

  <volume>8</volume>

  <issue>1</issue>

  <fpage>25</fpage>

  <lpage>32</lpage>

  
			  <history>

				<date date-type="received">

				  <day>22</day>
				  <month>09</month>
				  <year>2011</year>
				</date>

			  </history>

		
			  <history>

				<date date-type="accepted">

				  <day>19</day>
				  <month>02</month>
				  <year>2018</year>
				</date>

			  </history>

		
</article-meta>

</front>



<body>

In this paper a new automatic method is presented to enhance the image brightness through gamma correction process. Most of current gamma correction methods apply a uniform gamma correction across the image. Considering the fact that gamma variation for a single image is actually nonlinear, the proposed method does the gamma correction in a local approach. Thus the method is able to estimate appropriate gamma values for different regions of the image using a neural network. After windowing several training images with known gamma values, the mean and texture of each window (responsible for brightness and contrast of the window) are computed to train the neural network. The same features will be extracted from the unknown image to estimate the correct gamma values of the different parts of the image. Unlike other gamma correction methods, the proposed method does not change the gamma values of an image which does not need any brightness enhancement. The experimental results prove its better performance over other gamma correction methods.
</body>

</article>


  <article-id pub-id-type="publisher-id">709</article-id>

  <article-categories>
	<subj-group>
	  <subject>Paper</subject>

	</subj-group>
  </article-categories>

  <title-group>
	<article-title>Improving face recognition from a single image per person via virtual images produced by imagination using neural networks</article-title>

  </title-group>

  


  <contrib-group>

  
	<contrib contrib-type="author">

	  <name>

		<surname>abdolali</surname>
		<given-names>fatemeh</given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname>dadashi</surname>
		<given-names>neda</given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname>SeyyedSalehi</surname>
		<given-names>SeyyedAli</given-names>
	  </name> 
	</contrib> 
	

  </contrib-group>

  
			<aff>

			
	</aff>
 
 
  


  <pub-date pub-type="pub">

	<day>1</day>
	<month>9</month>

	<year>2011</year>

  </pub-date>

  <volume>8</volume>

  <issue>1</issue>

  <fpage>33</fpage>

  <lpage>44</lpage>

  
			  <history>

				<date date-type="received">

				  <day>22</day>
				  <month>09</month>
				  <year>2011</year>
				</date>

			  </history>

		
			  <history>

				<date date-type="accepted">

				  <day>19</day>
				  <month>02</month>
				  <year>2018</year>
				</date>

			  </history>

		
</article-meta>

</front>



<body>

This paper deals with the problem of face recognition from a single image per person by producing virtual images using neural networks. To this aim, the person and variation information are separated and the associated manifolds are estimated using a nonlinear neural information processing model. For increasing the number of training samples in neural classifier, virtual images are produced for the neutral pose samples in a gallery dataset. By designing various structures of neural networks, the quality of virtually produced images, and consequently the recognition accuracy rate are improved. To obtain person information manifold codes giving better performance in describing the other persons and in generalizing, a learning method based on unsupervised clustering is presented. Applying this learning method and training classifier with virtual images, gives an accuracy rate of 83.63% on test dataset, which shows 12.73% improvement in comparison with training classifier using neutral pose samples.
</body>

</article>


  <article-id pub-id-type="publisher-id">707</article-id>

  <article-categories>
	<subj-group>
	  <subject>Paper</subject>

	</subj-group>
  </article-categories>

  <title-group>
	<article-title>Application of Blind Source Separation for Speech-Music Separation</article-title>

  </title-group>

  


  <contrib-group>

  
	<contrib contrib-type="author">

	  <name>

		<surname>Aghabozorgi sahaf</surname>
		<given-names>Masoud Reza</given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname>pishravian</surname>
		<given-names>arash</given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname>abutalebi</surname>
		<given-names>hamid reza</given-names>
	  </name> 
	</contrib> 
	

  </contrib-group>

  
			<aff>

			
	</aff>
 
 
  


  <pub-date pub-type="pub">

	<day>1</day>
	<month>9</month>

	<year>2011</year>

  </pub-date>

  <volume>8</volume>

  <issue>1</issue>

  <fpage>45</fpage>

  <lpage>54</lpage>

  
			  <history>

				<date date-type="received">

				  <day>22</day>
				  <month>09</month>
				  <year>2011</year>
				</date>

			  </history>

		
			  <history>

				<date date-type="accepted">

				  <day>19</day>
				  <month>02</month>
				  <year>2018</year>
				</date>

			  </history>

		
</article-meta>

</front>



<body>

In this paper, the application of the Independent Component Analysis In this paper, the application of the Independent Component Analysis technique in speech-music separation is discussed. The separation algorithm is in the time domain. It needs the score function estimation to minimize the mutual information. For estimating score function, sufficient samples of the mixed (speech-music) signals are needed. In other words, these samples must be included both original sources. Since the speech and music signals could contain the silent gaps, the frame selection is important in our problem. Our proposed method for selecting the optimum frame is based on the score function difference. The experimental results show good performance of the proposed method in elimination of the silent gaps. Also they express the separation algorithm based on Gaussian Mixture estimator achieves a better separation performance and less processing time compared to the separation algorithm based on Minimum Mean Square Error estimator.
</body>

</article>


  <article-id pub-id-type="publisher-id">712</article-id>

  <article-categories>
	<subj-group>
	  <subject>Paper</subject>

	</subj-group>
  </article-categories>

  <title-group>
	<article-title>Region-based Quality Improvement of Facial Images with Strong Shadows to Enhance Recognition</article-title>

  </title-group>

  


  <contrib-group>

  
	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

	<contrib contrib-type="author">

	  <name>

		<surname></surname>
		<given-names></given-names>
	  </name> 
	</contrib> 
	

  </contrib-group>

  
			<aff>

			
	</aff>
 
 
  


  <pub-date pub-type="pub">

	<day>1</day>
	<month>9</month>

	<year>2011</year>

  </pub-date>

  <volume>8</volume>

  <issue>1</issue>

  <fpage>55</fpage>

  <lpage>66</lpage>

  
			  <history>

				<date date-type="received">

				  <day>22</day>
				  <month>09</month>
				  <year>2011</year>
				</date>

			  </history>

		
			  <history>

				<date date-type="accepted">

				  <day>19</day>
				  <month>02</month>
				  <year>2018</year>
				</date>

			  </history>

		
</article-meta>

</front>



<body>

Varying illuminations, especially the side lighting effects in face images, is one of the major obstacles in face recognition systems. Various methods have been presented for face recognition under different lighting conditions witch require previous knowledge about Light source and shadow area. In this paper, a novel approach based on H-minima transform to image segmentation and illumination normalization is proposed. Firstly, shadow area is extracted and modified by multi-stage method. Then, the gradient based criteria used to determine the best pattern of shadow areas. Subsequently, the obtained pattern of shadow areas is used to improve Retinex method in obscure area, obvious area, and all areas of the face image. Experimental results on the Extended Yale B database show that the proposed method significantly improves the performance of Retinex method. Furthermore, it provides the effective results in illumination normalization even in extreme lighting conditions.
</body>

</article>

