• Title/Summary/Keyword: Block method

Search Result 4,372, Processing Time 0.04 seconds

Block layout method in the block stockyard based on the genetic algorithm

  • Roh, Myung-Il
    • Ocean Systems Engineering
    • /
    • v.2 no.4
    • /
    • pp.271-287
    • /
    • 2012
  • Due to its large size, a ship is first divided into scores of blocks and then each block is constructed through various shops, such as the assembly shop, the painting shop, and the outfitting shop. However, each block may not be directly moved to the next shop and may be temporarily laid at a block stockyard because the working time in each shop is different from each other. If blocks are laid at the block stockyard without any planning, the rearrangement of the blocks by a transporter is required because the blocks have the different in and out time. In this study, a block layout method based on the genetic algorithm was proposed in order to minimize the rearrangement of the blocks in the block stockyard. To evaluate the applicability of the proposed method, it was applied to simple layout problems of the block stockyard. The result shows that the proposed method can yield a block layout that minimizes the total relocation cost of moving obstacle blocks in the block stockyard.

Zoom Motion Estimation Method for Depth Video Coding (깊이 영상 부호화에서 신축 움직임 추정 방법)

  • Lee, Dong-Seok;Kwon, Soon-Kak
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.11
    • /
    • pp.1711-1719
    • /
    • 2017
  • In this paper, we propose a method of the zoom motion estimation for the depth video coding. The proposed method calculates the zoom ratio using the average of the depth values in the current block and in the reference block. It resizes the reference block by the zoom ratio and interpolates the reference block to size of the current block. It compares the current block with the reference block that is obtained by subtracting the average of pixels from the current block to the reference block in order to find the reference block that is the best closest one to the current block. The results of the simulation for the proposed method show that the motion estimation errors are significantly reduced.

BLOCK INCOMPLETE FACTORIZATION PRECONDITIONERS FOR A SYMMETRIC H-MATRIX

  • Yun, Jae-Heon;Kim, Sang-Wook
    • Bulletin of the Korean Mathematical Society
    • /
    • v.37 no.3
    • /
    • pp.551-568
    • /
    • 2000
  • We propose new parallelizable block incomplete factorization preconditioners for a symmetric block-tridiagonal H-matrix. Theoretical properties of these block preconditioners are compared with those of block incomplete factorization preconditioners for the corresponding comparison matrix. Numerical results of the preconditioned CG(PCG) method using these block preconditioners are compared with those of PCG method using a standard incomplete factorization preconditioner to see the effectiveness of the block incomplete factorization preconditioners.

  • PDF

Retrospective Study of Facial Nerve Block with O'Brien Method for Facial Spasm (안면경련 환자에서 O'Brien법을 이용한 안면신경 차단의 추적조사)

  • Kim, Chan;Kim, Sung-Mo;Lee, Hyo-Keun;Kim, Seung-Hie;Kim, Jeong-Ho;Kim, Boo-Seong
    • The Korean Journal of Pain
    • /
    • v.10 no.1
    • /
    • pp.16-20
    • /
    • 1997
  • Background : Hemifacial spasm commonly occurs on muscles about the eye, but may also involve or spread to the entire side of the face. There are many treatment for facial spasm, such as neuro-vascular decompression, local injection of Botulium toxin, facial nerve block at stylomastoid foramen, facial nerve block with O'Brien method. The present study was aimed to investigate the effects of facial nerve block with O'Brien method. Methods : Forty five patients with hemifacial spasm were treated by facial nerve block with O'Brien method from January 1996 to February 1997 We reviewed the charts, retrospectively. Results : Sex ratio was 1:1.7(17 male : 28 female patients). Most patients were 40~60 years old. Most patients well tolerated facial nerve block. Three patients failed to respond to the facial nerve block. We repeated the procedure within one week. Among the 45 patients who received nerve block, 35 received repeated block; 7 patients received second repeat block, 2 patients received third repeat block. After successful nerve block, all patients were free of spasm for 1 to 6 months. Average spasm-free period was 3.5 months. Conclusion : Although the spasm-free period was short, these results suggest facial nerve block with O'Brien method is a safe and comfortable method for treatment of facial spasm.

  • PDF

Block-wise Adaptive Predictive PLS using Block-wise Data Extraction (데이터 추출 과정을 적용한 Block-wise Adaptive Predictive PLS)

  • Kim Sung-Young;Chung Chang-Bock;Choi Soo-Hyoung;Lee Bom-Sock
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.7
    • /
    • pp.706-712
    • /
    • 2006
  • Recursive Partial Least Squares(RPLS) method has been used for processing the on-line available multivariate chemical process data and modeling adaptive prediction model for process changes. However, RPLS method is unstable in PLS model updating because RPLS method updates PLS model by merging past PLS model and new data. In this study, Adaptive Predictive Partial Least Squres(APPLS) method is suggested for more sensitive adaptation to process changes. By expanding APPLS method, block-wise Adaptive Predictive Partial Least Squares(block-wise APPLS) method is suggested for a lager scale data of chemical processes. APPLS method has been applied to predict the reactor properties and the product quality of a direct esterification reactor for polyethylene terephthalate(PTT), and block-wise APPLS method has been applied to predict the cetane number using NIR Diesel Spectra data. APPLS and block-wise APPLS methods show better prediction and updating performance than RPLS method.

Postprocessing Method for Quantization Noise Reduction Using Block Classification and Adaptive Filtering (블록 분류와 적응적 필터링을 이용한 후처리에서의 양자화 잡음 제거 기법)

  • 이석환;권성근;이종원;이승진;이건일
    • Proceedings of the IEEK Conference
    • /
    • 2000.06d
    • /
    • pp.66-69
    • /
    • 2000
  • In this paper, we proposed a postprocessing algorithm for quantization effects reduction in block coded images using the block classification and adaptive filtering. The proposed method consists of classification, adaptive inter-block filtering, and intra-block filtering. First, each block is classified into one of seven classes based on the characteristics of 8${\times}$8 DCT coefficients. Then each block boundary is filtered by adaptive inter-block filters according to the block classification. Finally for blocks which are classified into edge block, intra-block filtering is peformed. Experimental results show that the proposed method gives better results than the conventional methods from both a subjective and an objective viewpoint.

  • PDF

Predictive motion estimation algorithm using spatio-temporal correlation of motion vector (움직임 벡터의 시공간적인 상관성을 이용한 예측 움직임 추정 기법)

  • 김영춘;정원식;김중곤;이건일
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.6
    • /
    • pp.64-72
    • /
    • 1996
  • In this paper, we propose predictive motion estimatin algorithm which can predict motion without additional side information considering spatio-tempral correlatio of motion vector. This method performs motion prediction of current block using correlation of the motion vector for two spatially adjacent blocks and a temporally adjacent block. Form predicted motion, the position of searhc area is determined. Then in this searhc area, we estimate motion vector of current block using block matching algoirthm. Considering spatial an temporal correlation of motion vector, the proposed method can predict motion precisely much more. Especially when the motion of objects is rapid, this method can estimate motion more precisely without reducing block size or increasing search area. Futhrmore, the proposed method has computation time the same as conventional block matching algorithm. And as it predicts motion from adjacent blocks, it does not require additional side information for adjacent block. Computer simulation results show that motion estimation of proposed method is more precise than that of conventioanl method.

  • PDF

The Proposed of the Encryption Method and Designed of the Secure Key Using Initial Bad Block Information Physical Address of NAND Flash Memory (NAND Flash Memory의 초기 Bad Block 정보 물리주소를 이용한 보안키 설계와 암호화 기법 제안)

  • Kim, Seong Ryeol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.12
    • /
    • pp.2282-2288
    • /
    • 2016
  • Security key generation method by hardware or software related techniques have been variously proposed. This study analyzed the existing security key generation techniques, and propose the design of a new NAND Bad block based security key(NBSK) using a Bad Block information in the NAND flash memory, and propose a new encryption method using the same. Bad Block present in the NAND flash memory is also generated during production and sometimes occur during operations. Initial Bad Block information generated during production is not changed, Bad Block information that may occur during operation has a characteristic that can be changed periodically. This study is designed of the new secure key using initial Bad Block information physical address generated during manufacturing a NAND flash memory, and proposed of the new encryption method. With the proposed key and method can satisfy the general security characteristics, such as the creation and distribution of the secure key authentication and confidentiality and the simplicity of the security key.

Automatic Multi-Block Grid Generation Technique Based on Delaunay Triangulation (Delaunay 삼각화 기법을 활용한 다중-블록 정렬 격자의 자동 생성 기법)

  • Kim Byoungsoo
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1999.11a
    • /
    • pp.108-114
    • /
    • 1999
  • In this paper. a new automatic multi=block grid generation technique for general 2D regions is introduced. According to this simple and robust method, the domain of interest is first triangulated by using Delaunay triangulation of boundary points, and then geometric information of those triangles is used to obtain block topology. Once block boundaries are obtained. structured grid for each block is generated such that grid lines have $C^0-continuity$ across inter-block boundaries. In the final step of the present method, an elliptic grid generation method is applied to smoothen grid distribution for each block and also to re-locale the inter-block boundaries, and eventually to achieve a globally smooth multi-block structured grid system with $C^1-continuity$.

  • PDF

Robust Motion Compensated Frame Interpolation Using Weight-Overlapped Block Motion Compensation with Variable Block Sizes to Reduce LCD Motion Blurs

  • Lee, Jichan;Choi, Jin Hyuk;Lee, Daeho
    • Journal of the Optical Society of Korea
    • /
    • v.19 no.5
    • /
    • pp.537-543
    • /
    • 2015
  • Liquid crystal displays (LCDs) have slow responses, so motion blurs are often perceived in fast moving scenes. To reduce this motion blur, we propose a novel method of robust motion compensated frame interpolation (MCFI) based on bidirectional motion estimation (BME) and weight-overlapped block motion compensation (WOBMC) with variable block sizes. In most MCFI methods, a static block size is used, so some block artefacts and motion blurs are observed. However, the proposed method adjusts motion block sizes and search ranges by comparing matching scores, so the precise motion vectors can be estimated in accordance with motions. In the MCFI, overlapping ranges for WOBMC are also determined by adjusted block sizes, so the accurate MCFI can be performed. In the experimental results, the proposed method strongly reduced motion blurs arisen from large motions, and yielded interpolated images with high visual performance and peak signal-to-noise ratio (PSNR).