• Title/Summary/Keyword: full-information

Search Result 3,671, Processing Time 0.027 seconds

Watermarking of Compressed Video in the Bitstream Domain: An Efficient Algorithm and its Implementation

  • Drobouchevitvh Inna G.;Lim Sung-Jun;Han Byung-Wan;Chang Hang-Bae;Kim Kyung-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4C
    • /
    • pp.458-471
    • /
    • 2006
  • Digital watermarking of multimedia data is a very active research area that has enjoyed a considerable amount of attention in recent years. In this paper, we propose an algorithm for embedding/detecting a fragile watermark in MPEG-4 compressed video domain (Simple and Advance Simple Profiles). The watermark bits are put directly into Huffman VLC-codespace of quantized DCT domain. The advantage of watermark embedding into the compressed domain is the significant savings for a real-time implementation as it does not require a full decoding operation. The watermark embedding does not change the video file size. The algorithm demonstrates high watermarking capacity, thereby providing reliable foolproof authentication. The results of experimental testing demonstrate that watermark embedding preserves the video quality. Watermark detection is performed without using the original video.

Performance Analysis of Coordinated Random Beamforming Technique in Multi-cell Environments

  • Lee, Jong-Min;Jung, Bang-Chul
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.4
    • /
    • pp.393-398
    • /
    • 2010
  • For multi-cell environments, coordinated random beamforming technique in multiuser MIMO(multiple-input multiple-output) broadcast channel is considered. In order to mitigate severe interference at receivers, the multi-cell environments might require complex transmitter and receiver design because the scheduler decision based on full channel state information (CSI) in one cell must be intertwined with decision made by other cells' CSI. With limited CSI, however, this paper considers a scheme of randomizing transmitters' beamforming but being coordinated with other cell transmitters. The transmitters in each cell share random beamforming patterns and schedule data transmission within coherent scheduling period. The corandomized beams allow the users to be selected with the highest SINRs even in multi-cell environments. We analyze the performance of the proposed scheme. And numerical results show that the scheme achieves better performance than the conventional random beamforming when applying to multi-cell environments.

A Digital Self-Sustained Phase Shift Modulation Control Strategy for Full-Bridge LLC Resonant Converters

  • Zheng, Kai;Zhou, Dongfang;Li, Jianbing;Li, Li;Zhao, Yujing
    • Journal of Power Electronics
    • /
    • v.16 no.3
    • /
    • pp.915-924
    • /
    • 2016
  • A digital self-sustained phase shift modulation (DSSPSM) strategy that allows for good soft switching and dynamic response performance in the presence of step variations is presented in this paper. The working principle, soft switching characteristics, and voltage gain formulae of a LLC converter with DSSPSM have been provided separately. Furthermore, the method for realizing DSSPSM is proposed. Specifically, some key components of the proposed DSSPSM are carefully investigated, including a parameter variation analysis, the start-up process, and the zero-crossing capture of the resonant current. The simulation and experiment results verify the feasibility of the proposed control method. It is observed that the zero voltage switching of the switches and the zero current switching of the rectifier diodes can be easily realized in presence of step load variations.

Low Power SAD Processor Architecture for Motion Estimation of K264 (K264 Motion Estimation용 저전력 SAD 프로세서 설계)

  • Kim, Bee-Chul;Oh, Se-Man;Yoo, Hyeon-Joong;Jang, Young-Beom
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.263-264
    • /
    • 2007
  • In this paper, an efficient SAD(Sum of Absolute Differences) processor structure for motion estimation of 0.264 is proposed. SAD processors are commonly used both in full search methods for motion estimation or in fast search methods for motion estimation. Proposed structure consists of SAD calculator block, combinator block, and minimum value calculator block. Especially, proposed structure is simplified by using Distributed Arithmetic for addition operation. The Verilog-HDL(Hard Description Language) coding and FPGA implementation results for the proposed structure show 39% and 32% gate count reduction comparison with those of the conventional structure, respectively. Due to its efficient processing scheme, the proposed SAD processor structure can be widely used in size dominant H.264 chip.

  • PDF

Face Component Extraction Using Multiresolution Image (다해상도 영상을 이용한 얼굴 구성요소 추출)

  • Jang, Kyung-Shik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.12
    • /
    • pp.3675-3682
    • /
    • 1999
  • This paper proposes the method to extract face components without using the color information and the motion information in a gray image. A laplacian pyramid of the original image is built. Eye and nose candidates are extracted using only the gray information in a low resolution laplacian image and pairs are found that consist of two eye candidates and a nose one. At full resolution, horizontal and vortical edges are found in the regions of face components which are established using the candidates. Using those edge informations, face components are extracted. The experiments have been performed for images with various sizes and positions of face, and show very encouraging result.

  • PDF

Network Security Situation Assessment Method Based on Markov Game Model

  • Li, Xi;Lu, Yu;Liu, Sen;Nie, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2414-2428
    • /
    • 2018
  • In order to solve the problem that the current network security situation assessment methods just focus on the attack behaviors, this paper proposes a kind of network security situation assessment method based on Markov Decision Process and Game theory. The method takes the Markov Game model as the core, and uses the 4 levels data fusion to realize the evaluation of the network security situation. In this process, the Nash equilibrium point of the game is used to determine the impact on the network security. Experiments show that the results of this method are basically consistent with the expert evaluation data. As the method takes full account of the interaction between the attackers and defenders, it is closer to reality, and can accurately assess network security situation.

SDN Based Mobility in Enterprise Wireless Network (엔터프라이즈 무선네트워크에서 SDN 기반 이동성 연구)

  • Challa, Rajesh;Yeom, Sanggil;Choo, Hyunseung
    • Annual Conference of KIPS
    • /
    • 2015.10a
    • /
    • pp.335-336
    • /
    • 2015
  • Seamless mobility is one of the most crucial feature of telecommunication industry. Researches are going on in full swing to deal with this feature in most efficient manner. Software Defined Networking (SDN) is seen as the next generation paradigm which can facilitate seamless mobility across heterogeneous networks by segregating the control plane and data plane functionalities, and logically centralizing the control plane. In this paper, we propose a simplified Layer 2 handover mechanism for enterprise wireless networks, based on SDN framework. We present a network assisted L2 handover method using the IEEE 802.21 Media Independent Handover (MIH) protocol and SDN concepts, to achieve seamless mobility across heterogeneous networks.

Reinforcement Learning-Based Intelligent Decision-Making for Communication Parameters

  • Xie, Xia.;Dou, Zheng;Zhang, Yabin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.2942-2960
    • /
    • 2022
  • The core of cognitive radio is the problem concerning intelligent decision-making for communication parameters, the objective of which is to find the most appropriate parameter configuration to optimize transmission performance. The current algorithms have the disadvantages of high dependence on prior knowledge, large amount of calculation, and high complexity. We propose a new decision-making model by making full use of the interactivity of reinforcement learning (RL) and applying the Q-learning algorithm. By simplifying the decision-making process, we avoid large-scale RL, reduce complexity and improve timeliness. The proposed model is able to find the optimal waveform parameter configuration for the communication system in complex channels without prior knowledge. Moreover, this model is more flexible than previous decision-making models. The simulation results demonstrate the effectiveness of our model. The model not only exhibits better decision-making performance in the AWGN channels than the traditional method, but also make reasonable decisions in the fading channels.

Ring Signature Scheme Based on Lattice and Its Application on Anonymous Electronic Voting

  • Zhou, Yihua;Dong, Songshou;Yang, Yuguang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.1
    • /
    • pp.287-304
    • /
    • 2022
  • With the development of quantum computers, ring signature schemes based on large integer prime factorization, discrete logarithm problem, and bilinear pairing are under threat. For this reason, we design a ring signature scheme based on lattice with a fixed verification key. Compared with the previous ring signature scheme based on lattice, our design has a fixed verification key and does not disclose the signer's identity. Meanwhile, we propose an anonymous electronic voting scheme by using our ring signature scheme based on lattice and (t, n) threshold scheme, which makes up for the lack of current anonymous electronic voting that cannot resist attacks of the quantum computer. Finally, under standard model (SM), we prove that our ring signature scheme based on lattice is anonymous against the full-key exposure, and existentially non-forgeable against insider corruption. Furthermore, we also briefly analyze the security of our anonymous electronic voting scheme.

Bit-width Aware Generator and Intermediate Layer Knowledge Distillation using Channel-wise Attention for Generative Data-Free Quantization

  • Jae-Yong Baek;Du-Hwan Hur;Deok-Woong Kim;Yong-Sang Yoo;Hyuk-Jin Shin;Dae-Hyeon Park;Seung-Hwan Bae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.29 no.7
    • /
    • pp.11-20
    • /
    • 2024
  • In this paper, we propose the BAG (Bit-width Aware Generator) and the Intermediate Layer Knowledge Distillation using Channel-wise Attention to reduce the knowledge gap between a quantized network, a full-precision network, and a generator in GDFQ (Generative Data-Free Quantization). Since the generator in GDFQ is only trained by the feedback from the full-precision network, the gap resulting in decreased capability due to low bit-width of the quantized network has no effect on training the generator. To alleviate this problem, BAG is quantized with same bit-width of the quantized network, and it can generate synthetic images, which are effectively used for training the quantized network. Typically, the knowledge gap between the quantized network and the full-precision network is also important. To resolve this, we compute channel-wise attention of outputs of convolutional layers, and minimize the loss function as the distance of them. As the result, the quantized network can learn which channels to focus on more from mimicking the full-precision network. To prove the efficiency of proposed methods, we quantize the network trained on CIFAR-100 with 3 bit-width weights and activations, and train it and the generator with our method. As the result, we achieve 56.14% Top-1 Accuracy and increase 3.4% higher accuracy compared to our baseline AdaDFQ.