• Title/Summary/Keyword: Resynchronization

Search Result 38, Processing Time 0.021 seconds

Multiple Description Coding using Whitening Transform (Whitening Transform을 이용한 Multiple Description Coding)

  • 최광표;이근영
    • Proceedings of the IEEK Conference
    • /
    • 2002.06d
    • /
    • pp.41-44
    • /
    • 2002
  • In the communications systems with diversity, we are commonly faced on needing of new source coding technique, error resilient coding. The error resilient coding addresses the coding algorithm that has the robustness to unreliability of communications channel. In recent years, many error resilient coding techniques were proposed such as data partitioning, resynchronization, error detection, concealment, reference picture selection and multiple description coding (MDC). In this paper, we proposed an MDC using whitening transform. The conventional MDC using correlating transform is need additional information to decode the image. But, if an image is transformed using the whitening transform, the additional information is not necessary to transform because the coefficients of whitening transform have uni-variance statistics.

  • PDF

An Improvement of Still Image Quality Based on Error Resilient Entropy Coding for Random Error over Wireless Communications (무선 통신상 임의 에러에 대한 에러내성 엔트로피 부호화에 기반한 정지영상의 화질 개선)

  • Kim Jeong-Sig;Lee Keun-Young
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.3 s.309
    • /
    • pp.9-16
    • /
    • 2006
  • Many image and video compression algorithms work by splitting the image into blocks and producing variable-length code bits for each block data. If variable-length code data are transmitted consecutively over error-prone channel without any error protection technique, the receiving decoder cannot decode the stream properly. So the standard image and video compression algorithms insert some redundant information into the stream to provide some protection against channel errors. One of redundancies is resynchronization marker, which enables the decoder to restart the decoding process from a known state in the event of transmission errors, but its usage should be restricted not to consume bandwidth too much. The Error Resilient Entropy Code(EREC) is well blown method which can regain synchronization without any redundant information. It can work with the overall prefix codes, which many image compression methods use. This paper proposes EREREC method to improve FEREC(Fast Error-Resilient Entropy Coding). It first calculates initial searching position according to bit lengths of consecutive blocks. Second, initial offset is decided using statistical distribution of long and short blocks, and initial offset can be adjusted to insure all offset sequence values can be used. The proposed EREREC algorithm can speed up the construction of FEREC slots, and can improve the compressed image quality in the event of transmission errors. The simulation result shows that the quality of transmitted image is enhanced about $0.3{\sim}3.5dB$ compared with the existing FEREC when random channel error happens.

Efficient Local Decoding Using Bit Stream Map for High Resolution Video (비트 스트림 지도를 이용한 고해상도 영상의 효율적인 지역복호화)

  • Park Sungwon;Won Jongwoo;Lee Sunyoung;Kim Wookjoong;Kim Kyuheon;Jang Euee S
    • Journal of Broadcast Engineering
    • /
    • v.9 no.4 s.25
    • /
    • pp.391-401
    • /
    • 2004
  • In this paper, we introduce a novel coding method to efficiently enable spatial random access for high resolution video. In terms of resolution and display size, standard display devices (such as cathode-ray tubes. monitors. PDAs, and LCDs) do not sufficiently support high resolution video such as digital cinema and panoramic video. Currently, users have no choice but to view video at lower resolution as a result of down-sampling, or only a partial region of the video due to display size limitations. Our proposed method. which we call the B-map, represents the set of starting locations of the coded segments in a picture frame. This information, or B-map, is first sent to the decoder prior to the coded data stream of the frame and is then used for fast local decoding. To test our method, we compare our B-map with JPEG tiling and the JPEG Resynchronization marker. Experimental results show that the proposed coding method requires less overhead than existing methods during the same decoding time. The results show promise for future panoramic or digital cinema applications.

A SES Alarmed Link Encryption Synchronization Method Having Optimized Threshold Value for High-Speed Video Data Encryption

  • Kim, Hyeong-Rag;Lee, Hoon-Jae;Kim, Ki-Hwan;Jung, Ju-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.9
    • /
    • pp.57-64
    • /
    • 2017
  • CCSDS Standard is widely used in the international space telecommunication area. But standard recommendation of CCSDS is not restrictive, so, we can select an appropriate encryption protocol among the layer. For synchronization, encryption sync is attached in the beginning of the encrypted data. In the exceptional environmental condition, although the receiver can not decrypt the normal data, the sender have no conception of that situation. In this paper, we propose a two-stage SES alarmed link encryption synchronization method having optimized threshold value necessary to decide whether the receiver has a correct decryption or not. first, through the experiment of mutual relations between error rate and encryption synchronization detection error, we can predict worst communication environment for the selected encryption synchronization pattern. second, through the experiment for finding what number of consecutive frame synchronization error is an appropriate reference value and analysis of that experiment, we suggest an optimized threshold value for resynchronization request. lastly, through the output images we can predict the probability error that should be guaranteed by channel coder.

A Real-Time Synchronization Mechanism for Distributed Multimedia Applications (분산 멀티미디어 응용을 위한 실시간 동기화 메카니즘)

  • Park, Young-Sook;Lee, Syung-Won;Chung, Gi-Dong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.12
    • /
    • pp.3785-3793
    • /
    • 2000
  • Effective synchronization specification model which can specify temrxlral relationship among media resolving asynchronous problem due to variable network delay is necessary in a distributed multimedia system. Therefore in this paper, we propose RTPN(Real- Time Petri Net) synchronization specification model based on Petri Net for multimedia application in a distributed real time environment. The proposed RTPN model supplies a tlexible decsription of the temporal relationship among various media objects by defining primary key media and relative key media according to delay and importance among media. Firing rule is instantly executed by firing function based on QoS values which supports intra-media and inter-media syncbronization. And asynchronous control algorithm for resynchronization of presentation level is possible more effective supporting of QoS.

  • PDF

Unequal Error Protection and Error Concealment Schemes for the Transmission of H.263 Video over Mobile Channels

  • Hong, Won-Gi;Ko, Sung-Jea
    • Journal of IKEEE
    • /
    • v.2 no.2 s.3
    • /
    • pp.285-293
    • /
    • 1998
  • This paper presents unequal error protection and error concealment techniques far robust H.263 video transmission over mobile channels. The proposed error protection scheme has three major features. First, it has the capability of preventing the loss of synchronization information in H.263 video stream as much as possible that the H.263 decoder can resynchronize at the next decoding point, if errors are occurred. Secondly, it employs an unequal error protection scheme to support variable coding rates using rate compatible punctured convolutional (RCPC) codes, dividing the encoded stream into two classes. Finally, a macroblock-interleaving scheme is employed in order to minimize the corruption of consecutive macroblocks due to burst errors, which can make a proper condition for error concealment. In addition, to minimize the spatial error propagations due to the variable length codes, a fast resynchronization scheme at the group of block layer is developed for recovering subsequent error-free macroblocks following the damaged macroblock. futhermore, error concealment techniques based on both side match criterion and overlapped block motion compensation (OBMC) are employed at the source decoder so that it can not only recover the lost macroblock more accurately, but also reduce blocking artifacts. Experimental results show that the proposed scheme can be an effective error protection scheme since proper video quality can be maintained under various channel bit error rates.

  • PDF

Multiple Description Coding using Whitening Ttansform

  • Park, Kwang-Pyo;Lee, Keun-Young
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1003-1006
    • /
    • 2002
  • In the communications systems with diversity, we are commonly faced on needing of new source coding technique, error resilient coding. The error resilient coding addresses the coding algorithm that has the robustness to unreliability of communications channel. In recent years, many error resilient coding techniques were proposed such as data partitioning, resynchronization, error detection, concealment, reference picture selection and multiple description coding (MDC). Especially, the MDC using correlating transform explicitly adds correlation between two descriptions to enable the estimation of one set from the other. However, in the conventional correlating transform method, there is a critical problem that decoder must know statistics of original image. In this paper, we propose an enhanced method, the MDC using whitening transform that is not necessary additional statistical information to decode image because the DCT coefficients to apply whitening transform to an image have uni-variance statistics. Our experimental results show that the proposed method achieves a good trade-off between the coding efficiency and the reconstruction quality. In the proposed method, the PSNR of images reconstructed from two descriptions is about 0.7dB higher than conventional method at the 1.0 BPP and from only one description is about 1,8dB higher at the same rate.

  • PDF

Strength of Character for the Fusion Age "Grit": Research Trend Analysis: Focusing on Domestic, Master's and Doctoral Dissertations

  • Kwon, Jae Sung
    • International journal of advanced smart convergence
    • /
    • v.8 no.1
    • /
    • pp.166-175
    • /
    • 2019
  • Grit, a concept conceived in 2007 by Duckworth and others in the United States, is based on positive psychology that focuses on growth and development through individual strengths. Recently, "Grit", which means patience and enthusiasm for long-term goals, has emerged as a key factor of personality strength. In Korea, Joo-hwan Kim (2013) was the first to conceptualize and study the subject of Grit. However, there have been no overview studies that systematically summarize the overall trends and flow in the research of Grit so far. There have been 147 research papers on Grit published so far in Korea. The purpose of this study was to conduct trend analysis on the subject of Grit by analyzing forty-three (43) master's and doctoral dissertations, thus presenting the direction of future research on Grit through careful analysis. In the studies conducted, it was found that Grit is a very significant variable linked to self-efficacy. It is also a subjective belief that can help an individual achieve his/her educational goals, and go through failure resynchronization. In addition, Grit is very significant as a practical core indicator of how fusion talent is fostered for the fourth industrial revolution. Therefore, there is a need for more in-depth research from the viewpoints of workplace learning, experiential learning, or informal learning, as well as research into Grit characteristics.

Skew Compensation Algorithm for Time Synchronization in Wireless Sensor Networks (무선 센서 네트워크 시간 동기화에 대한 왜곡 보정 알고리즘)

  • Kumar, Shiu;Keshav, Tushar;Jo, Dong Hyeon;Kim, Hui;Lee, Jae Yeong;Jeon, Hye Ji;Jeong, Min A;Lee, Seong-Ro
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.495-497
    • /
    • 2013
  • Wireless sensor networks (WSNs) have emerged as an attractive and key research area over the last decade. Time synchronization is a vital part of infrastructure for any distributed system. In embedded sensor networks, time synchronization is an essential service for correlating data among nodes and communication scheduling. This is realized by exchanging messages that are time stamped using the local clocks on the nodes. Various time synchronization protocols have been proposed aiming to attain high synchronization accuracy, high efficiency and low communication overhead. However, it requires that the time between resynchronization intervals to be as large as possible to obtain a system which is energy efficient having low communication overhead. This paper presents a simple but effective skew compensation algorithm that measures the skew rate of the sensor nodes with respect to the reference node and calibrates itself to compensate for the difference in the frequencies of the nodes. The proposed method can be incorporated with any existing time synchronization protocol for WSNs.

Cryptographic synchronization signal generation method using maximal length sequence (최대길이 시퀀스를 이용한 암호동기신호 생성 기법)

  • Son, Young-ho;Bae, Keun-sung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.7
    • /
    • pp.1401-1410
    • /
    • 2017
  • Cryptographic synchronization which synchronizes internal state of cryptographic algorithm and ciphertext stream between an encryptor and a decryptor affects the quality of secure communication. If there happens a synchronization loss between a transmitter and a receiver in a secure communication, the output of the receiver is unintelligible until resynchronization is made. Especially, in the secure communication on a wireless channel with high BER, synchronization performance can dominate its quality. In this paper, we proposed a novel and noise robust synchronization signal generation method as well as its detection algorithm. We generated a synchronization signal in the form of a masking structure based on the maximal length sequence, and developed a detection algorithm using a correlation property of the maximal length sequence. Experimental results have demonstrated that the proposed synchronization signal outperforms the conventional concatenated type synchronization signal in a noisy environment.