• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.3-10
• /
• 2014

In this paper we review the typical Toeplitz matrices and block circulant matrices, and propose the a circulant Hadamard matrix which is consisted of +1 and -1, but its structure is different from typical Hadamard matrix. The proposed circulant Hadamard matrix decreases computational complexities to $Nlog_2N$ additions through high speed algorithm compare to original one. This matrix is able to be applied to Massive MIMO channel estimation, FIR filter design, amd signal processing.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2005.07b
• /
• pp.863-864
• /
• 2005

In recent years, we use overdriving scheme to improve the response time of the liquid crystal. Since conventional overdriving scheme uses memory to perform ideal processing, it is desired to reduce system cost by decreasing the data stored in these SDRAMs. As a general compression method, quantization, sub-sampling and Block Truncation Coding ( BTC ) are used, which process data in block base and cause block effect. So we proposed new data compression method by color space conversion. Because this method compresses luminance and chrominance signal by different ratio, it can efficiently reduce error of block effect in decompression image.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.159-164
• /
• 2003

Location of stock in a warehouse directly affects the total materials handling expense of all goods moving through the warehouse. The purpose of this paper is to develop a storage policy in order picking warehouse, the block-based storage policy to minimize the total order picking time. In block-based storage policy, the rack is divided into blocks and items are assigned to each block based on the turn-over rate of each item and the average distance between the blocks and the dock. To demonstrate the performance of the proposed policy, we compare with the existing method called class-based storage policy under various matching methods.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.470-474
• /
• 2005

There are many suggestion of methods which get good quality images by controling the GOP structure. But the existing algorithm should have not good to deal the real time adaptive processing determine the GOP structure because which check the fixed quantity of image in advance and require high capacity of frame memories and have delay time by increasing calculation quantity. This paper propose the algorithm which adapt the real time by the basic of macro block. We show the good simulation results using the proposed GOP structure based on macro block.

• 한국전산유체공학회:학술대회논문집
• /
• 2007.04a
• /
• pp.79-82
• /
• 2007

The aerodynamic coefficients of Apollo capsule are calculated using a DSMC solver, SMILE, and the results agree very well with the data predicted by NASA. The aerodynamic characteristics of an orbital block which operates at high altitudes in the free molecule regime are also predicted. For the nominal flow conditions, the predicted aerodynamic force is very small since the dynamic pressure is extremely low. And the additional aerodynamic coefficients for the analysis of the attitude control are presented as the angle of attack and the side slip angle vary from $+45^{\circ}\;to\;-45^{\circ}$ of the nominal angle.

• Korean Journal of Remote Sensing
• /
• v.36 no.4
• /
• pp.545-555
• /
• 2020

This paper focuses on automatic image registration between EO (Electro-Optical) and IR (InfraRed) satellite images with different spectral properties using block-based approach and simple preprocessing technique to enhance the performance of feature matching. If unpreprocessed EO and IR images from Kompsat-3A satellite were applied to local feature matching algorithms(Scale Invariant Feature Transform, Speed-Up Robust Feature, etc.), image registration algorithm generally failed because of few detected feature points or mismatched pairs despite of many detected feature points. In this paper, we proposed a new image registration method which improved the performance of feature matching with block-based registration process on 9-divided image and pre-processing technique based on adaptive histogram equalization. The proposed method showed better performance than without our proposed technique on visual inspection and I-RMSE. This study can be used for automatic image registration between various images acquired from different sensors.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.49 no.8
• /
• pp.63-72
• /
• 2012

In this paper, we proposed a parallel architecture of line & block edge filter for high-performance H.264/AVC deblocking filter for Quad Full High Definition(Quad FHD) video real time processing. To improve throughput, we designed 4-parallel block edge filter with 16 line edge filter. To reduce internal buffer size and processing cycle, we scheduled 4-parallel zig-zag scan order as deblocking filtering order. To avoid data conflicts we placed 1 delay cycle between block edge filtering. We implemented interleaving buffer, as internal buffer of block edge filter, to sharing buffer for reducing buffer size. The proposed architecture was simulated in 0.18um standard cell library. The maximum operation frequency is 108MHz. The gate count is 140.16Kgates. The proposed H.264/AVC deblocking filter can support Quad FHD at 113.17 frames per second by running at 90MHz.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3964-3975
• /
• 2000

There are two policies for maintaining consistency among the multiple processor caches in a multiprocessor system: Write invalidate and Write update. In the write invalidate policy, whenever a processor attempt to write its cached block, it has to invalidate all the same copies of the updated block in the system. As a results of this frequent invalidations, this policy results in high cache miss ratio. On the other hand, the write update policy renew them, instead of invalidating all the same copies. This policy has to transfer the updated contents through interconnection network, whether the updated block is ptivate or not. Therefore the network suffer from heavy transaction traffic. In this paper we present an efficient cache coherence protocol for shared memory multiprocessor system connected by slotted ring. This protocol is based on the write update policy, but the updated contents are transferred only in case of updating the shared block. Otherwise, if the updated block is private, the updated contents are not transferred. We analyze the proposed protocol and enforce simulation to compare it with previous version.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.2
• /
• pp.30-36
• /
• 2014

Quality and resolution of camera in mobile device is improved significantly. In this paper, we propose block-based information hide techniques without image distortion for mobile device to solve image degradation in conventional watermarking methods. Information of image is composed with text such as camera maker, model, date, time, etc. Each text is converted to $8{\times}8$ pixel blocks and is added to the bottom of image. Generally image including block based information for image authentication are compressed using JPEG in mobile device. The vertical line value in JPEG header is modified by original size of image sensor. This technique can hide the block based authentication information using general decoder. In the experimental results, JPEG file size is slightly increased within 0.1% for the proposed block based authentication information encoding. Finally proposed methods can be adopted for various embedded systems using medical image, smart phone and DSLR camera.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.691-700
• /
• 1995

Most fractal image codings using fractal concept require long encoding time because a large amount of computation is needed to find an optimal affine transformation point. Such a problem can be solved by designing a block classifier fitted to characteristics of image blocks. In general, it is possible to predict more precise and various types of blocks in frequency domain than in spatial domain. In this paper, we propose a block classifier to predict the block type using characteristics of DCT(Discrete Cosine Transform). This classifier has merits to enhance the quality of decoded images as well as to reduce the encoding time meeting fractal features. AC coefficient values in frequency domain make it possible to predict various types of blocks. As the results, the number of comparisons between a range block and the correspoding domain blocks to reach an optimal affine transformation point can be reduced. Specially, signs of DCT coefficients help to find the optimal affine transformation point with only two isometric transformations by eliminating unnecessary isometric transformations among eight isometric transformations used in traditional fractal codings.