• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.8
• /
• pp.3036-3044
• /
• 2010

With the rapid growth of video data service, demand to provide advertisements or additional information with regard to a particular video scene is increasing. However, the direct use of automated visual analysis or speech recognition on videos virtually has limitations with current level of technology; the metadata of video such as title, category information, or summary does not reflect the content of continuously changing scenes. This work presents a new video contextual advertising system that serves relevant advertisements on a given scene by leveraging the scene's situation information inferred from video scripts. Experimental results show that the use of situation information extracted from scripts leads to better performance and display of more relevant advertisements to the user.

• Journal of KIISE:Information Networking
• /
• v.36 no.6
• /
• pp.471-480
• /
• 2009

One of the principal impediments to the achievement of a scalable access control for a large number of subscribers in a public broadcast is to distribute key update messages reliably to all stateless receivers. However, in a public broadcast, the rekeying messages can be dropped or compromised during the transmission over an insecure broadcast channel, or transmitted to the receivers while it was off-line. In this study, we propose a novel group key management scheme that features a mechanism that allows the legitimate receivers to recover the current group key even if they lose key update messages for long-term sessions using short hint messages and member computation. The performance analysis result shows that the proposed scheme has advantages of the scalable and efficient rekeying compared with the previous reliable group key distribution schemes. The proposed key management scheme targets a conditional access system in a media broadcast where there is no feedback channel from receivers to the broadcasting station.

• Journal of KIISE:Information Networking
• /
• v.37 no.2
• /
• pp.109-121
• /
• 2010

Recently, the military of Korea has been establishing the next generation wireless tactical communication system so called Tactical Information Communication Network (TICN). A routing protocol for TICN transport networks has to be able to select a path with high survivality, reliability, and stability while accommodating as many flows as possible with minimum QoS guarantees. The OSPF(Open Short Path First) used widely is determined to be the routing protocol for TICN. With the typical deployment practices OSPF, however, it cannot satisfy the requirements of TICN. In this paper, we propose a cost function for OSPF and a way to tune the OSPF protocol parameters for the TICN transport networks. Through simulations, it is shown that the OSPF with the proposed cost function provides better performance than the OSPF in terms of both the services provided to the applications and the network resources utilization.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.9
• /
• pp.835-840
• /
• 2008

This paper proposes an enhanced recommendation technique for personalized e-commerce portal analyzing various attitudes of customer. The attitudes are classifies into three types such as "purchasing product", "adding product to shopping cart", and "viewing the product information". We implicitly track customer attitude to estimate the rating of products for recommending products. We classified user groups which have similar preference for each item using implicit user behavior. The preference similarity is estimated using the Cross Correlation Coefficient. Our recommendation technique shows a high degree of accuracy as we use age and gender to group the customers with similar preference. In the experimental section, we show that our method can provide better performance than other traditional recommender system in terms of accuracy.

• Journal of Computing Science and Engineering
• /
• v.5 no.3
• /
• pp.210-222
• /
• 2011

In this work, we study the problem of privacy-preservation data publishing in moving objects databases. In particular, the trajectory of a mobile user in a plane is no longer a polyline in a two-dimensional space, instead it is a two-dimensional surface of fixed width $2A_{min}$, where $A_{min}$ defines the semi-diameter of the minimum spatial circular extent that must replace the real location of the mobile user on the XY-plane, in the anonymized (kNN) request. The desired anonymity is not achieved and the entire system becomes vulnerable to attackers, since a malicious attacker can observe that during the time, many of the neighbors' ids change, except for a small number of users. Thus, we reinforce the privacy model by clustering the mobile users according to their motion patterns in (u, ${\theta}$) plane, where u and ${\theta}$ define the velocity measure and the motion direction (angle) respectively. In this case, the anonymized (kNN) request looks up neighbors, who belong to the same cluster with the mobile requester in (u, ${\theta}$) space: Thus, we know that the trajectory of the k-anonymous mobile user is within this surface, but we do not know exactly where. We transform the surface's boundary poly-lines to dual points and we focus on the information distortion introduced by this space translation. We develop a set of efficient spatiotemporal access methods and we experimentally measure the impact of information distortion by comparing the performance results of the same spatiotemporal range queries executed on the original database and on the anonymized one.

• Journal of KIISE
• /
• v.41 no.9
• /
• pp.686-698
• /
• 2014

Recently, large-scale streaming sensor data have emerged due to explosive supply of smart phones, diffusion of IoT and Cloud computing technology, and generalization of IoT devices. Also, researches on combination of semantic web technology are being actively pushed forward by increasing of requirements for creating new value of data through data sharing and mash-up in large-scale environments. However, we are faced with big issues due to large-scale and streaming data in the inference field for creating a new knowledge. For this reason, we propose the RDFS rule based parallel reasoning scheme to service by processing large-scale streaming sensor data with the semantic web technology. In the proposed scheme, we run in parallel each job of Rete network algorithm, the existing rule inference algorithm and sharing data using the HBase, a hadoop database, as a public storage. To achieve this, we implement our system and evaluate performance through the AWS data of the weather center as large-scale streaming sensor data.

• Journal of KIISE:Software and Applications
• /
• v.37 no.4
• /
• pp.264-272
• /
• 2010

Example-based super resolution is a method to restore a high resolution image from low resolution images through training and retrieval of image patches. It is not only good in its performance but also available for a single frame low-resolution image. However, its time complexity is very high because it requires lots of comparisons to retrieve image patches in restoration process. In order to improve the restoration speed, an efficient patch retrieval algorithm is essential. In this paper, we applied various high-dimensional feature retrieval methods, available for the patch retrieval, to a practical example-based super resolution system and compared their speed. As well, we propose to apply the multi-phase candidate reduction approach to the patch retrieval process, which was successfully applied in character recognition fields but not used for the super resolution. In the experiments, LSH was the fastest among conventional methods. The multi-phase candidate reduction method, proposed in this paper, was even faster than LSH: For $1024{\times}1024$ images, it was 3.12 times faster than LSH.

• Korean Journal of Cognitive Science
• /
• v.18 no.4
• /
• pp.445-455
• /
• 2007

We present a new biometric identification system based on multi-view features of teeth using principal components analysis(PCA). The multi-view features of teeth consist of the frontal view, the left side view and the right side view. In this paper, we try to stan the foundations of a dental biometrics for secure access in real life environment. We took the pictures of the three views teeth in the experimental environment designed specially and 42 principal components as the features for individual identification were developed. The classification for individual identification based on the nearest neighbor(NN) algorithm is created with the distance between the multi-view teeth and the multi-view teeth rotated. The identification performance after rotating two degree of test data is 95.2% on the left side view teeth and 91.3% on the right side view teeth as the average values.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.901-910
• /
• 2003

Generally, most commercial retrieval engines adopt boolean query as user's query type. Although boolean query is useful to retrieval engines that need fast retrieval, it is not easy for user to express his demands with boolean operators. So, many researches have been studied for decades about information retrieval systems using natural language query that is convenient for user. To retrieve documents that are suitable for user's demands, they have to express their demands correctly, So, this thesis proposes interactive query process agent using natural language. This agent expresses demands concrete through gradual interaction with user, When users input a natural language Query, this agent analyzes the query and generates boolean query by selecting proper keyword and feedbacks the state of the keyword selected. If the keyword is a synonymy or a polysemy, the agent expands or limits the keyword through interaction with user. It makes user express demands more concrete and improve system performance. So, this agent can improve the precision of Information Retrieval.

• The Journal of the Korea Contents Association
• /
• v.9 no.10
• /
• pp.339-348
• /
• 2009

This research proposes a new approach to measure corporate contributions to sustainability called Sustainable Value. With some global corporations which recognize the seriousness of environmental crisis and their social responsibility, enterprises are positively accepting the sustainable management. Also, publication of the sustainability report is proliferating which is showing the enterprise's strategy, activity, result and influence in environmental, economic, social cases to the stakeholder. However, to settle and proliferate this current, it rests with how to evaluate enterprises sustainability in reasonable and reliable figure. In this context, what introduced and taking effects are sustainability report evaluation and awarding system. But the quality of sun stainability report and its content's depth and the evaluation of enterprise's sustainability itself should be distinguished. Because the enterprise which published excellent graded sustainability report is not always the enterprise that is sustainable. Then, how could we prove the result of enterprise's sustainable management based on sustainability report? This paper is to find the answer and to utilize it based on sustainability report, particularly sustainable value model as the central figure.