• 한국멀티미디어학회논문지
• /
• 제25권6호
• /
• pp.783-792
• /
• 2022

Versatile Video Coding (VVC) is the latest video coding standard, which had been developed by the Joint Video Experts Team (JVET) of ITU-T Video Coding Experts Group (VCEG) and ISO/IEC Moving Picture Experts Group (MPEG) in 2020. Although VVC can provide powerful coding performance, it requires tremendous computational complexity to determine the optimal block structures during the encoding process. In this paper, we propose a fast ternary tree decision method using two neural networks with 7 nodes as input vector based on the multi-layer perceptron structure, names STH-NN and STV-NN. As a training result of neural network, the STH-NN and STV-NN achieved accuracies of 85% and 91%, respectively. Experimental results show that the proposed method reduces the encoding complexity up to 25% with unnoticeable coding loss compared to the VVC test model (VTM).

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 추계학술대회
• /
• pp.949-952
• /
• 2009

본 논문에서는 다층구조를 갖는 trellis 부호를 이용한 정보부호화 기반 워터마킹 방법에 대하여 연구하였다. 영상을 $8{\times}8$블록으로 중복되지 않게 나누어 DCT변환을 수행하고 각 블록으로부터 12개의 중간주파수 대역의 계수를 추출한다. 이를 다층구조를 갖는 trellis 부호화의 각 단계에서 평균이 0이고 분산이 1인 가우시안 난수와 비교하여 선형상관계수가 최소인 벡터를 Viterbi 알고리즘으로 구하고 이 벡터를 원 영상에 삽입하여 워터마킹된 영상을 얻는다. 제안 방법의 성능을 평가하기 위해 다수의 영상에 대한 평균 비트오차율을 계산하여 성능을 비교하였다.

• 한국ITS학회 논문지
• /
• 제7권5호
• /
• pp.122-130
• /
• 2008

최근 무선통신의 발달로 인하여 음성 서비스 이외의 동영상, 인터넷 서비스와 같은 보다 큰 전송률을 요구하는 다양한 서비스 요구가 급속도로 높아지고 있다. 고속 전송률 서비스를 낮은 가격으로 많은 사용자에게 제공하기 위해 제한된 통신자원을 이용하여 보다 많은 데이터를 전송할 수 있는 물리계층 기술이 필요하게 되어 직교 주파수 다중 방식인 OFDM(Orthogonal Frequency Division Multiplexing)과 다수의 송 수신 안테나를 이용하는MIMO(Multiple Input Multiple Output)시스템을 사용하게 되었다. MIMO 기술 중 Spatial Multiplexing은 전송용량 이득은 가질 수 있지만, 다수의 안테나로 인한 상관으로 인해 Diversity gain을 얻지 못하는 단점을 가지고 있다. 본 논문에서는 차세대 전송기술로 부각되고 있는 고속의 무선 데이터 전송기술 내에서, MIMO-OFDM 시스템인 SDM방식에서 Diversity gain을 얻고자 제안된 Multi-Block을 이용한 SDM의 성능에 대해 알아보고, 앞으로의 연구 방향에 대해 설명하고자 한다.

• 대한기계학회논문집B
• /
• 제20권4호
• /
• pp.1416-1425
• /
• 1996

A numerical method has been proposed to predict 3-dimensional flow in a duct system with multiple outlets. For the duct system, it is supposed that the pressure values are given at multiple outlets while the velocity profile is given at a inlet. To maintain the continuity of pressure distribution between main and branch duct, present method allows that the pressure value taken from analysis of branch duct can be converted to the main duct analysis. The result from present method which can handle the pressure boundary condition closely coincided with that from regular method which can handle the velocity boundary condition only. Furthermore the flow distribution from present method showed good agreement with that from the single block method. From the comparison of the present method with the total pressure method used for engineering duct design, 13% of discrepancy in pressure loss was shown between the main duct inlet and the branch duct outlet.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제9권6호
• /
• pp.598-612
• /
• 2017

The recently developed Harmonic Polynomial Cell (HPC) method has been proved to be a promising choice for solving potential-flow Boundary Value Problem (BVP). In this paper, a flux method is proposed to consistently deal with the Neumann boundary condition of the original HPC method and enhance the accuracy. Moreover, fixed mesh algorithm with free surface immersed is developed to improve the computational efficiency. Finally, a two dimensional (2D) multi-block strategy coupling boundary-fitted mesh and fixed mesh is proposed. It limits the computational costs and preserves the accuracy. A fully nonlinear 2D numerical wave tank is developed using the improved HPC method as a verification.

• Journal of Communications and Networks
• /
• 제9권2호
• /
• pp.150-158
• /
• 2007

We consider channel-coded multi-input multi-output (MIMO) orthogonal frequency-division multiplexing (OFDM) transmission and obtain a condition on its signal for it to attain the maximum diversity and coding gain. As this condition may not be realizable, we propose a suboptimal design that employs an orthogonal transform and a space-frequency interleaver between the channel coder and the multi-antenna OFDM transmitter. We propose a corresponding receiving method based on block turbo equalization. Attention is paid to some detailed design of the transmitter and the receiver to curtail the computational complexity and yet deliver good performance. Simulation results demonstrate that the proposed transmission technique can outperform the conventional coded MIMO OFDM and the MIMO block single-carrier transmission with cyclic prefixing.

• Nuclear Engineering and Technology
• /
• 제54권11호
• /
• pp.4280-4295
• /
• 2022

In this paper, a new multi-group neutron-gamma transport calculation code system STRAUM-MATXST for complicated geometrical problems is introduced and its development status including numerical tests is presented. In this code system, the MATXST (MATXS-based Cross Section Processor for S_N Transport) code generates multi-group neutron and gamma cross sections by processing MATXS format libraries generated using NJOY and the STRAUM (S_N Transport for Radiation Analysis with Unstructured Meshes) code performs multi-group neutron-gamma coupled transport calculation using tetrahedral meshes. In particular, this work presents the recent implementation and its test results of the Krylov subspace methods (i.e., Bi-CGSTAB and GMRES(m)) with preconditioners using DSA (Diffusion Synthetic Acceleration) and TSA (Transport Synthetic Acceleration). In addition, the Krylov subspace methods for accelerating the energy-group coupling iteration through thermal up-scatterings are implemented with new multi-group block DSA and TSA preconditioners in STRAUM.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.1117-1120
• /
• 1999

The main purpose of padding methods is to extend the boundary segments of arbitrarily shaped objects to a regular grid so that the common block based coding technique, such as 8${\times}$8 DCT, can be applied. In the conventional padding methods used in MPEG-4: LPE and zero padding, the main process is based on 8${\times}$8 blocks. On the contrary, we propose a new padding method based on pixel-by-pixel. The proposed method puts pixels into a multi-busier using the typical value of each boundary blocks and reproduces new boundary blocks. Simulation results show that the proposed method reduces the conventional padding method and improves the coding efficiency of the conventional padding method.

• Journal of Information Processing Systems
• /
• 제15권2호
• /
• pp.410-421
• /
• 2019

Distributed compressed sensing (DCS) states that we can recover the sparse signals from very few linear measurements. Various studies about DCS have been carried out recently. In many practical applications, there is no prior information except for standard sparsity on signals. The typical example is the sparse signals have block-sparse structures whose non-zero coefficients occurring in clusters, while the cluster pattern is usually unavailable as the prior information. To discuss this issue, a new algorithm, called backtracking-based adaptive orthogonal matching pursuit for block distributed compressed sensing (DCSBBAOMP), is proposed. In contrast to existing block methods which consider the single-channel signal reconstruction, the DCSBBAOMP resorts to the multi-channel signals reconstruction. Moreover, this algorithm is an iterative approach, which consists of forward selection and backward removal stages in each iteration. An advantage of this method is that perfect reconstruction performance can be achieved without prior information on the block-sparsity structure. Numerical experiments are provided to illustrate the desirable performance of the proposed method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.773-776
• /
• 1998

In this paper, we propose an efficient multi-view images coding algorithm which finds the optimal texture from the restricted number of multi-view images. The X-Y plane of the normalized object space is divided into triangular patches. The depth value of the node is determined by applying the block based disparity compensation method and then the texture of the each patch is extracted by applying the affine transformation patch is extracted by applying the affine transformation based disparity compensation method to the multi-view images. We restricted the number of images contributed to determining the texture comapred to traditional methods which use all the multi-view images in the texture extraction. Experimental results show that the SNR of images encoded by the proposed algorithm is better than that of imaes encoded by the traditional method by the amount about 0.2dB for the test sets of multi-view images called dragon, kid, city and santa. The recovered images from the encoded data by the proposed method show the better visual images than the recovered images from the encoded data by the traditional methods.