• Title/Summary/Keyword: 가중치 대각화

Search Result 4, Processing Time 0.082 seconds

Low Complexity Power Allocation Scheme for MIMO Multiple Relay System With Weighted Diagonalization (다중 안테나 다중 중계 시스템을 위한 가중치 대각화 기반의 저 복잡도 전력 할당 기법)

  • Lee, Bumsoo;Lee, Chungyong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.2
    • /
    • pp.27-34
    • /
    • 2013
  • We propose a simple power allocation scheme for an amplify-and-forward multiple relay system with multiple-input multiple-output antennas. Unlike the existing relay precoding matrix with full elements, proposed precoder is a diagonal matrix whose diagonal element is the relay gain for each stream. Furthermore, a weight vector is applied to streams, such that the mutual information of the system approaches that of the exhaustive search scheme, regardless of the number of antennas. Numerical results show that proposed scheme outperforms the conventional schemes with respect to mutual information.

Image Retrieval Using the Color Co-occurrence Histogram Describing the Size and Coherence of the Homogeneous Color Region (칼라 영역의 크기와 뭉침을 기술하는 칼라 동시발생 히스토그램을 이용한 영상검색)

  • An Myung-Seok;Cho Seok-Je
    • The KIPS Transactions:PartB
    • /
    • v.13B no.3 s.106
    • /
    • pp.275-282
    • /
    • 2006
  • For the efficient image retrieval, the method has studied that uses color distribution and relations between pixels. This paper presents the color descriptor that stands high above the others in image retrieval capacity. It is based on color co-occurrence histogram that the diagonal part and the non-diagonal part are attached the weight and modified to energy of color co-occurrence histogram, and the number of bins with petty worth have little influence is curtailed. It's verified by analysis that the diagonal part carries size information of homogeneous color region and the non-diagonal part does information about the coherence of it, Moreover the non-diagonal part is more influential than diagonal part in survey of similarity between images. So, the non-diagonal part is attached more weight than the diagonal part as a result of the research. The experiments validate that the proposed descriptor shows better image retrieval performance when the weight for non-diagonal part is set to the value between 0.7 and 0.9.

Quality Improvement of Interpolated Image Using Weight-Granting Method Based on Median Values Of Local Area (국부 영역 중앙값 기반의 가중치 부여 방법을 이용한 보간 영상의 화질 개선)

  • Kwak, Nae-Joung;Ryu, Sung-Pil;Ahn, Jae-Hyeong;Kwon, Dong-Jin
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.12
    • /
    • pp.346-354
    • /
    • 2007
  • Interpolation methods to get the magnified image from an image with low resolution use known pixels to make an interpolated pixel. This interpolation process usually generates blurred edges and blocking effect in the result image. To improve these defects, conventional methods multiply proper weights reflecting neighborhood pixels and add the values during interpolating process. The proposed method changes input pixels in consideration of information of neighborhood pixels, gets interpolated pixels by using these values and improves the quality of interpolated image. Firstly, we compute difference values of the diagonal directions of a pixel and classify flat regions and complex regions according to these values. If the regions is complex ones, the proposed method changes an original pixel into a new value using a input pixel and a median value of it's neighbor pixels. Therefore, the proposed method applies bilinear method to the original pixels in flat regions and the changed ones in complex regions and produces the interpolated images. We evaluate the performance of the proposed method with existing methods by using PSNR and the quality of enlarged image. The results show that the proposed method improves PSNR in comparing with conventional methods and that is superior to the existing methods in terms of the quality of the interpolated image.

Saturation Compensating Method by Embedding Pseudo-Random Code in Wavelet Packet Based Colorization (웨이블릿 패킷 기반의 컬러화 알고리즘에서 슈도랜덤코드 삽입을 이용한 채도 보상 방법)

  • Ko, Kyung-Woo;Jang, In-Su;Kyung, Wang-Jun;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.4
    • /
    • pp.20-27
    • /
    • 2010
  • This paper proposes a saturation compensating method by embedding pseudo-random code information in wavelet packet based colorization algorithm. In the color-to-gray process, an input RGB image is converted into YCbCr images, and a 2-level wavelet packet transform is applied to the Y image. And then, color components of CbCr are embedded into two sub-bands including minimum amount of energy on the Y image. At this time, in order to compensate the color saturations of the recovered color image during the printing and scanning process, the maximum and minimum values of CbCr components of an original image are also embedded into the diagonal-diagonal sub-band by a form of pseudo-random code. This pseudo-random code has the maximum and minimum values of an original CbCr components, and is expressed by the number of white pixels. In the gray-to-color process, saturations of the recovered color image are compensated using the ratio of the original CbCr values to the extracted CbCr values. Through the experiments, we can confirm that the proposed method improves color saturations in the recovered color images by the comparison of color difference and PSNR values.