• Title/Summary/Keyword: SP picture

Search Result 38, Processing Time 0.026 seconds

Characterization and Color Reproduction Based on Average Picture Level if PDP Displays (평균화면밝기에 기반한 PDP 디스플레이의 특성화 및 색 재현)

  • Kwon, Oh-Seol;Ko, Kyung-Woo;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.5
    • /
    • pp.9-17
    • /
    • 2008
  • This paper proposes a method of color reproduction considering the viewing conditions of a PDP TV. Because of a change of peripheral environments by a temporal and spatial location of observers, the ambient lightings should be considered in the process of color reproduction of displays. A conventional method enhances the contrast and saturation of images by controlling voltage gains in each channel, so that there is a limit to implementing the phenomenon of human adaptation. This method also faces difficulties in reproducing the perceived colors under a variety of viewing conditions. Accordingly, in order to solve this problem, we first characterize the device by considering the brightness and the flare effect. The chromatic adaptation is finally applied to reproduce colors in a PDP TV using the information from the viewing conditions by the sensor. The images reproduced by the proposed method are visually more superior to those reproduced by a conventional method in the experiments.

ISFRNet: A Deep Three-stage Identity and Structure Feature Refinement Network for Facial Image Inpainting

  • Yan Wang;Jitae Shin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.3
    • /
    • pp.881-895
    • /
    • 2023
  • Modern image inpainting techniques based on deep learning have achieved remarkable performance, and more and more people are working on repairing more complex and larger missing areas, although this is still challenging, especially for facial image inpainting. For a face image with a huge missing area, there are very few valid pixels available; however, people have an ability to imagine the complete picture in their mind according to their subjective will. It is important to simulate this capability while maintaining the identity features of the face as much as possible. To achieve this goal, we propose a three-stage network model, which we refer to as the identity and structure feature refinement network (ISFRNet). ISFRNet is based on 1) a pre-trained pSp-styleGAN model that generates an extremely realistic face image with rich structural features; 2) a shallow structured network with a small receptive field; and 3) a modified U-net with two encoders and a decoder, which has a large receptive field. We choose structural similarity index (SSIM), peak signal-to-noise ratio (PSNR), L1 Loss and learned perceptual image patch similarity (LPIPS) to evaluate our model. When the missing region is 20%-40%, the above four metric scores of our model are 28.12, 0.942, 0.015 and 0.090, respectively. When the lost area is between 40% and 60%, the metric scores are 23.31, 0.840, 0.053 and 0.177, respectively. Our inpainting network not only guarantees excellent face identity feature recovery but also exhibits state-of-the-art performance compared to other multi-stage refinement models.

Multi-Line Driving Technology on PM OLED using Graph theory and Correlation (그래프 이론과 상관성을 이용한 PM OLED 다중선 구동 기술)

  • Lee, Gil-Jae;Lee, Chang-Hoon;Jeong, Je-Chang
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.1
    • /
    • pp.62-72
    • /
    • 2010
  • PM OLED is used in many applications as one of the display for the next generation. The most essential problems are the power dissipation and the short life time in applying PM OLED into a commercial application. Many efforts are made in developing the panel and in improving the circuit for expanding the current market wider. The life time in PM OLED is expanded by lessening the power dissipation of the circuit for the magnitude of the driving current is lowered. It is possible to minimize the power dissipation from improving the driving technology. The classical technology, Row-to-Row driving, is that row is selected one by one while applying the column current input individually. The multi-line driving is a new technology which is to select multiple rows simultaneously while applying the column current as a whole. However, the solution of the multi-line driving is NP-complete problem. The efficiency is dependant on the sort of picture and the driving condition. This paper presents the new efficient multi-line driving which is that the multiple lines are selected by applying column current together after grouping the simultaneous driving group applying the gnew efficient muthe coi-line dr coefficient. Bengrouping the several rows which has the higher coi-line dr coefficient, the more efficient driving is realized to present the high quality image and to lessen the power dissipation and to stretch the life time in the PM OLED.

Deinterlacing Method for improving Motion Estimator based on multi arithmetic Architecture (다중연산구조기반의 고밀도 성능향상을 위한 움직임추정의 디인터레이싱 방법)

  • Lee, Kang-Whan
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.1
    • /
    • pp.49-55
    • /
    • 2007
  • To improved the multi-resolution fast hierarchical motion estimation by using de-interlacing algorithm that is effective in term of both performance and VLSI implementation, is proposed so as to cover large search area field-based as well as frame based image processing in SoC design. In this paper, we have simulated a various picture mode M=2 or M=3. As a results, the proposed algorithm achieved the motion estimation performance PSNR compare with the full search block matching algorithm, the average performance degradation reached to -0.7dB, which did not affect on the subjective quality of reconstructed images at all. And acquiring the more desirable to adopt design SoC for the fast hierarchical motion estimation, we exploit foreground and background search algorithm (FBSA) base on the dual arithmetic processor element(DAPE). It is possible to estimate the large search area motion displacement using a half of number PE in general operation methods. And the proposed architecture of MHME improve the VLSI design hardware through the proposed FBSA structure with DAPE to remove the local memory. The proposed FBSA which use bit array processing in search area can improve structure as like multiple processor array unit(MPAU).

Low-Complexity H.264/AVC Deblocking Filter based on Variable Block Sizes (가변블록 기반 저복잡도 H.264/AVC 디블록킹 필터)

  • Shin, Seung-Ho;Doh, Nam-Keum;Kim, Tae-Yong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.4
    • /
    • pp.41-49
    • /
    • 2008
  • H.264/AVC supports variable block motion compensation, multiple reference images, 1/4-pixel motion vector accuracy, and in-loop deblocking filter, compared with the existing compression technologies. While these coding technologies are major functions of compression rate improvement, they lead to high complexity at the same time. For the H.264 video coding technology to be actually applied on low-end / low-bit rates terminals more extensively, it is essential to improve tile coding speed. Currently the deblocking filter that can improve the moving picture's subjective image quality to a certain degree is used on low-end terminals to a limited extent due to computational complexity. In this paper, a performance improvement method of the deblocking filter that efficiently reduces the blocking artifacts occurred during the compression of low-bit rates digital motion pictures is suggested. In the method proposed in this paper, the image's spatial correlational characteristics are extracted by using the variable block information of motion compensation; the filtering is divided into 4 modes according to the characteristics, and adaptive filtering is executed in the divided regions. The proposed deblocking method reduces the blocking artifacts, prevents excessive blurring effects, and improves the performance about $30{\sim}40%$ compared with the existing method.

Multiple Description Coding of H.264/AVC Motion Vector under Data Partitioning Structure and Decoding Using Multiple Description Matching (데이터 분할구조에서의 H.264/AVC 움직임 벡터의 다중표현 부호화와 다중표현 정합을 이용한 복호화)

  • Yang, Jung-Youp;Jeon, Byeung-Woo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.6
    • /
    • pp.100-110
    • /
    • 2007
  • When compressed video data is transmitted over error-prone network such as wireless channel, data is likely to be lost, so the quality of reconstructed picture is severely decreased. It is specially so in case that important information such as motion vector or macroblock mode is lost. H.264/AVC standard includes DP as error resilient technique for protecting important information from error in which data is labeled according to its relative importance. But DP technique requires a network that supports different reliabilities of transmitted data. In general, the benefits of UEP is sought by sending multiple times of same packets corresponding to important information. In this paper, we propose MDC technique based on data partitioning technique. The proposed method encodes motion vector of H.264/AVC standard into multiple parts using MDC and transmits each part as independent packet. Even if partial packet is lost, the proposed scheme can decode the compressed bitstream by using estimated motion vector with partial packets correctly transmitted, so that achieving improved performance of error concealment with minimal effect of channel error. Also in decoding process, the proposed multiple description matching increases the accuracy of estimated lost motion vector and quality of reconstructed video.

Development of the Hippocampal Learning Algorithm Using Associate Memory and Modulator of Neural Weight (연상기억과 뉴런 연결강도 모듈레이터를 이용한 해마 학습 알고리즘 개발)

  • Oh Sun-Moon;Kang Dae-Seong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.4 s.310
    • /
    • pp.37-45
    • /
    • 2006
  • In this paper, we propose the development of MHLA(Modulatory Hippocampus Learning Algorithm) which remodel a principle of brain of hippocampus. Hippocampus takes charge auto-associative memory and controlling functions of long-term or short-term memory strengthening. We organize auto-associative memory based 3 steps system(DG, CA3, CAl) and improve speed of learning by addition of modulator to long-term memory learning. In hippocampal system, according to the 3 steps order, information applies statistical deviation on Dentate Gyrus region and is labelled to responsive pattern by adjustment of a good impression. In CA3 region, pattern is reorganized by auto-associative memory. In CAI region, convergence of connection weight which is used long-term memory is learned fast by neural networks which is applied modulator. To measure performance of MHLA, PCA(Principal Component Analysis) is applied to face images which are classified by pose, expression and picture quality. Next, we calculate feature vectors and learn by MHLA. Finally, we confirm cognitive rate. The results of experiments, we can compare a proposed method of other methods, and we can confirm that the proposed method is superior to the existing method.

A Quantization-adaptive Watermarking Algorithm to Protect MPEG Moving Picture Contents (MPEG 동영상 컨텐츠 보호를 위한 양자화-적응적 워터마킹 알고리즘)

  • Kim Joo-Hyuk;Choi Hyun-Jun;Seo Young-Ho;Kim Dong-Wook
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.6
    • /
    • pp.149-158
    • /
    • 2005
  • This paper proposed a blind watermarking method for video contents which satisfies both the invisibility and the robustness to attacks to prohibit counterfeiting, modification, illegal usage and illegal re-production of video contents. This watermarking algorithm targets MPEG compression system and was designed to control the amount of watermarking to be inserted according to the adaptive quantization scale code to follow the adaptive quantization of the compression system. The inserting positions of the watermark were chosen by considering the frequency property of an image and horizontal, vertical and diagonal property of a $8{\times}8$ image block. Also the amount of watermarking for each watermark bit was decided by considering the quantization step. This algorithm was implemented by C++ and experimented for invisibility and robustness with MPEG-2 system. The experiment results showed that the method satisfied enough the invisibility of the inserted watermark and robustness against attacks. For the general attacks, the error rate of the extracted watermark was less than $10\%$, which is enough in robustness against the attacks. Therefore, this algorithm is expected to be used effectively as a part in many MPEG systems for real-time watermarking, especially in the sensitive applications to the network environments.