• Title/Summary/Keyword: coding parameters

Search Result 276, Processing Time 0.028 seconds

Deep Learning based BER Prediction Model in Underwater IoT Networks (딥러닝 기반의 수중 IoT 네트워크 BER 예측 모델)

  • Byun, JungHun;Park, Jin Hoon;Jo, Ohyun
    • Journal of Convergence for Information Technology
    • /
    • v.10 no.6
    • /
    • pp.41-48
    • /
    • 2020
  • The sensor nodes in underwater IoT networks have practical limitations in power supply. Thus, the reduction of power consumption is one of the most important issues in underwater environments. In this regard, AMC(Adaptive Modulation and Coding) techniques are used by using the relation between SNR and BER. However, according to our hands-on experience, we observed that the relation between SNR and BER is not that tight in underwater environments. Therefore, we propose a deep learning based MLP classification model to reflect multiple underwater channel parameters at the same time. It correctly predicts BER with a high accuracy of 85.2%. The proposed model can choose the best parameters to have the highest throughput. Simulation results show that the throughput can be enhanced by 4.4 times higher than the conventionally measured results.

High Compression Image Coding with BTC Parameters (BTC 파라메타를 이용한 고압축 영상부호화)

  • Shim, Young-Serk;Lee, Hark-Jun
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.2
    • /
    • pp.140-146
    • /
    • 1989
  • An efficient quantization and encoding of BTC (Block Truncation Coding) parameters {($Y_{\alpha},\;Y_{\beta}),\;P_{{\beta}/{\beta}}$} are investigated, In our algorithm 4${\times}$4 blocks are classified into flat or edge block. While edge block is represented by two approximation level $Y_{\alpha},\;Y_{\beta}$ with label plane $P_{{\beta}/{\beta}}$, flat block is represented by single approximation level Y. The approximation levels Y, $Y_{\alpha}$ and $Y_{\beta}$ are encoded by predictive quatization specially designed, and the label plane $P_{{\beta}/{\beta}}$ is tried to be encoded using stored 32 reference plantes. The performance of the proposed scheme has appeared comparable to much more complex transform coding in terms of SNR, although it requires more study on the representation of small slope in background.

  • PDF

Estimation and Watermarking of Motion Parameters in Model Based Image Coding

  • Park, Min-Chul
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1264-1267
    • /
    • 2002
  • In order to achieve an advanced human-computer interface system, it is necessary to analyze and synthesize facial motions just as they are in an interactive way, and to protect them from unwanted use and/or illegal use for their privacy, various uses in applications and the costs of obtaining motion parameters. To estimate facial motion, a method of using skin color distribution, luminance, and geometrical information of a face is employed. Digital watermarks are embedded into facial motion parameters and then these parameters are scrambled so that it cannot be understood. Experimental results show high accuracy and efficiency of the proposed estimation method and the usefulness of the proposed watermarking method.

  • PDF

ON IMPROVING THE PERFORMANCE OF CODED SPECTRAL PARAMETERS FOR SPEECH RECOGNITION

  • Choi, Seung-Ho;Kim, Hong-Kook;Lee, Hwang-Soo
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1998.08a
    • /
    • pp.250-253
    • /
    • 1998
  • In digital communicatioin networks, speech recognition systems conventionally reconstruct speech followed by extracting feature [parameters. In this paper, we consider a useful approach by incorporating speech coding parameters into the speech recognizer. Most speech coders employed in the networks represent line spectral pairs as spectral parameters. In order to improve the recognition performance of the LSP-based speech recognizer, we introduce two different ways: one is to devise weighed distance measures of LSPs and the other is to transform LSPs into a new feature set, named a pseudo-cepstrum. Experiments on speaker-independent connected-digit recognition showed that the weighted distance measures significantly improved the recognition accuracy than the unweighted one of LSPs. Especially we could obtain more improved performance by using PCEP. Compared to the conventional methods employing mel-frequency cepstral coefficients, the proposed methods achieved higher performance in recognition accuracies.

  • PDF

Efficient Algorithms for Motion Parameter Estimation in Object-Oriented Analysis-Synthesis Coding (객체지향 분석-함성 부호화를 위한 효율적 움직임 파라미터 추정 알고리듬)

  • Lee Chang Bum;Park Rae-Hong
    • The KIPS Transactions:PartB
    • /
    • v.11B no.6
    • /
    • pp.653-660
    • /
    • 2004
  • Object-oriented analysis-synthesis coding (OOASC) subdivides each image of a sequence into a number of moving objects and estimates and compensates the motion of each object. It employs a motion parameter technique for estimating motion information of each object. The motion parameter technique employing gradient operators requires a high computational load. The main objective of this paper is to present efficient motion parameter estimation techniques using the hierarchical structure in object-oriented analysis-synthesis coding. In order to achieve this goal, this paper proposes two algorithms : hybrid motion parameter estimation method (HMPEM) and adaptive motion parameter estimation method (AMPEM) using the hierarchical structure. HMPEM uses the proposed hierarchical structure, in which six or eight motion parameters are estimated by a parameter verification process in a low-resolution image, whose size is equal to one fourth of that of an original image. AMPEM uses the same hierarchical structure with the motion detection criterion that measures the amount of motion based on the temporal co-occurrence matrices for adaptive estimation of the motion parameters. This method is fast and easily implemented using parallel processing techniques. Theoretical analysis and computer simulation show that the peak signal to noise ratio (PSNR) of the image reconstructed by the proposed method lies between those of images reconstructed by the conventional 6- and 8-parameter estimation methods with a greatly reduced computational load by a factor of about four.

Distributed Multi-view Video Coding Based on Illumination Compensation (조명보상 기반 분산 다시점 비디오 코딩)

  • Park, Sea-Nae;Sim, Dong-Gyu;Jeon, Byeung-Woo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.6
    • /
    • pp.17-26
    • /
    • 2008
  • In this paper, we propose a distributed multi-view video coding method employing illumination compensation for multi-view video coding. Distributed multi-view video coding (DMVC) methods can be classified either into a temporal or an inter-view interpolation-based ones according to ways to generate side information. DMVC with inter-view interpolation utilizes characteristics of multi-view videos to improve coding efficiency of the DMVC by using side information based on the inter-view interpolation. However, mismatch of camera parameters and illumination change between two views could bring about inaccurate side information generation. In this paper, a modified distributed multi-view coding method is presented by applying illumination compensation in generating the side information. In the proposed encoder system, in addition to parity bits for AC coefficients, DC coefficients are transmitted as well to the decoder side. By doing so, the decoder can generate more accurate side information by compensating illumination changes with the transmitted DC coefficients. We found that the proposed algorithm is $0.1{\sim}0.2\;dB$ better than the conventional algorithm that does not make use of illumination compensation.

Application of couple sparse coding ensemble on structural damage detection

  • Fallahian, Milad;Khoshnoudian, Faramarz;Talaei, Saeid
    • Smart Structures and Systems
    • /
    • v.21 no.1
    • /
    • pp.1-14
    • /
    • 2018
  • A method is proposed to detect structural damages in the presence of damping using noisy data. This method uses Frequency Response Function (FRF) and Mode-Shapes as the input parameters for a system of Couple Sparse Coding (CSC) to study the healthy state of the structure. To obtain appropriate patterns of FRF for CSC training, Principal Component Analysis (PCA) technique is adopted to reduce the full-size FRF to overcome over-fitting and convergence problems in machine-learning training. To verify the proposed method, a numerical two-story frame structure is employed. A system of individual CSCs is trained with FRFs and mode-shapes, and then termed ensemble to detect the health condition of the structure. The results demonstrate that the proposed method is accurate in damage identification even in presence of up to 20% noisy data and 5% unconsidered damping ratio. Furthermore, it can be concluded that CSC ensemble is highly efficient to detect the location and the severity of damages in comparison to the individual CSC trained only with FRF data.

Region-of-Interest Coding using Sub-Picture Slice Structure (내부 영상 슬라이스 구조를 이용한 관심 영역 부호화)

  • 김우식
    • Journal of Broadcast Engineering
    • /
    • v.7 no.4
    • /
    • pp.335-344
    • /
    • 2002
  • A sub-picture slice structure is proposed which can perform the region-of-interest coding effectively, where the subjective quality can be improved by coding the region-of-interest in higher quality than the background region. In addition, the bit allocation mechanism is Proposed where the interval between quantization parameters of the foreground and background region is fixed. And the method to reduce the boundary effect between the foreground and background region is proposed. The foreground region is better protected to the network channel error than the background region. which results in the overall subjective quality improvement in the error prone environments.

An Improved Motion Compensated Temporal Filtering for Efficient Scalable Video Coding (효율적인 스케일러블 비디오 부호화를 위한 향상된 움직임 보상 시간적 필터링 방법)

  • Jeon, Ki-Cheol;Kim, Jong-Ho;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5C
    • /
    • pp.520-529
    • /
    • 2007
  • In this paper, we study the characteristics of parameters which are related to performance of MCTF which is a key technique for wavelet-based scalable video coding, and propose an improved MCTF method. The proposed MCTF method adopts the motion estimation of which motion vector field is distributed more uniformly using variable block sizes. By using the proposed method, the decomposition performance of temporal filter is improved, and the energy in high-frequency frames is reduced. It can help the entropy coder to generate lower bitrate. From simulation results, we verify the decomposed energy on high-frequency frame using the proposed method is reduced by 25.86% at the most in terms of variance of the high-frequency frame.

SonicStream: A Network Coding Based Live P2P Media Streaming System With Rich User Experiences

  • Chen, Xiaogang;Ren, Ning;Zhang, Xiaochen;Wang, Xin;Zhao, Jin
    • Journal of Communications and Networks
    • /
    • v.10 no.4
    • /
    • pp.430-436
    • /
    • 2008
  • Recent studies have convinced that network coding can improve the performance of live media streaming in terms of startup delay, resilience to peer dynamics, as well as reduced bandwidth cost on dedicated streaming servers. However, there still exist some strategy drawbacks and neglected problems which need to be further researched. In addition to the commonly used evaluation parameters of the network and user experiences mentioned above, we focus on additional key factors, playback lag and switch lag, which have not been fully explored in previous work. In this paper, we present SonicStream, a novel and fully implemented live peer to peer (P2P) media streaming system with consideration of rich user experiences, including startup delay, playback continuity, playback lag, switch lag, etc. In pursuit of a further enhanced user experience, we revise traditional peer selection/data scheduling methods. Through a series of experimental evaluations and a cautious comparison with the latest similar work $R^2$, the superior performance of SonicStream has been preliminarily verified.