• The Journal of the Korea Contents Association
• /
• v.21 no.12
• /
• pp.816-827
• /
• 2021

The purpose of this study is to understand the relationship between fear and anger emotions in the discourse produced by the media during the period of major emerging infectious diseases (SARS, Swine Flu, MERS, and COVID-19) that occurred since 2000 in Korea. The researcher collected editorial articles of the major daily newspaper after a significant epidemic of new infectious diseases and analyzed them using the Extended Parallel Processing Model (EPPM) and text mining techniques. In all epidemic times, fear appears stronger than anger, but the smaller the fear, the greater the risk control message is produced. In detail, fear emerges strongly in the discourse of the risk of infectious diseases or the economic crisis. Anger appears strong when the government's quarantine failures, groups where group infections occurred, and concealing information about infectious diseases. In this process, anger is strongly expressed against the factors that threaten the safety of society. Anger is also an emotion that can justify strong quarantine, but it can be the basis for discourse on minority hate. In this respect, anger is a two-sided emotion, so it must be handled carefully in the media.

• Journal of the Korean Society of Radiology
• /
• v.83 no.6
• /
• pp.1229-1239
• /
• 2022

Recently, artificial intelligence (AI) technology has shown potential clinical utility in a wide range of MRI fields. In particular, AI models for improving the efficiency of the image acquisition process and the quality of reconstructed images are being actively developed by the MR research community. AI is expected to further reduce acquisition times in various MRI protocols used in clinical practice when compared to current parallel imaging techniques. Additionally, AI can help with tasks such as planning, parameter optimization, artifact reduction, and quality assessment. Furthermore, AI is being actively applied to automate MR image analysis such as image registration, segmentation, and object detection. For this reason, it is important to consider the effects of protocols or devices in MR image analysis. In this review article, we briefly introduced issues related to AI application of MR image acquisition and reconstruction.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.3
• /
• pp.164-173
• /
• 2014

In underwater robotics, vision would be a key element for recognition in underwater environments. However, due to turbidity an underwater optical camera is rarely available. An underwater imaging sonar, as an alternative, delivers low quality sonar images which are not stable and accurate enough to find out natural objects by image processing. For this, artificial landmarks based on the characteristics of ultrasonic waves and their recognition method by a shape matrix transformation were proposed and were proven in Part 1. But, this is not working properly in undulating and dynamically noisy sea-bottom. To solve this, we propose a framework providing a selection phase of likelihood candidates, a selection phase for final candidates, recognition phase and tracking phase in sequence images, where a particle filter based selection mechanism to eliminate fake candidates and a mean shift based tracking algorithm are also proposed. All 4 steps are running in parallel and real-time processing. The proposed framework is flexible to add and to modify internal algorithms. A pool test and sea trial are carried out to prove the performance, and detail analysis of experimental results are done. Information is obtained from tracking phase such as relative distance, bearing will be expected to be used for control and navigation of underwater robots.

• Journal of Biomedical Engineering Research
• /
• v.20 no.1
• /
• pp.107-113
• /
• 1999

The purpose of this study was to develop a miniature imaging gamma probe with high performance that can detect small or residual tumors after surgery. Gamma probe detector system consists of NaI(Tl) scintillator, position sensitive photomultiplier tube (PSPMT), and collimator. PSPMT was optically coupled with 6.5 mm thick, 7.62 cm diameter of NaI(Tl) crystal and supplied with -1000V for high voltage. Parallel hexagonal hole collimator was manufactured for characteristics of 40-mm hole length, 1.3-mm hole diameter, and 0.22 mm septal thickness. Electronics consist of position and trigger signal readout systems. Position signals were obtained with summing, subtracting, and dividing circuit using preamplifer and amplifier. Trigger signals were obtained using summing amplifier, constant fraction discriminator, and gate and delay generator module with preamplifer. Data acquisition and processing were performed by Gamma-PF interface board inserted into pentium PC and PIP software. For imaging studies, flood and slit mask images were acquired using a point source. Two hole phantom images were also acquired with collimator. Intrinsic and system spatial resolutions were measured as 3.97 mm and 5.97 mm, respectively. In conclusion, Miniature gamma probe images based on the PSPMT showed good image quality, we conclude that the miniature imaging gamma probe was successfully developed and good image data were obtained. However, further studies will be required to optimize imaging characteristics.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.86-95
• /
• 2009

Efficient DAG scheduling is critical for achieving high performance in heterogeneous computing environments. Finding an optimal solution to the problem of scheduling an application modeled by a directed acyclic graph(DAG) onto a set of heterogeneous machines is known to be an NP-complete problem. In this paper we propose a new list scheduling algorithm, called the Heterogeneous Rank-Path Scheduling(HRPS) algorithm, to exploit all of a program's available parallelism in distributed heterogeneous computing system. The primary goal of HRPS is to minimize the schedule length of applications. The performance of the algorithm has been observed by its application to some practical DAGs, and by comparing it with other existing scheduling algorithm such as CPOP, HCPT and FLB in term of the schedule length. The comparison studies show that HRPS significantly outperform CPOP, HCPT and FLB in schedule length.

• The KIPS Transactions:PartD
• /
• v.19D no.2
• /
• pp.151-160
• /
• 2012

Most of the distributed high-dimensional indexing structures provide a reasonable search performance especially when the dataset is uniformly distributed. However, in case when the dataset is clustered or skewed, the search performances gradually degrade as compared with the uniformly distributed dataset. We propose a method of improving the k-nearest neighbor search performance for the distributed vector approximation-tree based on the strongly clustered or skewed dataset. The basic idea is to compute volumes of the leaf nodes on the top-tree of a distributed vector approximation-tree and to assign different number of bits to them in order to assure an identification performance of vector approximation. In other words, it can be done by assigning more bits to the high-density clusters. We conducted experiments to compare the search performance with the distributed hybrid spill-tree and distributed vector approximation-tree by using the synthetic and real data sets. The experimental results show that our proposed scheme provides consistent results with significant performance improvements of the distributed vector approximation-tree for strongly clustered or skewed datasets.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.10
• /
• pp.2143-2149
• /
• 2012

DVB-S2 employs LDPC codes which approach to the Shannon's limit, since it has characteristics of a good distance, error floor does not appear. Furthermore it is possible to processes full parallel processing. However, it is very difficult to high speed decoding because of a large block size and number of many iterations. This paper present HSS algorithm to reduce the iteration numbers without performance degradation. In the flooding scheme, the decoder waits until all the check-to-variable messages are updated at all parity check nodes before computing the variable metric and updating the variable-to-check messages. The HSS algorithm is to update the variable metric on a check by check basis in the same way as one code draws benefit from the other. Eventually, LDPC decoding speed based on HSS algorithm improved 30% ~50% compared to conventional one without performance degradation.

• The KIPS Transactions:PartB
• /
• v.10B no.7
• /
• pp.837-846
• /
• 2003

This paper deals with plain figures on the architectural drawings of apartment. This kind of architectural drawings consist of main walls represented by two parallel bold lines, symbols (door, window, $\cdots$), dimension line, extension line, and dimensions represent various numerical values and characters. This paper suggests a method for recognizing main wall which is a backbone of apartment in an architectural drawing. In this thesis, the following modules are realized : an efficient image barbarization, a removal of thin lines, a vectorization of detected lines, a region bounding for main walls, a calculation of extension lines, a finding main walls based on extension line, and a field expansion by searching other main walls which are linked with the detected main walls. Although the windows between main walls are not represented as main walls, a detection module for the windows is considered during the recognition period. So the windows are found as a part of main wall. An experimental result on 9 different architectural drawings shows 96.5% recognition of main walls and windows, which is about 5.8% higher than that of Karl Tombre.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.1
• /
• pp.8-17
• /
• 2002

This paper suggests that the immune algorithm can effectively be used in tuning of a PID controller. The artificial immune network always has a new parallel decentralized processing mechanism for various situations, since antibodies communicate to each other among different species of antibodies/B-cells through the stimulation and suppression chains among antibodies that form a large-scaled network. In addition to that, the structure of the network is not fixed, but varies continuously. That is, the artificial immune network flexibly self-organizes according to dynamic changes of external environment (meta-dynamics function). However, up to the present time, models based on the conventional crisp approach have been used to describe dynamic model relationship between antibody and antigen. Therefore, there are some problems with a less flexible result to the external behavior. On the other hand, a number of tuning technologies have been considered for the tuning of a PID controller. As a less common method, the fuzzy and neural network or its combined techniques are applied. However, in the case of the latter, yet, it is not applied in the practical field, in the former, a higher experience and technology is required during tuning procedure. In addition to that, tuning performance cannot be guaranteed with regards to a plant with non-linear characteristics or many kinds of disturbances. Along with these, this paper used immune algorithm in order that a PID controller can be more adaptable controlled against the external condition, including moise or disturbance of plant. Parameters P, I, D encoded in antibody randomly are allocated during selection processes to obtain an optimal gain required for plant. The result of study shows the artificial immune can effectively be used to tune, since it can more fit modes or parameters of the PID controller than that of the conventional tuning methods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.1-7
• /
• 2009

When constructing various mobile networks including sensor networks, the problem of finding the layout or graph to interconnect the terminals or nodes of the network may come up. Providing a common scheme that can be applied to the kind of problems, and formulating the bounds of the run time and the result of the algorithm from the scheme, one may evaluate precisely the plan of constructing analogous network systems. This paper, dealing with EMST(Euclidean Minimum Spanning Tree) that represents such problems, provides the scheme for constructing EMST by parallel processing over distributed environments, and the ground for determining the maximum difference of the layout or the graph produced from the scheme: the difference from EMST. In addition, it provides the upper bound of the run time of the algorithm from the scheme.