• Title/Summary/Keyword: 언더플로우

Search Result 45, Processing Time 0.021 seconds

A Modification of The Fuzzy Logic Based DASH Adaptation Algorithm for Performance Improvement (성능 향상을 위한 퍼지 논리 기반 DASH 알고리즘의 수정)

  • Kim, Hyun-Jun;Son, Ye-Seul;Kim, Joon-Tae
    • Journal of Broadcast Engineering
    • /
    • v.22 no.5
    • /
    • pp.618-631
    • /
    • 2017
  • In this paper, we propose a modification of fuzzy logic based DASH adaptation algorithm(FDASH) for seamless media service in time-varying network conditions. The proposed algorithm selects more appropriate bit-rate for the next segment by the modification of the Fuzzy Logic Controller(FLC) and reduces the number of video bit-rate changes by applying Segment Bit-rate Filtering Module(SBFM). Also, we apply the Start Mechanism for clients not to watch the low quality videos in the very beginning stage of streaming service and add the Sleeping Mechanism to avoid any buffer overflow expected. Ultimately, we verified by using NS-3 Network Simulator that the proposed method shows better performance compared to FDASH. According to the experimental results, there is no buffer underflow/overflow within the limited buffer size, which is not guaranteed in FDASH on the other hand. Also, we confirmed that mFDASH has almost the same level of average video quality against FDASH and reduces about 50% of number of video bit-rate changes compared to FDASH in Point-to-Point network and Wi-Fi network.

A Study on Improvement To The Key Parameter For High Real Capacity Of Lossless Data Hiding (무손실 데이터 은닉의 삽입 용량 증진을 위한 키 파라미터 개선 기법)

  • Jeong, Hee;Kang, Ji-Hong;Choe, Yoon-Sik
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.07a
    • /
    • pp.219-221
    • /
    • 2012
  • 본 논문은 무손실 데이터 은닉 기법중 주변 화소의 통계적 특성을 이용하여 어떠한 추가적인 맵 정보 없이 키 파라미터로써 원본 영상과 삽입한 데이터를 정확히 분리해 내는 기법이다. 오버/언더 플로우에 더 강한 데이터 은닉을 위해, 데이터 삽입에 대한 변수로 작용할 수 있는 주변 화소값들의 범위 뿐만 아니라 주변 화소값들의 표준 편차와 평균값을 모두 키 파라미터의 인자로 사용하여 화소값이 낮은, 즉 영상의 밝기가 어두운 부분에 더 많은 데이터를 삽입할 수 있는 기법을 제안하였고, 실험을 통하여 기존 기법 대비 평균 2배 이상의 삽입 용량이 증진된 것을 확인하였다.

  • PDF

Reversible Image Watermarking with Differential Histogram Shifting and Error Prediction Compensation (차이값 히스토그램 쉬프팅과 오류 예측 보정을 이용한 가역 영상 워터마킹)

  • Yeo, Dong-Gyu;Lee, Hae-Yeoun;Kim, Byeong-Man;Kim, Kyung-Su
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.6
    • /
    • pp.417-429
    • /
    • 2010
  • Reversible watermarking inserts watermark into digital media in such a way that visual transparency is preserved and then enables to restore the original media from the marked one without any loss of media quality. This watermarking can be applied to quality-sensitive imaging such as medical imaging, military imaging, remote-sensing imaging, and precious artwork, where the original media should be preserved during image processing and analysis. In this paper, a reversible image watermarking technique that embeds message bits by modifying the differential histogram of adjacent pixels is presented. In order to satisfy both high embedding capacity and visual quality, the proposed technique exploits the fact that adjacent pixels in the image have highly spatial correlation. Also, we prevent overflow/underflow problem and salt-and-pepper artifacts by employing a predicted error compensation scheme. Through experiments using various test images, we prove that the presented technique provides perfect reversibility and high embedding capacity, while maintaining the induced-distortion low.

Preceding Error Recovery Algorithm for Multimedia Stream in the Tree-based Multicast Environments (트리기반 멀티캐스트 환경에서 멀티미디어 스트림을 위한 선행에러복구 방안)

  • Kim, Ki-Young;Yoon, Mi-Youn;Shin, Young-Tae
    • The KIPS Transactions:PartC
    • /
    • v.10C no.3
    • /
    • pp.345-354
    • /
    • 2003
  • IP Multicast is required of more little network resources than one in unicast. Furthermore, reliable multicast has been researched for supporting reliability at IP Multicast mechanism. Although these studies are carried out, they only have focused on general data. In other words, in case that realtime packet, they can not support reliability since they do not consider realtime properties such as dependency of interframe and playback in time. Besides, we also request to support scalability because we are based on Mobile IP network together with internet. Thus, we need a mechanism to guarantee reliability and scalability of realtime stream data. In this paper, we propose PER (Preceding Error Recovery) that reflect characteristics of the realtime data, especially for H.323. PER provides scalable reliability because it is based on tree-based multicast basically and helps to support scalable relibility as reducing control packet and recovers stream buffer space from underflow status as soon as possible. PER shows much better scalable and reliable than existing works.

A Seamless Adaptive Streaming Scheme for Interactive Multimedia Service in HTTP Adaptive Streaming (HTTP 적응적 스트리밍에서 끊김 없는 대화형 멀티미디어 스트리밍을 위한 전송 기법)

  • Kim, Heekwang;Chung, Kwangsue
    • Journal of KIISE
    • /
    • v.44 no.5
    • /
    • pp.545-552
    • /
    • 2017
  • Because of the explosive growth of mobile devices and development of network technologies, HTTP (Hypertext Transfer Protocol) adaptive streaming has become a new trend in video delivery to provide efficient multimedia streaming services. As interest in personalized broadcasting grows, the study of interactive multimedia has been actively pursued. The interactive multimedia service is a method of playing media according to a scenario selected by the user. Providing the interactive multimedia service with the existing HTTP adaptive streaming causes switching delay and buffer underflow according to the point in time when the user selects the scenario while the client streams the interactive multimedia and therefore decreases the user QoE (Quality of Experience). In this paper, we propose an adaptive streaming scheme for interactive multimedia service in HTTP adaptive streaming to provide seamless playback. We design the architecture and prefetching scheme for interactive multimedia streaming.

An Efficient Transmission Plan for Adaptable Bandwidth Allocation Technique (적응형 대역폭 할당 방법을 위한 효율적인 전송 계획)

  • Lee, Myoun-Jae;Park, Do-Soon
    • The KIPS Transactions:PartC
    • /
    • v.14C no.3 s.113
    • /
    • pp.285-292
    • /
    • 2007
  • In the adaptable bandwidth allocation technique, a transmission plan for variable rate video data is made by the CBA algorithm and the data is transmitted by considering network traffic. But the CBA algorithm produces a transmission plan where the size of the increasing interval of transmission rate is generally larger than the size of the decreasing interval. And the transmission rate in CBA algorithm is changed in overflow curve during the increasing interval of transmission rate. This ぉy cause many frames to be discarded when available transmission rate is small. In this paper, a smoothing algorithm is proposed, where transmission rate is changed in the middle of underflow curve and overflow curve, but the transmission rate increases at the minimum. In order to show the performance, the proposed algorithm and a CBA algorithm were applied to a transmission plan in the adaptable bandwidth allocation technique, and the minimum frame rates, the average frame rates, the variation of frame rates, and the numbers of discarded frames were compared in both algorithms.

Depending on PACS Operating System Differences Analysis of Usefulness of Lossless Compression Method in Medical Image Upload: SNR, CNR, Histogram Comparative Analysis (PACS운영 시스템 차이에 따른 의료 영상 업로드 시 무손실 압축 방식의 유용성 분석: SNR, CNR, Histogram 비교 분석을 중심으로)

  • Choi, Ji-An;Hwang, Jun-Ho;Lee, Kyung-Bae
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.3
    • /
    • pp.299-308
    • /
    • 2018
  • This study focused on the fact that medical images that are issued at different hospitals may affect image quality on PACS when different software is used. A university hospital image was copied to the DICOM file and registered on the PACS of the university hospital B. The capacity and image quality of the software used in the university hospital were evaluated by SNR, CNR and histogram. As the compression ratio increased, SNR and CNR tended to decrease. Note that Lossless Compression decreased the data size by half compared to No Compression, but SNR and CNR did not change. As a result of the histogram analysis, the information loss due to the underflow phenomenon was conspicuous. When moving to another hospital, No compression or lossless compression method should be used. In conclusion, it is useful to use the lossless compression method, considering waiting time and economic efficiency in uploading.

High-Capacity Reversible Watermarking through Predicted Error Expansion and Error Estimation Compensation (추정 오차 확장 및 오류 예측 보정을 통한 고용량 가역 워터마킹)

  • Lee, Hae-Yeoun;Kim, Kyung-Su
    • The KIPS Transactions:PartB
    • /
    • v.17B no.4
    • /
    • pp.275-286
    • /
    • 2010
  • Reversible watermarking which can preserve the original quality of the digital contents and protect the copyright has been studied actively. Especially, in medical, military, and art fields, the need for reversible watermarking is increasing. This paper proposes a high-capacity reversible watermarking through predicted error expansion and error estimation compensation. Watermark is embedded by expanding the difference histogram between the original value and the predicted value. Differently from previous methods calculating the difference between adjacent pixels, the presented method calculates the difference between the original value and the predicted value, and that increases the number of the histogram value, where the watermark is embedded. As a result, the high capacity is achieved. The inserted watermark is extracted by restoring the histogram between the original value and the predicted value. To prove the performance, the presented algorithm is compared with other previous methods on various test images. The result supports that the presented algorithm has a perfect reversibility, a high image quality, and a high capacity.

Improved Real-time Video Conferencing System with Memory Buffer Control Management (메모리 버퍼 제어 관리 기능을 갖춘 향상된 실시간 영상회의 시스템)

  • Yoo, Woo Jong;Kim, Sang Hyong
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.6
    • /
    • pp.255-260
    • /
    • 2017
  • The limitation of real-time video conferencing system is that the delay of network and buffering and the transmission of user information are not efficiently performed between systems, so real - time performance is not guaranteed completely. In order to overcome this problem, the study on the extension of the network infrastructure and the jitter delay is actively carried out, but the study on the buffering delay is insufficient. In this paper, we propose a frame-rate control buffer management (FRCB) scheme to solve the problem caused by buffering delay. The FRCB is used to prevent overflow and underflow of the buffer by adopting the two-stage buffer threshold of Fast-play THreshold (FTH) and Slow-play THreshold (STH). Therefore, it showed better performance than jitter buffer even under high CPU load, and showed that it is suitable for high quality real time video conferencing.

Design of a high-performance floating-point unit adopting a new divide/square root implementation (새로운 제산/제곱근기를 내장한 고성능 부동 소수점 유닛의 설계)

  • Lee, Tae-Young;Lee, Sung-Youn;Hong, In-Pyo;Lee, Yong-Surk
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.37 no.12
    • /
    • pp.79-90
    • /
    • 2000
  • In this paper, a high-performance floating point unit, which is suitable for high-performance superscalar microprocessors and supports IEEE 754 standard, is designed. Floating-point arithmetic unit (AU) supports all denormalized number processing through hardware, while eliminating the additional delay time due to the denormalized number processing by proposing the proposed gradual underflow prediction (GUP) scheme. Contrary to the existing fixed-radix implementations, floating-point divide/square root unit adopts a new architecture which determines variable length quotient bits per cycle. The new architecture is superior to the SRT implementations in terms of performance and design complexity. Moreover, sophisticated exception prediction scheme enables precise exception to be implemented with ease on various superscalar microprocessors, and removes the stall cycles in division. Designed floating-point AU and divide/square root unit are integrated with and instruction decoder, register file, memory model and multiplier to form a floating-point unit, and its function and performance is verified.

  • PDF