• 한국통신학회논문지
• /
• 제22권6호
• /
• pp.1279-1288
• /
• 1997

In this paper, we propose a fast fractal coding method based on LMSE analysis and subblock feature. In the proposed method, scaling paarameter is calculated and whether search for each domain block should be done or not is determined based on the LMSE analysis of fractal approximation, and isometry parameter is chosen based on subblock feature. To investigate the efficiency of the proposed method, we compared it with Jacquin's method on image quality and encoding time. Experimental results show the proposed method yields nearly the same performance as that of Jacquin method in PSNR, and its encoding time is reduced by about 1/7 times.

• 제어로봇시스템학회논문지
• /
• 제16권10호
• /
• pp.957-962
• /
• 2010

If we want to recognize the human's emotion via the facial image, first of all, we need to extract the emotional features from the facial image by using a feature extraction algorithm. And we need to classify the emotional status by using pattern classification method. The AAM (Active Appearance Model) is a well-known method that can represent a non-rigid object, such as face, facial expression. The Bayesian Network is a probability based classifier that can represent the probabilistic relationships between a set of facial features. In this paper, our approach to facial feature extraction lies in the proposed feature extraction method based on combining AAM with FACS (Facial Action Coding System) for automatically modeling and extracting the facial emotional features. To recognize the facial emotion, we use the DBNs (Dynamic Bayesian Networks) for modeling and understanding the temporal phases of facial expressions in image sequences. The result of emotion recognition can be used to rehabilitate based on biofeedback for emotional disabled.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4587-4605
• /
• 2019

High Efficiency Video Coding (HEVC) suffers from high computational complexity due to its quad-tree structure in motion estimation (ME). This paper exposes an adaptive search range decision algorithm for accelerating HEVC integer-pel ME on GPU which estimates the optimal search range (SR) using a MAP (Maximum A Posteriori) estimator. There are three main contributions; First, we define the motion feature as the standard deviation of motion vector difference values in a CTU. Second, a MAP estimator is proposed, which theoretically estimates the motion feature of the current CTU using the motion feature of a temporally adjacent CTU and its SR without any data dependency. Thus, the SR for the current CTU is parallelly determined. Finally, the values of the prior distribution and the likelihood for each discretized motion feature are computed in advance and stored at a look-up table to further save the computational complexity. Experimental results show in conventional HEVC test sequences that the proposed algorithm can achieves high average time reductions without any subjective quality loss as well as with little BD-bitrate increase.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1510-1532
• /
• 2017

In smart grid, privacy implications to individuals and their families are an important issue because of the fine-grained usage data collection. Wireless communications are utilized by many utility companies to obtain information. Network coding is exploited in smart grids, to enhance network performance in terms of throughput, delay, robustness, and energy consumption. However, random linear network coding introduces a new challenge for privacy preserving due to the encoding of data and updating of coefficients in forwarder nodes. We propose a distributed privacy preserving scheme for random linear network coding in smart grid that considers the converged flows character of the smart grid and exploits a homomorphic encryption function to decrease the complexities in the forwarder node. It offers a data confidentiality privacy preserving feature, which can efficiently thwart traffic analysis. The data of the packet is encrypted and the tag of the packet is encrypted by a homomorphic encryption function. The forwarder node random linearly codes the encrypted data and directly processes the cryptotext tags based on the homomorphism feature. Extensive security analysis and performance evaluations demonstrate the validity and efficiency of the proposed scheme.

• ETRI Journal
• /
• 제27권6호
• /
• pp.713-724
• /
• 2005

This paper focuses on the problem of key-frames coding and proposes a new promising approach based on the use of fractals. The summary, made of a set of key-frames selected from a full-length video sequence, is coded by using a 3D fractal scheme. This allows the video presentation tool to expand the video sequence in a "natural" way by using the property of the fractals to reproduce the signal at several resolutions. This feature represents an important novelty of this work with respect to the alternative approaches, which mainly focus on the compression ratio without taking into account the presentation aspect of the video summary. In devising the coding scheme, we have taken care of the computational complexity inherent in fractal coding. Accordingly, the key-frames are first wavelet transformed, and the fractal coding is then applied to each subband to reduce the search range. Experimental results show the effectiveness of the proposed approach.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2212-2215
• /
• 2003

In this paper, we proposed speech feature vector extractor for embedded system using TMS 320C31 DSP chip. For this extractor, we used algorithm using cepstrum coefficient based on LPC(Linear Predictive Coding) that is reliable algorithm to be is widely used for speech recognition. This system extract the speech feature vector in real time, so is used the mobile system, such as cellular phones, PDA, electronic note, and so on, implemented speech recognition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.242-259
• /
• 2015

Three-dimensional video coding is one of the main challenges restricting the widespread applications of 3D video and free viewpoint video. In this paper, a novel fractal coding algorithm with motion-vector-field-based motion estimation for depth map sequence is proposed. We firstly add pre-search restriction to rule the improper domain blocks out of the matching search process so that the number of blocks involved in the search process can be restricted to a smaller size. Some improvements for motion estimation including initial search point prediction, threshold transition condition and early termination condition are made based on the feature of fractal coding. The motion-vector-field-based adaptive hexagon search algorithm on the basis of center-biased distribution characteristics of depth motion vector is proposed to accelerate the search. Experimental results show that the proposed algorithm can reach optimum levels of quality and save the coding time. The PSNR of synthesized view is increased by 0.56 dB with 36.97% bit rate decrease on average compared with H.264 Full Search. And the depth encoding time is saved by up to 66.47%. Moreover, the proposed fractal depth map sequence codec outperforms the recent alternative codecs by improving the H.264/AVC, especially in much bitrate saving and encoding time reduction.

• 방송공학회논문지
• /
• 제25권3호
• /
• pp.325-337
• /
• 2020

VVC(Versatile Video Coding)는 ISO/IEC/ITU-T의 JVET(Joint Video Experts Team)에서 표준화 중인 새로운 비디오 부호화 표준으로 스크린 콘텐츠 부호화 툴을 포함한 다양한 기술을 채택하고 있다. 스크린 콘텐츠는 문자 영역과 같이 사선 방향 에지가 자주 발생하는 특징을 가지며, 이런 특징을 갖는 영상에 삼각형 형태의 분할 부호화를 적용하면 압축 효율이 증가할 수 있다. 본 논문에서는 스크린 콘텐츠를 위한 VVC 기반 화면내 삼각형 분할 예측 방법을 제안한다. 기존 VVC의 화면간 예측 부호화에서 삼각형 분할 예측을 지원하는 Triangular Prediction Mode 방법과 유사하게, 제안 방법은 화면내 예측 부호화에서 수직과 수평 방향 예측 모드와 주변 복원 참조 라인을 이용하여 두 개의 사각형 예측 블록을 생성하고 삼각형 모양의 마스크로 두 예측 블록을 가중합하여 최종 예측 신호를 만든다. 제안 방법의 실험 결과는 All Intra 스크린 콘텐츠 영상 실험에서 YUV 각각 평균 1.86%, 1.49%, 1.55% 부호화 성능향상을 보이고, 자연 영상 실험 조건에서는 부호화 효율에 미미한 손실을 보였다. 결론적으로, 화면내 예측 부호화 모드에 제안 방법을 적용하여 압축 성능을 향상할 수 있었다.

• 방송공학회논문지
• /
• 제24권6호
• /
• pp.1134-1142
• /
• 2019

영상의 이중 압축 검출은 영상의 위조여부를 판단하는 한가지 효과적인 방식이다. 이러한 이중 압축 검출 기술을 바탕으로 HEVC로 압축된 영상의 진위 여부를 판단하는 다양한 종류의 기존 기술들이 소개되었지만, 동일한 압축 환경에서 이중 압축된 영상의 진위 여부를 검출하는 것은 상당히 어려운 일로 여겨지고 있다. 본 논문에서는 동일 압축 환경에서 HEVC의 이중압축 여부를 판단하는 기술로서, Intra모드로 압축된 영상의 분할 정보를 이용하여 판단하는 방식을 제안한다. Coding Unit (CU)와 Transform Unit (TU)의 분할 정보로부터 통계적 특징과 딥러닝 네트워크 기반의 특징을 우선 추출하고, softmax단에서 추출된 특징들을 통합하여 이중 압축 여부를 판단하는 기술을 제안한다. 실험결과를 통해서 제안하고 있는 기술이 WVGA 영상과 HD 영상에서 각각 87.5%와 84.1%의 정확도를 가지며 효과적으로 검출한다는 것을 보여준다,

• 디지털산업정보학회논문지
• /
• 제12권4호
• /
• pp.33-40
• /
• 2016

Previous works for detecting arrhythmia have mostly used nonlinear method to increase classification accuracy. Most methods require accurate detection of ECG signal, higher computational cost and larger processing time. But it is difficult to analyze the ECG signal because of various noise types. Also in the healthcare system based IOT that must continuously monitor people's situation, it is necessary to process ECG signal in realtime. Therefore it is necessary to design efficient algorithm that classifies different arrhythmia in realtime and decreases computational cost by extrating minimal feature. In this paper, we propose R wave detection considering complexity and arrhythmia classification based on binary coding. For this purpose, we detected R wave through SOM and then RR interval from noise-free ECG signal through the preprocessing method. Also, we classified arrhythmia in realtime by converting threshold variability of feature to binary code. R wave detection and PVC, PAC, Normal classification is evaluated by using 39 record of MIT-BIH arrhythmia database. The achieved scores indicate the average of 99.41%, 97.18%, 94.14%, 99.83% in R wave, PVC, PAC, Normal.