• Title/Summary/Keyword: Bi-directional coding

Search Result 17, Processing Time 0.026 seconds

Relay Selection Schemes in Network-Coding based Two-Way Relay Communication to Improve Performance (성능향상을 위한 네트워크 부호화 기반 양방향 중계기 통신에서의 릴레이 선택 기법)

  • Lee, Jin-Hee;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.5
    • /
    • pp.7-13
    • /
    • 2009
  • In This Paper, we propose relay schemes for network-coding based two-way relay communication in multi relay channel. Two-way relay channel communication is a bi-directional communication that two users exchange their data with the help of a relay. Network-coding based Two-way relay communication can achieve more throughput compared to conventional two-way relay communication. In this paper, we propose relay selection schemes to provide maximum performance considering instantaneous signal-to-noise in multi-relay channel. Simulation results show that the proposed relay selection schemes can provide diversity order according to the number of relays.

  • PDF

Medium to Long Range Wireless Video Transmission Scheme in 2.4GHz Band with Beamforming (빔 형성을 적용한 2.4GHz 대역 중장거리 영상 전송 무선 기술)

  • Paik, Junghoon;Kim, Namho;Jee, Minki
    • Journal of Broadcast Engineering
    • /
    • v.23 no.5
    • /
    • pp.693-700
    • /
    • 2018
  • In this paper, we propose a wireless video transmission scheme, providing medium and long range communication in the 2.4GHz band with beamforming. With this scheme, it is shown that the transmission rate of 32Mbps and received signal power of -77dBm is achieved with 4 antennas of 5dBi and 16dBm transmit power at each antenna connection for the distance of 3.6km. The scheme also provides transmission distance of 20km for 10~12Mbps with the 4 omni-directional antennas of 5dBi.

Backward Quadtree Disparity Estimation for Efficient Multi-view Image Coder (효율적인 다시점 영상 부호화기를 위한 역방향 사진트리 변이 추정)

  • 최승철;김용태;손광훈
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.1911-1914
    • /
    • 2003
  • This paper proposes efficient system for multiview images using backward quadtree disparity estimation. Previous quadtree method usually divides current image. In this work, backward quadtree divides reference image. So, it does not need to code quadtree data. For backward quadtree, quadtree information map is generated. By using this map, adaptive dividing is possible. And, conventional bi-directional matching method is used with backward quadtree. These methods increase subject and object quality of decoded test images. For multiview images, panorama synthesizing method was used. Panorama image and right-most image are used for reference image for intermediate view images coding.

  • PDF

Tobacco Retail License Recognition Based on Dual Attention Mechanism

  • Shan, Yuxiang;Ren, Qin;Wang, Cheng;Wang, Xiuhui
    • Journal of Information Processing Systems
    • /
    • v.18 no.4
    • /
    • pp.480-488
    • /
    • 2022
  • Images of tobacco retail licenses have complex unstructured characteristics, which is an urgent technical problem in the robot process automation of tobacco marketing. In this paper, a novel recognition approach using a double attention mechanism is presented to realize the automatic recognition and information extraction from such images. First, we utilized a DenseNet network to extract the license information from the input tobacco retail license data. Second, bi-directional long short-term memory was used for coding and decoding using a continuous decoder integrating dual attention to realize the recognition and information extraction of tobacco retail license images without segmentation. Finally, several performance experiments were conducted using a largescale dataset of tobacco retail licenses. The experimental results show that the proposed approach achieves a correction accuracy of 98.36% on the ZY-LQ dataset, outperforming most existing methods.

Fast Mode Decision Algorithm for Scalable Video Coding (SVC) Using Directional Information of Neighboring Layer (스케일러블 비디오 코딩에서 방향성 정보를 이용한 모드 결정 고속화 기법)

  • Jung, Hyun-Ki;Hong, Kwang-Soo;Kim, Byung-Gyu;Kim, Chang-Ki;Yoo, Jeong-Ju
    • Journal of Broadcast Engineering
    • /
    • v.17 no.1
    • /
    • pp.108-121
    • /
    • 2012
  • As Scalable Video Coding (SVC) is a video compression standard extended from H.264/AVC, it is a way to provide scalability in terms of temporal, spatial and quality. Although the compression efficiency of SVC is increased due to the scalability in many aspect, it is essential to reduce the complexity in order to efficiently use because the complexity is relatively increased. To reduce the complexity of SVC in the paper, we propose fast mode decision algorithm to reduce the complexity of encoding process using direction information of B-picture by efficiently performing inter-layer prediction. The proposed algorithm is a fast mode decision algorithm that makes different from detection mode number of forward and backward, bi-direction in the way using best mode of base-layer up-sampled after simply SKIP mode detection using the direction information of best mode of base-layer up-sampled. The experimental results show that the proposed algorithm approach can achieve the maximum computational time saving about 53% with almost no loss of rate distortion (RD) performance in the enhancement layer.

Low-complexity Local Illuminance Compensation for Bi-prediction mode (양방향 예측 모드를 위한 저복잡도 LIC 방법 연구)

  • Choi, Han Sol;Byeon, Joo Hyung;Bang, Gun;Sim, Dong Gyu
    • Journal of Broadcast Engineering
    • /
    • v.24 no.3
    • /
    • pp.463-471
    • /
    • 2019
  • This paper proposes a method for reducing the complexity of LIC (Local Illuminance Compensation) for bi-directional inter prediction. The LIC performs local illumination compensation using neighboring reconstruction samples of the current block and the reference block to improve the accuracy of the inter prediction. Since the weight and offset required for local illumination compensation are calculated at both sides of the encoder and decoder using the reconstructed samples, there is an advantage that the coding efficiency is improved without signaling any information. Since the weight and the offset are obtained in the encoding prediction step and the decoding step, encoder and decoder complexity are increased. This paper proposes two methods for low complexity LIC. The first method is a method of applying illumination compensation with offset only in bi-directional prediction, and the second is a method of applying LIC after weighted average step of reference block obtained by bidirectional prediction. To evaluate the performance of the proposed method, BD-rate is compared with BMS-2.0.1 using B, C, and D classes of MPEG standard experimental image under RA (Random Access) condition. Experimental results show that the proposed method reduces the average of 0.29%, 0.23%, 0.04% for Y, U, and V in terms of BD-rate performance compared to BMS-2.0.1 and encoding/decoding time is almost same. Although the BD-rate was lost, the calculation complexity of the LIC was greatly reduced as the multiplication operation was removed and the addition operation was halved in the LIC parameter derivation process.

A Study of Connectivity in MIMO Fading Ad-Hoc Networks

  • Yousefi'zadeh, H.;Jafarkhani, H.;Kazemitabar, J.
    • Journal of Communications and Networks
    • /
    • v.11 no.1
    • /
    • pp.47-56
    • /
    • 2009
  • We investigate the connectivity of fading wireless ad-hoc networks with a pair of novel connectivity metrics. Our first metric looks at the problem of connectivity relying on the outage capacity of MIMO channels. Our second metric relies on a probabilistic treatment of the symbol error rates for such channels. We relate both capacity and symbol error rates to the characteristics of the underlying communication system such as antenna configuration, modulation, coding, and signal strength measured in terms of signal-to-interference-noise-ratio. For each metric of connectivity, we also provide a simplified treatment in the case of ergodic fading channels. In each case, we assume a pair of nodes are connected if their bi-directional measure of connectivity is better than a given threshold. Our analysis relies on the central limit theorem to approximate the distribution of the combined undesired signal affecting each link of an ad-hoc network as Gaussian. Supported by our simulation results, our analysis shows that (1) a measure of connectivity purely based on signal strength is not capable of accurately capturing the connectivity phenomenon, and (2) employing multiple antenna mobile nodes improves the connectivity of fading ad-hoc networks.