• Title/Summary/Keyword: compressed mode

Search Result 90, Processing Time 0.02 seconds

A Frequency Domain DV-to-MPEG-2 Transcoding (DV에서 MPEG-2로의 주파수 영역 변환 부호화)

  • Kim, Do-Nyeon;Yun, Beom-Sik;Choe, Yun-Sik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.2
    • /
    • pp.138-148
    • /
    • 2001
  • Digital Video (DV) coding standards for digital video cassette recorder are based mainly on DCT and variable length coding. DV has low hardware complexity but high compressed bit rate of about 26 Mb/s. Thus, it is necessary to encode video with low complex video coding at the studios and then transcode compressed video into MPEG-2 for video-on-demand system. Because these coding methods exploit DCT, transcoding in the DCT domain can reduce computational complexity by excluding duplicated procedures. In transcoding DV into MPEC-2 intra coding, multiplying matrix by transformed data is used for 4:1:1-to-4:2:2 chroma format conversion and the conversion from 2-4-8 to 8-8 DCT mode, and therefore enables parallel processing. Variance of sub block for MPEG-2 rate control is computed completely in the DCT domain. These are verified through experiments. We estimate motion hierarchically using DCT coefficients for transcoding into MPEG-2 inter coding. First, we estimate motion of a macro block (MB) only with 4 DC values of 4 sub blocks and then estimate motion with 16-point MB using IDCT of 2$\times$2 low frequencies in each sub block, and finish estimation at a sub pixel as the fifth step. ME with overlapped search range shows better PSNR performance than ME without overlapping.

  • PDF

Multiple Description Coding of H.264/AVC Motion Vector under Data Partitioning Structure and Decoding Using Multiple Description Matching (데이터 분할구조에서의 H.264/AVC 움직임 벡터의 다중표현 부호화와 다중표현 정합을 이용한 복호화)

  • Yang, Jung-Youp;Jeon, Byeung-Woo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.6
    • /
    • pp.100-110
    • /
    • 2007
  • When compressed video data is transmitted over error-prone network such as wireless channel, data is likely to be lost, so the quality of reconstructed picture is severely decreased. It is specially so in case that important information such as motion vector or macroblock mode is lost. H.264/AVC standard includes DP as error resilient technique for protecting important information from error in which data is labeled according to its relative importance. But DP technique requires a network that supports different reliabilities of transmitted data. In general, the benefits of UEP is sought by sending multiple times of same packets corresponding to important information. In this paper, we propose MDC technique based on data partitioning technique. The proposed method encodes motion vector of H.264/AVC standard into multiple parts using MDC and transmits each part as independent packet. Even if partial packet is lost, the proposed scheme can decode the compressed bitstream by using estimated motion vector with partial packets correctly transmitted, so that achieving improved performance of error concealment with minimal effect of channel error. Also in decoding process, the proposed multiple description matching increases the accuracy of estimated lost motion vector and quality of reconstructed video.

Error Concealment Method for MPEG-4 Video in Wireless Environment (무선환경에서 MPEG-4 영상의 오류은닉 방법)

  • Park, Sun-Young;Song, Joon-Ho;Moon, Joo-Hee
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.6
    • /
    • pp.641-651
    • /
    • 2002
  • Recently, many advanced video application services over the mobile wireless networks have required a transcoder which can efficiently reduce the size of compressed video bitstreams. The transcoder can be worked in either the spatial domain or the DCT domain. In this paper, we propose a new fast hybrid-type transcoder which can efficiently reduce the frame size with keeping the visual quality. The proposed scheme consists of two major processes: a transform domain process and a spatial domain process. We also propose a scheme for coding mode selection and motion vector refinement. Experimental results show that our approach can reduce the computational complexity more than any other conventional spatial-domain transcoder with keeping the visual quality.

A New Fast Transcoder for Resizing Coded Video Sequences (부호화된 영상의 크기를 변환하는 새로운 고속 트랜스코더)

  • Park, Il-Woo;Cho, Yong-Gook;Myung, Jin-Su;Chae, Byung-Jo;Oh, Seoung-Jun;Yang, Chang-Mo;Cho, We-Duke
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.6
    • /
    • pp.652-663
    • /
    • 2002
  • Recently, many advanced video application services over the mobile wireless networks have required a transcoder which can efficiently reduce the size of compressed video bitstreams. The transcoder can be worked in either the spatial domain or the DCT domain. In this paper, we propose a new fast hybrid-type transcoder which can efficiently reduce the frame size with keeping the visual quality. The proposed scheme consists of two major processes: a transform domain process and a spatial domain process. We also propose a scheme for coding mode selection and motion vector refinement. Experimental results show that our approach can reduce the computational complexity more than any other conventional spatial-domain transcoder with keeping the visual quality.

Improved Error Detection Scheme Using Data Hiding in Motion Vector for H.264/AVC (움직임 벡터의 정보 숨김을 이용한 H.264/AVC의 향상된 오류 검출 방법)

  • Ko, Man-Geun;Suh, Jae-Won
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.6
    • /
    • pp.20-29
    • /
    • 2013
  • The compression of video data is intended for real-time transmission of band-limited channels. Compressed video bit-streams are very sensitive to transmission error. If we lose packets or receive them with errors during transmission, not only the current frame will be corrupted, but also the error will propagate to succeeding frames due to the spatio-temporal predictive coding structure of sequences. Error detection and concealment is a good approach to reduce the bad influence on the reconstructed visual quality. To increase concealment efficiency, we need to get some more accurate error detection algorithm. In this paper, We hide specific data into the motion vector difference of each macro-block, which is obtained from the procedure of inter prediction mode in H.264/AVC. Then, the location of errors can be detected easily by checking transmitted specific data in decoder. We verified that the proposed algorithm generates good performances in PSNR and subjective visual quality through the computer simulation by H.324M mobile simulation tool.

Adaptive Frequent Pattern Algorithm using CAWFP-Tree based on RHadoop Platform (RHadoop 플랫폼기반 CAWFP-Tree를 이용한 적응 빈발 패턴 알고리즘)

  • Park, In-Kyu
    • Journal of Digital Convergence
    • /
    • v.15 no.6
    • /
    • pp.229-236
    • /
    • 2017
  • An efficient frequent pattern algorithm is essential for mining association rules as well as many other mining tasks for convergence with its application spread over a very broad spectrum. Models for mining pattern have been proposed using a FP-tree for storing compressed information about frequent patterns. In this paper, we propose a centroid frequent pattern growth algorithm which we called "CAWFP-Growth" that enhances he FP-Growth algorithm by making the center of weights and frequencies for the itemsets. Because the conventional constraint of maximum weighted support is not necessary to maintain the downward closure property, it is more likely to reduce the search time and the information loss of the frequent patterns. The experimental results show that the proposed algorithm achieves better performance than other algorithms without scarifying the accuracy and increasing the processing time via the centroid of the items. The MapReduce framework model is provided to handle large amounts of data via a pseudo-distributed computing environment. In addition, the modeling of the proposed algorithm is required in the fully distributed mode.

Rotordynamic Performance Analysis and Operation Test of a Power Turbine for the Super critical CO2 Cycle Application (초임계 CO2 발전용 파워 터빈의 회전체 동역학 해석 및 구동 시험)

  • Lee, Donghyun;Kim, Byungok;Sun, Kyungho;Lim, Hyungsoo
    • Tribology and Lubricants
    • /
    • v.33 no.1
    • /
    • pp.9-14
    • /
    • 2017
  • This paper presents a rotordynamic analysis and the operation of a power turbine applied to a 250 kW super-critical $CO_2$ cycle. The power turbine consists of a turbine wheel and a shaft supported by two fluid film bearings. We use a tilting pad bearing for the power turbine owing to the high speed operation, and employ copper backing pads to improve the thermal management of the bearing. We conduct a rotordynamic analysis based on the design parameters of the power turbine. The dynamic coefficients of the tilting pad bearings were calculated based on the iso-thermal lubrication theory and turbine wheel was modeled as equivalent inertia. The predicted Cambell diagram showed that there are two critical speeds, namely the conical and bending critical speeds under the rated speed. However, the unbalance response prediction showed that vibration levels are controlled within 10 mm for all speed ranges owing to the high damping ratio of the modes. Additionally, the predicted logarithmic decrement indicates that there is no unstable mode. The power turbine uses compressed air at a temperature of $250^{\circ}C$ in its operation, and we monitor the shaft vibration and temperature of the lubricant during the test. In the steady state, we record a temperature rise of $40^{\circ}C$ between the inlet and outlet lubricant and the measured shaft vibration shows good agreement with the prediction.

Dependent Quantization for Scalable Video Coding

  • Pranantha, Danu;Kim, Mun-Churl;Hahm, Sang-Jin;Lee, Keun-Sik;Park, Keun-Soo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2006.11a
    • /
    • pp.127-132
    • /
    • 2006
  • Quantization in video coding plays an important role in controlling the bit-rate of compressed video bit-streams. It has been used as an important control means to adjust the amount of bit-streams to at]owed bandwidth of delivery networks and storage. Due to the dependent nature of video coding, dependent quantization has been proposed and applied for MPEG-2 video coding to better maintain the quality of reconstructed frame for given constraints of target bit-rate. Since Scalable Video Coding (SVC) being currently standardized exhibits highly dependent coding nature not only between frames but also lower and higher scalability layers where the dependent quantization can be effectively applied, in this paper, we propose a dependent quantization scheme for SVC and compare its performance in visual qualities and bit-rates with the current JSVM reference software for SVC. The proposed technique exploits the frame dependences within each GOP of SVC scalability layers to formulate dependent quantization. We utilize Lagrange optimization, which is widely accepted in R-D (rate-distortion) based optimization, and construct trellis graph to find the optimal cost path in the trellis by minimizing the R-D cost. The optimal cost path in the trellis graph is the optimal set of quantization parameters (QP) for frames within a GOP. In order to reduce the complexity, we employ pruning procedure using monotonicity property in the trellis optimization and cut the frame dependency into one GOP to decrease dependency depth. The optimal Lagrange multiplier that is used for SVC is equal to H.264/AVC which is also used in the mode prediction of the JSVM reference software. The experimental result shows that the dependent quantization outperforms the current JSVM reference software encoder which actually takes a linear increasing QP in temporal scalability layers. The superiority of the dependent quantization is achieved up to 1.25 dB increment in PSNR values and 20% bits saving for the enhancement layer of SVC.

  • PDF

The Study of Antibiotic Resistance in Bacterial Biofilms (박테리아 생체막에 대한 항생제 내성 연구)

  • Kim Jin Wook;Joo Chi Un;Park Jin Yong;Lee Song Ae;Kim In Hae;Lee Jae Hwa
    • Environmental Mutagens and Carcinogens
    • /
    • v.25 no.4
    • /
    • pp.157-160
    • /
    • 2005
  • Antibiotic resistance of bacteria in the biofilm mode of growth contributes to the chronicity of infection and disease. The penetration of antibiotic, through biofilm developed in an itt vitro model system was investigated. Antibiotic resistant bacteria (E. coli) were obtained from Culture Collection of Antibiotic Resistant Microbes. Ca-alginate bead used as simulated biofilm and a cell entrapment test using compressed air were experiment for the improvement cell viability. Antibiotic susceptibilities though biofilms was measured by assaying the concentration of antibiotic that diffused through the biofilm to minimal inhibition concentration (MIC). Survival of immobilized cells were reduced as compared to free cells. In case of antibiotic susceptible E. coli reduced continuously, but antibiotic resistant E. coli kept up survival rate constantly. Survival was showed after exposed to the antibiotics that the more treated antibiotic resistant E. coli and low concentration of antibiotics) the more survived.

  • PDF

A Buffer Management Algorithm based on the GOP Pattern and the Importance of each Frame to Provide QoS for Streaming Services in WLAN (WLAN에서 스트리밍 서비스이 QoS를 제공하기 위한 GOP 패턴 및 프레임 중요도에 따른 버퍼 관리 기술)

  • Kim, Jae-Hyun;Lee, Hyun-Jin;Lee, Kyu-Hwan;Roh, Byeong-Hee
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.372-375
    • /
    • 2008
  • IEEE 802.11e standardized the EDCA mechanism to support the priority based QoS. And the virtual collision handler schedules the transmission time of each MAC frame using the internal back-off window according to the access category(AC). This can provides the differentiated QoS to real-time services at the medium traffic load condition. However, the transmission delay of MAC frame for real-time services may be increased as the traffic load of best effort service increases. It becomes more critical when the real-time service uses a compressed mode video codec such as moving picture experts group(MPEG) 4 codec. That is because each frame has the different importance. That is, the I-frame has more information as compared with the P- and the B-frame. In this paper, we proposed a buffer management algorithm based on the frame importance and the delay bound. The proposed algorithm is consisted of the traffic regulator based on the dual token bucket algorithm and the active queue management algorithm. The traffic regulator reduces the transmission rate of lower AC until that the virtual collision handler can transmit an I-frame. And the active queue management discards frame based on the importance of each frame and the delay bound of head of line(HoL) frame when the channel resource is insufficient.

  • PDF