• The Korean Journal of Nuclear Medicine Technology
• /
• v.15 no.1
• /
• pp.17-24
• /
• 2011

Purpose: Presently in the nuclear medicine field, the high-speed image reconstruction algorithm like the OSEM algorithm is widely used as the alternative of the filtered back projection method due to the rapid development and application of the digital computer. There is no to relate and if it applies the optimal parameter be clearly determined. In this research, the quality change of the Jaszczak phantom experiment and brain SPECT patient data according to the iteration times and subset number change try to be been put through and analyzed in 3D OSEM reconstruction method of applying 3D beam modeling. Materials and Methods: Patient data from August, 2010 studied and analyzed against 5 patients implementing the brain SPECT until september, 2010 in the nuclear medicine department of ASAN medical center. The phantom image used the mixed Jaszczak phantom equally and obtained the water and 99mTc (500 MBq) in the dual head gamma camera Symbia T2 of Siemens. When reconstructing each image altogether with patient data and phantom data, we changed iteration number as 1, 4, 8, 12, 24 and 30 times and subset number as 2, 4, 8, 16 and 32 times. We reconstructed in reconstructed each image, the variation coefficient for guessing about noise of images and image contrast, FWHM were produced and compared. Results: In patients and phantom experiment data, a contrast and spatial resolution of an image showed the tendency to increase linearly altogether according to the increment of the iteration times and subset number but the variation coefficient did not show the tendency to be improved according to the increase of two parameters. In the comparison according to the scan time, the image contrast and FWHM showed altogether the result of being linearly improved according to the iteration times and subset number increase in projection per 10, 20 and 30 second image but the variation coefficient did not show the tendency to be improved. Conclusion: The linear relationship of the image contrast improved in 3D OSEM reconstruction method image of applying 3D beam modeling through this experiment like the existing 1D and 2D OSEM reconfiguration method according to the iteration times and subset number increase could be confirmed. However, this is simple phantom experiment and the result of obtaining by the some patients limited range and the various variables can be existed. So for generalizing this based on this results of this experiment, there is the excessiveness and the evaluation about 3D OSEM reconfiguration method should be additionally made through experiments after this.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.301-305
• /
• 1996

$\mu$ theory can handle the parametric uncertainty and produces more non-conservative controller than H$_{\infty}$ control theory. However an existing solution of the theory, D-K iteration, creates a controller of huge order and cannot handle the real or mixed real-complex perturbation sets. In this paper, we use genetic algorithms to solve these problems of the D-K iteration method. The Youla parameterization is used to obtain all stabilizing controllers and the genetic algorithms determines the values of the state feedback gain, the observer gain, and Q parameter to minimize $\mu$, the structured singular value, of given system. From an example, we show that this method produces lower order controller which controls a real parameter-perturbed plant than D-K iteration method.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.65-71
• /
• 1997

In this paper, we propose a new .mu.-controller design method using an equivalent weighting function $W_{\mu}$(s). The proposed mehtod is not guaranteed to converge to the minimum as D-K and .mu.-K iteration method. However, the robust performance problem can be converted into an equivalent $H^{\infty}$ optimization problem of unstructured uncertainty by using an equivalent weightng function $W_{\mu}$(s). Also we can find a .mu.-optimal controller iteratively using an error index $d_{\epsilon}$ of differnce between maximum singular value and .mu.-norm. And under the condition of the same order of scaling functions, the proposed method provides the .mu.-optimal controller with the degree less than that obtained by D-K iteration..

• Bulletin of the Korean Mathematical Society
• /
• v.39 no.3
• /
• pp.389-399
• /
• 2002

We prove that the results of Chang, Park and Cho in ［1］ concerning the iterative approximation of asymptotically pseudocontractive maps with bounded ranges can be extended to a certain class of asymptotically pseudocontractive maps whose ranges need not be bounded.

• Journal of the Korean Mathematical Society
• /
• v.36 no.6
• /
• pp.1061-1073
• /
• 1999

Let X be a real normed linear space. Let T : D(T) ⊂ X \longrightarrow X be a uniformly continuous and ∮-strongly quasi-accretive mapping. Let {${\alpha}$n}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} , {${\beta}$n}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} be two real sequences in [0, 1] satisfying the following conditions: (ⅰ) ${\alpha}$n \longrightarrow0, ${\beta}$n \longrightarrow0, as n \longrightarrow$\infty$ (ⅱ) {{{{ SUM from { { n}=0} to inf }}}} ${\alpha}$=$\infty$. Set Sx=x-Tx for all x $\in$D(T). Assume that {u}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} and {v}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} are two sequences in D(T) satisfying {{{{ SUM from { { n}=0} to inf }}}}∥un∥<$\infty$ and vn\longrightarrow0 as n\longrightarrow$\infty$. Suppose that, for any given x0$\in$X, the Ishikawa type iteration sequence {xn}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} with errors defined by (IS)1 xn+1=(1-${\alpha}$n)xn+${\alpha}$nSyn+un, yn=(1-${\beta}$n)x+${\beta}$nSxn+vn for all n=0, 1, 2 … is well-defined. we prove that {xn}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} converges strongly to the unique zero of T if and only if {Syn}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} is bounded. Several related results deal with iterative approximations of fixed points of ∮-hemicontractions by the ishikawa iteration with errors in a normed linear space. Certain conditions on the iterative parameters {${\alpha}$n}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} , {${\beta}$n}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} and t are also given which guarantee the strong convergence of the iteration processes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3A
• /
• pp.166-170
• /
• 2003

In this paper, the characteristics of Koch island microstrip patch antenna are investigated by numerical and experimental methods. The Koch patch is fractal shaped antenna which can be characterized by two properties such as space-filling and self-similarity. Due to its space-filling property of fractal structure, the proposed Koch fractal patch antennas are smaller in size than that of conventional square patch antenna. From numerical and experimental results, it is found that as the iteration number and iteration factor of Koch patch increase, its resonance frequency becomes lower than that of conventional patch, thus contributes to antenna size reduction. In particular, when the fractal iteration factor is 1/4, the fractal antenna is 45% smaller in size than that of conventional patch, while maintaining radiation patterns comparable to those of rectangular antenna and cross polarization level is about -20~-14 dB.

• Communications of the Korean Mathematical Society
• /
• v.25 no.4
• /
• pp.655-669
• /
• 2010

In this paper we propose new primal-dual interior point methods (IPMs) for $P_*(\kappa)$ linear complementarity problems (LCPs) and analyze the iteration complexity of the algorithm. New search directions and proximity measures are defined based on a class of kernel functions, $\psi(t)=\frac{t^2-1}{2}-{\int}^t_1e{^{q(\frac{1}{\xi}-1)}d{\xi}$, $q\;{\geq}\;1$. If a strictly feasible starting point is available and the parameter $q\;=\;\log\;\(1+a{\sqrt{\frac{2{\tau}+2{\sqrt{2n{\tau}}+{\theta}n}}{1-{\theta}}\)$, where $a\;=\;1\;+\;\frac{1}{\sqrt{1+2{\kappa}}}$, then new large-update primal-dual interior point algorithms have $O((1\;+\;2{\kappa})\sqrt{n}log\;n\;log\;{\frac{n}{\varepsilon}})$ iteration complexity which is the best known result for this method. For small-update methods, we have $O((1\;+\;2{\kappa})q{\sqrt{qn}}log\;{\frac{n}{\varepsilon}})$ iteration complexity.

• International Journal of Precision Engineering and Manufacturing
• /
• v.1 no.2
• /
• pp.76-83
• /
• 2000

A study on the robust control of a composite beam with a distributed PVDF sensor and piezo-ceramic actuator is presented in this paper. $1^{st}$ and $2^{nd}$ natural frequencies are considered in the modeling, because robust control theory which has robustness to structured uncertainty is adopted to suppress the vibration. If the controllers designed by $H_{\infty}$ theory do not satisfy control performance, it is improved by $\mu$-synthesis method with D-K iteration so that the $\mu$-controller based on the structured singular value satisfies the nominal performance and robust performance. Simulation and experiment were carried out with the designed controller and the verification of the robust control properties was presented by results.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.1
• /
• pp.178-183
• /
• 2014

This paper presents a motor characteristics analysis method using an equivalent circuit. Motor characteristics analysis via equivalent circuit is very important for designing a high efficiency single phase induction motor. The accuracy of the motor characteristics depends on the accuracy of the parameters, especially saturation factor, which determines the cyclical relationship in the analysis process. Therefore, using the proposed method, the saturation factor was calculated using the iteration routine and numerical technique. The proposed method was verified by comparing the finite element method results and the dynamo test results of manufactured prototype model.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.4
• /
• pp.799-813
• /
• 2012

In this paper, we first show that the iteration {$x_n$} defined by $x_{n+1}=P((1-{\alpha}_n)x_n +{\alpha}_nTP[{\beta}_nTx_n+(1-{\beta}_n)x_n])$ converges strongly to some fixed point of T when E is a real uniformly convex Banach space and T is a quasi-nonexpansive non-self mapping satisfying Condition A, which generalizes the result due to Shahzad [11]. Next, we show the strong convergence of the Mann iteration process with errors when E is a real uniformly convex Banach space and T is a quasi-nonexpansive self-mapping satisfying Condition A, which generalizes the result due to Senter-Dotson [10]. Finally, we show that the iteration {$x_n$} defined by $x_{n+1}={\alpha}_nSx_n+{\beta}_nT[{\alpha}^{\prime}_nSx_n+{\beta}^{\prime}_nTx_n+{\gamma}^{\prime}_n{\upsilon}_n]+{\gamma}_nu_n$ converges strongly to a common fixed point of T and S when E is a real uniformly convex Banach space and T, S are two quasi-nonexpansive self-mappings satisfying Condition D, which generalizes the result due to Ghosh-Debnath [3].