• Title/Summary/Keyword: Video information indexing

Search Result 160, Processing Time 0.02 seconds

XML Repository System Using DBMS and IRS

  • Kang, Hyung-Il;Yoo, Jae-Soo;Lee, Byoung-Yup
    • International Journal of Contents
    • /
    • v.3 no.3
    • /
    • pp.6-14
    • /
    • 2007
  • In this paper, we design and implement a XML Repository System(XRS) that exploits the advantages of DBMSs and IRSs. Our scheme uses BRS to support full text indexing and content-based queries efficiently, and ORACLE to store XML documents, multimedia data, DTD and structure information. We design databases to manage XML documents including audio, video, images as well as text. We employ the non-composition model when storing XML documents into ORACLE. We represent structured information as ETID(Element Type Id), SORD(Sibling ORDer) and SSORD(Same Sibling ORDer). ETID is a unique value assigned to each element of DTD. SORD and SSORD represent an order information between sibling nodes and an order information among the sibling nodes with the same element respectively. In order to show superiority of our XRS, we perform various experiments in terms of the document loading time, document extracting time and contents retrieval time. It is shown through experiments that our XRS outperforms the existing XML document management systems. We also show that it supports various types of queries through performance experiments.

Design and Implementation of a news Archive System using Shot Types (샷의 타입을 이용한 뉴스 아카이브 시스템의 설계 및 구현)

  • Han, Keun-Ju;Nang, Jong-Ho;Ha, Myung-Hwan;Jung, Byung-Hee;Kim, Kyeong-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.5
    • /
    • pp.416-428
    • /
    • 2001
  • In order to build a news archive system. the news video stream should be first segmented into several articles, ad their contents are abstracted effectively. This abstraction helps the users to understand the contents of the article without playing the whole video stream. This paper proposes a new article boundary detection scheme for the news video streams together with a new news article abstraction scheme using the shot types of the news video data. The shots in the news video are classified into anchor person shots, interview shots, speech shots, reporting shots, graphic shots, and others. Since the news article starts with an anchor shot whose duration is relatively longer than other shots with special screen structure, the article boundary in detected by the computing the length of the shot and checking the screen structure in the proposed scheme. For the effective abstraction of the article video, the graphic image located in the right-top of the anchor shot frames is primarily used in the proposed abstraction scheme since it is the abstraction of the article made by the producer of the news according to its contents so that it contains a lot of meaningful information. The key frames of the other shots except interview and report shots are also used to abstract the contents of the articles in the proposed scheme. Upon experimental results, the precision and recall values of the proposed article boundary detection scheme could be 92% and 96%, respectively. This paper also presents a design and implementation of a prototype news archive system on WWW that consists of an indexing tool, an authoring tool, a database for meta-data of the news, and a browsing tool.

  • PDF

Fast Scene Change Detection Algorithm in MPEG Compressed Video by Minimal Decoding (MPEG으로 압축된 비디오에서 최소 복호화에 의한 빠른 장면전환검출 알고리듬)

  • Kim, Gang-Uk;Lee, Jae-Seung;Kim, Jong-Hun;Hwang, Chan-Sik
    • The KIPS Transactions:PartB
    • /
    • v.9B no.3
    • /
    • pp.343-350
    • /
    • 2002
  • A scene change detection which involves finding a cut between two consecutive shots is an important step for video indexing and retrieval. This paper proposes an algorithm for fast and accurate detection of abrupt scene changes in an MPEG compressed domain with minimal decoding requirements arid computational effort. The proposed method compares two successive DC images of I-frames for finding the GOP (group of picture) which contain a scene change and uses macroblock-coded type information contained in B-frames to detect the exact frame where the scene change occurred. The experiment results demonstrate that the proposed algorithm has better detection performance, such as precision and recall rate, than the existing method using all DC images. The algorithm has the advantage of speed, simplicity and accuracy. In addition, it requires less amount of storage.

User control based OTT content search algorithms (사용자 제어기반 OTT 콘텐츠 검색 알고리즘)

  • Kim, Ki-Young;Suh, Yu-Hwa;Park, Byung-Joon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.5
    • /
    • pp.99-106
    • /
    • 2015
  • This research is focused on the development of the proprietary database embedded in the OTT device, which is used for searching and indexing video contents, and also the development of the search algorithm in the form of the critical components of the interface application with the OTT's database to provide video query searching, such as remote control smartphone application. As the number of available channels has increased to anywhere from dozens to hundreds of channels, it has become increasingly difficult for the viewer to find programs they want to watch. To address this issue, content providers are now in need of methods to recommend programs catering to each viewer's preference. the present study aims provide of the algorithm which recommends contents of OTT program by analyzing personal watching pattern based on one's history.

A Signature-based Video Indexing Scheme using Spatio-Temporal Modeling for Content-based and Concept-based Retrieval on Moving Objects (이동 객체의 내용 및 개념 기반 검색을 위한 시공간 모델링에 근거한 시그니쳐 기반 비디오 색인 기법)

  • Sim, Chun-Bo;Jang, Jae-U
    • The KIPS Transactions:PartD
    • /
    • v.9D no.1
    • /
    • pp.31-42
    • /
    • 2002
  • In this paper, we propose a new spatio-temporal representation scheme which can model moving objets trajectories effectively in video data and a new signature-based access method for moving objects trajectories which can support efficient retrieval on user query based on moving objects trajectories. The proposed spatio-temporal representation scheme supports content-based retrieval based on moving objects trajectories and concept-based retrieval based on concepts(semantics) which are acquired through the location information of moving objects trajectories. Also, compared with the sequential search, our signature-based access method can improve retrieval performance by reducing a large number of disk accesses because it access disk using only retrieved candidate signatures after it first scans all signatures and performs filtering before accessing the data file. Finally, we show the experimental results that proposed scheme is superior to the Li and Shan's scheme in terns of both retrieval effectiveness and efficiency.

Estimation of Lifetime Data Storage Capacity for Human Senses (인간 감각 정보를 위한 평생 기억용량 평가)

  • You, Young-Gap;Song, Young-Jun;Kim, Dong-Woo
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.1
    • /
    • pp.23-29
    • /
    • 2009
  • This paper presents a capacity estimation of a storage system accumulating all data sensed during the lifetime of an individual human being. The calculation assumes modern data compression and data collection schemes based on wearable or implanted devices under ubiquitous environment. More than 76% of the storage area is found to be used for video data storage of common TV image quality. The remaining storage area is for data from other sensing organs including audio, taste, olfactory and tactual systems in addition to indexing information. Total storage area of around 600 tera bytes is needed to cover 100 years of human life including his fetal period.

Indexing for irregular structured video using template (Template 을 이용한 동영상 비정규 구조 색인 방법)

  • Kwon, Soon-Yong;Oh, Sang-Wook;Yoon, Ja-Cheon;Sull, Sang-Hoon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.05a
    • /
    • pp.189-192
    • /
    • 2005
  • 동영상 데이터가 급증하면서 뉴스 검색과 같은 검색 서비스를 위한 내용 기반의 색인 방법에 대한 관심이 높아지고 있다. 이에 따른 최근의 동영상 색인 기술들은 특히 용량이 큰 동영상에서 자동 또는 반자동으로 색인하기 위한 방법들을 소개하고 있으며, 대부분 저수준 특징(low-level feature)들을 이용하여 특정 구간을 검출하는 방법을 사용하고 있다. 그러나 저수준 특징만을 이용할 경우 고수준 특징(high-level feature)이 나타내는 인지적 측면에서의 동영상 내용을 다룰수 없어, 사용자가 일일이 내용에 따른 구분 작업을 병행해야 하는 단점을 갖고 있다. 본 논문에서는 뉴스와 같이 시간적으로 비정규적이지만 내용에 따라 구조를 지니고 있는 동영상에 대해서, 저수준 특징만을 사용하여 고수준 특징을 이용한 것과 같은 성능으로 사용자가 수행해야 하는 작업을 최소화하는 내용 기반 구간 검출 방법에 의한 색인 방법을 제안한다. 특히 저수준 특징을 이용한 프로그램 구간 검출은 빠른 처리 및 효과적인 검출 성능 보이고 있어, 본 논문에서 제안한 비정규 구조 색인 방법이 내용 기반 색인에 매우 효과적임을 보여주고 있다.

  • PDF

Bandwidth-Efficient Live Virtual Reality Streaming Scheme for Reducing View Adaptation Delay

  • Lee, Jongmin;Lee, Joohyung;Lim, Jeongyeon;Kim, Maro
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.291-304
    • /
    • 2019
  • This paper proposes a dynamic-tiling-based bandwidth-efficient (DTBE) virtual reality (VR) streaming scheme. We consider 360-degree VR contents with multiple view points such as the front, back, upper, and bottom sides. At a given time, the focus of a client is always bound to a certain view among multiple view points. By utilizing this perspective, under our proposed scheme, tiles with high encoding rates are selectively assigned to the focused view where multiple view points consist of multiple tiles with different encoding rates. The other tiles with low encoding rates are assigned to the remaining view points. Furthermore, for reducing view adaptation delay, we design a novel rapid view adaptation mechanism that selectively delivers an I-frame during view point updates by using frame indexing. We implement the proposed scheme on a commercial VR test bed where we adopt the MPEG media transport (MMT) standard with high-efficiency video coding (HEVC) tile modes. The measurement-based experiments show that the proposed scheme achieves an average data usage reduction of almost 65.2% as well as average view adaptation delay reduction of almost 57.7%.

Detecting Faces on Still Images using Sub-block Processing (서브블록 프로세싱을 이용한 정지영상에서의 얼굴 검출 기법)

  • Yoo Chae-Gon
    • The KIPS Transactions:PartB
    • /
    • v.13B no.4 s.107
    • /
    • pp.417-420
    • /
    • 2006
  • Detection of faces on still color images with arbitrary backgrounds is attempted in this paper. The newly proposed method is invariant to arbitrary background, number of faces, scale, orientation, skin color, and illumination through the steps of color clustering, cluster scanning, sub-block processing, face area detection, and face verification. The sub-block method makes the proposed method invariant to the size and the number of faces in the image. The proposed method does not need any pre-training steps or a preliminary face database. The proposed method may be applied to areas such as security control, video and photo indexing, and other automatic computer vision-related fields.

Thumbnail Generation at Progressive Mode of H.264/AVC (H.264/AVC의 Progressive Mode에서 Thumbnail 영상 생성)

  • Oh, Hyung-Suk;Kim, Won-Ha
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.1
    • /
    • pp.23-32
    • /
    • 2011
  • In this paper, we develop a method for generating thumbnail images at hybrid domain combined the spatial domain and transform domain. The proposed method generates a pixel of a thumbnail image by adding a DC value of residual transform coefficients and an average value of an estimate block. For effectively calculating average values of estimate blocks, we propose a method for reconstructing the boundary pixels of a block. In comparison to the conventional method of decoding the bit stream then scaling down the decoded images, the developed method reduces the complexity by more than 60% while producing identical thumbnail images.