• Proceedings of the Korean Geotechical Society Conference
• /
• 2009.09a
• /
• pp.815-826
• /
• 2009

The paper presents a case study addressing the design and construction aspects for DCM(Deep Cement Mixing) method employed as the foundation of a caisson type breakwater with heavy weight(10,700 ton/EA) and a high design wave height($H_{1/3}$=8.7m). The DCM was designed for the project(Ulsan New Port North Breakwater Phase 1) by optimizing the pattern of DCM columns with a combination of short and long columns (i.e., block type(upper 3m)+wall type(lower)) and considering overlapped section between columns as a critical section against shear force where the coefficient of effective width of treated column($\alpha$) was estimated with caution. It was shown that the value can be 0.9 under the condition with the overlapped width of 30cm. In addition to that, a field trial test was performed after improving conventional DCM equipment (e.g., mixing blades, cement paste supplying pipes, multi auger motor, etc.) to establish a standardized DCM construction cycle (withdrawal rate of mixing blades) which can provide the prescribed strength. The result of the field strength test for cored DCM specimens shows that the averaged strength is larger than the target strength and the distribution of the strength(with a defect rate of 7%) also satisfies with the quality control normal distribution curve which allows defect rate of 15.9%.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1277-1288
• /
• 1997

In this paper,the extraciton method for individual and the recognition method for the printed dociments are discussed. In preprocessing is a technique to extract characters that are difficult to manage such as touching characters or overlapped chracters.Genrally in the existing segmentation methods,projection and edge detection are applied.However,in this paper an indvidual character is extracted by using connected pixel with one projection after the string extraction The maximum Blok Methld(MBM)is used for the recognition.The MBM is a method to enlarge the block to the last point the pixel that was found during projection. The maximum blocks are skeletonxied after the division into straight line block and oblique line block.Especially,in the recognition of chinese chracters compared to the existing method it showed improved recognition rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.8
• /
• pp.1792-1801
• /
• 2003

In these days, image mosaic is getting interest in the field of advertisement, tourism, game, medical imaging, and so on with the development of internet technology and the performance of personal computers. The main problem of mage mosaic is searching corresponding points correctly in the overlapped area between images. However, previous methods requires a lot of CPU times and data processing for finding corresponding points. And they need repeated recording with a revolution of 360 degree around objects or background. This paper presents a new image mosaic method which generates a panorama image from a video sequence recorded by a general video camera. Our method finds the corresponding points between two successive images by using a new direction oriented 3­step block matching methods. Experimental results show that the suggested method is more efficient than the methods based on existing block matching algorithm, such as full search and K­step search algorithm.

• Journal of IKEEE
• /
• v.2 no.2 s.3
• /
• pp.285-293
• /
• 1998

This paper presents unequal error protection and error concealment techniques far robust H.263 video transmission over mobile channels. The proposed error protection scheme has three major features. First, it has the capability of preventing the loss of synchronization information in H.263 video stream as much as possible that the H.263 decoder can resynchronize at the next decoding point, if errors are occurred. Secondly, it employs an unequal error protection scheme to support variable coding rates using rate compatible punctured convolutional (RCPC) codes, dividing the encoded stream into two classes. Finally, a macroblock-interleaving scheme is employed in order to minimize the corruption of consecutive macroblocks due to burst errors, which can make a proper condition for error concealment. In addition, to minimize the spatial error propagations due to the variable length codes, a fast resynchronization scheme at the group of block layer is developed for recovering subsequent error-free macroblocks following the damaged macroblock. futhermore, error concealment techniques based on both side match criterion and overlapped block motion compensation (OBMC) are employed at the source decoder so that it can not only recover the lost macroblock more accurately, but also reduce blocking artifacts. Experimental results show that the proposed scheme can be an effective error protection scheme since proper video quality can be maintained under various channel bit error rates.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.167-174
• /
• 2000

The three-step search(TSS) algorithm, a simple and gradual motion estimation algorithm, has been widely used in some low bit-rate video compression. We propose a new fast block motion estimation algorithm using the characteristics of motion in search region. Most of motion vectors exist in the center region of search area, so the notion in that region is examined more closely than TSS in this paper. Also in a search step, motion vector is estimated in the local area which is not overlapped with the search area in previous step, considering the all possible direction of motion. Therefore, we get the better motion estimation and reduce computational time in compared with the conventional methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4502-4518
• /
• 2015

Fisher linear discriminant analysis (LDA) is one of the most popular projection techniques for feature extraction and has been widely applied in face recognition. However, it cannot be used when encountering the single sample per person problem (SSPP) because the intra-class variations cannot be evaluated. In this paper, we propose a novel method called local similarity based linear discriminant analysis (LS_LDA) to solve this problem. Motivated by the "divide-conquer" strategy, we first divide the face into local blocks, and classify each local block, and then integrate all the classification results to make final decision. To make LDA feasible for SSPP problem, we further divide each block into overlapped patches and assume that these patches are from the same class. To improve the robustness of LS_LDA to outliers, we further propose local similarity based median discriminant analysis (LS_MDA), which uses class median vector to estimate the class population mean in LDA modeling. Experimental results on three popular databases show that our methods not only generalize well SSPP problem but also have strong robustness to expression, illumination, occlusion and time variation.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.137-140
• /
• 2002

In this paper, a new algorithm for two-dimensional (2-D) finite-difference time-domain (FDTD) method is presented. By this new method, the maximum time step size can be increased over the Courant-Friedrich-Levy (CFL) condition restraint. This new algorithm is adapted from an Alternating-Direction Implicit FDTD (ADI-FDTD) method. However, unlike the ADI-FDTD algorithm. the alternation is performed with respect to the blocks of fields rather than with respect to each respective coordinate direction. Moreover. this method can be efficiently simulated with parallel computation. and it is more efficient than the conventional FDTD method in terms of CPU time. Numerical formulations are shown and simulation results are presented to demonstrate the effectiveness and efficiency of our proposed method.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.209-210
• /
• 2014

최근 인터넷 상에서 제공되는 영상 서비스에 대한 요구가 증가하고 있다. 하지만 네트워크 환경에서 전송되는 데이터는 오류로 인하여 쉽게 손실될 수 있다. 특히 HEVC(High Efficiency Video Coding)와 같이 높은 압축률로 압축된 정보에 대한 전송 오류는 영상 복원에 심각한 영향을 끼친다. 따라서 네트워크 환경에서 일정한 화질을 유지하기 위한 오류 은닉(Error Concealment : EC) 방법이 필요하다. 본 논문은 HEVC EC 를 위한 PU(Prediction Unit) 기반 움직임 벡터 외삽법(Motion Vector Extrapolation : MVE) 모델을 제안한다. PU 는 예측의 기본 단위로써 PU 내에 동일한 물체가 포함될 확률이 높다. 따라서, 이 모델은 손실된 프레임의 이전 프레임이 갖는 PU 정보를 이용하여 PU 단위로 외삽(extrapolation)을 실시한다. 또한, 손실된 블록과 외삽 블록간의 관계를 고려하여 겹쳐진(overlapped) 외삽 블록 중 가장 작은 PU 크기를 EC 기본 단위로 결정한다. 이 방법은 PU 정보를 반영함으로써 블록 경계 오류(block artifact)를 감소시킨다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.210-213
• /
• 2004

히스토그램 평활화는 이미지의 Contrast를 향상시키는데 그 효율성과 단순성 때문에 매우 유용하게 사용되는 알고리즘이다. 본 논문에서는 로컬 히스토그램 평활화 기법에 Genetic Algorithm(GA)을 적용하는 방법을 제안하고 있다. 본 연구에서는 기존 히스토그램 평활화 기법이 결과 이미지에 대한 평가가 없기 때문에 단일 결과만을 생성한다는 단점을 보안하기 위해 객관적인 이미지의 평가기준을 제시하였고, 이 평가기준을 이용한 GA를 통해 목적에 근접한 향상된 이미지를 획득하였다. 마지막으로, 제안하고 있는 알고리즘의 우수성을 증명하기 위해 다른 향상 기법(Global Histogram Equalization, Partially Overlapped Sub-Block Histogram Equalization)과의 비교를 하였다.

• ETRI Journal
• /
• v.32 no.3
• /
• pp.490-492
• /
• 2010

This letter proposes a robust feature extraction method using a spatially normalized mean for temporal ordinal measurement. Before computing a rank matrix from the mean values of non-overlapped blocks, each block mean is normalized so that it obeys the invariance property against linear additive and subtractive noise effects and is insensitive against multiplied and divided noise effects. Then, the temporal ordinal measures of spatially normalized mean values are computed for the feature matching. The performance of the proposed method showed about 95% accuracy in both precision and recall rates on various distortion environments, which represents the 2.7% higher performance on average compared to the temporal ordinal measurement.