Search results for: Foroozandeh Zardashti

Authors: Iran Kalbasi, Foroozandeh Zardashti

Abstract:

Dialectology is a branch of social linguistics that studies systematic language variations. Dialects are the branches of a unique language that have structural, morphological and phonetic differences with each other. In Iran, these dialects and language variations themselves have a lot of cultural loads, and studying them have linguistic and cultural importance. In this study, phonetic structure of two Iranian dialects, Bakhtiyari Lori of Masjedsoleyman and Shushtari in Khuzestan Province of Iran have been surveyed. Its statistical community includes twenty speakers of two dialects. The theoretic bases of this research is based on structuralism. Its data have been collected by interviewing the questionnaire that consist of 3000 words, 410 sentences and 110 complex and simple verbs. These datas are analysed and described synchronically. Then, the phonetic characteristics of these two dialects and standard Persian have been compared. Therefore, we can say that in phonetic level of these two dialects and standard Persian, there are clearly differences.

Keywords: standard language, dialectology, bakhtiyari lori dialect of Masjedsoleyman, Shushtari dialect, vowel, consonant

Procedia PDF Downloads 557

Authors: Ali Pour Yazdanpanah, Farideh Foroozandeh Shahraki, Emma Regentova

Abstract:

The reconstruction from sparse-view projections is one of important problems in computed tomography (CT) limited by the availability or feasibility of obtaining of a large number of projections. Traditionally, convex regularizers have been exploited to improve the reconstruction quality in sparse-view CT, and the convex constraint in those problems leads to an easy optimization process. However, convex regularizers often result in a biased approximation and inaccurate reconstruction in CT problems. Here, we present a nonconvex, Lipschitz continuous and non-smooth regularization model. The CT reconstruction is formulated as a nonconvex constrained L1 − L2 minimization problem and solved through a difference of convex algorithm and alternating direction of multiplier method which generates a better result than L0 or L1 regularizers in the CT reconstruction. We compare our method with previously reported high performance methods which use convex regularizers such as TV, wavelet, curvelet, and curvelet+TV (CTV) on the test phantom images. The results show that there are benefits in using the nonconvex regularizer in the sparse-view CT reconstruction.

Keywords: computed tomography, non-convex, sparse-view reconstruction, L1-L2 minimization, difference of convex functions

Procedia PDF Downloads 279