• Geotechnical Engineering
• /
• v.10 no.1
• /
• pp.71-82
• /
• 1994

According to the field measurement of dredging-reclaimed land, the actual self-weight consolidation settlement has been frequently reported to be less than the predicted values based on the laboratory tests results. The author estimates that one of the reasons is the reduction of the compressibility due to the sedimentation of the dredging material, Furthemore, the aging effect is ignored in the consolidation characteristics of the very low stress range as a pump dredging-reclaimed land. In this paper, a series of seepage consotidation tests has been carried out by applying the seepage force to the specimen prepared by sedimentation in consolidmeter in order to clarflfy the aging-effect on the compressibility of dredging clayey soil, Also, with a view to overcome unstable consolidation solution occurring in the case where the initial water content is higher as pumpdredging reclaimed land, the finite difference analysis technique using predictorforrector method is suggested that it gets good agreement with ezperimental results. Finally, the compressibility of the dredging clayey soil is depended on self-weight consolidation time.

• Applied Chemistry for Engineering
• /
• v.10 no.8
• /
• pp.1124-1128
• /
• 1999

In this study the effect of organic additive, triethanolamine(TEA), and temperature change of accelerator for shotcrete was studied. Then the amount of accelerator, temperature and W/C were experimentally investigated. Effects of hydration time and hydration heat of concrete on organic additive amount were analysed by DSC, SEM and XRD. We found that the hydration heat was increased and hydration time was decreased with TEA(<5 wt %). The order of hydration rate of potassium accelerator was PA < PC-3 < PC-5 < PC-8.

• Journal of Broadcast Engineering
• /
• v.7 no.1
• /
• pp.45-54
• /
• 2002

This paper proposes a video compression algorithm using characteristics of wavelet coefficients. The proposed algorithm can provide lowed bit rate and faster running time while guaranteeing the reconstructed image qualify by the human virtual system. In this approach, each video sequence is decomposed into a pyramid structure of subimages with various resolution to use multiresolution capability of discrete wavelet transform. Then similarities between two neighboring frames are obtained from a low-frequency subband which Includes an important information of an image and motion informations are extracted from the similarity criteria. Four legion selection filters are designed according to the similarity criteria and compression processes are carried out by encoding the coefficients In preservation legions and replacement regions of high-frequency subbands. Region selection filters classify the high-frequency subbands Into preservation regions and replacement regions based on the similarity criteria and the coefficients In replacement regions are replaced by that of a reference frame or reduced to zero according to block-based similarities between a reference frame and successive frames. Encoding is carried out by quantizing and arithmetic encoding the wavelet coefficients in preservation regions and replacement regions separately. A reference frame is updated at the bottom point If the curve of similarity rates looks like concave pattern. Simulation results show that the proposed algorithm provides high compression ratio with proper Image quality. It also outperforms the previous Milton's algorithm in an Image quality, compression ratio and running time, leading to compression ratio less than 0.2bpp. PSNR of 32 dB and running tome of 10ms for a standard video image of size 352${\times}$240 pixels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.785-792
• /
• 2004

In this paper, we propose a fast and efficient method that improves the performance of embedded zerotree wavelet(EZW) algorithm introduced by Sharipo． In the EZW algorithm, two bits are allocated for a symbol, but it is inefficient for compression and the zerotree coding wastes much time at encoding. In this paper, in order to increase the efficiency of compression, it will be allocated a variable bit for a symbol at each subband. To reduce the encoding time, we use a backscan method and lifting scheme instead of filter bank in wavelet transform. Experimental result are shown that the algorithm suggested in this paper has a better performance about 0.3∼1.5㏈ PSNR while the encoding time was speeded up more than 2-10 times compared with the EZW algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.946-948
• /
• 2005

H.264/AVC는 SoC/IEC MPEG와 ITU-T Video Coding Experts Group에서 함께 발표한 비디오 코딩을 위한 가장 최근의 표준이다. 기존의 표준들 보다 적은 비트로 높은 압축률과 좋은 화질을 제공하고 있다. 그러나 1/4 화소 움직임 예측과 보상의 지원과 7가지의 가변블록에 대한 움직임예측과 블록모드별 RD(Rate-Distortion)를 수행하고 CAVLC등 H.264/AVC 표준에서 채택한 여러 가지 비디오 압축방식으로 인해 그 복잡도가 훨씬 증가하였다. 이 논문에서 H.264/AVC의 복호화기에서 복잡도의 약 $40\%$ 이상을 차지하는 움직임보상 모듈을 효율적으로 수행하고 최적화하기 위한 방법을 제안한다. 예측된 모션벡터에 따라 창조하는 프레임에서 매크로블록을 만들어 내는 움직임 보상 과정을 수행하는 데 있어서 접근 지연시간이 큰 외부 메모리 창조를 선인출 메커니즘을 이용하여 미리 예측하여 수행함으로써 전체 수행시간을 줄이는 기법을 적용하였다. 이를 통하여 가변길이 복호화 모듈과 움직임 보상모듈을 수정하여 반복적으로 읽고, 쓰기를 수행해야 하는 횟수를 줄였다. 실험 결과 본 논문에서 제안하는 방법을 이용하여 복호화 과정을 수행했을 때 PSNR(Peak Signal to Noise Ratio)의 손실은 전혀 없으면서 복호화기의 전체 실행시간을 약 $5\%$ 향상시키고, 핵심 모듈인 움직임 보상과정에서 약 $20\%$ 정도 실행시간을 향상시키는 등 높은 성능 향상을 보였다.

• KIISE Transactions on Computing Practices
• /
• v.23 no.10
• /
• pp.594-598
• /
• 2017

Tremendous quantities of numerical data are generated every day from various sources, including the stock market. Universal codes such as Elias gamma coding, Elias delta coding and Fibonacci coding are generally used to store arrays of integers. Studies have been conducted to support fast access to specific elements in an integer array, while occupying less space. We suggest an improved code system that utilizes the concepts of succinct data structures. This system is based on a data structure that allows compressing a delimiter bit array while supporting queries in constant time. The results of an experiment show that the encoded array uses lower space, while not sacrificing time efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.11
• /
• pp.1645-1654
• /
• 1993

Unlike a noise removal recursive temporal filter, this paper presents a temporal filter which improves visual quality and data compression efficiency. In general, for the temporal band-limitation, temporal aliasing should be considered. Since most of a video signal has temporally aliased components, it is desirable to consider them. From a signal processing point of view, it is impossible to realize the filtering not afeced by the aliasings. However, in this paper, efficient filtering with de-aliasing characteristics is proposed. Considering the location of a video signal, temporal filtering can be accomplished by the spatial filtering along the motion vector trajectory (Motion Adaptive Spatial Filter). This filtered result dose not include the aliasings. Besides the efficient band-limitation, temporal noise is also reduced. For the evaluation of the MASF, its realization and filtering characteristics will be discussed in ditail.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.1
• /
• pp.67-74
• /
• 2000

In this paper, a $54{\times}54$-bit multiplier based on a improved conditional sum adder is proposed. To reduce the multiplication time, high compression-rate compressors without Booth's Encoding, and a 108-bit conditional sum adder with separated carry generation block, are developed. Furthermore, a design technique based on pass-transistor logic is utilized for optimize the multiplication time and the power consumption by about 5% compared to that of conventional one. With $0.65{\mu}m$, single-poly, triple-metal CMOS process, its chip size is $6.60{\times}6.69\;mm^2$ and the multiplication time is 135.ns at a 3.3V power supply.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.553-560
• /
• 2003

A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the selected cells of an OLAP data cube where target cells are decided by specified query ranges. The direct method to access the data cube itself forces too many cells to be accessed, therefore it incurs severe overheads. The prefix-sum cube was proposed for the efficient processing of range-sum queries in OLAP environments. However, the prefix-sum cube has been criticized due to its space requirement. In this paper, we propose a lossless compression method called the overlapped-subcube that is developed for the purpose of compressing prefix-sum cubes. A distinguished feature of the overlapped-subcube is that searches can be done without decompressing. The overlapped-subcube reduces the space requirement for storing prefix-sum cubes, and improves the query performance.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.8 no.2
• /
• pp.159-167
• /
• 2004

The compressive strength of concrete is a criterion to produce concrete. However, the tests on the compressive strength are complicated and time-consuming. More importantly, it is too late to make improvement even if the test result does not satisfy the required strength, since the test is usually performed at the 28th day after the placement of concrete at the construction site. Therefore, strength prediction before the placement of concrete is highly desirable. This study presents the probabilistic technique for predicting the compressive strength of concrete on the basis of concrete mix proportions. The estimation of the strength is based on the probabilistic neural network which is an effective tool for pattern classification problem and gives a probabilistic result, not a deterministic value. In this study, verifications for the applicability of the probabilistic neural networks were performed using the test results of concrete compressive strength. The estimated strengths are also compared with the results of the actual compression tests. It has been found that the present methods are very efficient and reasonable in predicting the compressive strength of concrete probabilistically.