• Title/Summary/Keyword: ${\gamma}$-set

Search Result 291, Processing Time 0.026 seconds

Design of 10bit gamma line system with small size of gate count and 4bit error(LSB) to implement non-linear gamma curve (비선형 감마 커브 구현을 위한 작은 크기와 4bit(LSB) 오차를 가진 10비트 감마 라인 시스템의 설계)

  • Jang, Won-Woo;Kim, Hyun-Sik;Lee, Sung-Mok;Kim, In-Kyu;Kang, Bong-Soon
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2005.11a
    • /
    • pp.353-356
    • /
    • 2005
  • In this paper, the proposed $gamma({\gamma})$ line system is developed for reducing the error between non-linear gamma curve produced by a formula and result produced by hardware implementation. The proposed algorithm and system is based on the specific gamma value 2.2, namely the formula is represented by {0,1}$^{2.2}$ and the bit width of input and out data is 10bit. In order to reduce the error, the system is using least squares polynomial of the numerical method which is calculating the best fitting polynomial through a set of points. The proposed gamma line is consisting of nine kinds of quadratic equations, each with their own overlap sections to get more precise. Based on the algorithm verified by $MATLAB^{TM}$ 7.0, the proposed system is implemented by using Verilog-HDL. The proposed system has 2 clock latency; 1 result per clock. The error range (LSB) is -4 and +3. Its standard deviation is 1.287956238. The total gate count of system is 2,083 gates and the maximum timing is 15.56[ns].

  • PDF

A CMOS Image Sensor with Analog Gamma Correction using a Nonlinear Single Slope ADC (비선형 단일 기울기 ADC를 사용하여 아날로그 감마 보정을 적용한 CMOS 이미지 센서)

  • Ham Seog-Heon;Han Gunhee
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.1 s.343
    • /
    • pp.65-70
    • /
    • 2006
  • An image sensor has limited dynamic range while the human eye has logarithmic response over wide range of light intensity. Although the sensor gain can be set high to identify details in darker area on the image, this results in saturation in brighter area. The gamma correction is essential to fit the human eye response. However, the digital gamma correction degrades image quality especially for darker area on the image due to the limited ADC resolution and the dynamic range. This Paper proposes a CMOS image sensor (CIS) with a nonlinear analog-to-digital converter (AU) which performs analog gamma correction. The CIS with the proposed nonlinear analog-to-digital conversion scheme was fabricated with a $0.35{\mu}m$ CMOS process. The analog gamma correction using the proposed nonlinear ADC CIS provides the 2.2dB peak-signal-to-noise-ratio(PSM) improved image qualify than conventional digital gamma correction. The PSNR of the image obtain from the digital gamma correction is 25.6dB while it is 27.8dB for analog gamma correction. The PSNR improvement over digital gamma correction is about $28.8\%$.

An Implementation of an Edge-based Algorithm for Separating and Intersecting Spherical Polygons (구 볼록 다각형 들의 분리 및 교차를 위한 간선 기반 알고리즘의 구현)

  • Ha, Jong-Seong;Cheon, Eun-Hong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.9
    • /
    • pp.479-490
    • /
    • 2001
  • In this paper, we consider the method of partitioning a sphere into faces with a set of spherical convex polygons $\Gamma$=${P_1...P_n}$ for determining the maximum of minimum intersection. This problem is commonly related with five geometric problems that fin the densest hemisphere containing the maximum subset of $\Gamma$, a great circle separating $\Gamma$, a great circle bisecting $\Gamma$ and a great circle intersecting the minimum or maximum subset of $\Gamma$. In order to efficiently compute the minimum or maximum intersection of spherical polygons. we take the approach of edge-based partition, in which the ownerships of edges rather than faces are manipulated as the sphere is incrementally partitioned by each of the polygons. Finally, by gathering the unordered split edges with the maximum number of ownerships. we approximately obtain the centroids of the solution faces without constructing their boundaries. Our algorithm for finding the maximum intersection is analyzed to have an efficient time complexity O(nv) where n and v respectively, are the numbers of polygons and all vertices. Furthermore, it is practical from the view of implementation, since it computes numerical values. robustly and deals with all the degenerate cases, Using the similar approach, the boundary of a general intersection can be constructed in O(nv+LlogL) time, where : is the output-senstive number of solution edges.

  • PDF

COMBINATORIAL PROOF FOR THE GENERALIZED SCHUR IDENTITY

  • Lee, Jae-Jin
    • Communications of the Korean Mathematical Society
    • /
    • v.13 no.3
    • /
    • pp.445-459
    • /
    • 1998
  • Let λ be a partition with all distinct parts. In this paper we give a bijection between the set $\Gamma$$_{λ}$(X) of pairs (equation omitted) satisfying a certain condition and the set $\pi_{λ}$(X) of circled permutation tableaux of shape λ on the set X, where P$\frac{1}{2}$ is a tail circled shifted rim hook tableaux of shape λ and (equation omitted) is a barred permutation on X. Specializing to the partition λ with one part, this bijection gives a combinatorial proof of the Schur identity: $\Sigma$2$\ell$(type($\sigma$)) = 2n! summed over all permutation $\sigma$ $\in$ $S_{n}$ with type($\sigma$) $\in$ O $P_{n}$ . .

  • PDF

Analysis on the characteristics for upper bound of [1,2]-domination in trees (트리의 [1,2]-지배 수 상계에 대한 특성 분석)

  • Lee, Hoon;Sohn, Moo Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.12
    • /
    • pp.2243-2251
    • /
    • 2016
  • In this paper, we propose a theoretical model for characterization and upper bounds of [1,2]-domination set of network which has tree structure. In detail, we propose a theoretic model for upper bounds on [1,2]-domination set of a tree network which has some typical constrains. To that purpose, we introduce a graph theory to model and analyze the characteristics of tree structure networks. We assume a node subset D of a graph G=(V,E). We define that D is a [1,2]-dominant set if for any node v in set V which is not an element of a set D is adjacent to a node or two nodes of an element in a set D (that is, $1{\leq}{\mid}N({\upsilon}){\bigcap}D{\mid}{\leq}2$ for every node $v{\in}V-D$). The minimum cardinality of a [1,2]-dominating set of G, which is denoted by ${\gamma}_{[1,2]}(G)$, is called the [1,2]-domination number of G. In this paper, we show new upper bounds and characteristics about the [1,2]-domination number of tree.

Pharmacophore Identification for Peroxisome Proliferator-Activated Receptor Gamma Agonists

  • Sohn, Young-Sik;Lee, Yu-No;Park, Chan-In;Hwang, S-Wan;Kim, Song-Mi;Baek, A-Young;Son, Min-Ky;Suh, Jung-Keun;Kim, Hyong-Ha;Lee, Keun-Woo
    • Bulletin of the Korean Chemical Society
    • /
    • v.32 no.1
    • /
    • pp.201-207
    • /
    • 2011
  • Peroxisome proliferator-activated receptors (PPARs) are members of nuclear receptors and their activation induces regulation of fatty acid storage and glucose metabolism. Therefore, the $PPAR\gamma$ is a major target for the treatment of type 2 diabetes mellitus. In order to generate pharmacophore model, 1080 known agonists database was constructed and a training set was selected. The Hypo7, selected from 10 hypotheses, contains four features: three hydrogen-bond acceptors (HBA) and one general hydrophobic (HY). This pharmacophore model was validated by using 862 test set compounds with a correlation coefficient of 0.903 between actual and estimated activity. Secondly, CatScramble method was used to verify the model. Hence, the validated Hypo7 was utilized for searching new lead compounds over 238,819 and 54,620 chemical structures in NCI and Maybridge database, respectively. Then the leads were selected by screening based on the pharmacophore model, predictive activity, and Lipinski's rules. Candidates were obtained and subsequently the binding affinities to $PPAR\gamma$ were investigated by the molecular docking simulations. Finally the best two compounds were presented and would be useful to treat type 2 diabetes.

Fabrication of Fiber-optics Detector for Measuring Radioactive Waste (방사성 오염도 측정을 위한 광섬유 검출기 제작)

  • Kim, Jeong-Ho;Joo, Koan-Sik
    • Journal of IKEEE
    • /
    • v.19 no.3
    • /
    • pp.282-287
    • /
    • 2015
  • In this study, an optical fiber detector was constructed by using a Ce:GAGG scintillator, optical fiber, and photomultiplier. The single crystal size of the scintillator was set to $3{\times}3{\times}20mm^3$ after simulating the counting efficiency of gamma rays in the scintillator by using the MCNPX code. The constructed detector used the standard gamma ray sources $^{137}Cs$ and $^{133}Ba$ to measure radiation and analyze the spectral characteristics of gamma rays. The resulting trend curve showed excellent linearity with an R-squared value of 0.99741, and the detector characteristics were found to vary 2% or less with distance based on comparison with the MCNPX value. Furthermore, the spectroscopic analysis of the gamma ray energy from the single-ray and mixed-ray sources showed that $^{137}Cs$ had its peak energy at 662 keV, and $^{133}Ba$ had at 356 keV. It seems that if the fiber-optics detector is used, working hours and exposure of worker can be reduced.

Comparison among Gamma(${\gamma}$) Line Systems for Non-Linear Gamma Curve (비선형 감마 커브를 위한 감마 라인 시스템의 비교)

  • Jang, Won-Woo;Lee, Sung-Mok;Ha, Joo-Young;Kim, Joo-Hyun;Kim, Sang-Choon;Kang, Bong-Soon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.2
    • /
    • pp.265-272
    • /
    • 2007
  • This proposed gamma (${\gamma}$) correction system is developed to reduce the difference between non-linear gamma curve produced by a typical formula and result produced by the proposed algorithm. In order to reduce the difference, the proposed system is using the Least Squares Polynomial which is calculating the best fitting polynomial through a set of points which is sampled. Each system is consisting of continuous several kinds of equations and having their own overlap sections to get more precise. Based on the algorithm verified by MATLAB, the proposed systems are implemented by using Verilog-HDL. This paper will compare the previous algorithm of gamma system such as Existing system with Seed Table with the latest that such as Proposed system. The former and the latter system have 1, 2 clock latency; each 1 result per clock. Because each of the error range (LSB) is $1{\sim}+1,\;0{\sim}+36$, we can how that Proposed system is improved. Under the condition of SAMSUNG STD90 0.35 worst case, each gate count is 2,063, 2,564 gates and each maximum data arrival time is 29.05[ns], 17.52[ns], respectively.

The Evaluation of Usefulness of Pixelated Breast-Specific Gamma Imaging in Thyroid scan (Pixelated Breast-Specific Gamma Imaging(BSGI) 감마 카메라를 이용한 갑상선 검사의 유용성 평가)

  • Jung, Eun-Mi;Seong, Ji-Hye;Yoo, Hee-Jae
    • The Korean Journal of Nuclear Medicine Technology
    • /
    • v.15 no.1
    • /
    • pp.90-93
    • /
    • 2011
  • Purpose: A Pixelated BSGI gamma camera has features to enhance resolution and sensitivity and minimize the distance between detector and organs by narrow FOV. Therefore, it is known as useful device to examine small organs such as thyroid, parathyroid and gall bladder. In general, when we would like to enlarge the size of images and obtain high resolution images by gamma camera in nuclear medicine study, we use pinhole collimator. The purpose of this study is to evaluate the usefulness of Pixelated BSGI gamma camera and to compare to it using pinhole collimator in thyroid scan which is a study of typical small organs. Materials and methods: (1) The evaluation of sensitivity and spatial resolution: We measured sensitivity and spatial resolution of Pixelated BSGI with LEHR collimator and Infinia gamma camera with pinhole collimator. The sensitivity was measured by point source sensitivity test recommended by IAEA. We acquired images considering dead time in BSGI gamma camera for 100 seconds and used $^{99m}TcO4-\;400{\mu}Ci$ line source. (2) The evaluation of thyroid phantom: The thyroid phantom was filled with $^{99m}TcO4-$. After set 300 sec or 100 kcts stop conditions, we acquired images from both pixelated BSGI gamma camera and Infinia gamma camera with LEHR collimator. And we performed all thyroid studies in the same way as current AMC's procedure. Results: (1) the result of sensitivity: As a result, the sensitivity and spatial resolution of pixelated BSGI gamma camera were better than Infinia's. The sensitivities of pixelated BSGI and Infinia gamma camera were $290cps/{\mu}Ci$ and $350cps/{\mu}Ci$ respectively. So, the sensitivity of pixelated BSGI was 1.2 times higher than Infinia's (2) the result of thyroid phantom: Consequently, we confirmed that images of Pixelated BSGI gamma camera were more distinguishable between hot and cold spot compared with Infinia gamma camera. Conclusion: A pixelated BSGI gamma camera is able to shorten the acquisition time. Furthermore, the patients are exposed to radiation less than before by reducing amount of radiopharmaceutical doses. Shortening scan time makes images better by minimizing patient's breath and motion. And also, the distance between organ and detector is minimized because detector of pixelated BSGI gamma camera is small and possible to rotate. When patient cannot move at all, it is useful since device is feasible to move itself. However, although a pixelated BSGI gamma camera has these advantages, the effect of dead time occurs over 2000 cts/s since it was produced only for breast scan. So, there were low concentrations in organ. Therefore, we should consider that it needs to take tests to adjust acquisition time and amount of radiopharmaceutical doses in thyroid scan case with a pixelated BSGI gamma camera.

  • PDF

INVOLUTION-PRESERVING MAPS WITHOUT THE LINEARITY ASSUMPTION AND ITS APPLICATION

  • Xu, Jin-Li;Cao, Chong-Guang;Wu, Hai-Yan
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.1_2
    • /
    • pp.97-103
    • /
    • 2009
  • Suppose F is a field of characteristic not 2 and $F\;{\neq}\;Z_3$. Let $M_n(F)$ be the linear space of all $n{\times}n$ matrices over F, and let ${\Gamma}_n(F)$ be the subset of $M_n(F)$ consisting of all $n{\times}n$ involutory matrices. We denote by ${\Phi}_n(F)$ the set of all maps from $M_n(F)$ to itself satisfying A - ${\lambda}B{\in}{\Gamma}_n(F)$ if and only if ${\phi}(A)$ - ${\lambda}{\phi}(B){\in}{\Gamma}_n(F)$ for every A, $B{\in}M_n(F)$ and ${\lambda}{\in}F$. It was showed that ${\phi}{\in}{\Phi}_n(F)$ if and only if there exist an invertible matrix $P{\in}M_n(F)$ and an involutory element ${\varepsilon}$ such that either ${\phi}(A)={\varepsilon}PAP^{-1}$ for every $A{\in}M_n(F)$ or ${\phi}(A)={\varepsilon}PA^{T}P^{-1}$ for every $A{\in}M_n(F)$. As an application, the maps preserving inverses of matrces also are characterized.

  • PDF