• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.4
• /
• pp.38-48
• /
• 2011

Block based LCD backlight nonideality and crosstalk compensation methodologies are proposed based on the analysis of backlight profiles and image pixel homogeneity. Large computation complexity required in the conventional compensations is minimized without the degradation of image qualities by optimizing image block size, image area inside the block to be excluded from the compensation computation and the required backlight range to be computed. The optimization results of computation complexity as well as image qualities are verified for the proposed compensation by real image data simulations.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2007.08b
• /
• pp.1597-1599
• /
• 2007

In TFT-LCD, mura is a defect which degrades the display quality. The resistance difference between gate lines is the main cause of H-Block mura. Two methods could eliminate this defect. A thinner gate layer or gate fan-out pattern decrease mura level. H-Block mura has been reduced after implementing the new schemes.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.155-162
• /
• 2013

The conventional block-based compressed sensing uses a fixed block size for signal reconstruction, and the reconstructed signal is degraded because the block size suitable to the signal characteristics is not used. To solve this problem, in this paper, a variable block size method for compressed sensing is proposed that estimates the signal characteristics and selects a proper block size for each frame, thereby improving the quality of the reconstructed signal. The proposed method reconstructs the signal with different block sizes, analyzes the signal characteristics using correlation coefficients for each frame, and select the block size for the frame. It is confirmed that, with the same acquired data, the proposed method reconstructs the signal of higher quality than the conventional fixed block size method.

• Journal of Hospice and Palliative Care
• /
• v.12 no.2
• /
• pp.56-60
• /
• 2009

More than 80% of cancer-related pain is pharmacologically controllable, whereas $10{\sim}20%$ of patients require interventional treatments. Neurolytic nerve block can play a major role in cancer pain treatment, and it has been proposed to prevent the development of pain and improve the quality of life of patients with cancer. If the pain is well localized and restricted to certain peripheral parts of the body, spinal peripheral or sympathetic nerve blocks may result in excellent therapeutic effects. Neurolytic sympathetic block, especially Celiac plexsus block (CPB) performed in earlier stages, is effective with successful long term results. However, selection of patients is critical for succeful outcomes. Neurolytic plexus block significantly improves the quality of life of patients and reduces abdominal and pelvic cancer pain, analgesic consumption and adverse opioids-related side effects. Interventional pain management should be considered at earlier stages to provide patients with the best quality of life possible.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.1
• /
• pp.13-19
• /
• 2019

The accuracy of machine learning is greatly affected by amount of learning data and quality of data. Collecting existing Web-based learning data has danger that data unrelated to actual learning can be collected, and it is impossible to secure data transparency. In this paper, we propose a method for collecting data directly in parallel by blocks in a block - chain structure, and comparing the data collected by each block with data in other blocks to select only good data. In the proposed system, each block shares data with each other through a chain of blocks, utilizes the All-reduce structure of Parallel-SGD to select only good quality data through comparison with other block data to construct a learning data set. Also, in order to verify the performance of the proposed architecture, we verify that the original image is only good data among the modulated images using the existing benchmark data set.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.4
• /
• pp.447-452
• /
• 1988

This paper proposes a hybrid image coding in order to improve the coding performance by combining the BTC with the DPCM. And utilizing the human perceptual characteristics, a new objective image quality evaluation method has been proposed to obtain an excellent result in good agreement with the subjective quality evaluation. A hyb-1 method consisting of the DPCM and the AMBTC has retained a good picture quality at the bit rate of 1.5 bits/pel. A hyb-3 method combining the EBTC-3 with the DPCM has scarcely degraded the picture quality compared with the original image at the bit rate of 2.1 bits/pel. A newly proposed mehtod of picture quality evaluation accumulating a blocky noise at the edge block and an impulsive noise at the flat block selectively has been coincident with the subjective evaluation of quality.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1097-1100
• /
• 1999

Due to the significant computation of full search in motion estimation, extensive research in fast motion estimation algorithms has been carried out. However, most of the algorithms have the degradation in predicted images compared with the full search algorithm. To reduce an amount of significant computation while keeping the same prediction quality of the full search, we propose a fast block-matching algorithm based on gradient magnitude of reference block without any degradation of predicted image. By using Taylor series expansion, we show that the block matching errors between reference block and candidate block are proportional to the gradient magnitude of matching block. With the derived result, we propose fast full search algorithm with adaptively determined scan direction in the block matching. Experimentally, our proposed algorithm is very efficient in terms of computational speedup and has the smallest computation among all the conventional full search algorithms. Therefore, our algorithm is useful in VLSI implementation of video encoder requiring real-time application.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7C
• /
• pp.681-686
• /
• 2009

In H.264/Ave, an intra prediction added to the P-frame coding slightly improves both of image quality and bit rate, but greatly increases an amount of computation. In order to reduce the increase in computation, this paper proposes an image contents based intra prediction coding using characteristics that the best intra block mode depends on the image content of a macro block. The proposed algorithm estimates the image content with image complexity and the best inter block mode, and then selects or excludes a intra block mode on the basis of it. The simulation results show that the proposed algorithm reduces average O.OldB in image quality, and increases average 0.38% in the bit rate, but reduces average 37.02% in computation time compared with the conventional algorithm.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.633-644
• /
• 2004

In this paper, we notice that the original NTSS algorithm can be proposed as the NTSS-3 Level algorithm by the multi-resolution technique. The fast block matching algorithm affects the speed by the patten combination and this paper proposes the block matching algorithm in different levels by multi-resolution technique, quite different from the original NTSS Patten. The block matching algorithm requires the multi-candidate to reduce the occurrence of low-image quality by the local minima problem. The simulation result compared to FS shows search speed 16 times quicker, and the PSNR 0.11-0.12［dB］ gets improved Image quality compared to the original fast block matching algorithm NTSS, and the speed is improved up to 0.1 times for improved image by the search point portion.