• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.3
• /
• pp.562-569
• /
• 2019

Raman spectroscopy has been receiving increased attention as a standoff explosive detection technique. In addition, there is a growing need for a fast search method that can identify raman spectrum for measured chemical substances compared to known raman spectra in large database. By far the most simple and widely used method is to calculate and compare the Euclidean distance between the given spectrum and the spectra in a database. But it is non-trivial problem because of the inherent high dimensionality of the data. One of the most serious problems is the high computational complexity of searching for the closet spectra. To overcome this problem, we presented the MPS Sort with Sorted Variance+PDS method for the fast algorithm to search for the closet spectra in the last paper. the proposed algorithm uses two significant features of a vector, mean values and variance, to reject many unlikely spectra and save a great deal of computation time. In this paper, we present two new methods for the fast algorithm to search for the closet spectra. the PCA+PDS algorithm reduces the amount of computation by reducing the dimension of the data through PCA transformation with the same result as the distance calculation using the whole data. the Hierarchical Cluster Tree algorithm makes a binary hierarchical tree using PCA transformed spectra data. then it start searching from the clusters closest to the input spectrum and do not calculate many spectra that can not be candidates, which save a great deal of computation time. As the Experiment results, PCA+PDS shows about 60.06% performance improvement for the MPS Sort with Sorted Variance+PDS. also, Hierarchical Tree shows about 17.74% performance improvement for the PCA+PDS. The results obtained confirm the effectiveness of the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1970-1982
• /
• 1993

This paper describes an efficient array algorithm for parallel computation of vector-radix two-dimensional (2-D) fast discrete cosine transform (VR-FCT), and its VLSI implementation. By mapping the 2-D VR-FCT onto a 2-D array of processing elements (PEs), the butterfly structure of the VR-FCT can be efficiently importanted with high concurrency and local communication geometry. The proposed array algorithm features architectural modularity, regularity and locality, so that it is very suitable for VLSI realization. Also, no transposition memory is required, which is invitable in the conventional row-column decomposition approach. It has the time complexity of O(N+Nnzp-log2N) for (N*N) 2-D DCT, where Nnzd is the number of non-zero digits in canonic-signed digit(CSD) code, By adopting the CSD arithmetic in circuit desine, the number of addition is reduced by about 30%, as compared to the 2`s complement arithmetic. The computational accuracy analysis for finite wordlength processing is presented. From simulation result, it is estimated that (8*8) 2-D DCT (with Nnzp=4) can be computed in about 0.88 sec at 50 MHz clock frequency, resulting in the throughput rate of about 72 Mega pixels per second.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.291-300
• /
• 1999

인터넷을 기반으로 한 정보통신의 급속한 발전이라는 기업환경의 변화에 적응하기 위해서 기업은 점차 모든 경영시스템을 인터넷을 기반으로 하도록 변화시키고 있을 뿐만 아니라, 기업 조직 또한 전세계를 기반으로한 글로벌 기업 형태로 변화하고 있다. 이러한 급속한 경영환경의 변화로 인해서 기업 내에서는 종전과는 다른 형태의 부서간 상호의사결정조정 과정이 필요하게 되었다. 일반 기업들을 대상으로 한 상호의사결정의 지원과정에 대해서는 기존에 많은 연구들이 있었으나 글로벌기업과 같은 네트워크 형태의 새로운 형태의 기업에 있어서의 상호의사결정과정을 지원할 수 있는 의사결정지원시스템에 대해서는 단순한 그룹의사결정지원시스템 또는 분산의사결정지원시스템과 같은 연구들이 주를 이루고 있다. 따라서 본 연구에서는 인터넷 특히, 웹을 기반으로 한 기업의 글로벌경영 및 분산 경영에서 비롯되는 부서간 상호의사결정이라는 문제를 효율적으로 지원할 수 있는 기업의 글로벌경영 및 분산 경영에서 비롯되는 부서간 상호의사결정이라는 문제를 효율적으로 지원할 수 있는 메커니즘을 제시하고 이에 기반한 프로토타입 형태의 시스템을 구현하여 성능을 검증하고자 한다. 특히, 기업 내에서 가장 대표적으로 상호의사결정지원이 필요한 생산과 마케팅 부서를 대상으로 상호의사결정지원 메커니즘을 개발하고 실험을 진행하였다. 그 결과 글로벌 기업내의 생산과 마케팅 부서간 상호의사결정을 효율적으로 지원 할 수 있는 상호조정 메카니즘인 개선된 PROMISE(PROduction and Marketing Interface Support Environment)를 기반으로 한 웹 분산의사결정지원시스템 (Web-DSS : Web-Decision Support Systems)을 제안하는 바이다.자대상 벤처기업의 선정을 위한 전문가시스템을 구축중이다.의 밀도를 비재무적 지표변수로 산정하여 로지스틱회귀 분석과 인공신경망 기법으로 검증하였다. 로지스틱회귀분석 결과에서는 재무적 지표변수 모형의 전체적 예측적중률이 87.50%인 반면에 재무/비재무적 지표모형은 90.18%로서 비재무적 지표변수 사용에 대한 개선의 효과가 나타났다. 표본기업들을 훈련과 시험용으로 구분하여 분석한 결과는 전체적으로 재무/비재무적 지표를 고려한 인공신경망기법의 예측적중률이 높은 것으로 나타났다. 즉, 로지스틱회귀 분석의 재무적 지표모형은 훈련, 시험용이 84.45%, 85.10%인 반면, 재무/비재무적 지표모형은 84.45%, 85.08%로서 거의 동일한 예측적중률을 가졌으나 인공신경망기법 분석에서는 재무적 지표모형이 92.23%, 85.10%인 반면, 재무/비재무적 지표모형에서는 91.12%, 88.06%로서 향상된 예측적중률을 나타내었다.ting LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computation. Adaptive transversal filter with proposed data recycling buffer

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.139-148
• /
• 1999

오늘날 기술집약적인 벤처기업들에 대한 관심이 집중되고 있다. 소수의 진취적인 벤처기업들이 기술개발 및 신상품 개발 등 두드러진 활약을 보이고 있기 때문이다. 그러나 실제 이 벤처기업의 성공 가능성은 그렇게 높지 않다. 특히 벤처기업 환경이 아직 미약한 국내의 경우 위험부담이 훨씬 더 크다. 이러한 벤처기업 환경에서 투자대상 벤처기업을 선정하는 것은 매우 전략적인 의사결정이다. 일반적으로 일반 벤처투자가들은 관심이 있는 산업에 해당하는 기업의 사업계획서와 기초적인 관련 정보를 토대로 투자여부를 결정한다. 그렇지만 실제로는 이와 같은 분석에 필수적으로 요구되는 정보가 불확실할 뿐만 아니라 기술분야에 대한 전문적 지식도 부족하기 때문에 투자 여부를 결정하는 것은 매우 복잡하고 어려운 문제이다. 그러므로 투자대상 벤처기업의 선정을 효과적으로 지원해주는 체계적인 접근이 필요하다. 특히 벤처 사업과 관련된 기술 동향 및 수준 등에 관련된 전문 지식과 경험이 체계적으로 제공되어야 하고 또한 벤처 투자가의 개인적 경험과 판단이 평가 프로세스에 직접적으로 반영될 수 있어야 한다. 이에 본 연구에서는 전문가의 지식과 경험을 체계화하고 투자가의 개인적 판단을 효과적으로 수용할 수 있는 전문가시스템의 접근방법을 제시하고자 한다. 투자대상 벤처기업의 선정을 위한 전문가시스템을 구축하기 위해 본 연구에서는 다양한 정보수집 과정을 거쳤다. 우선 벤처 투자와 관련된 기존 문헌을 심층 분석하였으며 아울러 벤처 투자 업계에서 활약중인 전문 벤처캐피탈리스트들과의 수차례 인터뷰를 통해 벤처기업 평가의 주요 요인과 의사결정 과정을 파악할 수 있었다. 이러한 과정을 통하여 본 연구에서는 벤처 투자의 90%를 차지하는 정보통신분야에 속한 기법 중에서 투자대상 벤처기업의 선정을 위한 전문가시스템을 구축중이다.의 밀도를 비재무적 지표변수로 산정하여 로지스틱회귀 분석과 인공신경망 기법으로 검증하였다. 로지스틱회귀분석 결과에서는 재무적 지표변수 모형의 전체적 예측적중률이 87.50%인 반면에 재무/비재무적 지표모형은 90.18%로서 비재무적 지표변수 사용에 대한 개선의 효과가 나타났다. 표본기업들을 훈련과 시험용으로 구분하여 분석한 결과는 전체적으로 재무/비재무적 지표를 고려한 인공신경망기법의 예측적중률이 높은 것으로 나타났다. 즉, 로지스틱회귀 분석의 재무적 지표모형은 훈련, 시험용이 84.45%, 85.10%인 반면, 재무/비재무적 지표모형은 84.45%, 85.08%로서 거의 동일한 예측적중률을 가졌으나 인공신경망기법 분석에서는 재무적 지표모형이 92.23%, 85.10%인 반면, 재무/비재무적 지표모형에서는 91.12%, 88.06%로서 향상된 예측적중률을 나타내었다.ting LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computation. Adaptive transversal filter with proposed data recycling buffer algorithm could efficiently reject ISI of channel and in

• Journal of Internet Computing and Services
• /
• v.21 no.4
• /
• pp.117-126
• /
• 2020

A maritime object detection system is an intelligent assistance system to maritime autonomous surface ship(MASS). It detects automatically floating debris, which has a clash risk with objects in the surrounding water and used to be checked by a captain with a naked eye, at a similar level of accuracy to the human check method. It is used to detect objects around a ship. In the past, they were detected with information gathered from radars or sonar devices. With the development of artificial intelligence technology, intelligent CCTV installed in a ship are used to detect various types of floating debris on the course of sailing. If the speed of processing video data slows down due to the various requirements and complexity of MASS, however, there is no guarantee for safety as well as smooth service support. Trying to solve this issue, this study conducted research on the minimization of computation volumes for video data and the increased speed of data processing to detect maritime objects. Unlike previous studies that used the Hough transform algorithm to find the horizon and secure the areas of interest for the concerned objects, the present study proposed a new method of optimizing a binarization algorithm and finding areas whose locations were similar to actual objects in order to improve the speed. A maritime object detection system was materialized based on deep learning CNN to demonstrate the usefulness of the proposed method and assess the performance of the algorithm. The proposed algorithm performed at a speed that was 4 times faster than the old method while keeping the detection accuracy of the old method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.6
• /
• pp.1083-1091
• /
• 2017

This paper describes a design of cryptographic processor supporting 224-bit elliptic curves over prime field defined by NIST. Scalar point multiplication that is a core arithmetic function in elliptic curve cryptography(ECC) was implemented by adopting the modified Montgomery ladder algorithm. In order to eliminate division operations that have high computational complexity, projective coordinate was used to implement point addition and point doubling operations, which uses addition, subtraction, multiplication and squaring operations over GF(p). The final result of the scalar point multiplication is converted to affine coordinate and the inverse operation is implemented using Fermat's little theorem. The ECC processor was verified by FPGA implementation using Virtex5 device. The ECC processor synthesized using a 0.18 um CMOS cell library occupies 2.7-Kbit RAM and 27,739 gate equivalents (GEs), and the estimated maximum clock frequency is 71 MHz. One scalar point multiplication takes 1,326,985 clock cycles resulting in the computation time of 18.7 msec at the maximum clock frequency.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.129-137
• /
• 2001

Matching pursuit algorithm was successfully demonstrated useful in low bit-rate video coding, However, one of the practical concerns related to applying the matching pursuit algorithm to application is its massive computation required for finding bases whose weighted sum best approximates the given input image. The main contribution of this paper is that we provide a new method that can drastically reduce the computational load without any degradation of image quality. Its main idea is based on reducing the number of inner product calculation required for finding best bases because the complexity of matching pursuit algorithm is due to the exhaustive local inner product calculation. As the first step, we compute a matrix which is the 1-D inner product of the given motion-compensated error input image with the 1-D vertical Gabor functions using the separable property of Gabor bases. In the second step, we calculate length of each vector in the matrix that corresponds to 1-D horizontal Gabor function, and compare the length with the current maximum absolute inner product value so far. According to the result of this comparison, one can decide whether or not to calculate the inner product. Since most of them do not need to calculate the inner product value, one can significantly reduce the computational load. Experimental results show that proposed method reduces about 70% of inner product calculation compared to the Neff's fast algorithm without any degradation of image quality.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.1
• /
• pp.22-30
• /
• 2011

In this paper, we propose a memory efficient multi-rate Low Density Parity Check (LDPC) decoder for China Mobile Multimedia Broadcasting (CMMB). We find the best trade-off between the performance and the circuit area by designing a partially parallel decoder which is capable of passing multiple messages in parallel. By designing an efficient address generation unit (AGU) with an index matrix, we could reduce both the amount of memory requirement and the complexity of computation. The proposed regular LDPC decoder was designed in Verilog HDL and was synthesized by Synopsys' Design Compiler using Chartered $0.18{\mu}m$ CMOS cell library. The synthesized design has the gate size of 455K (in NAND2). For the two code rates supported by CMMB, the rate-1/2 decoder has a throughput of 14.32 Mbps, and the rate-3/4 decoder has a throughput of 26.97 Mbps. Compared with a conventional LDPC for CMMB, our proposed design requires only 0.39% of the memory.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.1
• /
• pp.29-38
• /
• 2005

The fluid animation procedure consists of physical simulation and visual rendering. In the physical simulation of fluids, the most frequently used practices are the numerical simulation of fluid particles using particle dynamics equations and the continuum analysis of flow via Wavier-Stokes equation. Particle dynamics method is fast in calculation, but the resulting fluid motion is conditionally unrealistic The method using Wavier-Stokes equation, on the contrary, yields lifelike fluid motion when properly conditioned, yet the complexity of calculation restrains this method from being used in real-time applications. Global illumination is generally successful in producing premium-Duality rendered images, but is also excessively slow for real-time applications. In this paper, we propose a rapid fluid animation method incorporating enhanced particle dynamics simulation method and pre-integrated volume rendering technique. The particle dynamics simulation of fluid flow was conducted in real-time using Lennard-Jones model, and the computation efficiency was enhanced such that a small number of particles can represent a significant volume. For real-time rendering, pre-integrated volume rendering method was used so that fewer slices than ever can construct seamless inter-laminar shades. The proposed method could successfully simulate and render the fluid motion in real time at an acceptable speed and visual quality.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.212-218
• /
• 2003

State invariant is a property that holds in every reachable state. It can be used not only in understanding and analyzing complex software systems, but it can also be used for system verifications such as checking safety, liveness, and consistency. For these reasons, there are many vital researches for deriving state invariant from finite state machine models. In previous works every reachable state is to be considered to generate state invariant. Thus it is likely to be too complex for the user to understand. This paper seeks to answer the question `how to simplify state invariant\ulcorner`. Since the complexity of state invariant is strongly dependent upon the size of states to be considered, so the smaller the set of states to be considered is, the shorter the length of state invariant is. For doing so, we let the user focus on some interested scopes rather than a whole state space in a model. Computation Tree Logic(CTL) is used to specify scopes in which he/she is interested. Given a scope in CTL, mixed reachability analysis is used to find out a set of states inside it. Obviously, a set of states calculated in this way is a subset of every reachable state. Therefore, we give a weaker, but comprehensible, state invariant.