• Journal of the Korean Society of Radiology
• /
• v.17 no.1
• /
• pp.141-148
• /
• 2023

The algebraic reconstruction technique is one of the reconstruction methods in CT and shows good image quality against noise-dominant conditions. The number of iteration is one of the key factors determining the execution time for the algebraic reconstruction technique. However, there are some rules for determining the number of iterations that result in more than a few hundred iterations. Thus, the rules are difficult to apply in practice. In this study, we proposed a method to determine the number of iterations for practical applications. The reconstructed image quality shows slow convergence as the number of iterations increases. Image quality 𝜖 < 0.001 was used to determine the optimal number of iteration. The Shepp-Logan head phantom was used to obtain noise-free projection and projections with noise for 360, 720, and 1440 views were obtained using Geant4 Monte Carlo simulation that has the same geometry dimension as a clinic CT system. Images reconstructed by around 10 iterations within the stop condition showed good quality. The method for determining the iteration number is an efficient way of replacing the best image-quality-based method, which brings over a few hundred iterations.

• 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.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.103-109
• /
• 1995

In this paper, we propose a postprocessing method that neatly removes blocking effect but retains visually important image details and edges. The iterative thresholded lowpass filter is basically a low pass filter whose ouput depends on three variable elements. I.e. iteration number, threshold value and passband width. The threshold value restricts the difference between the output of the proposed filter and the original input independent of the iteration number. With this property, the iterative thresholded lowpass filter can retain most of the image details while smoothing the block boundaries. The other two variable elements, i.e. iteration number and passband width, can determine the convergence speed of the proposed filter. In this paper, we also propose several adaptive filtering techniques based on the iterative thresholded lowpass filter with their simulation results.

• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.228-233
• /
• 2010

In this paper, the iteration localization algorithm that NLOS signal is iteratively removed to get the exact location in the wireless sensor network is proposed. To evaluate the performance of the proposed algorithm, TDOA location estimation method is used, and readers are located on every 150m intervals with rectangular shape in $300m{\times}300m$ searching field. In that searching field, the error distance is analyzed according to increasing the number of iteration, sub-blink and the estimated sensor node locations which are located in the iteration range. From simulation results, the error distance is diminished according to increasing the number of the sub-blink and iteration with the proposed location estimation algorithm in NLOS environment. Therefore, to get more accurate location information in wireless sensor network in NLOS environments, the proposed location estimation algorithm removing NLOS signal effects through iteration scheme is suitable.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.327-334
• /
• 2005

The representation of Web Sites with EMFG(Extended Mark Flow Graph) is studied as a new method that represents the complicated Web Sites structure. The Web Sites usually have the number of iteration structures. The representation of these Web Sites with EMFG is too complicated, and so we can not understand the structure of these Web Sites sometimes. Therefore, in this paper, we classify these iteration structures when express Web Sites by EMFG as serial iteration structures and parallel iteration structures and propose the method that can simplify these iteration structures. Then we can reduce number of boxes, arcs, and transitions, and efficiently design and manage Web Sites by using this method.

• Journal of Biomedical Engineering Research
• /
• v.22 no.3
• /
• pp.241-247
• /
• 2001

ABR(auditory brainstem response) is one of the audiometry which measures objective hearing threshold level by acquiring electric evoked potentials emanated from auditory nerve system responding to an auditory stimulation. However, the obtained potentials which are largely interfered by power line noise, have extremely low SNR, thus ensemble average algorithm is generally used. The purpose of this study was to investigate the effect of iteration number in ensemble average on the reduction of the power line noise. The power line noise was modeled to be a 60 Hz sinusoidal signal and the energy of the modeled signal was calculated when it was averaged. It was verified by simulation that the energy had the periodic zero points for each stimulation rate, and 60 Hz signal induced by the power line was applied to the developed ABR system to confirm that the period of zero energy point was the same with that of the simulation. By the properly selected iteration number, power line noise could be reduced and more reliable ABR could be acquired.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.5 no.1
• /
• pp.25-36
• /
• 2006

This paper discusses the implementation and performance evaluation of a DSP-based digital beamformer using the Texas Instrument TMSC6711 DSP processor for smart antenna applications. Two adaptive beamforming algorithms which served as the brain for the beamformer, the Normalized Least-Mean-Square (NLMS) and the Constant Modulus Algorithms (CMA) were embedded into the processor and evaluated. Result shows that the NLMS-based digital beamformer outperforms the CMA-based digital beamformer: 1)For NLMS algorithm, the antenna steers to the direction of the desired user even at low iteration value and the suppression level towards the interferer increases as the number of iteration increase. For CMA algorithm, the beam radiation pattern slowly steers to the desired user as the number of iteration increased, but at arate slower than NLMS algorithm and the sidelobe level is shown to increases as the number of iteration increase. 2) The NLMS algorithm has faster convergence than CMA algorithm and the error convergence for CMA algorithm sometimes is subject to misadjustment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.148-154
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard are required a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method is reduced number of unnecessary iteration. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme.

• The Journal of the Korea Contents Association
• /
• v.6 no.2
• /
• pp.162-168
• /
• 2006

This paper presents a high performance CORDIC circuit based on redundant numbers yielding a minimal number of iteration stages. The minimal number of iteration stages reflects the iteration number yielding a smaller computation error than the truncation error. The minimal number of iterations is found n-4 for $n\geq16$, where n is the number of input angle bits. The CORDIC circuit is based on a redundant number system with a constant scale factor The circuit performs sine and cosine calculations with a delay of {5 (n-4)+ 2[$log_{2}n$]}$\DeltaT$.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.1
• /
• pp.15-28
• /
• 2018

Recently Machine Learning algorithms are widely used to process Big Data in various applications and a lot of these applications are executed in run time. Therefore the speed of Machine Learning algorithms is a critical issue in these applications. However the most of modern iteration Machine Learning algorithms use a successive iteration technique well-known in Numerical Linear Algebra. But this technique has a very low convergence, needs a lot of iterations to get solution of considering problems and therefore a lot of time for processing even on modern multi-core computers and clusters. Tchebychev iteration technique is well-known in Numerical Linear Algebra as an attractive candidate to decrease the number of iterations in Machine Learning iteration algorithms and also to decrease the running time of these algorithms those is very important especially in run time applications. In this paper we consider the usage of Tchebychev iterations for acceleration of well-known K-Means and SVM (Support Vector Machine) clustering algorithms in Machine Leaning. Some examples of usage of our approach on modern multi-core computers under Apache Spark framework will be considered and discussed.