• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.756-771
• /
• 2003

Digital Video Library System which manages a large amount of multimedia information requires efficient and effective retrieval methods. In this paper, we propose and implement a new video search and retrieval algorithm that compares the query video shot with the video shots in the archives in terms of foreground object, background image, audio, and its context. The foreground object is the region of the video image that has been changed in the successive frames of the shot, the background image is the remaining region of the video image, and the context is the relationship between the low-level features of the adjacent shots. Comparing these features is a result of reflecting the process of filming a moving picture, and it helps the user to submit a query focused on the desired features of the target video clips easily by adjusting their weights in the comparing process. Although the proposed search and retrieval algorithm could not totally reflect the high level semantics of the submitted query video, it tries to reflect the users' requirements as much as possible by considering the context of video clips and by adjusting its weight in the comparing process.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.5
• /
• pp.555-564
• /
• 2016

This paper proposes a time slot allocation scheme for military patrol environments. This proposal comes from analysis of traffic properties in a military patrol environment. In the near future, robots are expected to explore enemy grounds and measure threat, taking the place of human patrol. In order to control such robots, control messages must be extremely accurate. One mistake from the control center could cause a tragedy. Thus, high reliability must be guaranteed. Another goal is to maintain a continual flow of multimedia data sent from patrol robots. That is, QoS (Quality of Service) must be guaranteed. In order to transmit data while fulfilling both attributes, the per-path based centralized TDMA slot allocation scheme is recommended. The control center allocates slots to robots allowing synchronization among robots. Slot allocation collisions can also be avoided. The proposed scheme was verified through the ns-3 simulator. The scheme showed a higher packet delivery ratio than the algorithm in comparison. It also performed with shorter delay time in the downlink traffic transmission scenario than the algorithm in comparison.

• Cartoon and Animation Studies
• /
• s.48
• /
• pp.69-84
• /
• 2017

In order to display various art works such as media art in a multi-display environment, it is necessary to consider contents arrangement. The advantage of having a 1: N or N: N layout instead of a 1: 1 or N: 1 layout between display and content, but a more complex scheme of how to do spatial and temporal layout in multi-display Is required. In order to distribute contents, existing media server solution or programming-based multimedia production software is used. However, it takes much time to rearrange or modify the contents, and it is not easy to modify the contents. Therefore, It is difficult to place content in the environment. In order to solve this problem, various approaches are needed from research on content placement method to development of content placement software that improves the existing method. However, analysis on systematic content placement type supporting it, or interface There is also no access to. In this study, we have summarized the requirements for designing the interface for each type with the aim of making it possible to utilize previously analyzed content layout types in various display activities such as media art in multi - display environment. The requirements of each type of interface were derived based on spatial arrangement and temporal layout type which are most distinguished when content is placed. The contents of the interface requirements are summarized as follows: We expect to be a cornerstone for system development.

• KDI Journal of Economic Policy
• /
• v.32 no.3
• /
• pp.101-137
• /
• 2010

This paper defines markets relating to each paid broadcasting service by applying the test method of critical sales loss to the results of survey to the paid service subscribers. The result confirms the existence of a meaningful competitive relationship--in terms of the Competition Law--among all paid broadcasting services included in this study, or at least analog cable broadcasting, digital cable broadcasting, and real time IPTV(Internet Protocol TV) service. This indicates that current regulations which are being applied to cable TV, satellite broadcasting, and IPTV are actually discriminatory. Based on these analysis results, this paper suggests that the main attention for the improvement of regulations should be focused on regulations which are differently applied to different paid service providers. In particular, Article 20 in the Internet Multimedia Broadcasting Law is interpreted as defining the real-time IPTV as an independent market, thereby having leeway to harm fair competition among different paid service providers. Therefore, that article needs to change to give the right of equal access to contents to all the competing paid service providers. Furthermore, to put teeth in the contents equal access rule, most popular pay channels need to be designated as target contents of the rule. As for the market-share limitation regulations, the paper suggests that an upper limit on the market share should be set based on the total number of subscribers of all the competing paid services and the same limit applied to all the competing paid service providers.

• Journal of IKEEE
• /
• v.9 no.1 s.16
• /
• pp.19-30
• /
• 2005

Packet classification is defined as the action to match the packet with a set of predefined rules. One of classification is to use Ternary Content Addressable Memory hardware search engine that has faster than other algorithmic methods. However, TCAM has some limitations. One of them is that TCAM can not perform range matching efficiently. A range has to be expanded into prefixes to fit the boundary. In general, the number of expansion could be up to 2w-2, where w is the width of the field. For example, if two range fields with 16 bits are used, there could be up to $30\;{\times}\;30\;=\;900$ expansions for a single rule. In this paper, we describe the novel algorithm for converting range matching rules into TCAM entry efficiently. The number of maximum entry is 2w-4 when using the algorithm. Furthermore, it has also benefit about the negation range. In the result of experimentation, the new scheme practically reduces 14 percent in case that searched fields are source port and destination port number.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.531-542
• /
• 1997

In this paper,we propose applicable methodology using simple scenarios for the architecture and its procedure of sibnalling at the NNI for B-ISDN in Korea.By the recent technologies,the flexible and intergrated networks of the future are designed, and the infrastructure hardware and software of those networks are sdsigned based on the modular concepts.Also the ATM-based B-ISDN must be able to support the broadband transmission function for providing various services with diverse bandwidths such as multimedia serivce and the function for controlling services and bandwidth is necessaty.Currently,the trquirements at the NNI for B-ISDN in korea atr based on the network mode connection type which is connection setup strucuture.They must show the upper/lower layer conformance to have the flexibility in new services and guarantee the interoperability between the network functions.But,network functions and protocol specifications described in this paper are limity to the first stage target system in korea.Therefore,we present the modular architecture which is corresponding to the B-ISUP of HAN/B-ISDN with those characteristics.Currently applicable architecture and procedure for B-ISUP and the functions of expandable modular architecture are also proposed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.6
• /
• pp.27-37
• /
• 2008

Applications of 3D data increase with advancement of multimedia technique and contents, and it is necessary to manage and to retrieve for 3D data efficiently. In this paper, we propose a new method using the sliced shape which extracts efficiently a feature description for shape-based retrieval of 3D models. Since the feature descriptor of 3D model should be invariant to translation, rotation and scale for its model, normalization of models requires for 3D model retrieval system. This paper uses principal component analysis(PCA) method in order to normalize all the models. The proposed algorithm finds a direction of each axis by the PCA and creates orthogonal n planes in each axis. These planes are orthogonalized with each axis, and are used to extract sliced shape image. Sliced shape image is the 2D plane created by intersecting at between 3D model and these planes. The proposed feature descriptor is a distribution of Euclidean distances from center point of sliced shape image to its outline. A performed evaluation is used for average of the normalize modified retrieval rank(ANMRR) with a standard evaluation from MPEG-7. In our experimental results, we demonstrate that the proposed method is an efficient 3D model retrieval.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.1
• /
• pp.198-201
• /
• 2015

The prompt and accurate location determination of the nodes of the wireless indoor shipboard networks is crucial to forming the stable wireless shipboard sensor networks. To this end in this paper it can be achieved through the measurement of the bi-directional channel qualities among the nodes after the locations of the sensor nodes temporarily placed. For the 1st stage the piconet-type sensor networks are considered to measure the channel qualities between a specific node and the cluster node which is the master node. After finishing the 1st stage measurement the nodes needing the relay nodes are selected and the measurement action goes into the 2nd stage. In the 2nd stage the measurement between a candidate relay node and the node needing a relay node starts to begin. After the 2nd stage the relay nodes to connect to the cluster node are fixed and the information delivery paths between a node and the cluster head are established. In this paper the measurement results in the realistic environment are gathered and analysed to show that the measurement procedure can be applied in the wireless indoor shipboard networks.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.5
• /
• pp.895-907
• /
• 2020

With the recent increasing influence of multimedia content other than the text-based content, services that help to process information in content brings us great convenience. These services' representative features are searching and masking the sensitive data. It is not difficult to find the solutions that provide searching and masking function for text information and image. However, even though we recognize the necessity of the technology for searching and masking a part of the audio data, it is not easy to find the solution because of the difficulty of the technology. In this study, we propose web application that provides searching and masking functions for audio data using audio partitioning method. While we are achieving the research goal, we evaluated several speech to text conversion APIs to choose a proper API for our purpose and developed regular expressions for searching sensitive information. Lastly we evaluated the accuracy of the developed searching and masking feature. The contribution of this work is in design and implementation of searching and masking a sensitive information from the audio data by the various functionality proving experiments.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.383-390
• /
• 2006

Product-line engineering is a dreaming goal in software engineering research. Unfortunately, the current underlying technologies do not seem to be still not much matured enough to make it viable in the industry. Based on our experiences in working on mobile telephony systems over 3 years, now we are in the course of developing an approach to product-line engineering for mobile telephony system software. In this paper, the experiences are shared together with our research motivation and idea. Consequently, we propose an approach to building and maintaining telephony application logics from the perspective of scenes. As a Domain-Specific Language(DSL), Menu Navigation Viewpoint(MNV) DSL is designed to deal with the problem domain of telephony applications. The functional requirements on how a set of telephony application logics are configured can be so various depending on manufacturer, product concept, service carrier, and so on. However, there is a commonality that all of the currently used telephony application logics can be generally described from the point of user's view, with a set of functional features that can be combinatorially synthesized from typical telephony services(i.e. voice/video telephony, CBS/SMS/MMS, address book, data connection, camera/multimedia, web browsing, etc.), and their possible connectivity. MNV DSL description acts as a backbone software architecture based on which the other types of telephony application logics are placed and aligned to work together globally.