• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.247-249
• /
• 2000

본 논문에서는 대개 잡음이 포함되어 있고 불규칙적인 특성을 갖고 있는 시계열 자료에 대해 신경 트리 모델을 사용하여 시계열 예측 문제를 해결하고자 한다. 주어진 시계열 자료에 적합한 구조와 가중치를 갖는 신경트리를 찾기 위해 베이지안 진화 알고리즘을 적용한 결과, 자료의 개수가 적어 과적합될 우려가 있는 경우 제안된 방법은 모델의 복잡도가 커지는 것을 억제하고 일반화 성능이 급격하게 나빠지지 않는다는 것을 확인하였다.

• Environmental engineer
• /
• v.24 s.256
• /
• pp.18-22
• /
• 2007

본 논문은 네덜란드의 지속가능성 평가(Sustainability Assessment, SA)에 있어 몇몇 최근의 진전을 토의한다. 효율적인 지속가능성 평가를 위한 몇몇 요소들의 강조에 초점을 둔다. SA는 현재로서는 복잡하지만 필수 구성요소이다. 이는 개발의 가능한 방향에 관한 토의의 질을 향상시키고, 대안들 결론 비용 및 이득에 가중치를 둠으로서 종종 국민을 위해 보다 투명한 정책결정의 복잡한 과정을 구성함을 통해 정책 결정의 민주적 질에 기여하는데 중대한 잠재력을 지닌다. 현재 네덜란드에서 SA에 관한 주요 도전은 아직은 산만하지만 포괄적이고 보다 널리 사용되는 도구로 만드는 것이다.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.250-253
• /
• 2006

In this paper, we proposed a new method of the Adaptive steganography using complexity on bit planes of color image. Applying fixing threshold and variable length, if insert information into all bit plans, all bit plans showed different image quality. Therefore, we first defined the complexity on bit plane and data complexity, similarity insert information into bit plans. As a result, the proposed method increased the insertion capacity and improved the image quality than fixing threshold and variable length method.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.769-772
• /
• 2001

Waish-Hadamard Transform은 압축, 필터링, 코드 디자인 등 다양한 이미지처리 분야에 응용되어왔다. 이러한 Hadamard Transform을 기본으로 확장한 Jacket Transform은 행렬의 원소에 가중치를 부여함으로써 Weighted Hadamard Matrix라고 한다. Jacket Matrix의 cocyclic한 특성은 암호화, 정보이론, TCM 등 더욱 다양한 응용분야를 가질 수 있고, Space Time Code에서 대역효율, 전력면에서도 효율적인 특성을 나타낸다 [6],[7]. 본 논문에서는 Distributed Arithmetic(DA) 구조를 이용하여 Fast Jacket Transform(FJT)을 구현한다. Distributed Arithmetic은 ROM과 어큐뮬레이터를 이용하고, Jacket Watrix의 행렬을 분할하고 간략화하여 구현함으로써 하드웨어의 복잡도를 줄이고 기존의 시스톨릭한 구조보다 면적의 이득을 얻을 수 있다. 이 방법은 수학적으로 간단할 뿐 만 아니라 행렬의 곱의 형태를 단지 덧셈과 뺄셈의 형태로 나타냄으로써 하드웨어로 쉽게 구현할 수 있다. 이 구조는 입력데이타의 워드길이가 n일 때, O(2n)의 계산 복잡도를 가지므로 기존의 시스톨릭한 구조와 비교하여 더 적은 면적을 필요로 하고 FPGA로의 구현에도 적절하다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.726-727
• /
• 2016

정보이론에서 엔트로피는 불확실성 또는 복잡성을 정량적으로 표현할 수 있는 개념이다. 이 개념을 차용하여 칼라 이미지에서 지역적인 복잡성을 R,G,B에 대해서 각각 엔트로피로 계산하고 R,G,B의 통계적인 특성을 고려하여 가중치를 부여하여 평균값을 구한 후 이 값을 임계치와 비교하여 복잡도가 큰 픽셀을 외곽선의 일부로 결정하는 알고리즘을 제안하였다. 제안 알고리즘을 기존의 소벨과 프레윗 알고리즘과 비교한 결과 다양한 임계치 값에 대해서 기존 알고리즘보다 시각적으로 우수한 외곽선 겸출 효과를 가짐을 확인하였다.

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

OFDM(Orthogonal Frequency Division Multiplexing) system is robust to frequency selective fading and narrowband interference in high-speed data communications. However, an OPDM signal consists of a number of independently modulated subcarriers and the superposition of these subcarriers causes a problem that can give a large PARR(Peak-to-Average Power Ratio). PTS(Partial Transmit Sequence) scheme can reduce the PAPR by dividing OFDM signal into subblocks and then multiplying the phase weighting factors to each subblocks, but computational complexity for selecting of phase weighting factors increases exponentially with the number of subblocks. Therefore, in this paper, MG-PSO(Modified Greedy algorithm-Particle Swarm Optimization) algorithm that combines modified greedy algorithm and PSO(Particle Swarm Optimization) algorithm is proposed to use for the phase control method in PTS scheme. This method can solve the computational complexity and guarantee to reduce PAPR. We analyzed the performance of the PAPR reduction when we applied the proposed method to telecommunication systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1507-1514
• /
• 2016

Full-image guided filter reflects all pixels of image in filtering by using weight propagation and two-pass model, whereas the existing guide filter is processed based on the kernel window. Therefore the computational complexity can be improved while maintaining characteristics of guide filter, such as edge-preserving, smoothing, and so on. In this paper, we propose an efficient VLSI architecture for the full-image guided filter by analyzing the data dependency, the data frequency and the PSNR analysis of the image in order to achieve enough speed for various applications such as stereo vision, real-time systems, etc. In addition, the proposed efficient scheduling enables the realtime process by minimizing the idle period in weight computation. The proposed VLSI architecture shows 214MHz of maximum operating frequency (image size: 384*288, 965 fps) and 76K of gates (internal memory excluded).

• Journal of Convergence for Information Technology
• /
• v.8 no.5
• /
• pp.101-106
• /
• 2018

Software are being studied to register and manage assets. And Methods for evaluating software systems have been based on subjective evaluation criteria. We propose an evaluation model for evaluating complex assets obtained from the complexity measurement of the preceding asset management system. We used scales to measure and provide logical complexity to measure the complexity of our architectural assets. And we used a method to evaluate whether it expresses attribute value of architecture asset. We have also built an evaluation model criterion for evaluating the usability of the asset data based on the ISO/IEC 25010 quality model characteristics of the SQuaRE Series. When the designers design the asset as a composite asset, the optional evaluation of the negative property that weights are assigned according to the characteristics of each asset is applied to secure the flexibility of the evaluation model.

• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.849-854
• /
• 2004

This paper proposes an algorithm to enhance the execution time of kNN in the document classification. The proposed algorithm is to enhance the execution time by minimizing the computing cost of the similarity between two documents by using the list of pairs, while the conventional kNN uses the iist of pairs. The 1ist of pairs can be obtained by applying the matrix transposition to the list of pairs at the training phase of the document classification. This paper analyzed the proposed algorithm in the time complexity and compared it with the conventional kNN. And it compared the proposed algorithm with the conventional kNN by using routers-21578 data experimentally. The experimental results show that the proposed algorithm outperforms kNN about $90{\%}$ in terms of the ex-ecution time.

• Journal of Broadcast Engineering
• /
• v.3 no.2
• /
• pp.118-126
• /
• 1998

In order to fedice the computational complexity of the motion estimation for the spatio-temporal prediction of the higher layer, two estimation method are proposed. In the first one, the motion vector of the higher layer is estimated within the small search range by using the previously estimated motion vector in the lower layer as an innitial vector. Inthe second one, the notion vector is estimated by the spatio-temporally weighted search, which is combined with the previously estimated motion vector of the lower layer and the weight for spatial prediction. Simulation results show that the proposed methods give the smaller computational complexity without the degradation of the coding efficiency than the conventinal one.