• Title/Summary/Keyword: 양자 정보

Search Result 1,022, Processing Time 0.055 seconds

Digital Video Watermarking Based on SPIHT Coding Using Motion Vector Analysis (움직임 벡터 정보를 이용한 SPIHT 부호화 기반의 디지털 비디오 워터마킹)

  • Kwon, Seong-Geun;Hwang, Eui-Chang;Lee, Mi-Hee;Jeong, Tai-Il;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.11
    • /
    • pp.1427-1438
    • /
    • 2007
  • Video watermarking technologies are classified into types of four kinds. The first type is to embed the watermark into a raw video signal and to code the watermarked video signal. Most of video watermarking technologies fall into the category of this type. The second type is to apply watermarking to the coding process, such as block DCT and quantization. The third is to directly embed the watermark into the compressed bitstream itself. Generally, it is referred as labelling rather than watermarking. Finally, the fourth is to embed the water mark into MPEG motion vector. This type has the difficulty in real-time process because of the high complexity and has the blocking effects because of DCT-based on coder. In this paper, we proposed the digital video watermarking that embed the watermark in SPIHT video code for I-frame using motion vector analysis. This method can remove the blocking effect occurred at the DCT-based on coder and obtain video data that has progressive transmission property. The proposed method is to select the region for the watermark embedding in I frame using motion vector estimated from the previous P or B frame. And then, it is to perform DWT and embed the watermark based on HVS into the wavelet coefficients in the same subband of DWT as the motion vector direction. Finally, the watermarked video bitstream is obtained by the SPIHT coder. The experimental results verified that the proposed method has the invisibility from the objective and subjective image quality and the robustness against the various SPIHT compression and MPEG re-code.

  • PDF

An Improved Reversible Secret Image Sharing Scheme based on GF(28) (유한 체 기반의 개선된 가역 비밀이미지 공유 기법)

  • Kim, Dong-Hyun;Kim, Jung-Joon;Yoo, Kee-Young
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.3
    • /
    • pp.359-370
    • /
    • 2013
  • Lin and Chan proposed a reversible secret image sharing scheme in 2010. The advantages of their scheme are as follows: the low distortion ratio, high embedding capacity of shadow images and usage of the reversible. However, their scheme has some problems. First, the number of participants is limited because of modulus prime number m. Second, the overflow can be occurred by additional operations (quantized value and the result value of polynomial) in the secret sharing procedure. Finally, if the coefficient of (t-1)th degree polynomial become zero, (t-1) participants can access secret data. In this paper, an improved reversible secret image sharing scheme which solves the problems of Lin and Chan's scheme while provides the low distortion ratio and high embedding capacity is proposed. The proposed scheme solves the problems that are a limit of a total number of participants, and occurrence of overflow by new polynomial operation over GF($2^8$). Also, it solve problem that the coefficient of (t-1)th degree polynomial become zero by fixed MSB 4-bit constant. In the experimental results, PSNR of their scheme is decreased with the increase of embedding capacity. However, even if the embedding capacity increase, PSNR value of about 45dB or more is maintained uniformly in the proposed scheme.

The Error Diffusion halftoning Method Using Information of Edge Enhancement (에지 강조 정보를 이용한 오차확산 해프토닝)

  • Kwak Nae Joung;Ahn Jae Hyeong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.3 s.303
    • /
    • pp.107-114
    • /
    • 2005
  • Edge enhanced image is needed for processing images for special purpose such as a circuit diagram or a design composed of lines. Error diffusion halftoning, among digital halftoning methods to represent a continuous grayscale image for the binary output device such as printers, facsimiles, LCD televisions and etc. also makes edges of objects blurred. This paper proposes the method to enhance the edge of a binary image for the binary output device as well as a circuit diagram or a design. Based on that the human eyes perceive the local average luminance rather than the pixel's luminance itself, the proposed system uses a local activitymeasure (LAM), which is the difference between a pixel luminance and the average of its $3{\times}3$ neighborhood pixels' luminances weighted according to the spatial positioning. The system also usesinformation of edge enhancement(IEE), which is computed from the LAM multiplied by the average luminance. The IEE is added to the quantizer's input pixel and feeds into the halftoning quantizer. The quantizer produces the halftone image having the enhanced edge. The simulation results show that the proposed method produces more fine halftoning images than conventional methods due to the enhanced edges. Also the performance of the proposed method is compared with that of the conventional method by measuring the edge correlation and the local average accordance over a range of viewing distances.

Implementation of an Optimal SIMD-based Many-core Processor for Sound Synthesis of Guitar (기타 음 합성을 위한 최적의 SIMD기반 매니코어 프로세서 구현)

  • Choi, Ji-Won;Kang, Myeong-Su;Kim, Jong-Myon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.1
    • /
    • pp.1-10
    • /
    • 2012
  • Improving operating frequency of processors is no longer today's issues; a multiprocessor technique which integrates many processors has received increasing attention. Currently, high-performance processors that integrate 64 or 128 cores are developing for large data processing over 2, 4, or 8 processor cores. This paper proposes an optimal many-core processor for synthesizing guitar sounds. Unlike the previous research in which a processing element (PE) was assigned to support one of guitar strings, this paper evaluates the impacts of mapping different numbers of PEs to one guitar string in terms of performance and both area and energy efficiencies using architectural and workload simulations. Experimental results show that the maximum area energy efficiencies were achieved at PEs=24 and 96, respectively, for synthesizing guitar sounds with sampling rate of 44.1kHz and 16-bit quantization. The synthesized sounds were very similar to original guitar sounds in their spectra. In addition, the proposed many-core processor was 1,235 and 22 times better than TI TMS320C6416 in area and energy efficiencies, respectively.

Performance Improvement of Downlink Real-Time Traffic Transmission Using MIMO-OFDMA Systems Based on Beamforming (Beamforming 기반 MIMO-OFDMA 시스템을 이용한 하향링크 실시간 트래픽 전송 성능 개선)

  • Yang Suck-Chel;Park Dae-Jin;Shin Yo-An
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.3 s.345
    • /
    • pp.1-9
    • /
    • 2006
  • In this paper, we propose a MIMO-OFDMA (Multi Input Multi Output-Orthogonal Frequency Division Multiple Access) system based on beamforming for performance improvement of downlink real-time traffic transmission in harsh channel conditions with low CIR (Carrier-to-Interference Ratio). In the proposed system, we first consider the M-GTA-SBA (Modified-Grouped Transmit Antenna-Simple Bit Allocation) using effective CSI (Channel State Information) calculation procedure based on spatial resource grouping, which is adequate for the combination of MRT (Maximum Ratio Transmission) in the transmitter and MRC (Maximum Ratio Combining) in the receiver. In addition, to reduce feedback information for the beamforming, we also apply QEGT (Quantized Equal Gain Transmission) based on quantization of amplitudes and phases of beam weights. Furthermore, considering multi-user environments, we propose the P-SRA (Proposed-Simple Resource Allocation) algorithm for fair and efficient resource allocation. Simulation results reveal that the proposed MIMO-OFDMA system achieves significant improvement of spectral efficiency in low CRI region as compared to a typical open-loop MIMO-OFDMA system using pseudo-orthogonal space time block code and H-ARQ IR (Hybrid-Automatic Repeat Request Incremental Redundancy).

Operation Status of Chinese Security Service Industry and Institutional Settlement Methods (중국 보안서비스산업의 운영실태 및 제도정착 방안)

  • Lee, Sangchul
    • Journal of the Society of Disaster Information
    • /
    • v.10 no.4
    • /
    • pp.536-547
    • /
    • 2014
  • With the changing safety services and social order systems accompanied by the economic development and changing public security environment since the Chinese economic reform, the security service industry in China is growing daily and related problems are increasing. For the Chinese security service market to be activated, the monopoly of security services by the public security agencies must be removed. In addition, the research and development, expansion, and applications of safety and crime prevention technologies regarding the safety and protection of exhibition, sales, culture, sports, commerce activities, combinations of safety technologies and crime prevention processes, the provision of relevant technical operations, and the expansion of security service areas are required. Furthermore, the administration rights, property rights, and business management rights of security companies must be separated, the security headquarters must be integrated and coordinated for optimization of various resources solely by market needs, and their rights and affiliation relations must be clear. Besides, the competitiveness of security companies in the security service market must be enhanced by unifying the business management, and optimizing and sharing their resources. The security service ordinances of China that have been implemented now must be applied realistically, methods to activate the true market economy for security services must be researched, and various ordinances related to security services must be realigned in line with the characteristics of security services. Finally, for the mutual cooperation system between public and private security services, the public security agencies must acknowledge the importance of private security services and the status of security service providers in crime prevention and social order maintenance. They must establish partnership relations with each other beyond the unilateral direction and management system for security services and drive with positive attitudes the security service industry which is still in its infancy.

Video Compression using Characteristics of Wavelet Coefficients (웨이브렛 계수의 특성을 이용한 비디오 영상 압축)

  • 문종현;방만원
    • Journal of Broadcast Engineering
    • /
    • v.7 no.1
    • /
    • pp.45-54
    • /
    • 2002
  • This paper proposes a video compression algorithm using characteristics of wavelet coefficients. The proposed algorithm can provide lowed bit rate and faster running time while guaranteeing the reconstructed image qualify by the human virtual system. In this approach, each video sequence is decomposed into a pyramid structure of subimages with various resolution to use multiresolution capability of discrete wavelet transform. Then similarities between two neighboring frames are obtained from a low-frequency subband which Includes an important information of an image and motion informations are extracted from the similarity criteria. Four legion selection filters are designed according to the similarity criteria and compression processes are carried out by encoding the coefficients In preservation legions and replacement regions of high-frequency subbands. Region selection filters classify the high-frequency subbands Into preservation regions and replacement regions based on the similarity criteria and the coefficients In replacement regions are replaced by that of a reference frame or reduced to zero according to block-based similarities between a reference frame and successive frames. Encoding is carried out by quantizing and arithmetic encoding the wavelet coefficients in preservation regions and replacement regions separately. A reference frame is updated at the bottom point If the curve of similarity rates looks like concave pattern. Simulation results show that the proposed algorithm provides high compression ratio with proper Image quality. It also outperforms the previous Milton's algorithm in an Image quality, compression ratio and running time, leading to compression ratio less than 0.2bpp. PSNR of 32 dB and running tome of 10ms for a standard video image of size 352${\times}$240 pixels.

Uniform Posture Map Algorithm to Generate Natural Motion Transitions in Real-time (자연스러운 실시간 동작 전이 생성을 위한 균등 자세 지도 알고리즘)

  • Lee, Bum-Ro;Chung, Chin-Hyun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.6
    • /
    • pp.549-558
    • /
    • 2001
  • It is important to reuse existing motion capture data for reduction of the animation producing cost as well as efficiency of producing process. Because its motion curve has no control point, however, it is difficult to modify the captured data interactively. The motion transition is a useful method to reuse the existing motion data. It generates a seamless intermediate motion with two short motion sequences. In this paper, Uniform Posture Map (UPM) algorithm is proposed to perform the motion transition. Since the UPM is organized through quantization of various postures with an unsupervised learning algorithm, it places the output neurons with similar posture in adjacent position. Using this property, an intermediate posture of two active postures is generated; the generating posture is used as a key-frame to make an interpolating motion. The UPM algorithm needs much less computational cost, in comparison with other motion transition algorithms. It provides a control parameter; an animator could control the motion simply by adjusting the parameter. These merits of the UPM make an animator to produce the animation interactively. The UPM algorithm prevents from generating an unreal posture in learning phase. It not only makes more realistic motion curves, but also contributes to making more natural motions. The motion transition algorithm proposed in this paper could be applied to the various fields such as real time 3D games, virtual reality applications, web 3D applications, and etc.

  • PDF

Hardware Design of In-loop Filter for High Performance HEVC Encoder (고성능 HEVC 부호기를 위한 루프 내 필터 하드웨어 설계)

  • Park, Seungyong;Im, Junseong;Ryoo, Kwangki
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.2
    • /
    • pp.335-342
    • /
    • 2016
  • This paper proposes efficient hardware structure of in-loop filter for a high-performance HEVC (High Efficiency Video Coding) encoder. HEVC uses in-loop filter consisting of deblocking filter and SAO (Sample Adaptive Offset) to improve the picture quality in a reconstructed image due to a quantization error. However, in-loop filter causes an increase in complexity due to the additional encoder and decoder operations. A proposed in-loop filter is implemented as a three-stage pipeline to perform the deblocking filtering and SAO operation with a reduced number of cycles. The proposed deblocking filter is also implemented as a six-stage pipeline to improve efficiency and performs a new filtering order for efficient memory architecture. The proposed SAO processes six pixels parallelly at a time to reduce execution cycles. The proposed in-loop filter encoder architecture is designed by Verilog HDL, and implemented by 131K logic gates in TSMC $0.13{\mu}m$ process. At 164MHz, the proposed in-loop filter encoder can support 4K Ultra HD video encoding at 60fps in real time.

A Compressed Sensing-Based Signal Detection Technique for Generalized Space Shift Keying Systems (일반화된 공간천이변조 시스템에서 압축센싱기술을 이용한 수신신호 복호 알고리즘)

  • Park, Jeonghong;Ban, Tae Won;Jung, Bang Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.7
    • /
    • pp.1557-1564
    • /
    • 2014
  • In this paper, we propose a signal detection technique based on the parallel orthogonal matching pursuit (POMP) is proposed for generalized shift space keying (GSSK) systems, which is a modified version of the orthogonal matching pursuit (OMP) that is widely used as a greedy algorithm for sparse signal recovery. The signal recovery problem in the GSSK systems is similar to that in the compressed sensing (CS). In the proposed POMP technique, multiple indexes which have the maximum correlation between the received signal and the channel matrix are selected at the first iteration, while a single index is selected in the OMP algorithm. Finally, the index yielding the minimum residual between the received signal and the M recovered signals is selected as an estimate of the original transmitted signal. POMP with Quantization (POMP-Q) is also proposed, which combines the POMP technique with the signal quantization at each iteration. The proposed POMP technique induces the computational complexity M times, compared with the OMP, but the performance of the signal recovery significantly outperform the conventional OMP algorithm.