• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.67-79
• /
• 2007

As the Web technologies and wired/wireless network are improved and various new multimedia services are introduced recently, need for searching multimedia including video data has been much increasing, The previous approaches for multimedia retrieval, however, do not make use of the relationships among semantic concepts contained in multimedia contents in an efficient way and provide only restricted search results, This paper proposes a multimedia retrieval system exploiting semantic relevancy of multimedia contents based on a domain ontology, We show the effectiveness of the proposed system by experiments on a prototype system we have developed. The proposed multimedia retrieval system can extend a given search keyword based on the relationships among the semantic concepts in the ontology and can find a wide range of multimedia contents having semantic relevancy to the input keyword. It also presents the results categorized by the semantic meaning and relevancy to the keyword derived from the ontology. Independency of domain ontology with respect to metadata on the multimedia contents is preserved in the proposed system architecture.

• Journal of Korea Multimedia Society
• /
• v.14 no.11
• /
• pp.1491-1499
• /
• 2011

Now a days, to make good use of tags is a general tendency when users need to upload or search some multimedia data such as images and videos on the Web. In this paper, we introduce an approach to calculate semantic importance of tags and to make re-ranking with them on tagged Web image retrieval. Generally, most photo images stored on the Web have lots of tags added with user's subjective judgements not by the importance of them. So they become the cause of precision rate decrease with simple matching of tags to a given query. Therefore, if we can select semantically important tags and employ them on the image search, the retrieval result would be enhanced. In this paper, we propose a method to make image retrieval re-ranking with the key tags which share more semantic information with a query or other tags based on Wikipedia-based semantic relatedness. With the semantic relatedness calculated by using huge on-line encyclopedia, Wikipedia, we found the superiority of our method in precision and recall rate as experimental results.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.5 no.2
• /
• pp.54-68
• /
• 2002

In this paper, We propose a multi-dimensional index structure, called a VA (vector approximate) -tree that constructs a tree with vector approximates of multi-dimensional feature vectors. To save storage space for index structures, the VA-tree employs vector approximation concepts of VA-file that presents feature vectors with much smaller number of bits than original value. Since the VA-tree is a tree structure, it does not suffer from performance degradation owing to the increase of data. Also, even though the VA-tree is MBR Minimum Bounding Region) based tree structure like a R-tree, its split algorithm never allows overlap between MBRs. We show through various experiments that our proposed VA-tree is the efficient index structure for large amount of multi-dimensional data.

• Archives of design research
• /
• v.15 no.1
• /
• pp.93-100
• /
• 2002

The University's web library is a form of library that enables to deal with information about searching loaning, returning of books or data housed in it through web. With the advent of the network and multimedia following the entrance to an information-oriented society, we are experiencing a big change in how to communicate and acquire information. Massive multimedia information transmitted by image and moving picture through the network, made it possible to overstep the limit of the physical gap between information suppliers and users. Despite this important role, it is accompanied by problems such as copyright, scarcity of recognition, paralysis of infra, technical matters and reliability which demand development. In this thesis, according to the State University Evaluation Standards, search node and user interface by system used in 20 different universities possessing web-based library sites were compared are analysed. On the basis of this, an experimental user interface for web-based University libraries was produced, and various questionnaires and data leer this produced interface were collected, classified and analyzed. With the application of the results for the work above to the general search system interface of the web-based library, we proposed a new user interface that contains the following functions, such as location and loan condition of books, search frequency and steps for purchasing books inside the web library.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11C
• /
• pp.1541-1550
• /
• 2004

In this paper, we propose an advanced hardware architecture for fast multi-resolution motion estimation of the video coding standard MPEG-1,2 and MPEG-4 AVC. We describe the algorithm and derive hardware architecture emphasizing the importance of area for low cost and fast operation by using the shared memory, the special ram architecture, the motion vector for 4 pixel x 4 pixel, the spiral search and so on. The proposed architecture has been verified by ARM-interfaced emulation board using Excalibur Altera FPGA and also by ASIC synthesis using Samsung 0.18 m CMOS cell library. The ASIC synthesis result shows that the proposed hardware can operate at 140 MHz, processing more than 1,100 QCIF video frames or 70 4CIF video frames per second. The hardware is going to be used as a core module when implementing a complete MPEG-4 AVC video encoder ASIC for real-time multimedia application.

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

We porpose a new VLSI architecture for the three step search algorithm for the mition estimation of moving images.In the proposed architecture the regular data input is possible and the data are passed through all computational processes ,minimiuzing the input bandwidth.The performandce is analyzed in detail,and compared with other architectures.The performance is approaching to the ideal computation speed,with less hardware than for the existing architectures.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.7
• /
• pp.1260-1266
• /
• 2007

The information and communication technology under developing from was time of broadcast and communication Convergence. There is iCOD with representative service of broadcast and communication Convergence. This the superhigh speed Internet about under using is the service which provides information service, the video contents and broadcasting and others with TV. But this service when it searches broadcasting information of different Channel, again must analyze the stream of broadcasting there is a problem point. This thesis hereupon iCOD broadcasting services it searched efficiently from the terminal and in order the fact that it selects from iCOD broadcasting streams SI information about under extracting SD&S base iPG XML documents it created and it transmits with the distant mote cast the method which and it planned it embodied.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6C
• /
• pp.624-633
• /
• 2003

We propose a novel method of selecting key VOPs from MPEG-4 compressed domain without fully decoding the compressed data. Approximated shapes of VOPs are obtained from the shape coding mode and then VOPs are clustered by shape similarity to generate key VOPs. The proposed method reduces the computation time of shape approximation, compared with Erol's method. Nevertheless, the resulting VOPs have a good summarizing capability of a video sequence. NMHD (normalized mean Hausdorff distance) values are 2-means clustered to generate key VOPs. In the video search, the MHD of a query VOP from key VOPs are computed and the VOP with the lowest distance is returned. Tests on standard MPEG-4 test sequences show that the computational complexity is very low. Recursive clustering proved to be very effective for generating suitable key VOPs.

• Journal of KIISE:Databases
• /
• v.37 no.5
• /
• pp.228-237
• /
• 2010

Although conventional index structures provide various nearest-neighbor search algorithms for high-dimensional data, there are additional requirements to increase search performances as well as to support index scalability for large scale data. To support these requirements, we propose a distributed high-dimensional indexing structure based on cluster systems, called a Distributed Vector Approximation-tree (DVA-tree), which is a two-level structure consisting of a hybrid spill-tree and VA-files. We also describe the algorithms used for constructing the DVA-tree over multiple machines and performing distributed k-nearest neighbors (NN) searches. To evaluate the performance of the DVA-tree, we conduct an experimental study using both real and synthetic datasets. The results show that our proposed method contributes to significant performance advantages over existing index structures on difference kinds of datasets.

• Journal of Digital Contents Society
• /
• v.15 no.3
• /
• pp.339-346
• /
• 2014

VOD Service, which has established a solid foothold as a profit model of digital broadcasting companies, is emerging as a key application of the N-screen technologies and services. In the circumstance, broadcasting companies are trying to promoting their VOD services by providing mobile services for improving the VOD service usability. The paper introduces a VOD mobile app (of a domestic digital cable broadcasting), which includes the functions of promoting the VOD programs and events printed on a VOD guide book, directly transmitting the information (e.g., book-marking and remote-control signals) to a set-top box, and watching the video contents stored in the mobile device on TV.