• Title/Summary/Keyword: 프레임률

Search Result 482, Processing Time 0.028 seconds

Design of a Variable half rate speech codec (가변율 half rate 음성 부호화기의 설계)

  • 성호상
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1998.06e
    • /
    • pp.293-296
    • /
    • 1998
  • 본 논문에서는 다양한 멀티미디어 서비스를 위해 가변율 half rate 음성 부호화기를 설계하였다. 유, 무성음과 묵음의 구분을 위해 본 논문에서는 프레임 에너지와 음성 파라메터들을 이용한 효과적인 voicing 결정 알고리즘을 사용하였다. 유성음을 위한 half rate 음성 부호화기는 저속에서 좋은 특성을 보이는 generalized AbS구조를 이용하였다. LPC 계수는 LSP 계수로 변환한 후 predictive 2-stage VQ를 통해서 양자화하며, 여기 신호는 음질저하를 최소화하며 복잡도를 감소시킨 shift 방식의 대수적 고정 코드북 구조를 사용하고, 적응코드북과 여기코드북의 이득은 VQ로 양자화 하였다. 무성음을 위한 부호화기는 대부분이 유성음을 위한 부호화기와 동일하지만, 무성음에서는 피치간 상관도가 매우 낮으므로 피치 보간 방법을 사용하지 않고 개루프로 피치 lag를 찾은 후 전체 프레임에 사용한다. 1 kb/s 부호화기는 묵음 구간과 주변소음 구간에 사용되며 이 구간의 신호를 피치 성분이 미약한 주변소음들로 제한하고 이에 최적인 부음성 부호화기를 설계하였다. 최종적으로 완성된 가변율 half rate 부호화기는 voice activity factor(VAF)가 0.47인 시험음성에서 약 2.6 kb/s의 평균 전송률을 보였다. 주관적 음질 평가의 일환으로 IS-96 표준 코덱인 가변율 8 kb/s QCELP와 A-B preference 시험을 실시하였다. 시험 결과 평균전송률이 약 2배인 가변율 8 kb/s QCELP 보다 우수한 음질 성능을 보였다.

  • PDF

A Study on the Contention Area Establish of Algorithm from Cable Network based on DOCSIS 3.0 (DOCSIS 3.0 기반 케이블망에서의 경쟁구간 설정 알고리즘에 관한 연구)

  • Kim, Young-Sung;Song, Jae-Jun;Roh, Sun-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.69-72
    • /
    • 2007
  • DOCSIS 3.0 Protocol is proposed to make the advance of HFC network. In the DOCSIS based network, the upstream frame is divided into contention section reservation section. CMs to have packets send request messages through the contention section. That two or more CMs sends Request message at the same contention slot makes collison. In this paper, are propose the contention section establlish at algorithm considering of channel-bonding mechanism that is the primary technique of DOCSIS 3.0. Results of simulation display better performance int the number of contention slots and the utilization of contention section.

  • PDF

2D Human Pose Estimation Using Component-Based Density Propagation (구성요소 기반 확률 전파를 이용한 2D 사람 자세 추정)

  • Cha, Eun-Mi;Lee, Kyoung-Mi
    • 한국HCI학회:학술대회논문집
    • /
    • 2007.02a
    • /
    • pp.725-730
    • /
    • 2007
  • 본 논문에서는 인체 추적에 필요한 인체의 각 부위들을 구성요소로 각각 검출하여 연결하는 인체 모델을 통해 각 구성요소를 개별적으로 추정하게 된다. 여기서 인체의 구성요소 중 동작 추적에 가장 필요한 6개 부위로 구성된 구성요소인 머리, 몸통, 왼팔, 오른팔, 왼발, 오른발 등을 검출하여 추적한 후, 각 구성요소의 중심값과 색상정보를 이용하여 이전 프레임과 현재 프레임 간에 연결성을 두여 각 구성요소를 개별적으로 확률 전파를 통해 추적되어지고, 각 구성요소의 추적 결과는 구성요소들의 추정 결과를 구성요소 기반 확률 전파를 이용하여 인체의 동작을 추정하는 방법을 제안한다. 입력 영상에서 피부색 등의 색상 정보를 이용하여 인체 부위 또는 인체 모델의 구성 요소들 각각의 중심값과 색상정보를 가지고 확률전파를 통해 이것이 어떤 동작인지 동작 추정이 가능하다. 본 논문에서 제안하는 인체 동작 추적 시스템은 유아의 동작교육에 이용되는 7가지 동작인 걷기, 뛰기, 앙감질, 구부리기, 뻗기, 균형 잡기, 회전하기 등에 적용하였다. 본 논문에서 제안한 인체 모델의 각 구성요소 부위들을 독립적으로 검출하여 평균 96%의 높은 인식률을 나타냈고, 앞서 적용한 7가지 동작에 대해서 실험한 결과 평균 88.5% 성공률을 획득함으로써 본 논문에서 제안한 방법의 타당성을 보였다.

  • PDF

Implementation of A 30-Channel PCM Telemetry Encoder with A TMS320F2812 DSP Chip (TMS320F2812 DSP 칩을 이용한 30채널 텔레메트리 엔코더 구현)

  • Kim Jung-Sup;Jang Myung-Jin;Shi Kwang-Gyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9A
    • /
    • pp.920-927
    • /
    • 2006
  • There are three critical considerations in developing a PCM telemetry encoder to be installed in an artillery projectile. The first is the performance consideration, such as sampling rate and data transmission rate. The second is the size consideration due to the severely limited installation space in an artillery projectile and the last is the power consumption consideration due to limitations of the munition's power supply. To meet these three considerations, the best alternative is a one-chip solution. Using a commercially available TMS320F2812 DSP, we have implemented a 30-channel PCM telemetry encoder to process randomized data frames, composed of 16-channel analog data, 14-channel digital data and 2-frame synchronization channels per data frame at 10Mbps transmitting baud rate.

Compression and Visualization Techniques for Time-Varying Volume Data (시변 볼륨 데이터의 압축과 가시화 기법)

  • Sohn, Bong-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.3
    • /
    • pp.85-93
    • /
    • 2007
  • This paper describes a compression scheme for volumetric video data(3D space X 1D time) there each frame of the volume is decompressed and rendered in real-time. Since even one frame size of volume is very large, runtime decompression can be a bottleneck for real-time playback of time-varying volume data. To increase the run-time decompression speed and compression ratio, we decompose the volume into small blocks and only update significantly changing blocks. The results show that our compression scheme compromises decompression speed and image quality well enough for interactive time-varying visualization.

  • PDF

Minimum Variable Bandwidth Allocation over Group of Pictures for MPEG Video Transmission (MPEG 동영상 전송을 위한 GOP 단위의 최소 변경 대역폭 할당 기법)

  • Kwak, Joon-Won;Lee, Myoung-Jae;Song, Ha-Yoon;Park, Do-Soon
    • The KIPS Transactions:PartC
    • /
    • v.9C no.5
    • /
    • pp.679-686
    • /
    • 2002
  • The transmission of prerecorded and compressed video data without degradation of picture quality requires video servers to cope with large fluctuations in bandwidth requirement. Bandwidth smoothing techniques can reduce the burst of a variable-bit rate stream by prefetching data at a series of fixed rates and simplifying the allocation of resources in the video servers and the network. In this paper, the proposed smoothing algorithm results in the optimal transmission plans for (1) the smallest bandwidth requirements, (2) the minimum number of changes in transmission rate, and (3) the minimum amount of the server process overhead. The advantages of the proposed smoothing algorithm have been verified through the comparison with the existing smoothing algorithms in diverse environments.

Optimal Spectrum Sensing Framework based on Estimated Miss Detection Probability for Aggregated Data Slots in Cognitive Radio Networks (무선 인지 네트워크에서 군집형 데이터 슬롯의 미검출 확률 추정에 기반한 최적 스펙트럼 센싱 구조)

  • Wu, Hyuk;Lee, Dong-Jun
    • Journal of Advanced Navigation Technology
    • /
    • v.17 no.5
    • /
    • pp.506-515
    • /
    • 2013
  • In cognitive radio networks, several research works typically address the framework which consists of a spectrum sensing period and a data transmission period. When the frame period is short, there is the problem that the throughput of secondary users decrease. In this paper, aggregated data slot structure is considered to increase the throughput of secondary users. Chapman-Kolmogorov equation is used for the modeling of the transmission probability of primary users and formulation of an optimization problem to maximize the throughput of secondary users. Solution of the optimization problem results in the optimal spectrum sensing time, the length of data slot and the number of data slots governed by a spectrum sensing.

Video Quality Variation Minimizing for Real-Time Low Bit Rate Video (영상품질 변화를 최소화하는 실시간 저전송률 영상코딩)

  • Park, Sang-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.5
    • /
    • pp.868-874
    • /
    • 2007
  • A real-time frame-layer rate control algorithm with a token bucket traffic shaper is proposed for minimizing video duality variation. The proposed rate control method uses a non-iterative optimization method for low computational complexity, and performs bit allocation at the frame level to minimize variation in distortion between frames. In order to reduce the quality fluctuation, we use a sliding window scheme which does not require the pre-analysis process. Therefore, the proposed algorithm does not produce the delay from encoding, and is suitable for real-time low-complexity video encoder. Experimental results indicate that the proposed control method provides better PSNR performance than the existing rate control method.

Rear-Approaching Vehicle Detection Research using Region of Interesting based on Faster R-CNN (Faster R-CNN 기반의 관심영역 유사도를 이용한 후방 접근차량 검출 연구)

  • Lee, Yeung-Hak;Kim, Joong-Soo;Shim, Jae-Chnag
    • Journal of IKEEE
    • /
    • v.23 no.1
    • /
    • pp.235-241
    • /
    • 2019
  • In this paper, we propose a new algorithm to detect rear-approaching vehicle using the frame similarity of ROI(Region of Interest) based on deep learning algorithm for use in agricultural machinery systems. Since the vehicle detection system for agricultural machinery needs to detect only a vehicle approaching from the rear. we use Faster R-CNN model that shows excellent accuracy rate in deep learning for vehicle detection. And we proposed an algorithm that uses the frame similarity for ROI using constrained conditions. Experimental results show that the proposed method has a detection rate of 99.9% and reduced the false positive values.

MPEG-4 Video Frame-based Bitrate Control using 2D History Pool and Sliding Window (2차원 히스토리 풀과 슬라이딩 윈도우를 이용한 MPEG-4 비디오 프레임 기반 비트 생성율 제어 방법)

  • Park, Gwang-Hoon;Lee, Yoon-Jin
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.6
    • /
    • pp.355-366
    • /
    • 2002
  • This paper introduces the MPEG-4 video frame-based bitrate control methodology using two dimensional history pool and a sliding window. Proposed method preferentially clusters the encoded results according to the image characteristics and stores those results into the 2 dimensional history pool. Among the stored results in the pool, the sliding window collects the encoded results whose characteristics are very similar to the image frame to be encoded. Feedback regression is finally carried out bated on the collected results. Therefore proposed method can actively adapt to the rapid varying image characteristics by reducing the occurrences of the extrapolations when determining the quantization steps. Proposed method has better performances than the MPEG-4 frame-based bitrate control algorithm by evaluating with the actually encoded bits per frame, encoded PSNR's, and frame skips.