• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.115-118
• /
• 1999

One of the typical methods to design a codebook is K-means algorithm. This algorithm has the drawbacks that converges to a locally optimal codebook and its performance is mainly decided by an initial codebook. D. Lee's method is almost same as the K-means algorithm except for a modification of a distance value. Those methods have a fixed distance value during all iterations. After many iterations. because the distance between new codevectors and old codevectors is much shorter than the distance in the early stage of iterations, the new codevectors are not affected by distance value. But new codevectors decided in the early stage of learning iterations are much affected by distance value. Therefore it is not appropriate to fix the distance value during all iterations. In this paper, we propose a new algorithm using each different distance value between codevectors for a limited iterations in the early stage of learning iteration. In the experiment, the result show that the proposed method can design better codebooks than the conventional K-means algorithms.

• The Korean Journal of Nuclear Medicine Technology
• /
• v.14 no.1
• /
• pp.122-126
• /
• 2010

Purpose: F-18-FPCIT that shows strong familiarity with DAT located at a neural terminal site offers diagnostic information about DAT density state in the region of the striatum especially Parkinson's disease. In this study, we altered the iteration and subset and measured SUV${\pm}$SD and Contrasts from phantom images which set up to specific iteration and subset. So, we are going to suggest the appropriate range of the iteration and subset. Materials and Methods: This study has been performed with 10 normal volunteers who don't have any history of Parkinson's disease or cerebral disease and Flangeless Esser PET Phantom from Data Spectrum Corporation. $5.3{\pm}0.2$ mCi of F-18-FPCIT was injected to the normal group and PET Phantom was assembled by ACR PET Phantom Instructions and it's actual ratio between hot spheres and background was 2.35 to 1. Brain and Phantom images were acquired after 3 hours from the time of the injection and images were acquired for ten minutes. Basically, SIEMENS Bio graph 40 True-point was used and True-X method was applied for image reconstruction method. The iteration and Subset were set to 2 iterations, 8 subsets, 3 iterations, 16 subsets, 6 iterations, 16 subsets, 8 iterations, 16 subsets and 8 iterations, 21 subsets respectively. To measure SUVs on the brain images, ROIs were drawn on the right Putamen. Also, Coefficient of variance (CV) was calculated to indicate the uniformity at each iteration and subset combinations. On the phantom study, we measured the actual ratio between hot spheres and back ground at each combinations. Same size's ROIs were drawn on the same slide and location. Results: Mean SUVs were 10.60, 12.83, 13.87, 13.98 and 13.5 at each combination. The range of fluctuation by sets were 22.36%, 10.34%, 1.1%, and 4.8% respectively. The range of fluctuation of mean SUV was lowest between 6 iterations 16 subsets and 8 iterations 16 subsets. CV showed 9.07%, 11.46%, 13.56%, 14.91% and 19.47% respectively. This means that the numerical value of the iteration and subset gets higher the image's uniformity gets worse. The range of fluctuation of CV by sets were 2.39, 2.1, 1.35, and 4.56. The range of fluctuation of uniformity was lowest between 6 iterations, 16 subsets and 8 iterations, 16 subsets. In the contrast test, it showed 1.92:1, 2.12:1, 2.10:1, 2.13:1 and 2.11:1 at each iteration and subset combinations. A Setting of 8 iterations and 16 subsets reappeared most close ratio between hot spheres and background. Conclusion: Findings on this study, SUVs and uniformity might be calculated differently caused by variable reconstruction parameters like filter or FWHM. Mean SUV and uniformity showed the lowest range of fluctuation at 6 iterations 16 subsets and 8 iterations 16 subsets. Also, 8 iterations 16 subsets showed the nearest hot sphere to background ratio compared with others. But it can not be concluded that only 6 iterations 16 subsets and 8 iterations 16 subsets can make right images for the clinical diagnosis. There might be more factors that can make better images. For more exact clinical diagnosis through the quantitative analysis of DAT density in the region of striatum we need to secure healthy people's quantitative values.

• Korean Journal of Construction Engineering and Management
• /
• v.14 no.1
• /
• pp.144-152
• /
• 2013

Design is an iterative, generative, and multidisciplinary process by its nature. Iteration occurs often in most of the engineering design and development projects including construction. Design iterations cause rework, and extra efforts are required to get the optimal sequence and to manage the projects. Contrary to simple design, isolation of the generative iterations in complex design systems is very difficult, but reduction in overall iterations is possible. Design depends upon the information flow within domain and also among various design disciplines and organizations. Therefore, it is suggested that managers should be aware about the crucial iterations causing rework and optimal sequence as well. In this way, managers can handle design parameters related to such iterations pro-actively. There are a number of techniques to reduce iterations for various kinds of engineering designs. In this paper, parameter based Design Structure Matrix (DSM) is chosen. To create this DSM, a survey was performed and then partitioned using a model. This paper provides an easy approach to those companies involved in or intend to be involved in "design and build projects".

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2008.11a
• /
• pp.638-641
• /
• 2008

Design is an iterative, generative, and multidisciplinary process by its nature. Iteration is frequent in most of the engineering design and development projects including construction. Design iterations cause rework, and extra efforts are required to get the optimal sequence and to manage the projects. Contrary to simple design, isolation of the generative iterations in complex design systems is very difficult, but reduction in overall iterations is possible. Design depends upon the information flow within domain and also among various design disciplines and organizations. Therefore, it is suggested that managers should be aware about the crucial iterations causing rework and optimal sequence as well. In this way, managers can handle design parameters related to such iterations proactively. Numbers of techniques are available to reduce iterations for various kinds of engineering designs. In this paper, parameter based Design Structure Matrix (DSM) is chosen. To create this DSM, a survey was performed and then partitioned using a model. This paper provides an easy approach to those companies involved in or intend to be involved in "design and build projects."

• IE interfaces
• /
• v.20 no.2
• /
• pp.112-120
• /
• 2007

As the market rapidly changes, the speed of new product development is highlighted as a critical element which determines the success of firms. While firms endeavor to accelerate the development speed, frequent iterations in a development process hinders the effort of acceleration. For this reason, many previous researches tried to find the optimal structure of the development process which minimizes the number of iterations. However, such researches have a limitation in that they can be applied to only a single-project environment. In a multi-project environment, waiting time induced by lack of resources also delays the process as well as the iterations do. In this paper, we propose dynamic sequencing method focusing on both iterations and waiting time for reducing the durations of development projects in a multi-project environment. This method reduces the waiting time by changing the sequence of development tasks according to the states of resources. While the method incurs additional iterations, they are expected to be offset by the reduced waiting time. The results of simulation show that the dynamic sequencing method dramatically improves the efficiency of a development process. Especially, the improvement is more salient as projects are more crowded and the process is more unbalanced. This method gives a new insight in researches on managing multiple development projects.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.67 no.3
• /
• pp.131-136
• /
• 2018

Harmony search (HS) is a relatively recently developed meta-heuristic optimization method imitating the music improvisation process where musicians improvise their instruments' pitches searching for a perfect state of harmony. In the conventional HS algorithm, it is necessary to determine the maximum number of iterations with some algorithm parameters. However, there is no criterion for determining the number of iterations, which is a very difficult problem. To solve this problem, a new method is proposed to perform the algorithm without setting the maximum number of iterations in this paper. The new method allows the algorithm to be performed until the desired tuning is achieved. To do this, a new variable bandwidth is introduced. In addition, the types and probability of harmonies composed of variables is analyzed to help to decide the value of HMCR. The performance of the proposed method is investigated and compared with classical HS. The experiments conducted show that the new method generally outperformed conventional HS when applied to seven benchmark problems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1C
• /
• pp.1-8
• /
• 2004

This paper proposes a novel algorithm for a low power turbo decoder based on reduction of number of decoding iterations, targeting power-critical mobile communication devices. Previous researches that attempt to reduce number of decoding iterations, such as CRC-aided and LLR methods, either show degraded BER performance in return for reduced complexity or require additional hardware resources for controlling the number of iterations to meet BER performance, respectively. The proposed algorithm can reduce power consumption without degrading the BER performance, and it is achieved with minimal hardware overhead. The proposed algorithm achieves this by comparing consecutive hard decision results using a simple buffer and counter. Simulation results show that the number of decoding iterations can be reduced to about 60% without degrading the BER performance in the proposed decoder, and power consumption can be saved in proportion to the number of decoding iterations.

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

• Kyungpook Mathematical Journal
• /
• v.46 no.2
• /
• pp.211-217
• /
• 2006

In this paper, we have shown that the convergence of one-step, two-step and three-step iterations is equivalent, which are known as Mann, Ishikawa and Noor iteration procedures, for a special class of Lipschitzian operators defined in a closed, convex subset of an arbitrary Banach space.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1387-1394
• /
• 2004

Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication systems. And it is well known about the fact that turbo code has better the BER performance as the number of decoding iterations increases in the AWGN channel environment. However, as the number of decoding iterations is increased under the several channel environments, any further iteration results in very little improvement, and it requires much delay, computation and power consumption in proportion to the number of decoding iterations. In this paper, it proposes the efficient iterative decoding stop criterion algorithm which can largely reduce the average number of decoding iterations of turbo code. Through simulations, it is verifying that the proposed algorithm can efficiently stop the iterative decoding by using the variance value of error probability for the soft output value, and can largely reduce the average number of decoding iterations without BER performance degradation. As a result of simulation, the average number of decoding iterations for the proposed algorithm is reduced by about 2.25% ~14.31％ and 3.79％ ~14.38% respectively compared to conventional schemes, and power consumption is saved in proportion to the number of decoding iterations.