• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.43-52
• /
• 2008

The paper presents the problem definition of video placement and efficient methods for placing video data on a cluster of video servers. The video placement is to place each of video replicas on one of the servers where the number and location of the servers are already determined. The rejection ratio of user requests is one of most important user-perceive performance measures, so it has been used as a performance criteria in many researches on the VOD system. The objective of our video placement is to achieve the load balancing among servers and the minimization of total network loads. To our experiment, the presented methods show better performance in terms of the rejection ratio of user requests than the methods for video placements in which only either server load balancing or network load minimization is considered. Also, it is observed that considerations on server load balancing is especially important in video placement. To our survey, little research has been published on video placement in which server and network load are considered together in a video server cluster environment.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.621-628
• /
• 2000

A retrieval performance of VOD sever is estimated by how quickly it services popular videos to users and how many users it is able to service. Each video data is placed on heterogeneous disks and placement techniques are various, retrieval performance is under the control of these elements, so that a retrieval performance is affected by placement policy. In this paper, we place video data considering their characteristics, especially, we place videos distributively according to their popularity. To verify our policy, we make various environment of experiment, estimate a placement policy using popularity of videos and a contrary policy, and compare them.

• Journal of Multimedia Information System
• /
• v.8 no.1
• /
• pp.23-30
• /
• 2021

Palmprint has become a popular biometric modality; however, palmprint recognition has not been conducted in video media. Video palmprint recognition (VPR) has some advantages that are absent in image palmprint recognition. In VPR, the registration and recognition can be automatically implemented without users' manual manipulation. A good-quality image can be selected from the video frames or generated from the fusion of multiple video frames. VPR in contactless mode overcomes several problems caused by contact mode; however, contactless mode, especially mobile mode, encounters with several revere challenges. Double-line-single-point (DLSP) assisted placement technique can overcome the challenges as well as effectively reduce the localization error and computation complexity. This paper modifies DLSP technique to reduce the invalid area in the frames. In addition, the valid frames, in which users place their hands correctly, are selected according to finger gap judgement, and then some key frames, which have good quality, are selected from the valid frames as the gallery samples that are matched with the query samples for authentication decision. The VPR algorithm is conducted on the system designed and developed on mobile device.

• Journal of Internet Computing and Services
• /
• v.18 no.1
• /
• pp.37-41
• /
• 2017

In this paper, a platform was proposed that can service the streaming of location based real-time video-clip for smart-travel-services to work with PPL(Product Placement). The location information of drama like as LTE GPS and Beacon were used to provide the drama video with the PUSH service. And PPL DB with the attributes like as picture, video, music and URI(Uniform resource Identifier) was designed. As a result, this platform could provide the location based video streaming service that could replace the original PPL properties, color or shape, with the other properties by the interactive tagging the PPL DB in drama scenes. The proposed platform could provide the location based real-time video streaming service that can alter the PPL properties with the request of service provider.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1053-1056
• /
• 1999

Video On Demand servers generally require massive disk storages for storing many video data. Many researches have been done on the topics of efficient allocation of movies in disks. This paper, We describe efficient disk placement techniques and implement storage system with SCSI and PCI Bus interface for efficient data handling. This paper also proposes a logical zone reconstruction method for the SCAN data placement technique. The proposed method reconstructs physical zones into logical zones by split and merge operations.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.8
• /
• pp.15-21
• /
• 1996

This paper describes data placement schemes that provide uniform and balanced to multiple disks load for retrievals of VBR (variable bit rate) video at varying retrieval speeds. To support maximum concurent users at arbitrary-speed playbacks in a disk-arry based system, the hot spot disks should be carefully avoided. In this paper, we extend the proposed scheme, prime round-robin(PRR), for VBR video. In addition, we have compared the performance of PRR and PRR (PRR extension).

• Smart Media Journal
• /
• v.5 no.4
• /
• pp.138-142
• /
• 2016

In this paper, a smart travel service platform is proposed with PPL(Product Placement) database based on the location of TV viewer who is 's marking by smart devices. This platform is designed with the active PUSH and smart kiosk signage with video clip of LTE/beacon's places. As a result, this PPL-DB platform is inter-worked for the PPL database of category, location, product, favor with interactive tagging in pictures and videos.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.2
• /
• pp.421-431
• /
• 1999

NOD systems contain the data of multiple types such as text, image and video, and the size of NOD data depend on their data types. Therefore, in this paper, we propose a Data Placement Method based on Data Types(DPMDT), in which the data placement method depends on their type. Then, we analyze the performance of DPMDT with that of a Time Based Storage Management(TBSM) in which the data placement method depends on their created date, and that of Rate Based Storage Management(RBSM) in which the data placement method depends on their created date and accessed rate. In case of long playback of video news and a few disks(one disk), our results show that the performance of DPMDT is less efficient than that of TBSM and RBSM methods, however, in case of over 2 disks, the performance of DPMDT is more efficient than that of TBSM and RBSM methods.

• Journal of Korea Multimedia Society
• /
• v.2 no.1
• /
• pp.22-29
• /
• 1999

In video-on-demand systems, movies are striped across the disks of the array in a video server to support multiple access. The blocks of the movies have to be placed carefully on the disks of the array in a video server in order to avoid load imbalance across these disks as well as to achieve maximum utilization of both space and bandwidth of these disks. This paper proposes a movie placement method called the GARR (group-alternation round-robin) that is based on the dynamic disk striping method considering the popularity of movie. The GARR uses group-alternation as movie selection policy and round-robin as data placement policy, where group-alternation allocates popular movie and unpopular movie groups to disks alternately. The performance of the GARR is evaluated by simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1652-1660
• /
• 1999

One of the most important goals in VOD servers is to provide services to more clients with services which clients request. In order to provide service efficiently and rapidly, though considering a few of policies, efficient placement of data when they are stored is direct cause to improve efficiency of retrievals. In this paper, we propose a efficient placement policy, encoded video data being stored in clustered VOD servers. In the proposed placement policy, partitioning a large disk array into smaller disk groups which consists of a few of disks with similar performances, specially disk I/O bandwidth. In last chapter, we compare proposed placement policy with conventional policies, and show the results of improved performances with proposed policy.