• Journal of Intelligence and Information Systems
• /
• v.19 no.3
• /
• pp.57-71
• /
• 2013

Over a billion people in the world generate new news minute by minute. People forecasts some news but most news are from unexpected events such as natural disasters, accidents, crimes. People spend much time to watch a huge amount of news delivered from many media because they want to understand what is happening now, to predict what might happen in the near future, and to share and discuss on the news. People make better daily decisions through watching and obtaining useful information from news they saw. However, it is difficult that people choose news suitable to them and obtain useful information from the news because there are so many news media such as portal sites, broadcasters, and most news articles consist of gossipy news and breaking news. User interest changes over time and many people have no interest in outdated news. From this fact, applying users' recent interest to personalized news service is also required in news service. It means that personalized news service should dynamically manage user profiles. In this paper, a content-based news recommendation system is proposed to provide the personalized news service. For a personalized service, user's personal information is requisitely required. Social network service is used to extract user information for personalization service. The proposed system constructs dynamic user profile based on recent user information of Facebook, which is one of social network services. User information contains personal information, recent articles, and Facebook Page information. Facebook Pages are used for businesses, organizations and brands to share their contents and connect with people. Facebook users can add Facebook Page to specify their interest in the Page. The proposed system uses this Page information to create user profile, and to match user preferences to news topics. However, some Pages are not directly matched to news topic because Page deals with individual objects and do not provide topic information suitable to news. Freebase, which is a large collaborative database of well-known people, places, things, is used to match Page to news topic by using hierarchy information of its objects. By using recent Page information and articles of Facebook users, the proposed systems can own dynamic user profile. The generated user profile is used to measure user preferences on news. To generate news profile, news category predefined by news media is used and keywords of news articles are extracted after analysis of news contents including title, category, and scripts. TF-IDF technique, which reflects how important a word is to a document in a corpus, is used to identify keywords of each news article. For user profile and news profile, same format is used to efficiently measure similarity between user preferences and news. The proposed system calculates all similarity values between user profiles and news profiles. Existing methods of similarity calculation in vector space model do not cover synonym, hypernym and hyponym because they only handle given words in vector space model. The proposed system applies WordNet to similarity calculation to overcome the limitation. Top-N news articles, which have high similarity value for a target user, are recommended to the user. To evaluate the proposed news recommendation system, user profiles are generated using Facebook account with participants consent, and we implement a Web crawler to extract news information from PBS, which is non-profit public broadcasting television network in the United States, and construct news profiles. We compare the performance of the proposed method with that of benchmark algorithms. One is a traditional method based on TF-IDF. Another is 6Sub-Vectors method that divides the points to get keywords into six parts. Experimental results demonstrate that the proposed system provide useful news to users by applying user's social network information and WordNet functions, in terms of prediction error of recommended news.

• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.557-575
• /
• 2005

Much research in core technologies has been done to make it possible the ubiquitous video services over various kinds of user information terminals anytime anywhere in the way the users want to consume. In this paper, we design plototypesystem architecture for the ubiquitous TV program content consumption based on user preference via various kinds of intelligent information terminals in digital home environment, and present an implementation and testing results for the prototype system. For the system design, we utilize the TV Anytime specification fur the consumption of TV program contents based on user preference in TV programs, and also use the MPEG-21 DIA (Digital Item Adaptation) tools which are the representation schema formats in order to describe the context information for user environments, user terminal characteristics, user characteristics for universal access and consumption of the preferred TV program contents. The proposed ubiquitous content mobility prototype system is designed to make it possible to seamlessly consume contents by a single user or multiple users via various kinds of user terminals for the TV program contents they watch together. The proposed ubiquitous content mobility prototype system in digital home environment consists of a home server, a display TV terminal, and an intelligent information terminal. We use 42 TV programs contents in eight different genres from four different TV channels in order to test our prototype system.

• Journal of Intelligence and Information Systems
• /
• v.19 no.1
• /
• pp.57-77
• /
• 2013

Social media has become one of the most popular media in web and mobile application. In 2011, social networks and blogs are still the top destination of online users, according to a study from Nielsen Company. In their studies, nearly 4 in 5active users visit social network and blog. Social Networks and Blogs sites rule Americans' Internet time, accounting to 23 percent of time spent online. Facebook is the main social network that the U.S internet users spend time more than the other social network services such as Yahoo, Google, AOL Media Network, Twitter, Linked In and so on. In recent trend, most of the companies promote their products in the Facebook by creating the "Facebook Page" that refers to specific product. The "Like" option allows user to subscribed and received updates their interested on from the page. The film makers which produce a lot of films around the world also take part to market and promote their films by exploiting the advantages of using the "Facebook Page". In addition, a great number of streaming service providers allows users to subscribe their service to watch and enjoy movies and TV program. They can instantly watch movies and TV program over the internet to PCs, Macs and TVs. Netflix alone as the world's leading subscription service have more than 30 million streaming members in the United States, Latin America, the United Kingdom and the Nordics. As the matter of facts, a million of movies and TV program with different of genres are offered to the subscriber. In contrast, users need spend a lot time to find the right movies which are related to their interest genre. Recent years there are many researchers who have been propose a method to improve prediction the rating or preference that would give the most related items such as books, music or movies to the garget user or the group of users that have the same interest in the particular items. One of the most popular methods to build recommendation system is traditional Collaborative Filtering (CF). The method compute the similarity of the target user and other users, which then are cluster in the same interest on items according which items that users have been rated. The method then predicts other items from the same group of users to recommend to a group of users. Moreover, There are many items that need to study for suggesting to users such as books, music, movies, news, videos and so on. However, in this paper we only focus on movie as item to recommend to users. In addition, there are many challenges for CF task. Firstly, the "sparsity problem"; it occurs when user information preference is not enough. The recommendation accuracies result is lower compared to the neighbor who composed with a large amount of ratings. The second problem is "cold-start problem"; it occurs whenever new users or items are added into the system, which each has norating or a few rating. For instance, no personalized predictions can be made for a new user without any ratings on the record. In this research we propose a clustering method according to the users' genre interest extracted from social network service (SNS) and user's movies rating information system to solve the "cold-start problem." Our proposed method will clusters the target user together with the other users by combining the user genre interest and the rating information. It is important to realize a huge amount of interesting and useful user's information from Facebook Graph, we can extract information from the "Facebook Page" which "Like" by them. Moreover, we use the Internet Movie Database(IMDb) as the main dataset. The IMDbis online databases that consist of a large amount of information related to movies, TV programs and including actors. This dataset not only used to provide movie information in our Movie Rating Systems, but also as resources to provide movie genre information which extracted from the "Facebook Page". Formerly, the user must login with their Facebook account to login to the Movie Rating System, at the same time our system will collect the genre interest from the "Facebook Page". We conduct many experiments with other methods to see how our method performs and we also compare to the other methods. First, we compared our proposed method in the case of the normal recommendation to see how our system improves the recommendation result. Then we experiment method in case of cold-start problem. Our experiment show that our method is outperform than the other methods. In these two cases of our experimentation, we see that our proposed method produces better result in case both cases.

• The Journal of the Korea Contents Association
• /
• v.9 no.8
• /
• pp.129-137
• /
• 2009

While the broadband network and multimedia technologies have been developing, the commercial market of digital contents also has been widely spreading with recently starting IPTV. As the IPTV services are getting to be generalized and popularized, the contents protection and authentication system tends to draw more attentions. So we need a system that can protect contents and allow only authenticated person to use right service by controling user authority and using content encryption. Until now, the conventional protection and authentication system is taking advantages of merits both in CAS and DRM. But the weak point of this system are in high costs, complexity and using HW. For resolving these problems, in this paper, we proposed IPTV contents protection and authentication system using OTP. When we transmit the content encrypted by OTP key using contents delivery technology, we operate XOR with contents using another settop-box's OTP key which was transmitted from distribution server. And contents are reconstructed and transmitted to the settop-box, In the end, downloaded content are encrypted by OTP key and are superior in content protection when contents redistribution. Since OTP use double-authentication elements in encryption process, this method is excellent in content protection. And it is very effective in cost aspect because it could be implemented by SW program. Another benefit is that we can shorten the development time period. In this paper, we propose and find its possibility as a new content protection and authentication method suitable for IPTV services.

• Journal of Broadcast Engineering
• /
• v.26 no.3
• /
• pp.247-257
• /
• 2021

This paper proposes a new technique for calibrating a multi-view RGB-D camera using a 3D (dimensional) skeleton. In order to calibrate a multi-view camera, consistent feature points are required. In addition, it is necessary to acquire accurate feature points in order to obtain a high-accuracy calibration result. We use the human skeleton as a feature point to calibrate a multi-view camera. The human skeleton can be easily obtained using state-of-the-art pose estimation algorithms. We propose an RGB-D-based calibration algorithm that uses the joint coordinates of the 3D skeleton obtained through the posture estimation algorithm as a feature point. Since the human body information captured by the multi-view camera may be incomplete, the skeleton predicted based on the image information acquired through it may be incomplete. After efficiently integrating a large number of incomplete skeletons into one skeleton, multi-view cameras can be calibrated by using the integrated skeleton to obtain a camera transformation matrix. In order to increase the accuracy of the calibration, multiple skeletons are used for optimization through temporal iterations. We demonstrate through experiments that a multi-view camera can be calibrated using a large number of incomplete skeletons.

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

Recently, we need to dramatically speed up real-time video encoding and decoding on mobile devices because complexity of video CODEC is significantly increasing along with the demand for multimedia service of high-quality and high-definition videos by users. A variety of research is conducted for parallelism of video processing using newly developed multi-core platforms. In this paper, we propose a method of parallelism based on slice partition of video compression CODEC. We propose a novel concept of a parallel slice for parallelism and propose a new coding order to be adequate to the parallel slice which keeps high coding efficiency. To minimize synchronization time of multiple parallel slices, we also propose a synchronization method to determinate whether the parallel slice could be independently decoded or not. Experimental results shows that we achieved 27.5% (40.7%) speed-up by parallelism with bit-rate increase of 3.4% (2.7%) for CIF sequences (720p sequences) by implementing the proposed algorithm on the H.264/AVC.

• Journal of Broadcast Engineering
• /
• v.22 no.5
• /
• pp.618-631
• /
• 2017

In this paper, we propose a modification of fuzzy logic based DASH adaptation algorithm(FDASH) for seamless media service in time-varying network conditions. The proposed algorithm selects more appropriate bit-rate for the next segment by the modification of the Fuzzy Logic Controller(FLC) and reduces the number of video bit-rate changes by applying Segment Bit-rate Filtering Module(SBFM). Also, we apply the Start Mechanism for clients not to watch the low quality videos in the very beginning stage of streaming service and add the Sleeping Mechanism to avoid any buffer overflow expected. Ultimately, we verified by using NS-3 Network Simulator that the proposed method shows better performance compared to FDASH. According to the experimental results, there is no buffer underflow/overflow within the limited buffer size, which is not guaranteed in FDASH on the other hand. Also, we confirmed that mFDASH has almost the same level of average video quality against FDASH and reduces about 50% of number of video bit-rate changes compared to FDASH in Point-to-Point network and Wi-Fi network.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.315-322
• /
• 2008

Searching a location of the copied video in video database, signatures should be robust to video reediting, channel noise, time variation of frame rate. Several kinds of signatures has been proposed. Ordinal signature, one of them, is difficult to describe the spatial characteristics of frame due to the site of fixed window, $N{\times}N$, which is compute the average gray value. In this paper, I studied an algorithm of sequence matching in video copy detection for the copyright protection, employing the R-tree index method for retrieval and suggesting a robust ordinal signatures for the original video clips and the same signatures of the pirated video. Robust ordinal has a 2-dimensional vector structures that has a strong to the noise and the variation of the frame rate. Also, it express as MBR form in search space of R-tree. Moreover, I focus on building a video copy detection method into which content publishers register their valuable digital content. The video copy detection algorithms compares the web content to the registered content and notifies the content owners of illegal copies. Experimental results show the proposed method is improve the video matching rate and it has a characteristics of signature suitable to the large video databases.

• Journal of Korea Multimedia Society
• /
• v.15 no.6
• /
• pp.805-813
• /
• 2012

In this paper, we have designed and developed a middleware for an effectively approaching database to the existed brain disease clinical research system. The brain disease clinical research system was consisted of two parts i.e., a register and an analyzer. Since the register collects the registration data the analyzer yields a statistical data which based on the diverse variables. The middleware has designed to database management and a large data query processing of clients. By separating the function of each feature as a module, the module which was weakened connectivity between functionalities has been implemented the re-use module. And image data module used a new compression method from image to text for an effective management and storage in database. We tested the middleware system using 700 actual clinical medical data. As a result, the total data transmission time was improved maximum 115 times faster than the existing one. Through the improved module structures, it is possible to provide a robust and reliable system operation and enhanced security functionality. In the future, these middleware importances should be increased to the large medical database constructions.

• Information and Communications Magazine
• /
• v.11 no.10
• /
• pp.120-138
• /
• 1994

최근에 정보 고속도로 사업계획과 관련하여 세계 여러나라들이 실시하거나 실시 예정인 VOD 시험서비스에 많은 관심이 일고 있다. VOD서비스와 같은 대화형 TV 서비스(I-TV, Interactive-TV Service)는 컴퓨터, 통신 가전업체 그리고 영화 제작사등이 함께 참여하고 있다. 본 기고에서는 차세대 통합 멀티미디어 사업이라는 대화형 TV서비스의 개요와 요소기술, 그리고 서비스의 동향 및 전망을 알아보기로 한다. 1. 대화형 TV 서비스(Interactive TV Service)의 개요 현재까지 대부분의 TV 시청자들은 방송국으로부터 송신되는 공중파나 CATV서비스를 통해 프로그램 서비스를 받아보는 방송(broadcasting)방식 형태의 서비스를 이용해 왔다. 그러나 이러한 일방적인 수신방식은 최근 미국의 클린턴 행정부가 미국의 차세대 기반 통신망 구축 정책(정보 고속도로 사업; Information Super High-way)의 일환으로, CATV 사업자뿐만 아니라 지역 전화회사까지도 참여하고 있는 VOD(Video On Demand) 시험서비스가 시행됨에 따라서 미국은 물론, 우리나라를 비롯한 여러나라에서 대화형식의 TV서비스를 시행하려는 움직임이 일어나고 있다. 이러한 움직임은 지난 ‘92년 7월 16일 미 연방통신위원회(FCC. Federal Communication Committee)가 그동안 전화회사에 대해 CATV 시업진출을 금지하였던 정책을 바꿔서, CATV에 대항한 경쟁도입과 기반 정보통신망 정비를 목표로 하여 비디오 다이얼톤(VDT(주), Video Dial Tone)이라는 이름하에 공중통신 사업자에게도 영상신호를 전송을 인가함에 따라 시작되었다. VOD서비스와 같은 대화형 TV서비스는 가입자가 원하는 서비스를 시간에 관계없이 댁내의 통신회선(일반전화망, 케이블망, 광화이버망, 위성망)을 통해서 요구 즉시 실시간에 서비스를 받아볼 수 있는 멀키미디어의 통합서비스 방식이다. 도한 이 서비스는 음성통신과 방송의 통합형 서비스로서, 방송국, 전화회사 혹은 서비스 제공업자(ISP ; Information Service Provider)에 의해 제공된 디지탈 영상 및 일반 데이터 등을 압축하여 서버에 저장한 후, 소비자의 요청이 있을 경우에 통신회선을 통해 즉시 서비스 해준다. 이와 같은 대화형 TV 서비스의 구성요소로는 다양한 영상정보 및 데이타를 보유하고 있는 정보제공자, 전화선이나 CATV 또는 위성방송과 연결해 주는 지역별 비디오 서버 및 교환장치, 통신회선을 통해 전송된 서비스를 영상정보로 만들어주고 또한 가입자의 요구를 즉시 정보제공자에게 알려줄 수 있는 가정용 단말기 (STB. Set Top Box)로 이루어진다. 여기서, 비디오 서버는 다양한 대화형 TV 서비스를 제공해 주는 중계자로서, 영화, 홈쇼핑, 홈뱅킹, 대화형 교육, 비디오 게임 등을 가정에서도 가능하게 해 줄 뿐 아니라, 가입자를 관리하는 기능을 가지고 있어서 가입자 정보는 물론, 각종 서비스 사용료, 개인 통계자료 분석 등도 집계할 수 있는 기능을 가지고 있다.(그림1) 본 기고에서는 이러한 대화형 TV서비스 중에 대표적 응용서비스인 VOD 서비스에 사용되는 기술요소와 각국에서 진행되고 있는 VOD 서비스 동향 및 전망에 대해 알아보고자 한다. (주) VDT(Video Dial Tone) : FCC가 ‘92년 7월 16일에 인가한 지역 전화회사에 의한 가정용 영상 전송서비스 및 CATV에 대항한 경쟁도입과 Infrastructure의 정비를 목표로 하여 결정한 내용은 다음과 같다. 지역 전화회사에 대하여 (1) 공중통신사업자에 대하여 서비스 제공자에 대한 영상신호의 전송을 인가(기본서비스), (2) Video Gateway 서비스, 비디오 기기 제공, 서비스 제공사업자에 대한 과금, 요금징수 대행을 인가(고도서비스), (3) 프로그램 제공자에 대하여 자본출자율을 5%로 높이는 외에 (종래는 1%) 업무 관계의 확대(합병회사 설립 및 consultant 계약 등)를 인가. (4) Rural 지역(영업지역의회의 지방)에 대한 직접 프로그램 제공의 특별인가(주민이 1만세데 미만의 지방 공공 단체만 가능, 영업지역내에서는 제한없음), (5) 지방공공 사업체에 의한 영업면허의 불요(지역 전화회사가 직접 사용자에 서비스를 제공하지 않기 때문에 CATV 서비스로는 보지 않기 때문). (6)의 회로의 권고(케이블 정책법으로 결정되어 있는 통신사업자와 CATV회사 자본의 상호보유 금지의 해제) 등이다.