Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartB
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 12B, Issue 7 - Dec 2005
Volume 12B, Issue 6 - Oct 2005
Volume 12B, Issue 5 - Oct 2005
Volume 12B, Issue 4 - Aug 2005
Volume 12B, Issue 3 - Jun 2005
Volume 12B, Issue 2 - Apr 2005
Volume 12B, Issue 1 - Feb 2005
Selecting the target year
MPEG-4 Contents Authoring with Mobile Device for Digital Multimedia Broadcasting
Li, Song-Lu ; Kim, Sang-Wook ;
The KIPS Transactions:PartB, volume 12B, issue 6, 2005, Pages 631~636
DOI : 10.3745/KIPSTB.2005.12B.6.631
Recently, research started to focus on Digital Multimedia Broadcasting(DMB), while the DMB service is already being launched to provide high quality audio, video and data broadcasting in Korea. Therefore, the demand for multimedia contents is also rose very sharply. In this paper, we introduced an MPEG-4 contents authoring system with mobile device for Digital Multimedia Broadcasting. Our system allows both single-handed and collaborative authoring modo. Further more, to overcome the delaytime for decoding the BIFS information, we also introduced an efficient algorithm to generate dynamic and light BIFS information.
DCT-domain MPEG-2/H.264 Video Transcoder System Architecture for DMB Services
Lee Joo-Kyong ; Kwon Soon-Young ; Park Seong-Ho ; Kim Young-Ju ; Chung Ki-Dong ;
The KIPS Transactions:PartB, volume 12B, issue 6, 2005, Pages 637~646
DOI : 10.3745/KIPSTB.2005.12B.6.637
Most of the multimedia contents for DBM services art provided as MPEG-2 bit streams. However, they have to be transcoded to H.264 bit streams for practical services because the standard video codec for DMB is H.264. The existing transcoder architecture is Cascaded Pixel-Domain Transcoding Architecture, which consists of the MPEG-2 dacoding phase and the H.264 encoding phase. This architecture can be easily implemented using MPEG-2 decoder and H.264 encoder without source modifying. However. It has disadvantages in transcoding time and DCT-mismatch problem. In this paper, we propose two kinds of transcoder architecture, DCT-OPEN and DCT-CLOSED, to complement the CPDT architecture. Although DCT-OPEN has lower PSNR than CPDT due to drift problem, it is efficient for real-time transcoding. On the contrary, the DCT-CLOSED architecture has the advantage of PSNR over CPDT at the cost of transcoding time.
PSIP Converter based on PMCP for Terrestrial/Cable Data Broadcasting Retransmission Service
Choi Ji Hoon ; Kim Yong Ho ; Choi Jin Soo ; Hong Jin Woo ;
The KIPS Transactions:PartB, volume 12B, issue 6, 2005, Pages 647~654
DOI : 10.3745/KIPSTB.2005.12B.6.647
In this paper, we implemented a terrestrial/cable PSIP converting system, so-called a PSIP converter, which is converting a terrestrial PSIP into a cable PSIP for a data broadcasting service in the interoperable network of terrestrial and cable, and define an interface between the PSIP converter and the OOB SI generator by using PMCP messages compliant to ATSC T3/Sl. The exiting PSIP converter just converts a terrestrial PSIP into a cable PSIP compliant to ATSC and OCAP standard and transmits by a MPEG-2 TS format. That is to say, it is not for the digital data broadcasting but for the digital broadcasting. In addition, the PSIP converter can support various types of PSIP information to the OOB SI generator by using PMCP messages defined by a hierarchical structure as per each channel, audio/video event, data event and so on.
A Study on Personalized Data Broadcasting Service using TV-Anytime Metadata
Kim Yong Ho ; Lee Han-kyu ; Choi Jin Soo ; Hong Jin Woo ;
The KIPS Transactions:PartB, volume 12B, issue 6, 2005, Pages 655~660
DOI : 10.3745/KIPSTB.2005.12B.6.655
The number of broadcasting channels and contents are increasing with the arrival of digital broadcast and various broadcasting medium. However, there is a limit on searching of the program by using conventional program guide. Therefore, personalized broadcasting service to provide the environment, that user is able to consume his/her customized broadcasting contents at anytime, is standardized by TV-Anytime Forum. Especially. the structure of data broadcasting contents have different from that of AV contents. Therefore, it is necessary to new structure of the metadata for personalized data broadcasting service and new mechanism for data flow of broadcasting system. In this paper, we introduce a method for personalized data broadcasting service using TV-Anytime metadata.
Stream Synchronization Mechanism using Variable Buffers and Insertion of Interactive Objects
Lee, Yang-Min ; Lee, Jae-Kee ;
The KIPS Transactions:PartB, volume 12B, issue 6, 2005, Pages 661~670
DOI : 10.3745/KIPSTB.2005.12B.6.661
According as services that offer multimedia streams are activated on the Internet, users who use these services we increased extremely. As a result of this, the increase of network traffic was occurred. Also it caused the problems such as the discontinuous playback in case of the s#ream playback and the asynchronization between a video and an audio. To solve these problems, it needs a method that guarantee the stable playback of media streams and a method of media transfer that can interact between a service user and media. Existing related researches has achieved the synchronization through various methods, but did not shown the results of satisfaction in the aspect of interaction. In this paper, we inserted the interactive objects in each media file, designed functions that these objects can use each other`s information, and solved the interaction and the synchronization between a video and an audio. Also, we solved the discontinuous playback of a stream by the insufficiency of network bandwidth through using variable buffers.
Image Separation of Talker from a Background by Differential Image and Contours Information
Park Jong-Il ; Park Young-Bum ; Yoo Hyun-Joong ;
The KIPS Transactions:PartB, volume 12B, issue 6, 2005, Pages 671~678
DOI : 10.3745/KIPSTB.2005.12B.6.671
In this paper, we suggest an algorithm that allows us to extract the important obbject from motion pictures and then replace the background with arbitrary images. The suggested technique can be used not only for protecting privacy and reducing the size of data to be transferred by removing the background of each frame, but also for replacing the background with user-selected image in video communication systems including mobile phones. Because of the relatively large size of image data, digital image processing usually takes much of the resources like memory and CPU. This can cause trouble especially for mobile video phones which typically have restricted resources. In our experiments, we could reduce the requirements of time and memory for processing the images by restricting the search area to the vicinity of major object`s contour found in the previous frame based on the fact that the movement of major object is not wide or rapid in general. Specifically, we detected edges and used the edge image of the initial frame to locate candidate-object areas. Then, on the located areas, we computed the difference image between adjacent frames and used it to determine and trace the major object that might be moving. And then we computed the contour of the major object and used it to separate major object from the background. We could successfully separate major object from the background and replate the background with arbitrary images.
Power Aware Vertical Handoff Algorithm for Multi-Traffic Environment in Heterogeneous Networks
Seo, Sung-Hoon ; Lee, Seung-Chan ; Song, Joo-Seok ;
The KIPS Transactions:PartB, volume 12B, issue 6, 2005, Pages 679~684
DOI : 10.3745/KIPSTB.2005.12B.6.679
There are a few representative wireless network access technologies used widely. WWAN is celluar based telecommunication networks supporting high mobility, WLAN ensures high data rate within hotspot coverage, and WDMB support both data and broadcasting services correspondingly. However, these technologies include some limitations especially on the mobility, data rate, transmission direction, and so on. In order to overvome these limitations, there are various studies have been proposed in terms of `Vortical Handoff` that offers seamless connectivity by switching active connection to the appropriate interface which installed in the mobile devices. In this paper, we propose the interface selection algorithm and network architecture to maximize the life time of entire system by minimizing the unnecessary energy consumption of another interfaces such as WLAN, WDMB that are taken in the user equipment. In addition, by using the results of analyzing multiple types of traffic and managing user buffer as a metric for vertical handoff, we show that the energy efficiency of our scheme is
than typical WLAN for WDMB and WLAN preferred schemes, correspondingly.
A Study on the Traffic Agent for Overlay Multicast
Ko Joo-Young ; Shim Jae-Chang ; Kim Hyun-Ki ;
The KIPS Transactions:PartB, volume 12B, issue 6, 2005, Pages 685~690
DOI : 10.3745/KIPSTB.2005.12B.6.685
Recently, studies for effective multimedia data delivery have been widely performed. Among those researches, internet broadcasting is a technology to transmit various multimedia contents to variety of costumers on the internet simultaneously. To deliver large scale multimedia data such as internet broadcasting, efficient data delivery method is required. Therefore, technologies based on the overlay multicast of application larger multicast application are actively studied as an alternative for multicast overcoming shortcoming of uni-cast based technologies, which we one to one transmission methods. In this paper, we classify and study on the overlay multicasting for internet broadcasting, which can be implemented by application programs without modification in physical layer of the internet.
Sentence Compression of Headline-style Abstract for Displaying in Small Devices
Lee, Kong-Joo ;
The KIPS Transactions:PartB, volume 12B, issue 6, 2005, Pages 691~696
DOI : 10.3745/KIPSTB.2005.12B.6.691
In this paper, we present a pilot system that tn compress a Korean sentence automatically using knowledge extracted from news articles and their headlines. A sot of compressed sentences can be presented as an abstraction of a document. As a compressed sentence is of headline-style, it could be easily displayed on small devices, such as mobile phones and other handhold devices. Our compressing system has shown to be promising through a preliminary experiment.
A Focused Crawler by Segmentation of Context Information
Cho, Chang-Hee ; Lee, Nam-Yong ; Kang, Jin-Bum ; Yang, Jae-Young ; Choi, Joong-Min ;
The KIPS Transactions:PartB, volume 12B, issue 6, 2005, Pages 697~702
DOI : 10.3745/KIPSTB.2005.12B.6.697
The focused crawler is a topic-driven document-collecting crawler that was suggested as a promising alternative of maintaining up-to-date web document Indices in search engines. A major problem inherent in previous focused crawlers is the liability of missing highly relevant documents that are linked from off-topic documents. This problem mainly originated from the lack of consideration of structural information in a document. Traditional weighting method such as TFIDF employed in document classification can lead to this problem. In order to improve the performance of focused crawlers, this paper proposes a scheme of locality-based document segmentation to determine the relevance of a document to a specific topic. We segment a document into a set of sub-documents using contextual features around the hyperlinks. This information is used to determine whether the crawler would fetch the documents that are linked from hyperlinks in an off-topic document.
Automatic Text Categorization Using Passage-based Weight Function and Passage Type
Joo, Won-Kyun ; Kim, Jin-Suk ; Choi, Ki-Seok ;
The KIPS Transactions:PartB, volume 12B, issue 6, 2005, Pages 703~714
DOI : 10.3745/KIPSTB.2005.12B.6.703
Researches in text categorization have been confined to whole-document-level classification, probably due to lacks of full-text test collections. However, full-length documents availably today in large quantities pose renewed interests in text classification. A document is usually written in an organized structure to present its main topic(s). This structure can be expressed as a sequence of sub-topic text blocks, or passages. In order to reflect the sub-topic structure of a document, we propose a new passage-level or passage-based text categorization model, which segments a test document into several Passages, assigns categories to each passage, and merges passage categories to document categories. Compared with traditional document-level categorization, two additional steps, passage splitting and category merging, are required in this model. By using four subsets of Routers text categorization test collection and a full-text test collection of which documents are varying from tens of kilobytes to hundreds, we evaluated the proposed model, especially the effectiveness of various passage types and the importance of passage location in category merging. Our results show simple windows are best for all test collections tested in these experiments. We also found that passages have different degrees of contribution to main topic(s), depending on their location in the test document.
Face Recognitions Using Centroid Shift and Neural Network-based Principal Component Analysis
Cho Yong-Hyun ;
The KIPS Transactions:PartB, volume 12B, issue 6, 2005, Pages 715~720
DOI : 10.3745/KIPSTB.2005.12B.6.715
This paper presents a hybrid recognition method of first moment of face image and principal component analysis(PCA). First moment is applied to reduce the dimension by shifting to the centroid of image, which is to exclude the needless backgrounds in the face recognitions. PCA is implemented by single layer neural network which has a teaming rule of Foldiak algorithm. It has been used as an alternative method for numerical PCA. PCA is to derive an orthonormal basis which directly leads to dimensionality reduction and possibly to feature extraction of face image. The proposed method has been applied to the problems for recognizing the 48 face images(12 Persons
4 scenes) of 64
64 pixels. The 3 distances such as city-block, Euclidean, negative angle are used as measures when match the probe images to the nearest gallery images. The experimental results show that the proposed method has a superior recognition performances(speed, rate). The negative angle has been relatively achieved more an accurate similarity than city-block or Euclidean.