• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1071-1084
• /
• 2008

The notion of intuitionistic fuzzy filters in ordered semigroups is introduced and relation between intuitionistic fuzzy filters and intuitionistic fuzzy prime ideals is investegated. The notion of intuitionistic fuzzy bi-ideal subsets and intuitionistic fuzzy bi-filters are provided and relation between intuitionistic fuzzy bi-filters and intuitionistic fuzzy prime bi-ideal subsets is established. The concept of intuitionistic fuzzy right filters(1eft filters) is given and their relation with intuitionistic fuzzy prime right (left) ideals is discussed.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1217-1225
• /
• 2010

In this paper we define fuzzy interior $\Gamma$-ideals in ordered $\Gamma$-semigroups. We prove that in regular(resp. intra-regular) ordered $\Gamma$-semigroups the concepts of fuzzy interior $\Gamma$-ideals and fuzzy $\Gamma$-ideals coincide. We prove that an ordered $\Gamma$-semigroup is fuzzy simple if and only if every fuzzy interior $\Gamma$-ideal is a constant function. We characterize intra-regular ordered $\Gamma$-semigroups in terms of interior (resp. fuzzy interior) $\Gamma$-ideals.

• Communications of the Korean Mathematical Society
• /
• v.32 no.1
• /
• pp.183-191
• /
• 2017

We define a stratification and a partition of a finite topological space and define a partial order on the partition. Open subsets can be described completely in terms of this partially ordered partition. We associate a directed graph to the partially ordered partition of a finite topological space. This gives a one-to-one correspondence between finite topological spaces and a certain class of directed graphs.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.311-324
• /
• 2010

We prove that a regular ordered semigroup S is left simple if and only if every intuitionistic fuzzy left ideal of S is a constant function. We also show that an ordered semigroup S is left (resp. right) regular if and only if for every intuitionistic fuzzy left(resp. right) ideal A = <$\mu_A$, $\gamma_A$> of S we have $\mu_A(a)\;=\;\mu_A(a^2)$, $\gamma_A(a)\;=\;\gamma_A(a^2)$ for every $a\;{\in}\;S$. Further, we characterize some semilattices of ordered semigroups in terms of intuitionistic fuzzy left(resp. right) ideals. In this respect, we prove that an ordered semigroup S is a semilattice of left (resp. right) simple semigroups if and only if for every intuitionistic fuzzy left (resp. right) ideal A = <$\mu_A$, $\gamma_A$> of S we have $\mu_A(a)\;=\;\mu_A(a^2)$, $\gamma_A(a)\;=\;\gamma_A(a^2)$ and $\mu_A(ab)\;=\;\mu_A(ba)$, $\gamma_A(ab)\;=\;\gamma_A(ba)$ for all a, $b\;{\in}\;S$.

• Nuclear Medicine and Molecular Imaging
• /
• v.41 no.3
• /
• pp.234-240
• /
• 2007

Purpose: In this study we propose a block-iterative method for reconstructing Compton scattered data. This study shows that the well-known expectation maximization (EM) approach along with its accelerated version based on the ordered subsets principle can be applied to the problem of image reconstruction for Compton camera. This study also compares several methods of constructing subsets for optimal performance of our algorithms. Materials and Methods: Three reconstruction algorithms were implemented; simple backprojection (SBP), EM, and ordered subset EM (OSEM). For OSEM, the projection data were grouped into subsets in a predefined order. Three different schemes for choosing nonoverlapping subsets were considered; scatter angle-based subsets, detector position-based subsets, and both scatter angle- and detector position-based subsets. EM and OSEM with 16 subsets were performed with 64 and 4 iterations, respectively. The performance of each algorithm was evaluated in terms of computation time and normalized mean-squared error. Results: Both EM and OSEM clearly outperformed SBP in all aspects of accuracy. The OSEM with 16 subsets and 4 iterations, which is equivalent to the standard EM with 64 iterations, was approximately 14 times faster in computation time than the standard EM. In OSEM, all of the three schemes for choosing subsets yielded similar results in computation time as well as normalized mean-squared error. Conclusion: Our results show that the OSEM algorithm, which have proven useful in emission tomography, can also be applied to the problem of image reconstruction for Compton camera. With properly chosen subset construction methods and moderate numbers of subsets, our OSEM algorithm significantly improves the computational efficiency while keeping the original quality of the standard EM reconstruction. The OSEM algorithm with scatter angle- and detector position-based subsets is most available.

• Journal of Biomedical Engineering Research
• /
• v.21 no.5
• /
• pp.441-448
• /
• 2000

방출단층영상 재구성을 위한 최대우도 기대값최대화(maximum likelihood expectation maximization, MLEM) 방법은 영상 획득과정을 통계학적으로 모델링하여 영상을 재구성한다. MLEM은 일반적으로 사용하여 여과후역투사(filtered backprojection)방법에 비해 많은 장점을 가지고 있으나 반복횟수 증가에 따른 발산과 재구성 시간이 오래 걸리는 단점을 가지고 있다. 이 논문에서는 이러한 단점을 보완하기 위해 계산시간을 현저히 단축시킨 배열된부분집합 기대값최대화(ordered subsets expectation maximization. OSEM)에 Gibbs 선행치인 membrance (MM) 또는 thin plate(TP)을 첨가한 OSEM-MAP (maximum a posteriori)을 구현함으로써 알고리즘의 안정성 및 재구성된 영상의 질을 향상시키고자 g나다. 실험에서 알고리즘의 수렴시간을 가속화하기 위해 투사 데이터를 16개의 부분집합으로 분할하여 반복연산을 수행하였으며, 알고리즘의 성능을 비교하기 위해 소프트웨어 모형(원숭이 뇌 자가방사선, 수학적심장흉부)을 사용한 영상재구성 결과를 제곱오차로 비교하였다. 또한 알고리즘의 사용 가능성을 평가하기 위해 물리모형을 사용하여 PET 기기로부터 획득한 실제 투사 데이터를 사용하였다.

• Bulletin of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.273-285
• /
• 1997

The aim of this paper is to present theorems on the exitence of zeros for mappings defined on convex subsets of topological vector spaces with values in a vector space. In addition to natural assumptions of continuity, convexity, and compactness, the mappings are subject to some geometric conditions. In the first theorem, the mapping satisfies a "Darboux-type" property expressed in terms of an auxiliary numerical function. Typically, this functions is, in this case, related to an order structure on the target space. We derive an existence theorem for "obtuse" quasiconvex mappings with values in an ordered vector space. In the second theorem, we prove the existence of a "common zero" for an arbitrary (not necessarily countable) family of mappings satisfying a general "inwardness" condition againg expressed in terms of numerical functions (these numerical functions could be duality pairings (more generally, bilinear forms)). Our inwardness condition encompasses classical inwardness conditions of Leray-Schauder, Altman, or Bergman-Halpern types.

• Kyungpook Mathematical Journal
• /
• v.47 no.1
• /
• pp.127-132
• /
• 2007

In this paper, we show that if R is a commutative ring with identity and (S, ${\leq}$) is a strictly totally ordered monoid, then the ring [[$R^{S,{\leq}}$]] of generalized power series is a PF-ring if and only if for any two S-indexed subsets A and B of R such that $B{\subseteq}ann_R(|A)$, there exists $c{\in}ann_R(A)$ such that $bc=b$ for all $b{\in}B$, and that for a Noetherian ring R, $[[R^{S,{\leq}}$]] is a PP ring if and only if R is a PP ring.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.290-298
• /
• 1994

In this paper we propose parallel sorting algorithm, taking 0( $n^{n}$ log n) time complexity, 0( $n^{x}$ log n) cost (parallel running time * number of processors) and 0( $n^{1-}$x＋ $n^{x}$ )data movement complexity under the ERWW- PRAM model. The methods for solving these problems similar. Parallel algorithm finds pivot for partitioning the data into ordered subsets of approximately equal size by using encording pointers..

• The Korean Journal of Nuclear Medicine
• /
• v.36 no.6
• /
• pp.344-356
• /
• 2002

Purpose: RBC blood pool SPECT has been used to diagnose focal liver lesion such as hemangioma owing to its high specificity. However, low spatial resolution is a major limitation of this modality. Recently, ordered subset expectation maximization (OSEM) has been introduced to obtain tomographic images for clinical application. We compared this new modified iterative reconstruction method, OSEM with conventional filtered back projection (FBP) in imaging of liver hemangioma. Materials and Methods: Sixty four projection data were acquired using dual head gamma camera in 28 lesions of 24 patients with cavernous hemangioma of liver and these raw data were transferred to LINUX based personal computer. After the replacement of header file as interfile, OSEM was performed under various conditions of subsets (1,2,4,8,16, and 32) and iteration numbers (1,2,4,8, and 16) to obtain the best setting for liver imaging. The best condition for imaging in our investigation was considered to be 4 iterations and 16 subsets. After then, all the images were processed by both FBP and OSEM. Three experts reviewed these images without any information. Results: According to blind review of 28 lesions, OSEM images revealed at least same or better image quality than those of FBP in nearly all cases. Although there showed no significant difference in detection of large lesions more than 3 cm, 5 lesions with 1.5 to 3 cm in diameter were detected by OSEM only. However, both techniques failed to depict 4 cases of small lesions less than 1.5 cm. Conclusion: OSEM revealed better contrast and define in depiction of liver hemangioma as well as higher sensitivity in detection of small lesions. Furthermore this reconstruction method dose not require high performance computer system or long reconstruction time, therefore OSEM is supposed to be good method that can be applied to RBC blood pool SPECT for the diagnosis of liver hemangioma.