• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.107-114
• /
• 2002

In these days, rapid advances of the computer system and the high speed network have made the multimedia services popularized among various applications and services in the internet. Internet live broadcasting, a part of multimedia services, makes it possible to provide not only existing broadcasting services including audio and video but also interactive communications which also expand application scopes by freeing from both temporal and spatial limitation. In the Paper, an interned Personal-live broadcasting server system is developed by allowing individual users to actively create or join live-broadcasting services with such basic multimedia devices as a PC camera and a sound card. As the number of broadcasters and participants increases, concurrent multiple channels are established and groups are to be expanded. The system should also guarantee High Availability (HA) for continuous services even in the presence of partial failure of the cluster. Furthermore, a transmission mode switching is supported to consider network environments in the user system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.10
• /
• pp.1441-1446
• /
• 2022

Modern people can access various information about food recipes very easily on the Internet or social media. As the supply of food recipes increases, it is difficult to find a suitable recipe for each user in the overflowing information. As such, the need to provide information by reflecting users' requirements has increased, and research related to food recipes and cooking recommendations is becoming active. In addition, the Internet, video, and application markets using this are also rapidly activating. In this study, in order to classify recipes from the user's perspective of food recipe users, the user's review data was applied with the k-mean clustering technique, which is unsupervised learning, and a "food recipe classification model" was derived. As a result, it was classified into a total of 25 clusters including information needed by many users, such as specific purposes and cooking stages.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.28-41
• /
• 2017

In this paper, the fast encoding algorithm in High Efficiency Video Coding (HEVC) encoder was studied. For the encoding efficiency, the current HEVC reference software is divided the input image into Coding Tree Unit (CTU). then, it should be re-divided into CU up to maximum depth in form of quad-tree for RDO (Rate-Distortion Optimization) in encoding precess. But, it is one of the reason why complexity is high in the encoding precess. In this paper, to reduce the high complexity in the encoding process, it proposed the method by determining the maximum depth of the CU using a hierarchical clustering at the pre-processing. The hierarchical clustering results represented an average combination of motion vectors (MV) on neighboring blocks. Experimental results showed that the proposed method could achieve an average of 16% time saving with minimal BD-rate loss at 1080p video resolution. When combined the previous fast algorithm, the proposed method could achieve an average 45.13% time saving with 1.84% BD-rate loss.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.8
• /
• pp.579-588
• /
• 2013

This paper proposes an effective watermarking approach for copyright protection of fire video images. The proposed watermarking approach efficiently utilizes the inherent characteristics of fire data with respect to color and texture by using a gray level co-occurrence matrix (GLCM) and fuzzy c-means (FCM) clustering. GLCM is used to generate a texture feature dataset by computing energy and homogeneity properties for each candidate fire image block. FCM is used to segment color of the fire image and to select fire texture blocks for embedding watermarks. Each selected block is then decomposed into a one-level wavelet structure with four subbands [LL, LH, HL, HH] using a discrete wavelet transform (DWT), and LH subband coefficients with a gain factor are selected for embedding watermark, where the visibility of the image does not affect. Experimental results show that the proposed watermarking approach achieves about 48 dB of high peak-signal-to-noise ratio (PSNR) and 1.6 to 2.0 of low M-singular value decomposition (M-SVD) values. In addition, the proposed approach outperforms conventional image watermarking approach in terms of normalized correlation (NC) values against several image processing attacks including noise addition, filtering, cropping, and JPEG compression.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.662-672
• /
• 2014

Human action recognition is used in areas such as surveillance, entertainment, and healthcare. This paper proposes a system to recognize both single and continuous human actions from monocular video sequences, based on 3D human modeling and cyclic hidden Markov models (CHMMs). First, for each frame in a monocular video sequence, the 3D coordinates of joints belonging to a human object, through actions of multiple cycles, are extracted using 3D human modeling techniques. The 3D coordinates are then converted into a set of geometrical relational features (GRFs) for dimensionality reduction and discrimination increase. For further dimensionality reduction, k-means clustering is applied to the GRFs to generate clustered feature vectors. These vectors are used to train CHMMs separately for different types of actions, based on the Baum-Welch re-estimation algorithm. For recognition of continuous actions that are concatenated from several distinct types of actions, a designed graphical model is used to systematically concatenate different separately trained CHMMs. The experimental results show the effective performance of our proposed system in both single and continuous action recognition problems.

• Journal of Broadcast Engineering
• /
• v.11 no.1 s.30
• /
• pp.15-27
• /
• 2006

In this paper, a novel approach is addressed to facilitate the browsing of large collection of digital photos associated with specified person(s) in the photos. The goal of the proposed method is to exploit additional person-identity features as incorporating facial regions and peripheral clothes region associated with them. For more effective incorporation of the clothes and facial features, situation-based photo clustering is also proposed. To evaluate the efficacy of the proposed method experiment was performed with 1120 generic home photos. The experiment results showed that the proposed method outperformed the conventional method us El.g only face feature as showing the average performance of about 92% contrary to the average performance of about 70% in the conventional method.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.19-22
• /
• 2001

현재 수 많은 공중파 채널을 비롯하여 각종 케이블 TV 와 위성 TV 등의 채널이 대량으로 디지털화 되어 가고 있지만 파국의 디지털 TV 의 규격은 MPEG2 라는 표준 규격으로 통일 되어 우리에게 전해지고 있다. 이런 수많은 동영상 정보들은 디지털이라는 특성상 기록과 보관이 용이하므로 사용자는 수 많은 정보를 저장, 관리 할 수 있게 되었다. 따라서 방대한 데이터의 바다 속에서 원하는 정보를 검색하는데 있어서 기존의 방식 즉 일정 속도를 가진 검색 엔진을 사용하는 것 보다는 MPEG2 규격의 표준들을 보다 효율적으로 이용하여 사용자들이 동영상 정보 중에 이동하기 원하는 부분으로 이동하기 위한 비선형 검색엔진을 소개한다. 이를 이용한 PVR(Penonal Video Recorder)은 현재 hardware 부분은 완료되었고 일부 software 엔진을 적용하여 개발 중이다.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.101-104
• /
• 2000

비디오 데이터의 효율적인 검색, 요약 등에 활용하기 위해서 대용량의 비디오 데이터를 프레임(Frame), 샷(Shot),스토리(Story)의 계층적인 구조로 표현하는 방법들이 요구되고 있으며, 이에 따라 비디오를 샷, 스토리 단위로 분할하는 연구들이 수행되고 있다. 본 논문은 비디오가 샷 단위로 분할되어 있다고 가정한 후, 인접한 샷들을 결합하여 의미 있는 최소 단위인 스토리를 분할하는 방법을 제안한다. 제안하는 방법은 각 샷에서 추출된 대표 프레임들을 비교하기 위한 CCV(Color Coherence Vector) 영상 특징을 추출한다. CCV 특징의 시각적인 유사도의 초기임계값과 일정한 시간 안에 반복되는 프레임들을 찾기 위한 시간적인 유사도의 시간 임계값을 설정하여NN(Nearest Neighbor) 클러스터링 방법을 이용하여 클러스터링을 한다. 클러스터링된 정보와 같은 장면이 한번이상 반복되는 스토리의 특성을 이용해 비디오를 스토리로 분할한다. 영화 비디오 데이터를 이용한 실험을 통해 제안하는 방법의 유효성을 검증하였다.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.1-10
• /
• 1997

In this paper, an improved lower bound on the burst-error correcting capability of th ecyclic product code is presented and through the analysis of this new bound clustered cyclic product (CCP abbr.)code is proposed. The CCP code, to improve the burst-error correcting capability, combines the idea of clustering and the transmission method of cyclic product code. That is, a cluster which is defined in this paper as a group of consecutive code symbols is employed as a new transmission unit to the code array transmission of cyclic product code. the burst-error correcting capability of the CCP code is improved without a loss in the random-error correcting capability and performance comparison in the digital video camera records (DVCR) system shows the superiority of the proposed CCP code over conventional product codes.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.5
• /
• pp.987-989
• /
• 2007

This paper describes a digital convergence platform(DCP) which is implemented based on the MPEG-21 multimedia framework. DCP is a newly proposed solution in this research for the convergence service of future home multimedia environment. DCP is a common platform designed to have the feature of reconfigurability, by means of S/W. which supports to run diverse digital multimedia services. A distributed peer to peer service and transaction model is also a new feature realized in DCP using the MPEG-21 multimedia framework. A prototype DCP is implemented to verify its functions of multimedia service and transactions. The developed DCPs are networked with IP clustering storage systems for the distributed service of multimedia. Successful streaming services of the MPEG-2/4 video and audio are verified with the implemented test-bed system of DCP.