• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.131-139
• /
• 2007

This paper proposed a multi-resolution algorithm. Its search point and complexity were compared with those of block match algorithm. Also the speed up comparison was made with the block match algorithm. The proposed multi-resolution NTSS-3 Level algorithm was compared again with its targets, TSS-3 Level algorithm and NTSS algorithm. The comparison results showed that the NTSS-3 Level algorithm was superior in search point and speed up. Accordingly, the proposed NTSS-3 Level algorithm was two to three times better in search point and two to four times better in complexity calculation than those of the compared object, the block match algorithm. In speed up, the proposed NTSS-3 Level algorithm was two times better. Accordingly, the proposed multi-resolution NTSS-3 Level algorithm showed PSNR ration portion excellency in search point and speed up.

• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.297-300
• /
• 2000

This paper proposes a high-speed and area-efficient FFT algorithm and performs a hardware implementation. This algorithm, named by “Radix-4/2”, uses the feature of existing radix-2$^3$algorithm, It reduces the number of non-trivial multipliers in SFG to the ratio of 3 to 2 campared with radix-2 or radix-4 algorithm and radix-4/2 has also twice throughput as radix-2$^3$algorithm's. It is proved that FFT processor using the proposed algorithm and 64-point MDC pipeline architecture has twice throughput as radix-2$^3$algorithm's, and reduces areas by 25 percentages in contrast to radix-4 algorithm's.

• 한국기계연구소 소보
• /
• s.20
• /
• pp.13-20
• /
• 1990

An algorithm is presented for 3-dimensional contour lines with a hidden line removal ~technique developed by T.L. Janssen(l). Contour line algorithm on any 3-dimensional plane cutting solid body is also shown. NUFIG(2) algorithm is adopted for searching contour lines. Test problems show well-established contour lines on the surface and also on the cutting plane of the structure.

• Proceedings of the KIPE Conference
• /
• 2002.11a
• /
• pp.199-202
• /
• 2002

This paper suggests the control algorithm of a 3-phase 3-wire series active power filters which have harmonic voltage source and harmonic current source This suggested control algorithm can compensate harmonics which are generated by nonlinear load such as diode or thyristor converter and reactive power in 3-phase 3-wire power distribution system This control algorithm extracts a compensation voltage reference from performance function without phase transformation Therefore this control algorithm is simpler than any other conventional control algorithm. 3-phase 3-wire series active power filter and hybrid active power filter is manufactured and experiments are carried out for harmonic voltage source and harmonic current source to verify the effectiveness of presented control algorithm Experimental results are presented in this Paper, as well.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.31-34
• /
• 1999

In this paper, the improved initial cell searching algorithm is proposed for 3GPP W-CDMA system. The key objective of the proposed algorithm is to utilize the reliability of the first stage of cell searching algorithm in order to accomplish the second stage. So the proposed algorithm makes the mobile station transfers to the second stage from the first stage, just after the slot synchronization is declared successively at the same time-offset. In order to compare the proposed algorithm with the conventional one, the simulations are accomplished for cell search algorithm for 3GPP W-CDMA systems in the multipath Rayleigh fading channel. Some parameters are also presented for the better performance in the initial cell searching algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.12
• /
• pp.1825-1833
• /
• 1990

This paper proposes an efficient algorithm that constructs 3-dimensional solid object from 3 orthogonal views. This algorithm inputs vertex and edge information of 3 orthogonal views and generates 2 dimensional surfaces, 3 dimensional vertices, edges and surfaces and then compares 2 dimensional projections of 3 dimensional surfaces with surfaces from othorgonal views. This algorithm is useful for CAD system, 3 dimensional scene analysis system and object modeling for real-time animation and has been implemented in C language on IRIS workstation. The effectiveness of this algorithm is shown by examples of aircrafts' models.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• v.3B no.3
• /
• pp.128-132
• /
• 2003

This paper presents the optimum design of a Linear Induction Motor (LIM) using Genetic algorithm, Niching Genetic algorithm and Neural Network. The design variables are optimized by different optimization methods and the results are discussed.

• Journal of information and communication convergence engineering
• /
• v.3 no.3
• /
• pp.119-121
• /
• 2005

This paper aims to estimate the delay time of multiple signals in a multi-path environment. It also seeks to carry out a comparative analysis with the existing delay time under the proposed algorithm to develop a new algorithm that applies the space average method in a MUSIC algorithm. Unlike the existing delay time estimation algorithm, the developed algorithm was able to estimate the delay time in 5ns low. Therefore, the algorithm proposed in this paper improved the existing delay time estimated algorithm.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.901-914
• /
• 1999

In [6] Schensted constructed the Schensted algorithm giving a bijection between permutations and pairs of Young standard tableaux. After knuth generalized it to column strict tableaux in [3] various analogs of the Schensted algorithm came. In this paper we describe the bumping algorithm on the shifted rim hook tableaux which is the basic building block of the Schensted algorithm for shifted rim book tableaux.

• Nuclear Engineering and Technology
• /
• v.54 no.9
• /
• pp.3403-3414
• /
• 2022

The purpose of this study is to model and optimize the block-matching and 3D filtering (BM3D) algorithm and to evaluate its applicability in brain single-photon emission computed tomography (SPECT) images using a fan beam collimator. For quantitative evaluation of the noise level, the coefficient of variation (COV) and contrast-to-noise ratio (CNR) were used, and finally, a no-reference-based evaluation parameter was used for optimization of the BM3D algorithm in the brain SPECT images. As a result, optimized results were derived when the sigma values of the BM3D algorithm were 0.15, 0.2, and 0.25 in brain SPECT images acquired for 5, 10, and 15 s, respectively. In addition, when the sigma value of the optimized BM3D algorithm was applied, superior results were obtained compared with conventional filtering methods. In particular, we confirmed that the COV and CNR of the images obtained using the BM3D algorithm were improved by 2.40 and 2.33 times, respectively, compared with the original image. In conclusion, the usefulness of the optimized BM3D algorithm in brain SPECT images using a fan beam collimator has been proven, and based on the results, it is expected that its application in various nuclear medicine examinations will be possible.