• Asia pacific journal of information systems
• /
• 제6권2호
• /
• pp.107-124
• /
• 1996

본 연구에서는 인터넷 환경에서 그룹의사결정시스템(GDSS)을 활용하기 위해 현재의 인터넷 기능개선 방향에 대해 분석하였다. 이를 위해 먼저 그룹의사결정지시스템의 요구사항을 기존의 문헌을 통해 정보전달, 의사결정 지원 정보제공 및 정보전달 흐름제어로 분류하였다. 다음에는 각 분야별로 현재의 인터넷이 가지고 있는 한계를 분석하고 이러한 한계를 극복할 수 있는 기술적인 대안들을 OSI 계층별로 분석하였다. 분석결과 현재의 인터넷에서 응용 프로그램과 TCP/IP계층 사이에 전달정보흐름 추적기능(Tracing), 응용 프로그램 코딩기능(Application Dependent Coding), 정보전달모드 제어기능(communication Mode Selection) 및 정보보안기능(Encoding/Decoding)이 추가되는 것으로 분석되었다. 또한 링크계층에는 셀교환 방식이 적합한 것으로 분석되었다. 본 연구의 결과는 그룹의사결정지원시스템 디자인 및 향후 인터넷 화상회의를 위한 시스템 디자인에서도 유용하게 적용될 수 있을 것으로 판단된다.

• 한국군사과학기술학회지
• /
• 제23권1호
• /
• pp.28-36
• /
• 2020

Due to the continued demand for high-definition video, video compression technology is steadily developing and the High Efficiency Video Coding standard was established in 2013. However, despite the development of this compression technology, it is very difficult to smoothly transmit VGA-level videos in Ultra-narrowband environments. In this paper, the target information preprocessing algorithm is presented for smooth transmission of target images moving in forest or open-terrain in Ultra-narrowband environment. In addition, for algorithm verification, the target information preprocessing algorithm was simulated and the simulated results were compared with the video compression result without the algorithm being applied.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제13권5호
• /
• pp.430-442
• /
• 2013

This paper presents a fast multi-reference frame integer motion estimator for H.264/AVC. The proposed system uses the previously proposed fast multi-reference frame algorithm. The previously proposed algorithm executes a full search area motion estimation in reference frames 0 and 1. After that, the search areas of motion estimation in reference frames 2, 3 and 4 are minimized by a linear relationship between the motion vector and the distances from the current frame to the reference frames. For hardware implementation, the modified algorithm optimizes the search area, reduces the overlapping search area and modifies a division equation. Because the search area is reduced, the amount of computation is reduced by 58.7%. In experimental results, the modified algorithm shows an increase of bit-rate in 0.36% when compared with the five reference frame standard. The pipeline structure and the memory controller are also adopted for real-time video encoding. The proposed system is implemented using 0.13 um CMOS technology, and the gate count is 1089K with 6.50 KB of internal SRAM. It can encode a Full HD video ($1920{\times}1080P@30Hz$) in real-time at a 135 MHz clock speed with 5 reference frames.

• 대한전자공학회논문지SD
• /
• 제41권4호
• /
• pp.75-82
• /
• 2004

압축 과정 중에 빠른 처리율을 보여주는 렘펠-짚 알고리즘의 결합에 의하여 채널 전송율은 증가한다. 영상정보의 압축 과정동안 처리율을 향상시키기 위하여 ICMEP 알고리즘을 제안하였으며 HDTV에 적용시켜 엔트로피 부호화기를 설계하였으며 이를 검증하였다. ICMEP 엔트로피 암호기는 top-down 방식을 이용하여 설계하였으며 VHDL을 이용하여 회로 합성 및 모의실험을 수행하였다. 모의실험 결과, 구현된 ICHEP 엔트로피 부호화기는 메모리 포화방지 및 압축률 증가로 인하여 전체적인 시스템 효율이 향상됨을 확인하였다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2001년도 춘계종합학술대회
• /
• pp.307-310
• /
• 2001

디지털 통신 시스템의 기저대역 신호처리 회로의 핵심 연산블록으로 사용될 수 있는 파라미터화 된 복소수 승산기 IP (Intellectual Property)를 설계하였다. 사용자의 필요에 따라 승수와 피승수의 비트 수를 8-b∼24-b 범위에서 2-b 단위로 선택할 수 있도록 파라미터화 하였으며, GUI 환경의 코어 생성기 (PCMUL_GEN)에 의해 지정된 비트 치기의 복소수 승산기의 VHDL 코드를 생성한다. 설계된 복소수 승산기 IP 코어는 redundant binary (RB) 수치계와 본 논문에서 제안하는 새로운 방식의 radix-4 Booth 인코딩/디코딩 회로를 적용함으로써, 내력 구조 및 배선이 단순화되어 고집적/고속/저전력의 장점을 갖는다. 설계된 IP는 Xilinx FPGA 보드로 구현하여 기능을 검증하였다.

• ETRI Journal
• /
• 제31권6호
• /
• pp.784-794
• /
• 2009

We present a full HD (1080p) H.264/AVC High Profile hardware encoder based on fast motion estimation (ME). Most processing cycles are occupied with ME and use external memory access to fetch samples, which degrades the performance of the encoder. A novel approach to fast ME which uses shared multibank memory can solve these problems. The proposed pixel subsampling ME algorithm is suitable for fast motion vector searches for high-quality resolution images. The proposed algorithm achieves an 87.5% reduction of computational complexity compared with the full search algorithm in the JM reference software, while sustaining the video quality without any conspicuous PSNR loss. The usage amount of shared multibank memory between the coarse ME and fine ME blocks is 93.6%, which saves external memory access cycles and speeds up ME. It is feasible to perform the algorithm at a 270 MHz clock speed for 30 frame/s real-time full HD encoding. Its total gate count is 872k, and internal SRAM size is 41.8 kB.

• 제어로봇시스템학회논문지
• /
• 제11권5호
• /
• pp.471-475
• /
• 2005

Recently, development of digital technology is occupying a large part of multimedia information like character, voice, image, video, etc. Research about video indexing and retrieval progresses especially in research relative to video. This paper proposes the novel notation in order to retrieve MPEG video in the international standards of moving picture encoding For realizing the retrieval-system, we detect DCT DC coefficient, and then we obtain shot to apply MVC(Mean Value Comparative) notation to image constructed DC coefficient. We choose the key frame for start-frame of a shot, and we have the codebook index generating it using feature of DC image and applying PCA(principal Component Analysis) to the key frame. Also, we realize the retrieval-system through similarity after indexing. We could reduce error detection due to distinguish shot from conventional shot detection algorithm. In the mean time, speed of indexing is faster by PCA due to perform it in the compressed domain, and it has an advantage which is to generate codebook due to use statistical features. Finally, we could realize efficient retrieval-system using MVC and PCA to shot detection and indexing which is important step of retrieval-system, and we using retrieval-system over the internet.

• Journal of Information Processing Systems
• /
• 제8권1호
• /
• pp.159-174
• /
• 2012

This paper presents a study on a high-performance design for a block cipher algorithm implemented on modern many-core graphics processing units (GPUs). The recent emergence of VLSI technology makes it feasible to fabricate multiple processing cores on a single chip and enables general-purpose computation on a GPU (GPGPU). The GPU strategy offers significant performance improvements for all-purpose computation and can be used to support a broad variety of applications, including cryptography. We have proposed an efficient implementation of the encryption/decryption operations of a block cipher algorithm, SEED, on off-the-shelf NVIDIA many-core graphics processors. In a thorough experiment, we achieved high performance that is capable of supporting a high network speed of up to 9.5 Gbps on an NVIDIA GTX285 system (which has 240 processing cores). Our implementation provides up to 4.75 times higher performance in terms of encoding and decoding throughput as compared to the Intel 8-core system.

• ETRI Journal
• /
• 제38권5호
• /
• pp.858-867
• /
• 2016

A high dynamic range (HDR) video service is an upcoming issue in the broadcasting industry. For compatibility with legacy devices receiving a non-constant luminance (NCL) signal, new tools supporting an HDR video service are required. The current pre-processing chain of HDR video can produce color noise owing to the chroma component down-sampling process for video encoding. Although a luma adjustment method has been proposed to solve this problem, some disadvantages still remain. In this paper, we present an adaptive color noise reduction method for an NCL signal of an HDR video service. The proposed method adjusts the luma component of an NCL signal adaptively according to the information of the luma component from a constant luminance signal and the level of color saturation. Experiment results show that the color noise problem is resolved by applying our proposed method. In addition, the speed of the pre-processing is increased more than two-fold compared to a previous method.

• Computers and Concrete
• /
• 제11권6호
• /
• pp.541-569
• /
• 2013

There is a wide variety of existing Genetic Algorithms (GA) operators and parameters in the literature. However, there is no unique technique that shows the best performance for different classes of optimization problems. Hence, the evaluation of these operators and parameters, which influence the effectiveness of the search process, must be carried out on a problem basis. This paper presents a comparison for the influence of GA operators and parameters on the performance of the damage identification problem using the finite element model updating method (FEMU). The damage is defined as reduction in bending rigidity of the finite elements of a reinforced concrete beam. A certain damage scenario is adopted and identified using different GA operators by minimizing the differences between experimental and analytical modal parameters. In this study, different selection, crossover and mutation operators are compared with each other based on the reliability, accuracy and efficiency criteria. The exploration and exploitation capabilities of different operators are evaluated. Also a comparison is carried out for the parallel and sequential GAs with different population sizes and the effect of the multiple use of some crossover operators is investigated. The results show that the roulettewheel selection technique together with real valued encoding gives the best results. It is also apparent that the Non-uniform Mutation as well as Parent Centric Normal Crossover can be confidently used in the damage identification problem. Nevertheless the parallel GAs increases both computation speed and the efficiency of the method.