• Title/Summary/Keyword: 공간-주파수 부호화

Search Result 62, Processing Time 0.023 seconds

Perceptual Quality-based Video Coding with Foveated Contrast Sensitivity (Foveated Contrast Sensitivity를 이용한 인지품질 기반 비디오 코딩)

  • Ryu, Jiwoo;Sim, Donggyu
    • Journal of Broadcast Engineering
    • /
    • v.19 no.4
    • /
    • pp.468-477
    • /
    • 2014
  • This paper proposes a novel perceptual quality-based (PQ-based) video coding method with foveated contrast sensitivity (FCS). Conventional methods on PQ-based video coding with FCS achieve minimum loss on perceptual quality of compressed video by exploiting the property of human visual system (HVS), that is, its sensitivity differs by the spatial frequency of visual stimuli. On the other hand, PQ-based video coding with foveated masking (FM) exploits the difference of the sensitivity of the HVS between the central vision and the peripheral vision. In this study, a novel FCS model is proposed which considers both the conventional DCT-based JND model and the FM model. Psychological study is conducted to construct the proposed FCS model, and the proposed model is applied to PQ-based video coding algorithm implemented on HM10.0 reference software. Experimental results show that the proposed method decreases bitrate by the average of 10% without loss on the perceptual quality.

Image Adaptive Block DCT-Based Perceptual Digital Watermarking (영상 특성에 적응적인 블록 DCT 기반 지각적 디지털 워터마킹)

  • 최윤희;최태선
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.6
    • /
    • pp.221-229
    • /
    • 2004
  • We present new digital watermarking scheme that embeds a watermark according to the characteristics of the image or video. The scheme is compatible with established image compression standard. We define a weighting function using a parent-child structure of the DCT coefficients in a block to embed a maximum watermark. The spatio-frequency localization of the DCT coefficients can be achieved with this structure. In the detection stage, we present an optimum a posteriori threshold with a given false detection error probability based on the statistical analysis. Simulation results show that the proposed algorithm is efficient and robust against various signal processing techniques. Especially, they are robust against widely used coding standards, such as JPEG and MPEG.

Fast Triangular Mesh Approximation for Terrain Data Using Wavelet Coefficients (Wavelet 변환 계수를 이용한 대용량 지형정보 데이터의 삼각형 메쉬근사에 관한 연구)

  • 유한주;이상지;나종범
    • Journal of Broadcast Engineering
    • /
    • v.2 no.1
    • /
    • pp.65-73
    • /
    • 1997
  • This paper propose a new triangular mesh approximation method using wavelet coefficients for large terrain data. Using spatio-freguency localization characteristics of wavelet coefficients, we determine the complexity of terrain data and approximate the data according to the complexity. This proposed algorithm is simple and requires low computational cost due to its top-down approach. Because of the similarity between the mesh approximation and data compression procedures based on wavelet transform, we combine the mesh approximation scheme with the Embedded Zerotree Wavelet (EZW) coding scheme for the effective management of large terrain data. Computer simulation results demonstrate that the proposed algorithm is very prospective for the 3-D visualization of terrain data.

  • PDF

Quadtree Based Infrared Image Compression in Wavelet Transform Domain (웨이브렛 변환 영역에서 쿼드트리 기반 적외선 영상 압축)

  • 조창호;이상효
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3C
    • /
    • pp.387-397
    • /
    • 2004
  • The wavelet transform providing both of the frequency and spatial information of an image is proved to be very much effective for the compression of images, and recently lot of studies on coding algorithms for images decomposed by the wavelet transform together with the multi-resolution theory are going on. This paper proposes a quadtree decomposition method of image compression applied to the images decomposed by wavelet transform by using the correlations between pixels and '0'data grouping. Since the coefficients obtained by the wavelet transform have high correlations between scales and high concentrations, the quadtree method can reduce the data quantity effectively. the experimental infrared image with 256${\times}$256 size and 8〔bit〕, was used to compare the performances of the existing and the proposed compression methods.

A Wavefront Array Processor Utilizing a Recursion Equation for ME/MC in the frequency Domain (주파수 영역에서의 움직임 예측 및 보상을 위한 재귀 방정식을 이용한 웨이브프런트 어레이 프로세서)

  • Lee, Joo-Heung;Ryu, Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.10C
    • /
    • pp.1000-1010
    • /
    • 2006
  • This paper proposes a new architecture for DCT-based motion estimation and compensation. Previous methods do riot take sufficient advantage of the sparseness of 2-D DCT coefficients to reduce execution time. We first derive a recursion equation to perform DCT domain motion estimation more efficiently; we then use it to develop a wavefront array processor (WAP) consisting of processing elements. In addition, we show that the recursion equation enables motion predicted images with different frequency bands, for example, from the images with low frequency components to the images with low and high frequency components. The wavefront way Processor can reconfigure to different motion estimation algorithms, such as logarithmic search and three step search, without architectural modifications. These properties can be effectively used to reduce the energy required for video encoding and decoding. The proposed WAP architecture achieves a significant reduction in computational complexity and processing time. It is also shown that the motion estimation algorithm in the transform domain using SAD (Sum of Absolute Differences) matching criterion maximizes PSNR and the compression ratio for the practical video coding applications when compared to tile motion estimation algorithm in the spatial domain using either SAD or SSD.

Hardware Design of Rate Control for H.264/AVC Real-Time Video Encoding (실시간 영상 부호화를 위한 H.264/AVC의 비트율 제어 하드웨어 설계)

  • Kim, Changho;Ryoo, Kwangki
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.201-208
    • /
    • 2012
  • In this paper, the hardware design of rate control for real-time video encoded is proposed. In the proposed method, a quadratic rate distortion model with high-computational complexity is not used when quantization parameter values are being decided. Instead, for low-computational complexity, average complexity weight values of frames are used to calculate QP. For high speed and low computational prediction, the MAD is predicted based on the coded basic unit, using spacial and temporal correlation in sequences. The rate control is designed with the hardware for fast QP decision. In the proposed method, a quadratic rate distortion model with high-computational complexity is not used when quantization parameter values are being decided. Instead, for low-computational complexity, average complexity weight values of frames are used to calculate QP. In addition, the rate control is designed with the hardware for fast QP decision. The execution cycle and gate count of the proposed architecture were reduced about 65% and 85% respectively compared with those of previous architecture. The proposed RC was implemented using Verilog HDL and synthesized with UMC $0.18{\mu}m$ standard cell library. The synthesis result shows that the gate count of the architecture is about 19.1k with 108MHz clock frequency.

A VLSI Architecture for Fast Motion Estimation Algorithm (고속 움직임 추정 알고리즘에 적합한 VLSI 구조 연구)

  • 이재헌;나종범
    • Journal of Broadcast Engineering
    • /
    • v.3 no.1
    • /
    • pp.85-92
    • /
    • 1998
  • The block matching algorithm is the most popular motion estimation method in image sequence coding. In this paper, we propose a VLSI architecture. for implementing a recently proposed fast bolck matching algorith, which uses spatial correlation of motion vectors and hierarchical searching scheme. The proposed architecture consists of a basic searching unit based on a systolic array and two shift register arrays. And it covers a search range of -32~ +31. By using the basic searching unit repeatedly, it reduces the number of gatyes for implementation. For basic searching unit implementation, a proper systolic array can be selected among various conventional ones by trading-off between speed and hardware cost. In this paper, a structure is selected as the basic searching unit so that the hardware cost can be minimized. The proposed overall architecture is fast enough for low bit-rate applications (frame size of $352{\times}288$, 3Oframes/sec) and can be implemented by less than 20,000 gates. Moreover, by simply modifying the basic searching unit, the architecture can be used for the higher bit-rate application of the frame size of $720{\times}480$ and 30 frames/sec.

  • PDF

The Efficient Coding Tools based 3-Dimensional Transform in H.264/AVC (H.264/AVC에서 3차원 변환에 기반을 둔 효율적인 동영상 압축 방법)

  • Jo, Jae-Kyu;Cho, Hye-Jeong;Lee, Jin-Ho;Jeong, Se-Yoon;Ahn, Chang-Beom;Oh, Seoung-Jun
    • Journal of Broadcast Engineering
    • /
    • v.15 no.3
    • /
    • pp.434-453
    • /
    • 2010
  • In this paper, we propose 3DTE(3-Dimensional Transform Environment) that is based on 3DT(Dimensional Transform) that performs 2-dimensional integer DCT(Discrete Cosine Transform) based on $4{\times}4$ block and 1-dimensional integer DCT based on $4{\times}1$ block after collecting same frequency coefficients in neighboring $4{\times}4$ block and supports it's additional coding tools for high performance. The transform of 3DT can keep prediction error by using $4{\times}4$ block and reduce spatial redundancy additionally. The proposed 3DTE can provide coding tools to improve the coding efficiency with using 3DT. The performance of 3DTE compared to JM11.0 is average 3.58% and 5.40% bit savings for all test sequences and HD sequences, respectively, with keeping subjective video quality in High profile.

Performance Analysis of OFDM-CDMA Systems using Space-Time Coding (공간-시간부호화를 이용한 OFDM-CDMA의 성능분석)

  • Kang, Mingoo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.2
    • /
    • pp.265-275
    • /
    • 2004
  • In this paper, an OFDM-CDMA broadband system is considered for a possible candidate of fixed wireless broadband access network applications. With an emphasis on a preamble design for multi-channel separation, we address a channel estimation based on the time-domain windowing and its imperfectness in OFDM-based multiple-antenna transmission systems. By properly designing each preamble for multiple antennas to be orthogonal in the time domain, the channel estimation can be applied to the ETSI HlPERLAN/2 and IEEE-802.11a standards in the case of more than two transmit antennas. Also, an effect of diversity techniques on the performance of OFDM-CDMA based broadband wireless access networks is investigated and the maximum achievable diversity gain for a two-path Rayleigh fading environment is evaluated Simulation results show that the OFDM-CDMA system applying a space-time-frequency diversity with a full-rate full diversity code can give the diversity of D = 4 and D = 8 for both multi-user cases of maximum user and half user capacities, respectively.

Multiple-Relay-assisted SSB SFBC SC-FDMA Transmission System (다중중계기 기반의 SSB SFBC SC-FDMA 시스템)

  • Won, HuiChul
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.25 no.2
    • /
    • pp.29-37
    • /
    • 2020
  • This paper proposes a multiple-relay-assisted single side band (SSB) space frequency block code (SFBC) single carrier (SC)-frequency division multiple access (FDMA) system and measures the performance of SSB SFBC SC-FDMA transmission system with the signal-to-noise power ratio SNR) between relays and a destination station. As we know, the performance of relay-assisted transmission systems can be easily improved by re-transmitting to the destination station after applying block code to the recovered transmitted signals of relays. In this paper, the performance improvement of the relay-assisted SSB SC-FDMA system can be obtained without any significant increase of system computational complexity by implementing block code with the complex conjugates symmetric characteristic of SSB system. The simulation result shows that the SNR performance of the proposed multiple-relay-assisted SSB SFBC SC-FDMA system is about 4 dB better than the performance of the single-relay-assisted SSB SC-FDMA system at the symbol error rate of 10-2.