• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4948-4967
• /
• 2017

On mobile devices, image sequences are widely used for multimedia applications such as computer vision, video enhancement, and augmented reality. However, the real-time processing of mobile devices is still a challenge because of constraints and demands for higher resolution images. Recently, heterogeneous computing methods that utilize both a central processing unit (CPU) and a graphics processing unit (GPU) have been researched to accelerate the image sequence processing. This paper deals with various optimizing techniques such as parallel processing by the CPU and GPU, distributed processing on the CPU, frame buffer object, and double buffering for parallel and/or distributed tasks. Using the optimizing techniques both individually and combined, several heterogeneous computing structures were implemented and their effectiveness were analyzed. The experimental results show that the heterogeneous computing facilitates executions up to 3.5 times faster than CPU-only processing.

• Journal of Korea Multimedia Society
• /
• v.23 no.8
• /
• pp.927-939
• /
• 2020

Gait recognition can identify people's identity from a long distance, which is very important for improving the intelligence of the monitoring system. Among many human features, gait features have the advantages of being remotely available, robust, and secure. Traditional gait feature extraction, affected by the development of behavior recognition, can only rely on manual feature extraction, which cannot meet the needs of fine gait recognition. The emergence of deep convolutional neural networks has made researchers get rid of complex feature design engineering, and can automatically learn available features through data, which has been widely used. In this paper,conduct feature metric learning in the three-dimensional space by combining the three-dimensional convolution features of the gait sequence and the Siamese structure. This method can capture the information of spatial dimension and time dimension from the continuous periodic gait sequence, and further improve the accuracy and practicability of gait recognition.

• Journal of Korean Academy of Nursing
• /
• v.37 no.1
• /
• pp.52-63
• /
• 2007

Purpose: Effective communication is an essential aspect of nursing care. This qualitative study was performed to analyze nurse-patient conversations about medication. Method: The nurse-patient dialogue was collected by video tape recording during the nurse's duty time in an internal medicine ward. One hundred seventy-eight episodes were extracted from the conversation. Using conversational analysis, the functional phases and patterns of dialogue sequence pertaining to medication were analyzed. Results: Conversations about medication were very brief dialogues, so 68.8% of the dialogue had a duration of less than 20 seconds. However, it was a systematic and comprehensive dialogue which had structures and sequential dialogue patterns. Four functional phases were explored. greeting, identifying the patient, medicating, finishing. The medicating phase was essential, in which the nurse gave the drug to the patient and provided information initiated by the nurse simultaneously. The patterns of the dialogue sequence represented were the nurse provided information first, and then, patients responded to the nurse as accepting, rejecting, raising an objection, or asking again later. Conclusion: As the results of this study show, a nurse's role is important as an educator. For effective conversation about medication, the development of an educational program should be considered, which includes knowledge about medication and communication skills.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.195-198
• /
• 2001

비디오 데이터의 효율적인 저장, 관리를 위해서는 장면진환 검출을 통한 비디오 분할 기술에 대한 연구가 필요하다. 본 논문에서는 MPEG 압축 비디오 상의 B(Bidirectional) 프레임의 특성을 복호화 과정을 거치지 않고 직접 추출하여 I(Intra), P(Predictive), B(Bidirectional) 프레임에 제안받지 않고 장면전환을 검출해 내는 방법을 제안한다. 장면전환 검출을 위해 복호화 하지 않고 필요한 데이터만을 추출해 내어 B 프레임의 특징만을 이용해 검출하므로 빠르면서도 정화한 장면전환을 검출한다. 또한 카메라 움직임이나 빛의 변화 같은 잡음에 강건한 방법을 제안한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06a
• /
• pp.139-142
• /
• 1998

장면 전환 검출(scene change detection)을 영상 정보의 인덱싱 및 검색을 위한 전처리로서, 전체 검색 시스템의 성능을 좌우하는 중요한 기술로 현재 많은 연구가 진행되고 있다. 본 논문에서는 MPEG 표준으로 압축된 동영상으로부터 얻은 DC 이미지를 이용한 장면 전환 검출 및 대표 프레임 검출에 대한 방법을 제안하고 이를 위한 시뮬레이터의 개발과 그에 대한 성능을 평가한다.

• Journal of Broadcast Engineering
• /
• v.3 no.2
• /
• pp.146-154
• /
• 1998

시간적 표본화를 채택한 다중경로방법에 의한 장면전환 검출방법은 전 동영상에 대해 매 프레임마다 순차적으로 검색하는 방법에 비해서 빠르며, 동일한 정확성을 갖고 있다. 그러나, 검출 시간을 최소화하기 위한 적절한 검출 간격을 선택하는 어떠한 기준이나 방법도 제시되지 않았으며 검출 간격을 경험에 의해 선택할 수밖에 없다. 이 논문에서는 장면 전환 검출 시간, 검출 간격과 실제 장면 전환 간격으로부터 검출 시간을 최소화하는 최적 검출 간격을 얻을 수 있음을 보였다. 평균 장면 전환 간격이 알려져 있지 않은 동영상에 대해서 최적 검출 간격을 추정할 수 있는 알고리듬을 제안하였다.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.08a
• /
• pp.317-320
• /
• 2000

동영상 분할은 컴퓨터 비전 분야에서 중요한 단계로 많이 연구되고 있다 그러나 동영상 분할은 계산 복잡도에 의해 제약을 받는다. 이를 해결하기 위해, 본 논문은 분산 유전자 알고리즘에 기반한 계산 효율을 높일 수 있는 새로운 동영상 분할 방법을 제안한다. 일반적으로 동영상에서 연속한 두 프레임은 높은 상관관계를 가진다. 따라서, 한 프레임의 분할 결과는 이전 프레임의 분할 결과를 사용해서 연속적으로 얻어진다. 그리고 중복된 계산을 제거하기 위해 움직이는 객체에 대응되는 염색체만을 진화시킨다. 실험 결과는 제안한 방법의 효율성을 보여준다.

• Journal of Internet Computing and Services
• /
• v.15 no.4
• /
• pp.9-20
• /
• 2014

Making good predictions about the outcome of one's actions would seem to be essential in the context of social interaction and decision-making. This paper proposes a computational model for learning articulated motion patterns for action recognition, which mimics biological-inspired visual perception processing of human brain. Developed model of cortical architecture for the unsupervised learning of motion sequence, builds upon neurophysiological knowledge about the cortical sites such as IT, MT, STS and specific neuronal representation which contribute to articulated motion perception. Experiments show how the model automatically selects significant motion patterns as well as meaningful static snapshot categories from continuous video input. Such key poses correspond to articulated postures which are utilized in probing the trained network to impose implied motion perception from static views. We also present how sequence selective representations are learned in STS by fusing snapshot and motion input and how learned feedback connections enable making predictions about future input sequence. Network simulations demonstrate the computational capacity of the proposed model for motion recognition.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.66-74
• /
• 2010

Recently distributed video coding (DVC) is spotlighted for the environment which has restriction in computing resource at encoder. Wyner-Ziv (WZ) coding is a representative scheme of DVC. The WZ encoder independently encodes key frame and WZ frame respectively by conventional intra coding and channel code. WZ decoder generates side information from reconstructed two key frames (t-1, t+1) based on temporal correlation. The side information is regarded as a noisy version of original WZ frame. Virtual channel noise can be removed by channel decoding process. So the performance of WZ coding greatly depends on the performance of channel code. Among existing channel codes, Turbo code and LDPC code have the most powerful error correction capability. These channel codes use stochastically iterative decoding process. However the iterative decoding process is quite time-consuming, so complexity of WZ decoder is considerably increased. Analysis of the complexity of LPDCA with real video data shows that the portion of complexity of LDPCA decoding is higher than 60% in total WZ decoding complexity. Using the HDA (Hard Decision Aided) method proposed in channel code area, channel decoding complexity can be much reduced. But considerable RD performance loss is possible according to different thresholds and its proper value is different for each sequence. In this paper, we propose an adaptive HDA method which sets up a proper threshold according to sequence. The proposed method shows about 62% and 32% of time saving, respectively in LDPCA and WZ decoding process, while RD performance is not that decreased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8C
• /
• pp.651-660
• /
• 2010

In this paper, we implement an efficient histogram-based prefiltering to compensate the illumination mismatches in regions between neighboring views. In multi-view video, such illumination disharmony can primarily occur on account of different camera location and orientation and an imperfect camera calibration. This discrepancy can cause the performance decrease of multi-view video coding(MVC) algorithm. A histogram matching algorithm can be exploited to make up for these differences in a prefiltering step. Once all camera frames of a multi-view sequence are adjusted to a predefined reference through the histogram matching, the coding efficiency of MVC is improved. However general frames of multi-view video sequence are composed of several regions with different color composition and their histogram distribution which are mutually independent of each other. In addition, the location and depth of these objects from sequeuces captured from different cameras can be different with different frames. Thus we propose a new algorithm which classify a image into several subpartitions by its depth information first and then histogram matching is performed for each region individually. Experimental results show that the compression ratio for the proposed algorithm is improved comparing with the conventional image-based algorithms.