• Title/Summary/Keyword: bit rate

Search Result 3,043, Processing Time 0.023 seconds

Fuzzy Logic-based Bit Compression Method for Distributed Face Recognition (분산 얼굴인식을 위한 퍼지로직 기반 비트 압축법)

  • Kim, Tae-Young;Noh, Chang-Hyeon;Lee, Jong-Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.2
    • /
    • pp.9-17
    • /
    • 2009
  • A face database has contained a large amount of facial information data since face recognition was widely used. With the increase of facial information data, the face recognition based on distributed processing method has been noticed as a major topic. In existing studies, there were lack of discussion about the transferring method for large data. So, we proposed a fuzzy logic-based bit compression rate selection method for distributed face recognition. The proposed method selects an effective bit compression rate by fuzzy inference based on face recognition rate, processing time for recognition, and transferred bit length. And, we compared the facial recognition rate and the recognition time of the proposed method to those of facial information data with no compression and fixed bit compression rates. Experimental results demonstrates that the proposed method can reduce processing time for face recognition with a reasonable recognition rate.

Error Rate Performance of FH/MFSK Signal with Thermal Noise in the Partial Band Jamming Environments (부분대역 재밍 환경하에서 열잡음을 고려한 FH/MFSK 신호의 오솔특성)

  • 강찬석;안중수
    • The Journal of the Acoustical Society of Korea
    • /
    • v.12 no.1
    • /
    • pp.47-54
    • /
    • 1993
  • Performance analysis is very important to transmit the high quality information and to construct the optimal system for the minimze the noise from the channel of spread spectrum system. In this paper the error rate performance is analyzed with computer simulation in noncoherent frequency hopping M-qry frequency shift keying(FH/MFSk) systems with regard to thermal noise under the partial band jamming environments. AS a result, in case the thermal noise is disregarded, bit error probability of system in jamming fraction ρ and Eb/Nj(bit energy to jamming power density) is reduced with the increase of K and in worst case 32FSK system is better than 2FSK system by 3.23dB with the variatio of Eb/Nj. In case thermal noise is considered, bit error probability of system by 3.23dB with the variation of Eb/Nj. In case thermal noise is considered, bit error probability of system are reduced with the increase of K and Eb/No(bit energy to thermal noise density). Bit error probability in connection with worst case ρ is not largely influenced form over the 14dB to K=1 and 8dB to K=5 accordingly thermal noise disregarding. These results may be useful for avoiding the common vulnerabilities when the spread spectrum system is designed.

  • PDF

Analysis for the Bit Error Probability in the PCM-NRZ/FM Telemetry System (PCM-NRZ/FM Telemetry 시스템에서 Bit 오차확률에 관한 분석)

  • 강정수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.8 no.2
    • /
    • pp.76-81
    • /
    • 1983
  • PCM-NRZ/FM Telemetry system is constructed on the basis of RF link with FM modulatedand NRZ-L binary coded PCM data are assumed to transmit through 5th-order Bessel filter. Upon demodulated by the limiter-discriminator at the receiver, the probability of bit error, which is important for performance estimation of digital system, is analyzed against SNR. The analysis based on the following parameters, that is bit rate 140kHz, frequency of pre-modulation filter f-100kHz, maximum frequency deviation of transmitter 2f=300kHz, was performed. As a result, when the telemetry system with the parameters above is designed, the probability of bit error is obtained as 10 along with fT=0.7 and h=2, T=2.

  • PDF

An Improvement of MPEG-4 Rate Control Scheme by Reducing the Occurrence of Frame Skipping at Low Bit-Rate (저 비트율에서 프레임 스킵 발생을 줄이는 MPEG-4 비트율 제어 기법의 개선)

  • Boo, Hee-Hyung;Choi, Yong-Do;Kim, Sung-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.9
    • /
    • pp.1086-1092
    • /
    • 2012
  • In this paper, we propose the rate control scheme reducing frame skipping at low bit-rate. As the method considering lossy parts in the compressing process at the existing scheme, the proposed scheme is improved by subtracting the converted bits from the target bit-rate of the current frame. The converted bits are the value resulted from multiplying the ratio of the current frame MAD to the previous frame MAD by the compressed bits changed from the remaining values after compressing the previous frame.

Equal Bit Rate Control for Low Bit-rate Coder based on Frame Statistics (저 전송률 부호화기를 위한 프레임 특성에 근간한 균등 비트 할당 기법)

  • Seo Dong-Wan;Choe Yoon-Sik
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.6 no.4
    • /
    • pp.176-181
    • /
    • 2005
  • This paper presents an equal bit rate control algorithm utilizing the statistical change between the previous frame and the current frame. The previous studies on the model-based rate control have focused on the models of bit rate and distortion in types of coders, in terms of the quantization parameter. The proposed algorithm improves the typical model-based rate control by updating a model parameter instead of modeling a better model of the rate and distortion. The proposed algorithm updates this model parameter by recognizing the change in statistics between the previous frame and the current frame. We implement the proposed algorithm in MPEG-4 coders and verify its performance while comparing it to the TMN8's approach (up to 0.6dB of improvement).

  • PDF

Performance Evaluation focused on Burst of Smoothing Algorithms (스무딩 알고리즘들의 버스트 성능 평가)

  • Lee, Myoun-Jae
    • Journal of Digital Contents Society
    • /
    • v.13 no.1
    • /
    • pp.111-118
    • /
    • 2012
  • The burst is to require abruptly high transmission rate in case of transmitting pre-stored variable bit rate video data, and it causes to be inefficient use of network resource, resource reservation. To avoid these problems, smoothing is transmission plan where variable rate video data is converted to a constant bit rate stream. These smoothing algorithms include CBA, MCBA, MVBA and others. To evaluate amount of burst reduction in the existing CBA, MCBA, MVBA algorithm, this paper compares the burst-related-factors of transmission plan in smoothing algorithms with original video sources which were stored Variable Bit Rate. There are maximum frame bytes, maximum GOP bytes, transmission rate variability per frame, transmission rate variability per GOP in burst-related evaluation factors. Experimental result shows burst-related factors of smoothing algorithms which were used for experiment lower than that of pre-stored video data, except special case.

Joint Spatial-Temporal Quality Improvement Scheme for H.264 Low Bit Rate Video Coding via Adaptive Frameskip

  • Cui, Ziguan;Gan, Zongliang;Zhu, Xiuchang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.1
    • /
    • pp.426-445
    • /
    • 2012
  • Conventional rate control (RC) schemes for H.264 video coding usually regulate output bit rate to match channel bandwidth by adjusting quantization parameter (QP) at fixed full frame rate, and the passive frame skipping to avoid buffer overflow usually occurs when scene changes or high motions exist in video sequences especially at low bit rate, which degrades spatial-temporal quality and causes jerky effect. In this paper, an active content adaptive frame skipping scheme is proposed instead of passive methods, which skips subjectively trivial frames by structural similarity (SSIM) measurement between the original frame and the interpolated frame via motion vector (MV) copy scheme. The saved bits from skipped frames are allocated to coded key ones to enhance their spatial quality, and the skipped frames are well recovered based on MV copy scheme from adjacent key ones at the decoder side to maintain constant frame rate. Experimental results show that the proposed active SSIM-based frameskip scheme acquires better and more consistent spatial-temporal quality both in objective (PSNR) and subjective (SSIM) sense with low complexity compared to classic fixed frame rate control method JVT-G012 and prior objective metric based frameskip method.

Optimum Bit Allocation for Lossless Laplacian Pyramid Coding (비 손실 라플라시안 피라미드 부호화의 최적 비트 배정)

  • 채종길
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.11
    • /
    • pp.1618-1625
    • /
    • 1993
  • In the transmission of image using the lossless Laplacian pyramid coding, the image quality of the last hierachy is almost same regardless of the bit rate of each hierachy. However, at the higher hierachy with low resolution, it is varied according to bit rate of each hierachy. In this paper, optimum bit allocation to achieve better image at the higher hierachy and minimize the distortion at the last hierachy was proposed. More efficient progressive transmission was shown to be possible by experimental results of higher PSNR and better image quality at the hierachy with low resolution.

  • PDF

A DSP Implementation of the BICM Module for DVB-T2 Receivers (DVB-T2 수신기를 위한 BICM 모듈의 DSP 구현)

  • Lee, Jae-Ho
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.4
    • /
    • pp.591-595
    • /
    • 2011
  • In this paper, we design the hardware architecture of the BICM(Bit Interleaved Coded Modulation) module for next generation European broadcast system and implement the BICM module with DSP(Digital Signal Processor) TMS320C6474. Simulation result shows that the BER(Bit Error Rate) performance of the fixed-point BICM module using more than 8 bits is very similar to that of the floating-point BICM module.

Scence Change Adaptive Bit Rate Control Using Local Variance (국부 분산을 이용한 장면 전환 적응 비트율 제어)

  • 이호영;김기석;박영식;송근원;남재열;하영호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.4
    • /
    • pp.675-684
    • /
    • 1997
  • The bit rate control algorithm which is capable of handing scene change is proposed. In MPEG-2 TM5, block variance is used to measure block activity. But block variance is not consistent with human visual system and does not differenciate the distribution of pixel values within the block. In target bit allocation process of TM5, global complexity, obtained by results of previous coded pictures, is used. Since I pictures are spaced relatively far apart, their complexity estimate is not very accurate. In the proposed algorithm local variance is used to measure block activity and detect scene change. Local variance, using deviation from the mean of neighboring pixels, well represents the distribution of pixel values within the block. If scene change is detected, the local variance information is used for target bit allocation process. Allocating target bits for I picture, the average local variance difference between previous and current I picture is considered. The experimental results show that the proposed algorithm can detect scene change very precisely and gives better picture quality and higher PSNR values than MPEG-2 TM5.

  • PDF