• Structural Engineering and Mechanics
• /
• v.59 no.5
• /
• pp.885-899
• /
• 2016

The energy-based approach to predict the fatigue crack growth behavior under constant and variable amplitude loading (VAL) of the aluminum alloy 2024 T351 has been investigated and detailed analyses discussed. Firstly, the plastic strain energy was determined per cycle for different block load tests. The relationship between the crack advance and hysteretic energy dissipated per block can be represented by a power law. Then, an analytical model to estimate the lifetime for each spectrum is proposed. The results obtained are compared with the experimentally measured results and the models proposed by Klingbeil's model and Tracey's model. The evolution of the hysteretic energy dissipated per block is shown similar with that observed under constant amplitude loading.

• Journal of IKEEE
• /
• v.20 no.3
• /
• pp.273-278
• /
• 2016

In HEVC variable block size motion estimation, same search window data are duplicatedly used in each block size. It increases memory bandwidth, and it is difficult to exploit early termination. In this paper, largest block size and its corresponding smaller block sizes with same positions are performed at the same time. It reduces memory bandwidth and computation by reusing search window data and computation results. In the early termination, image quality can be degraded when it determines early termination by observing largest block size only, since smaller block sizes cannot be equally terminated due to their relative positions. So, in this paper, processing order of early termination is changed to perform smaller block sizes in turns. The designed motion estimation engine was described in Verilog HDL and it was synthesized and verified in 0.18um process technology. Its gate count and maximum operating frequency are 36,101 gates and 263.15 MHz, respectively.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.39-42
• /
• 2005

H.264, a recently proposed international video coding standard, has adopted context-based adaptive variable length coding (CAVLC) as the entropy coding tool in the baseline profile. By combining an adaptive variable length coding technique with context modeling, we can achieve a high degree of redundancy reduction. However, CAVLC in H.264 has weakness that the correct prediction rate of the variable length coding (VLC) table is low in a complex area, such as the boundary of an object. In this paper, we propose a VLC table prediction scheme considering multiple reference blocks; the same position block of the previous frame and the neighboring blocks of the current frame. The proposed algorithm obtains the new weighting values considering correctness of the VLC table for each reference block. Using this method, we can enhance the prediction rate of the VLC table and reduce the bit-rate.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.167-169
• /
• 2005

The occurrence of a single bit error in transmission bitstream leads to serious temporal and spatial errors. Because moving picture coding as MPEG-2 based on block coding algorithm uses variable length coding and motion compensation coding algorithm. In this paper, we propose algorithm to conceal occurred error of I-frames in transmission channel using data of the neighboring blocks in decoder. We divide a damaged macroblock of I-frame into four sub blocks and compose new macroblock using the neighboring blocks for each sub block. We estimate the block with minimum difference value through block matching with previous frame for new macroblocks and replace each estimated block with damaged sub block in the same position. Through simulation results, the proposed algorithm will be applied to a characteristic of moving with effect and shows better performance than conventional error concealment algorithms from visual and PSNR of view.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.7-10
• /
• 2000

Fast block motion estimation technique is proposed to reduce the computational complexity in video coding. In the conventional methods the size of search region is fixed. For small motion regions like background the small size of sea of search region is enough to find a block motion. But for active motion regions the large size of search region is preferred to figure out the accurate motion vector. Therefore, it is reasonable that a block motion is estimated in the variable search region (both the size and the position of it). That is to say, the search region varies according to the predicted motion characteristics of a block. The block motion in video frames has temporal continuity and then the search region of a current block is predicted using the block motion of previous blocks. The computational complexity of the proposed technique is significantly reduced with a good picture quality compared to the conventional methods.

• Journal of the Korean Society of Radiology
• /
• v.8 no.7
• /
• pp.435-441
• /
• 2014

This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, There applied to 24-bpp color image compression and image techniques. The result did not occur a loss in the image quality of the image when using the encoding method, such as almost to the color in the RGB image compression rate and image quality, such as gray-level images and showed good.

• Journal of the Korean Society of Radiology
• /
• v.10 no.4
• /
• pp.263-270
• /
• 2016

This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, There applied to 24-bpp color image compression and image techniques. The result did not occur a loss in the image quality of the image when using the encoding method, such as almost to the color in the YIQ image compression rate and image quality, such as RGB images and showed good.

• Journal of Welding and Joining
• /
• v.9 no.1
• /
• pp.40-47
• /
• 1991

The most fatigue tests carried out under the either stress or strain control, but machines and structures had taken variable stress. This variable stress was treated as statistics based on p-type distributions. In this paper, the cumulative fatigue damage of SM45C round bar specimens having a center hole resulting from block loading with p-distributions in rotating bending conditions, is presented. The value of p was changed in the range from 0.25 to 1; 0.25, 0.5, 0.75, 1. The following conclusions were obtained through the constant stress amplitude experiments and the block loading experiments. (1) In constant loading test, fatigue life was affected by cyclic rate. From experimental data, N$_{f}$ (100cpm)/N$_{f}$(3000cpm)equal to 0.56. (2) In case of the cyclic rate 100cpm and 3000cpm, at the high stress amplitude level the crack propagation life N$_{*}$f is longer than the low stress amplitude level. (3) Miner's hypothesis may be valid for p=0.75 and prediction of fatigue life by Haibach's method agree with experimental data well for the case p=0.5, while the modified Miner's method agree with experimental data well for the case p=0.25.5.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.3
• /
• pp.205-211
• /
• 2002

Unknown inputs observer(UIO) which is achieved by the coordinate transformation method has the differential of system outputs in the observer and the equation for unknown inputs estimation. Generally, the differential of system outputs in the observer can be eliminated by defining a new variable. But it brings about the partition of the observer into two subsystems and need of an additional differential of system outputs still remained to estimate the unknown inputs. Therefore, the block pulse function expansions and its differential operation which is a newly derived in this paper are presented to alleviate such problems from an algebraic form.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.2
• /
• pp.45-55
• /
• 1994

In this paper, a block based image approximation technique using the Self Affine System(SAS) from the fractal theory is suggested. Each block of an image is divided into 4 tiles and 4 affine mapping coefficients are found for each tile. To find the affine mapping cefficients that minimize the error between the affine transformed image block and the reconstructed image block, the matrix euation is solved by setting each partial differential coefficients to aero. And to ensure the convergence of coding block. 4 uniformly partitioned affine transformation is applied. Variable block size technique is employed in order to applynatural image reconstruction property of fractal image coding. Large blocks are used for encoding smooth backgrounds to yield high compression efficiency and texture and edge blocks are divided into smaller blocks to preserve the block detail. Affine mapping coefficinets are found for each block having 16$\times$16, 8$\times$8 or 4$\times$4 size. Each block is classified as shade, texture or edge. Average gray level is transmitted for shade bolcks, and coefficients are found for texture and edge blocks. Coefficients are quantized and only 16 bytes per block are transmitted. Using the proposed algorithm, the computational load increases linearly in proportion to image size. PSNR of 31.58dB is obtained as the result using 512$\times$512, 8 bits per pixel Lena image.