• 대한기계학회논문집A
• /
• 제21권12호
• /
• pp.2096-2105
• /
• 1997

A parallel approach using a network of engineering workstations is presented for the efficient computation in the elastoplastic analysis of strip rolling process. The domain decomposition method coupled with the frontal solver for elimination of internal degrees of freedom in each subdomain is used. PVM is used for message passing and synchronization between processors. A 2-D plane strain problem and the strip rolling process are analyzed to demonstrate the performance of the algorithm and factors that have a great effect on efficiency are discussed. In spite of much communication time on the network the result illustrates the advantages of this parallel algorithm over its corresponding sequential algorithm.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2006년도 PARALLEL CFD 2006
• /
• pp.263-267
• /
• 2006

The path of a flapping airfoil during upstroke and down-stroke is optimized for maximum thrust and propulsive efficiency. The periodic flapping motion in combined pitch and plunge is described using Non-Uniform B-Splines(NURBS). A gradient based algorithm is employed for optimization of the NURBS parameters. Unsteady, low speed laminar flows are computed using a Navier-Stokes solver in a parallel computing environment based on domain decomposition. It is shown that the thrust generation is significantly improved in comparison to the sinusoidal flapping motion. For a high thrust generation, the airfoil stays at a high effective angle of attack for short durations.

• 전자공학회논문지B
• /
• 제33B권9호
• /
• pp.80-87
• /
• 1996

This paper proposes an image compression algorithm that adopts projection scheme on wavelet transform domain of image signal. Wavelet decomposed image is encoded by the result of projection along one direction out of eight which approximates the coefficients most closely to the originally transformed coefficients. These projectrion data are vector quantized using separate codebooks depending on the decomposition level and orientation of decomposed of image. Experimental results reveals that proposed scheme shows excellent performance in PSNR manner and also shows good subjective quality.

• 한국통신학회논문지
• /
• 제17권4호
• /
• pp.387-397
• /
• 1992

저차원분해을 이용한 분모분란형 디지틀 필터(SDDF)의 공간영역설계는 특이치분해(SVD)에 의하여 주어진 2차원 임펄스 응답설계명세조건이 한쌍의 1차원 설계명세조건으로 분해될 때 실현될 수 있는데, 1차원 설계 알고리즘으로서 평형형근사와 등가변환을 사용하기 때문에 알고리즘이 수치적으로 안정하며 양자화 오차를 최소화할 수 있다. 본 논문에서는 이들 오차를 분석하고 감소시키기 위하여 임펄스 응답 설계명세조건으로부터 직접 최소 계산양자화 실현을 유도하고 또한 최소계산양자화 오차와 최소 Round off 오차 실현 사이의 등가변환 관계로부터 SDDF를 최적실현한다. 이러한 알고리즘은 시뮬레이션에 의하여 분석되어지는데 양자화오차 문제에 있어서 직접형이나 평형형 실현보다 우수한 특성을 갖는다.

• 대한기계학회논문집A
• /
• 제31권7호
• /
• pp.739-746
• /
• 2007

Recently, models in STL files are widely used in reverse engineering processes, CAD systems and analysis systems. However the models have poor geometric quality and include only triangles, so the models are not suitable for the finite element analysis. This paper presents a general method that generates finite element mesh from STL file models. Given triangular meshes, the method estimates triangles and makes clusters which consist of triangles. The clusters are merged by some geometric indices. After merging clusters, the method applies plane meshing algorithm, based on domain decomposition method, to each cluster and then the result plane mesh is projected into the original triangular set. Because the algorithm uses general methods to generate plane mesh, we can obtain both tri and quad meshes unlike previous researches. Some mechanical part models are used to show the validity of the proposed method.

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

Recently, image and voice processing part is using wavelet transform. We propose thining algorithm using wavelet tranform. Wavelet transform consists of low frequency and high frequency in the spatial and frequency domain. After the wavelet decomposition, more than 90 percents of energy are contained in lowest frequency band. Therefor, for images with large difference of gray value between foreground and background like character images, we can more accurately in the lowest frequency band. Lowest frequency band has wavelet transform significant coefficient(WTS) that is required for the thinning algorithm we proposed Paper [3][5][7][8] can not separate consonants and vowels of korean characters. Becuase korean characters have structural feature. This paper can separate consonants and vowels. Simulation executed low frequency image and data compression can reduce 1/4$^{n}$ with level n. we can redcue time complexity 3/8.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 추계학술대회
• /
• pp.1286-1290
• /
• 2003

This paper presents a newly implemented parallel finite element procedure for contact-impact problems. Three sub-algorithms are includes in the proposed parallel contact-impact procedure, such as a parallel Belytschko-Lin-Tsay (BLT) shell element generation, a parallel explicit time integration scheme, and a parallel contact search algorithm based on the master slave slide-line algorithm. The underlying focus of the algorithms is on its effectiveness and efficiency for inclusion in future finite element systems on parallel computers. Throughout this research, a prototype code, named GT-PARADYN, is developed on the IBM SP2, a distributed-memory computer. Some numerical examples are provided to demonstrate the timing results of the procedure, discussing the accuracy and efficiency of the code.

• 대한기계학회논문집A
• /
• 제24권5호
• /
• pp.1215-1230
• /
• 2000

Parallel Approaches using Cray T3E which is NIPP (Massively Parallel Processors) machine are presented for the efficient computation of the finite element analysis of 3-D shape rolling processes. D omain decomposition method coupled with parallel linear equation solver is used. Domain decomposition is applied for obtaining element tangent stifffiess matrices and residual vectors. Direct and iterative parallel algorithms are used for solving the linear equations. Direct algorithm is_parallel version of direct banded matrix solver. For iterative algorithms, the well-known preconditioned conjugate gradient solver with Jacobi preconditioner is also employed. Moreover a new effective iterative scheme with block inverse matrix preconditioner, which is named by present authors, is presented and its results are compared with the one using Jacobi preconditioner. PVM and MPI are used for message passing and synchronization between processors. The performance and efficiency of each algorithm is discussed and comparisons are made among different algorithms.

• 한국산학기술학회논문지
• /
• 제4권3호
• /
• pp.263-269
• /
• 2003

이 논문은 3차원 정수 웨이브릿 변환을 이용한 손실 의료 영상 압축에 대한 방법을 보여준다. 의료영상에 3차원 웨이브릿 분할법과 3차원 spatial dependence tree를 이용한 Set Partitioning in Hierarchical Trees(SPIHT) algorithm을 제공한다. 또한 3차원 웨이브릿 분할법에서 정수 웨이브릿 필터들을 이용한 lifting방법을 이용하고, unitary 변환을 만들기 위하여 정확한 scaling을 이용한다. 압축률이 증가하면 할수록 인접한 coding unit사이에선 boundary effect가 생긴다. Video와 같지 않아서 인접한 coding unit사이에서의 boundary artifact는 보여서는 안 된다. 이러한 현상을 제거하기 위해서 인접한 coding unit사이에 axial domain으로 overlapping방법을 사용한다. 또한 코딩 할 때 여러 종류의 정수 필터들을 사용한다. 결과로 어떤 특정한 필터를 사용할 때 좋은 결과를 얻었고 overlapping방법을 사용했기 때문에 ringing artifacts는 거의 찾아 볼 수가 없게 되었다. 그리고 어두운 면을 코딩 할 때도 좋은 결과를 얻었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권12호
• /
• pp.4024-4041
• /
• 2022

Robust reversible watermarking has attracted widespread attention in the field of information hiding in recent years. It should not only have robustness against attacks in transmission but also meet the reversibility of distortion-free transmission. According to our best knowledge, the most recent robust reversible watermarking methods adopt a single image as the carrier, which might lead to low efficiency in terms of carrier utilization. To address the issue, a novel dual-image robust reversible watermarking framework is proposed in this paper to effectively utilize the correlation between both carriers (namely dual images) and thus improve the efficiency of carrier utilization. In the dual-image robust reversible watermarking framework, a two-layer robust watermarking mechanism is designed to further improve the algorithm performances, i.e., embedding capacity and robustness. In addition, an optimization model is built to determine the parameters. Finally, the proposed framework is applied in different domains (namely domain-independent), i.e., Slantlet Transform and Singular Value Decomposition domain, and Zernike moments, respectively to demonstrate its effectiveness and generality. Experimental results demonstrate the superiority of the proposed dual-image robust reversible watermarking framework.