• Journal of Communications and Networks
• /
• 제14권1호
• /
• pp.21-26
• /
• 2012

As electrocardiogram (ECG) signals are generally sampled with a frequency of over 200 Hz, a method to compress diagnostic information without losing data is required to store and transmit them efficiently on a wireless personal area network (WPAN). In this paper, an ECG signal compression method for communications onWPAN, which uses feature points based on curvature, is proposed. The feature points of P, Q, R, S, and T waves, which are critical components of the ECG signal, have large curvature values compared to other vertexes. Thus, these vertexes were extracted with the proposed method, which uses local extrema of curvatures. Furthermore, in order to minimize reconstruction errors of the ECG signal, extra vertexes were added according to the iterative vertex selectionmethod. Through the experimental results on the ECG signals from Massachusetts Institute of Technology-Beth Israel hospital arrhythmia database, it was concluded that the vertexes selected by the proposed method preserved all feature points of the ECG signals. In addition, it was more efficient than the amplitude zone time epoch coding method.

• 한국통신학회논문지
• /
• 제30권4C호
• /
• pp.253-261
• /
• 2005

본 논문에서는 MPEG 3DAV Coding에서 진행 중인 EE2 및 EE3의 다시점 영상 압축에 효율적으로 적용할 수 있는 블록기반 시차추정 기법을 제안한다. 제안된 기법은 영상의 특성을 이용하여 블록크기를 가변적으로 구성하는 적응적 시차 추정을 적용하여 영상의 화질을 개선하였다. 추정하고자하는 해당 블록의 주변 특성을 고려하여 탐색 영역을 가변적으로 설정함으로써 계산량을 줄이고 좌우방향으로 시차가 더 크다는 스테레오 영상의 특성을 이용하여 2진과 4진 트리 분해를 혼용함으르써 기존의 4진 트리만 이용한 정보 부호화 방식보다 부가정보량을 감소시킬 수 있다. 모의실험 결과 기존의 전 탐색 영역블록 정합기법(FBMA)에 비해 최대 $68\%$정도 계산량이 감소하고, PSNR면에서 기존 기법들보다 1dB 가량 개선되는 것을 알 수 있다.

• Journal of information and communication convergence engineering
• /
• 제13권3호
• /
• pp.205-214
• /
• 2015

In this paper, we propose a new approach to learning a discriminative model for figure/ground segmentation by incorporating the bag-of-features and conditional random field (CRF) techniques. We advocate the use of image patches instead of superpixels as the basic processing unit. The latter has a homogeneous appearance and adheres to object boundaries, while an image patch often contains more discriminative information (e.g., local image structure) to distinguish its categories. We use pixel-level sparse coding to represent an image patch. With the proposed feature representation, the unary classifier achieves a considerable binary segmentation performance. Further, we integrate unary and pairwise potentials into the CRF model to refine the segmentation results. The pairwise potentials include color and texture potentials with neighborhood interactions, and an edge potential. High segmentation accuracy is demonstrated on three benchmark datasets: the Weizmann horse dataset, the VOC2006 cow dataset, and the MSRC multiclass dataset. Extensive experiments show that the proposed approach performs favorably against the state-of-the-art approaches.

• Journal of information and communication convergence engineering
• /
• 제7권2호
• /
• pp.193-198
• /
• 2009

The H.264/ AVC video coding standard supports the intra prediction with various block sizes for luma component and a 8x8 block size for chroma components. This new feature of H.264/AVC offers a considerably higher improvement in coding efficiency compared to previous compression standards. In order to achieve this, H.264/AVC uses the Rate-distortion optimization (RDO) technique to select the best intra prediction mode for each block size, and it brings about the drastic increase of the computation complexity of H.264 encoder. In this paper, a fast block size decision algorithm is proposed to reduce the computation complexity of the intra prediction in H.264/AVC. The proposed algorithm computes the smoothness based on AC and DC coefficient energy for macroblocks and compares with the nonparametric criteria which is determined by considering information on neighbor blocks already reconstructed, so that deciding the best probable block size for the intra prediction. Also, the use of non-parametric criteria makes the performance of intra-coding not be dependent on types of video sequences. The experimental results show that the proposed algorithm is able to reduce up to 30% of the whole encoding time with a negligible loss in PSNR and bitrates and provides the stable performance regardless types of video sequences.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.142-147
• /
• 2009

The recent H.264/AVC video coding standard provides a higher coding efficiency than previous standards. H.264/AVC achieves a bit rate saving of more than 50 % with many new technologies, but it is computationally complex. Most of fast mode decision algorithms have focused on Baseline profile of H.264/AVC. In this paper, a fast block mode decision scheme for P- slices in High profile is proposed to reduce the computational complexity for H.264/AVC because the High profile is useful for broadcasting and storage applications. To reduce the block mode decision complexity in P- pictures of High profile, we use the SAD value after $16{\times}16$ block motion estimation. This SAD value is used for the classification feature to divide all block modes into some proper candidate block modes. The proposed algorithm shows average speed-up factors of 47.42 ${\sim}$ 67.04% for IPPP sequences.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.763-774
• /
• 2015

Hand posture recognition has been a wide region of applications in Human Computer Interaction and Computer Vision for many years. The problem arises mainly due to the high dexterity of hand and self-occlusions created in the limited view of the camera or illumination variations. To remedy these problems, a hand posture recognition method using 3-D point cloud is proposed to explicitly utilize 3-D information from depth maps in this paper. Firstly, hand region is segmented by a set of depth threshold. Next, hand image normalization will be performed to ensure that the extracted feature descriptors are scale and rotation invariant. By robustly coding and pooling 3-D facets, the proposed descriptor can effectively represent the various hand postures. After that, SVM with Gaussian kernel function is used to address the issue of posture recognition. Experimental results based on posture dataset captured by Kinect sensor (from 1 to 10) demonstrate the effectiveness of the proposed approach and the average recognition rate of our method is over 96%.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.873-876
• /
• 2000

The information-theoretic approach to face recognition is based on the compact coding where face images are decomposed into a small set of basis images. Most popular method for the compact coding may be the principal component analysis (PCA) which eigenface methods are based on. PCA based methods exploit only second-order statistical structure of the data, so higher- order statistical dependencies among pixels are not considered. Independent component analysis (ICA) is a signal processing technique whose goal is to express a set of random variables as linear combinations of statistically independent component variables. ICA exploits high-order statistical structure of the data that contains important information. In this paper we employ the ICA for the efficient feature extraction from face images and show that ICA outperforms the PCA in the task of face recognition. Experimental results using a simple nearest classifier and multi layer perceptron (MLP) are presented to illustrate the performance of the proposed method.

• Journal of Biosystems Engineering
• /
• 제17권2호
• /
• pp.143-155
• /
• 1992

The aim of this study is to develop a general purpose algorithm for analyzing geometrical features of agricultural products and microscopic particles regardless of their numbers, shapes and positions with a computer vision system. Primarily, boundary informations of an image were obtained by Scan Line Coding and Scan & Chain Coding methods and then with these informations, geometrical features such as area, perimeter, lengths, widths, centroid, major and minor axes, equivalent circle diameter, number of individual objects, etc, were analyzed. The algorithms developed in this study was evaluated with test images consisting of a number of randomly generated ellipsoids or a few synthesized diagrams having different features. The result was successful in terms of accuracy.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2022년도 추계학술대회
• /
• pp.10-13
• /
• 2022

최근 인공지능 기술을 바탕으로 지능형 분석을 수행하는 기계를 위한 비디오 부호화 기술의 필요성이 요구되면서, MPEG 에서는 VCM(Video Coding for Machines) 표준화를 시작하였다. VCM 에서는 기계를 위한 비디오/이미지 압축 또는 비디오/이미지 특징 압축을 위한 다양한 방법이 제시되고 있다. 본 논문에서는 객체추적(object tracking)을 위한 머신비전(machine vision) 네트워크에서 추출되는 다중스케일(multi-scale) 특징의 효율적인 압축 기법을 제시한다. 제안기법은 다중스케일 특징을 단일스케일(single-scale) 특징으로 차원을 축소하여 형성된 특징 시퀀스를 최신 비디오 코덱 표준인 VVC(Versatile Video Coding)를 사용하여 압축한다. 제안기법은 VCM 에서 제시하는 기준(anchor) 대비 89.65%의 BD-rate 부호화 성능향상을 보인다.

• 인지과학
• /
• 제12권1_2호
• /
• pp.77-89
• /
• 2001

얼굴 특징점의 지각적 위계구조를 반영한 표정인식 신경망 모형을 설계하였다. 입력자료는 MPEG-4 SNHC(Synthetic/Natural Hybrid Coding)의 얼굴 정의 파라미터(FDP) 중 39개 특징점 각각에 대해 150장의 표정연기 사진을 5개의 크기와 8개의 바위를 갖는 Gabor 필터로분석한 값이었다. 표정영상에 대한 감정상태 평정 값과 39개 특징점의 필터 반응 값을 중가 회귀분석한 결과, 감정상태의 쾌-불쾌 차원은 주로 입과 눈썹 주변의 특징점과 밀접한 과련이 있었고, 각성-수면차원은 주로 눈 주변의 특징점과 밀접한 관련이 있었다. 필터의 크기는 주로 저역 공간 주파수 필터와 감정상태가 관련이 있었고, 필터의 방위는 주로 비스듬한 사선방위와 감정상태가 관련이 있었다. 이를 기초로 표정인식 신경망을 최적화한 결과 원래 1560개(39x5x8) 입력요소를 400개(25x2x8)입력요소로 줄일 수 있었다. 표정인식 신경망의 최적화 결과를 사람의 감정상태 평정과 비교하여 볼 때, 쾌-불쾌 차원에서는 0.886의 상관관계가 있었고, 각성-수면 차원에서는 0.631의 상관관계가 있었다. 표정인식 신경망의 최적화 모형을 기쁨, 슬픔, 놀람, 공포, 분노, 혐오 등의 6가지 기본 정서 범주에 대응한 결과 74%의 인식률을 얻었다. 이러한 결과는 사람의 표정인식 원리를 이용하면 작은 양의 정보로도 최적화된 표정인식 시스템을 구현할수 있다는 점을 시시한다.