• Title/Summary/Keyword: 멀티미디어 회의 시스템

Search Result 524, Processing Time 0.024 seconds

A Mutual Authentication Protocol based on Hash Function for Efficient Verification of User Entitlement in IPTV Service (IPTV 서비스에서 사용자의 수신자격을 효율적으로 판별할 수 있는 해쉬 함수 기반의 상호 인증 프로토콜)

  • Jeong, Yoon-Su;Kim, Yong-Tae;Jung, Yoon-Sung;Park, Gil-Cheol;Lee, Sang-Ho
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.3
    • /
    • pp.187-197
    • /
    • 2010
  • The fusion stream of recent broadcasting and communication make multimedia content served in the area of broadcasting into IPTV service which transmits it through high-speed internet, cable TV net and satellite net in realtime. However, as the digital broadcasting service is extended to various media, the security of IPTV service content provided to users by service provider is not fully supported by CAS(Conditional Access System) provided by existing broadcasting system. This paper proposes interactive certification protocol which can efficiently distinguish the receiving-qualification of user between Set-Top Box and Smart Card which are parts of configurations for IPTV system. The proposed protocol uses hash function to make Set-Top Box transmit receiving-qualification about the channel fee which user pays more properly than existing protocol. Also, the proposed protocol uses session key generated between receiver and smart card through inter certification process and encrypts EMM not the service to be used by anyone illegally.

Delay Operation Techniques for Efficient MR-Tree on Nand Flash Memory (낸드 플래시 메모리 상에서 효율적인 MR-트리 동작을 위한 지연 연산 기법)

  • Lee, Hyun-Seung;Song, Ha-Yoon;Kim, Kyung-Chang
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.8
    • /
    • pp.758-762
    • /
    • 2008
  • Embedded systems usually utilize Flash Memories with very nice characteristics of non-volatility, low access time, low power and so on. For the multimedia database systems, R-tree is an indexing tree with nice characteristics for multimedia access. MR-tree, which is an upgraded version of R-tree, has shown better performance in searching, inserting and deleting operations than R-tree. Flash memory has sectors and blocks as a unit of read, write and delete operations. Especially, the delete is done on a unit of 512 byte blocks with very large operation time and it is also known that read and write operations on a unit of block matches caching nature of MT-tree. Our research optimizes MR-tree operations in a unit of Flash memory blocks. Such an adjusting leads in better indexing performance in database accesses. With MR-tree on a 512B block units we achieved fast search time of database indexing with low height of MR-tree as well as faster update time of database indexing with the best fit of flash memory blocks. Thus MR-tree with optimized operations shows good characteristics to be a database index schemes on any systems with flash memory.

A Study on 3D Object Retrieval using Reflective Symmetry (반사 대칭을 이용한 3차원 오브젝트 검색에 관한 연구)

  • Song, Ju-Whan;Choi, Seong-Hee;Gwun, Ou-Bong
    • 전자공학회논문지 IE
    • /
    • v.44 no.4
    • /
    • pp.48-54
    • /
    • 2007
  • Due to the diverse utilization of multimedia, interests are increasing towards processing (saving, editing, searching, etc) three dimensional object data. This paper proposes and realizes a retrieval system for three dimensional objects using reflective symmetry. For the retrieval method, a reflective symmetric axis with a projector is used. The symmetric plane is calculated by the reflection symmetry, and the depth buffer is calculated for the symmetric plane. Then, by applying the Fourier Transform to the depth buffer, the feature vector for the object is generated and retrieved. For the sample of inquiry, the model of similar symmetry was extracted using the benchmark data from Konstantz University. Considering that most of the objects have symmetrical characteristics, the proposed method of retrieving three dimensional objects using a reflective symmetric surface is an outstanding retrieval system.

Secure Deletion for Flash Memory File System (플래시메모리 파일시스템을 위한 안전한 파일 삭제 기법)

  • Sun, Kyoung-Moon;Choi, Jong-Moo;Lee, Dong-Hee;Noh, Sam-H.
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.6
    • /
    • pp.422-426
    • /
    • 2007
  • Personal mobile devices equipped with non-volatile storage such as MP3 player, PMP, cellular phone, and USB memory require safety for the stored data on the devices. One of the safety requirements is secure deletion, which is removing stored data completely so that the data can not be restored illegally. In this paper, we study how to design the secure deletion on Flash memory, commonly used as storage media for mobile devices. We consider two possible secure deletion policy, named zero-overwrite and garbage-collection respectively, and analyze how each policy affects the performance of Flash memory file systems. Then, we propose an adaptive file deletion scheme that exploits the merits of the two possible policies. Specifically, the proposed scheme applies the zero-overwrite policy for small files, whereas it employs the garbage-collection policy for large files. Real implementation experiments show that the scheme is not only secure but also efficient.

A Reliable Route Selection Algorithm in Mobile Ad-hoc Networks (이동 애드혹 네트워크에서의 안정 경로 선택 알고리즘)

  • Kim, Won-Ik;Suh, Young-Joo;An, Syung-Og
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.314-323
    • /
    • 2002
  • The routing protocols designed for wired networks can hardly be used for mobile ad-hoc networks due to limited bandwidth of wireless transmission and unpredictable topological change. Recently, several routing protocols for mobile ad-hoc networks have been Proposed. However, when theme protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoc networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable route that is impervious to route failures by topological changes by mobile hoots. For reliable route selection, the concept of virtual zone (stable zone and caution zone) is proposed. The zone is located in a mobile node'transmission range and determined by mobile node's mobility information received by Global Positioning System (GPS). The proposed algorithm is applied to the route discovery procedure of the existing on-demand routing protocol, AODV, and evaluated by simulation in various traffic conditions and mobility patterns.

Semantic-based Scene Retrieval Using Ontologies for Video Server (비디오 서버에서 온톨로지를 이용한 의미기반 장면 검색)

  • Jung, Min-Young;Park, Sung-Han
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.5
    • /
    • pp.32-37
    • /
    • 2008
  • To ensure access to rapidly growing video collection, video indexing is becoming more and more important. In this paper, video ontology system for retrieving a video data based on a scene unit is proposed. The proposed system creates a semantic scene as a basic unit of video retrieval, and limits a domain of retrieval through a subject of that scene. The content of semantic scene is defined using the relationship between object and event included in the key frame of shots. The semantic gap between the low level feature and the high level feature is solved through the scene ontology to ensure the semantic-based retrieval.

Visual Programming Environment for Effective Teaching and Research in Image Processing (영상처리에서 효율적인 교육과 연구를 위한 비주얼 프로그래밍 환경 개발)

  • Lee Jeong Heon;Heo Hoon;Chae Oksam
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.1
    • /
    • pp.50-61
    • /
    • 2005
  • With the wide spread use of multimedia device, the demand for the image processing engineers are increasing in various fields. However there are few engineers who can develop practical applications in the image processing area. To teach practical image processing techniques, we need a visual programming environment which can efficiently present the image processing theories and, at the same time, provide interactive experiments for the theory presented. In this paper, we propose a visual programming environment of the integrated environment for image processing. It consists of the theory presentation systems and experiment systems based on the visual programming environment. The theory presentation systems support multimedia data, web documents and powerpoint files. The proposed system provides an integrated environment for application development as well as education. The proposed system accumulates the teaching materials and exercise data and it manages, an ideal image processing education and research environment to students and instructors.

Digital Watermarking using ART2 Algorithm (ART2 알고리즘을 이용한 디지털 워터마킹)

  • 김철기;김광백
    • Journal of Intelligence and Information Systems
    • /
    • v.9 no.3
    • /
    • pp.81-97
    • /
    • 2003
  • In this paper, we suggest a method of robust watermarking for protection of multimedia data using the wavelet transform and artificial neural network. for the purpose of implementation, we decompose a original image using wavelet transform at level 3. After we classify transformed coefficients of other subbands using neural network except fur the lowest subband LL$_3$, we apply a calculated threshold about chosen cluster as the biggest. We used binary logo watermarks to make sure that it is true or not on behalf of the Gaussian Random Vector. Besides, we tested a method of dual watermark insertion and extraction. For the purpose of implementation, we decompose a original image using wavelet transform at level 3. After we classify transformed coefficients of other subbands using neural network except for the lowest subband LL$_3$, we apply a above mentioned watermark insert method. In the experimental results, we found that it has a good quality and robust about many attacks.

  • PDF

3차 저장 장치의 장착을 위한 MIDAS-II의 확장

  • Kim, Yeong-Seong;Gang, Hyeon-Cheol;Kim, Jun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.1
    • /
    • pp.21-35
    • /
    • 2000
  • MIDAS-II is the storage system for BADA DBMS developed at ETRI. This paper describes the extension of MIDAS-II for incorporating the tertiary storage device such as an optical disk jukebox or a tape library, enabling MIDAS-II to function as a storage system of the data server that stores a massive amount of multimedia data. The MIDAS-II disk volume structure is extended to efficiently function as a volume for the tertiary storage device with multiple platters, which canstore huge amount of data of the order of tera bytes. The storage structure of the LOB is changed to efficiently manage the LOB data in the tertiary storage device. The data structures of the shared memory, the process structure, and the utilities in MIDAS-II are also extended to efficiently incorporating the tertiary storage device. The functionalities of each MIDAS-II API function are expanded to handle the tertiary storage device, while the prototypes of those functions are intact in order not to affect the existing application programs. The performance evaluation shows that the extended MIDAS-II works effectively with the tertiary storage device. All these extensions and the performance evaluation are conducted in the SunOS 5.4 environment.

  • PDF

Design and Implementation of Web Interworking Learning System Using VoiceXML (VoiceXML을 이용한 Web 연동 학습 시스템 설계 및 구현)

  • Kim Dong-Hyun;Cho Chang-Su;Shin Jeong-Hoon;Hong Kwang-Seok
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.2 s.302
    • /
    • pp.21-30
    • /
    • 2005
  • Development of both multimedia technology and communication network technology has accomplished many changes through the field of learning system. For the construction of a more efficient and clever learning system there is a research being done by the use of the Web and the telephone network. But until now, the case of current implemented teaming system is single system and so it has each merits and demerits. That is to say, when we use the learning system through the Web, the demerit is only possible by the static states using computer. For those who do not use the computer, the demerit is that the user must learn the use of the new system. Also, the case of using telephone network has merits that one can use the system anyplace, anytime by the telephone. But it has the problem of not being able to transmit information very efficiently. From these, this paper proposes the learning system that can be used efficiently and conveniently anyplace, anytime by connecting both telephone network and web. Also, we propose a new algorithm of user ID, password and name registration function using teaming system using VoiceXML and individual learning progress save function using VoiceXML and web.