• The Journal of the Korea Contents Association
• /
• v.20 no.12
• /
• pp.278-286
• /
• 2020

The prisoner's dilemma game which is a representative example of game theory is being studied with interest by many economists, social scientists, and computer scientists. In recent years, many researches on computational approaches that apply evolutionary computation techniques such as genetic algorithms and particle swarm optimization have been actively conducted to analyze prisoner dilemma games. In this study, we intend to evolve a strategy for a iterated prisoner dilemma game participating two or more players using three different binary particle swarm optimization techniques. As a result of experimenting by applying three kinds of binary particle swarm optimization to the iterated prisoner's dilemma game, it was confirmed that mutual cooperation can be established even among selfish participants to maximize their own gains. However, it was also confirmed that the more participants, the more difficult to establish a mutual cooperation relationship.

• Nuclear Medicine and Molecular Imaging
• /
• v.41 no.3
• /
• pp.234-240
• /
• 2007

Purpose: In this study we propose a block-iterative method for reconstructing Compton scattered data. This study shows that the well-known expectation maximization (EM) approach along with its accelerated version based on the ordered subsets principle can be applied to the problem of image reconstruction for Compton camera. This study also compares several methods of constructing subsets for optimal performance of our algorithms. Materials and Methods: Three reconstruction algorithms were implemented; simple backprojection (SBP), EM, and ordered subset EM (OSEM). For OSEM, the projection data were grouped into subsets in a predefined order. Three different schemes for choosing nonoverlapping subsets were considered; scatter angle-based subsets, detector position-based subsets, and both scatter angle- and detector position-based subsets. EM and OSEM with 16 subsets were performed with 64 and 4 iterations, respectively. The performance of each algorithm was evaluated in terms of computation time and normalized mean-squared error. Results: Both EM and OSEM clearly outperformed SBP in all aspects of accuracy. The OSEM with 16 subsets and 4 iterations, which is equivalent to the standard EM with 64 iterations, was approximately 14 times faster in computation time than the standard EM. In OSEM, all of the three schemes for choosing subsets yielded similar results in computation time as well as normalized mean-squared error. Conclusion: Our results show that the OSEM algorithm, which have proven useful in emission tomography, can also be applied to the problem of image reconstruction for Compton camera. With properly chosen subset construction methods and moderate numbers of subsets, our OSEM algorithm significantly improves the computational efficiency while keeping the original quality of the standard EM reconstruction. The OSEM algorithm with scatter angle- and detector position-based subsets is most available.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.1
• /
• pp.27-36
• /
• 2000

As a potential approach for non-destructive testing of concrete structures, we evaluate the time-of-flight (TOF) ultrasound tomography technique In conventional X ray tomography, the reconstructed Image corresponds to the internal attenuation coefficient However, in TOF ultrasound tomography, the reconstructed Image is proportional to the retractive index of the medium Because refractive effects are minimal for X-rays, conventional reconstruction techniques are applied to reconstruct the Image in X-ray tomography However, since ultrasound travels in curved path, due to the spatial variations in the refractive index of the medium, the path must be known to correctly reconstruct the Image. Algorithm for determining the ultrasound path is developed from a Geometrical Optics point view and the image reconstruction algorithm, since the paths are curved It requires the algebraic approach, namely the ART or the SIRT Here, the difference between the computed and the measured TOP data is used as a basis, for the iteration process First the initial image is reconstructed assuming straight paths. It then updates the path based on the recently reconstructed image This process of reconstruction and path determination repeats until convergence The proposed algorithm is evaluated by computer simulations, and in addition is applied to a real concrete structure.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.5
• /
• pp.467-474
• /
• 2019

In this paper, we propose a novel method to improve FPS while maintaining the accuracy of YOLO v2 model in NVIDIA Jetson TX1. In general, in order to reduce the amount of computation, a conversion to an integer operation or reducing the depth of a network have been used. However, the accuracy of recognition can be deteriorated. So, we use methods to reduce computation and memory consumption through adjustment of the filter size and integrated computation of the network The first method is to replace the $3{\times}3$ filter with a $1{\times}1$ filter, which reduces the number of parameters to one-ninth. The second method is to reduce the amount of computation through CBR (Convolution-Add Bias-Relu) among the inference acceleration functions of TensorRT, and the last method is to reduce memory consumption by integrating repeated layers using TensorRT. For the simulation results, although the accuracy is decreased by 1% compared to the existing YOLO v2 model, the FPS has been improved from the existing 3.9 FPS to 11 FPS.

• Journal of Internet Computing and Services
• /
• v.9 no.3
• /
• pp.1-8
• /
• 2008

With growing interest in location-based service (LBS), there is increasing necessity for nearest neighbor (NN) search through query while the user is moving. NN search in such a dynamic environment has been performed through the repeated applicaton of the NN method to the search segment, but this increases search cost because of unnecessary redundant calculation. We propose slabbed continuous nearest neighbor (Slabbed_CNN) search, which is a new method that searches CNN in the search segment while moving, Slabbed_CNN reduces calculation costs and provides faster services than existing CNN by reducing the search area and calculation cost of the existing CNN method through reducing the search segment using slabs.

• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1542-1552
• /
• 1999

자료 병렬성이란 자료 집합의 원소들에 대하여 동일한 작업을 동시에 수행하므로써 얻어지는 병렬성을 말한다. 함수형 언어에서 자료 집합에 대한 반복 수행은 재귀적 자료형에 대한 재귀 함수에 의하여 표현된다. 본 논문에서는 이러한 재귀 함수를 자료 병렬 프로그램으로 변환하기 위한 병렬화 방법을 제시한다. 생성되는 병렬 프로그램의 병렬 수행 구조로는 일반적인 형태의 재귀적 자료형에 대하여 정의되는 다형적인 자료 병렬 연산을 사용하여 트리, 리스트 등과 같은 일반적인 재귀적 자료 집합에 대한 자료 병렬 수행이 가능하도록 하였다. 재귀 함수의 병렬화를 위해서는, 함수를 이루는 각각의 계산들의 병렬성을 재귀 호출에 의해 존재하는 의존성에 기반하여 분류하고, 이에 기반하여 각각의 계산들에 대한 적절한 자료 병렬 연산을 사용하는 병렬 프로그램을 생성하였다.Abstract Data parallelism is obtained by applying the same operations to each element of a data collection. In functional languages, iterative computations on data collections are expressed by recursions on recursive data structures. We propose a parallelization method for data-parallel implementation of such recursive functions. We employ polytypic data-parallel primitives to represent the parallel execution structure of the object programs, which enables data parallel execution with general recursive data structures, such as trees and lists. To transform sequential programs to their parallelized versions, we propose a method to classify the types of parallelism in subexpressions, based on the dependencies of the recursive calls, and generate the data-parallel programs using data-parallel primitives appropriately.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.97-103
• /
• 2010

There are many algorithms for 2D to 3D graphic conversion technology which have the high complexity and large scale of iterative computation. So in this paper propose parallel algorithm and high speed graphics accelerator architecture using Park's MAMS(Multiple Access Memory System) for Phong Shading, one of many 3D algorithms. The Proposed SIMD processor architecture is simulated by HDL and simulated and got 30 times faster result. It means any kinds of 3D algorithm can make parallel algorithm and accelerated by SIMD processor with Park's MAMS for real time processing.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.11
• /
• pp.105-113
• /
• 2004

This paper proposes 3D graphics accelerator, especially rendering unit, for portable devices. The existing 3D architecture is not suitable for portable devices because of its huge size. To reduce the size, we use iterative architecture and fixed-point calculation. In this paper, we suggest the format of fixed-point comparing with the result images, and some special technique to control. Finally, it is implemented with FPGA and 0.25um ASIC technology respectively. The ASIC chip can execute 47.88M pixels per second. The size of ASIC chip is 4.9287mm*4.9847mm and the power consumption is 263.7mW with 50MHz operation frequency.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.37 no.4
• /
• pp.35-41
• /
• 2000

In this paper, the multiplicative algorithm of two polynomals over finite field GF(2$^{m}$ ) is presented. The proposed algorithm permits an efficient realization of the parallel multiplication using iterative arrays. At the same time, it permits high-speed operation. This multiplier is consisted of three operation unit: multiplicative operation unit, the modular operation unit, the primitive irreducible operation unit. The multiplicative operation unit is composed of AND gate, X-OR gate and multiplexer. The modular operation unit is constructed by AND gate, X-OR gate. Also, an efficient pipeline form of the proposed multiplication scheme is introduced. All multipliers obtained have low circuit complexity permitting high-speed operation and interconnection of the cells are regular, well-suited for VLSI realization.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.632-635
• /
• 2016

증강현실에서 영상과 증강된 콘텐츠 간의 이질감을 줄이기 위해서 정확한 호모그래피 행렬을 추정해야 하며, 정확한 호모그래피 행렬을 추정할때 RANSAC 알고리즘이 널리 사용된다. 그러나 RANSAC 알고리즘은 랜덤 샘플링 과정을 반복적으로 거치기 때문에 불필요한 연산 과정이 발생하고 이로 인해 알고리즘의 효율이 저하된다. 이러한 단점을 극복하기 위해 DCS-RANSAC 알고리즘이 제안되었다. 제안된 DCS-RANSAC 알고리즘은 이미지를 특징점 분포 패턴에 따라 그룹으로 분류하고 각 그룹에 제약조건 문제를 적용하여 불필요한 연산 과정을 줄이고 정확도를 향상시킨 알고리즘이다. 그러나 DCS-RANSAC 알고리즘에서 사용된 이미지 그룹 데이터는 수동적인 방법을 통해 직관적으로 분류되어 있지만 특징점 분포 패턴이 다양하지 않아 분류시 정확도가 저하되는 경우가 있다. 위의 문제점을 해결하기 위해 본 논문에서는 머신러닝 기법을 통해 이미지들을 자동으로 분류하고 각 그룹마다 각기 다른 제약조건을 적용하는 MCS-RANSAC 알고리즘을 제안한다. 제안하는 알고리즘은 머신러닝 기법을 사용하여 전처리 단계에서 이미지를 분류하고 분류된 이미지에 제약조건을 적용시켜 알고리즘의 처리시간을 줄이고 정확도를 향상시켰다. 실험 결과 본 논문에서 제안하는 MCS-RANSAC은 DCS-RANSAC 알고리즘에 비해 수행시간이 약 6% 단축되었고 호모그래피 오차율은 약 15% 줄어들었으며 참정보 비율은 2.8% 증가한 것으로 확인되었다.