Object Store Method for Interactive Multimedia Broadcasting

Dae-Young Han, Bu-Hyun Hwang, Daein Kim, Jaein Kim, Choul-Su NaThe Journal of the Korea Contents Association 2009 · DOI

Abstract

With the commercialization of data broadcasting through communication and broadcasting convergence, interactive multimedia services providing additional information about on-screen objects have become possible. A critical factor in these services is user-centric interoperability, which allows for immediate information retrieval upon user request. This paper proposes an efficient object storage method to enhance this interoperability. The proposed method identifies the "Object’s Own Area" (OOA) within a mask video, partitions it into equal blocks, and clusters these areas into bit-sum formats based on a minimum object density threshold. Experimental results demonstrate that this approach significantly reduces the storage space required for object position information compared to traditional methods, improving overall system efficiency.

Introduction

In the era of interactive broadcasting, viewers expect to engage directly with content—for instance, clicking on a product in a commercial or an ingredient in a cooking show to access more information. Enabling this functionality requires the system to track the precise coordinates of interactive objects across every video frame. Traditionally, this is achieved using mask videos, where the object of interest is isolated in white against a black background. However, high-definition mask videos impose massive storage and bandwidth burdens, often exceeding the processing capabilities of standard Set-Top Boxes (STBs).

The BitSum Clustering for Mask (BSCM) Algorithm

To address these storage challenges, we propose the BitSum Clustering for Mask (BSCM) algorithm. This method shifts from storing raw pixel-based masks to a structured, compressed data format that is both space-efficient and computationally light for real-time interaction.

The procedural flow of the BSCM algorithm for efficient object data storage.

The BSCM process consists of five primary stages:

  1. Object’s Own Area (OOA) Extraction: The algorithm first identifies the smallest rectangular bounding box that encompasses the entire object, ignoring the rest of the frame.
  2. Equal Partitioning: The OOA is divided into a grid of blocks, each of size $D \times D$. This grid-based approach simplifies the spatial representation of the object.
  3. Density Filtering (Min_Rate): For each block, the algorithm calculates the ratio of object pixels to total pixels. If this density is below a predefined threshold ($Min\_Rate$), the block is discarded. This removes insignificant edge details to save space.
  4. BitSum Clustering: The indices of the remaining "active" blocks are stored as bitsets (BitSums). This allows the STB to perform extremely fast bitwise operations to determine if a user's click coordinates fall within an interactive region.
  5. Temporal Sampling (Frame Interval): To further reduce data volume, the algorithm employs a Frame Interval ($FI$) parameter, storing object data only every $N$ frames for objects with predictable motion.
Illustration of the OOA partitioned into a grid of blocks (D) for BitSum representation.

Experimental Results and Discussion

The proposed method was tested using HD (1280x720) mask videos. The experiments focused on the trade-off between storage efficiency and object representation accuracy.

  • Spatial Compression: By utilizing a $20 \times 20$ block grid instead of raw pixel data, the spatial information was reduced to approximately 1/40th of its original size.
  • Temporal Compression: Setting the Frame Interval ($FI$) to 10 effectively reduced the data volume by 90% without significantly impacting the user experience for moderately moving objects.
  • Parameter Sensitivity: Increasing the $Min\_Rate$ threshold led to a decrease in the number of stored clusters, demonstrating that broadcasters can tune this parameter based on their specific storage and precision requirements.

Conclusion

The BSCM algorithm provides a robust framework for managing interactive object data in multimedia broadcasting. By combining spatial gridding with bit-sum clustering and temporal sampling, the method achieves high compression ratios while remaining hardware-friendly for low-power Set-Top Boxes. Future research will explore handling complex scenes with multiple overlapping objects and dynamically adjusting parameters based on object velocity to further optimize the balance between precision and performance.

Summary updated

Abstract

통방융합으로 인한 데이터 방송이 상용화됨에 따라 멀티미디어 객체에 대한 다양한 부가 정보를 제공하는 대화형 멀티미디어 방송 서비스가 가능하게 되었다. 대화형 멀티미디어 방송의 중요한 요소 중 하나는 방송 제공자와 시청자와의 데이터 상호 운용성이다. 상호 운용성이 높을수록 사용자의 요청이 있을때 즉각적으로 시청자 관심 객체에 대한 정보를 제공할 수 있다. 본 논문에서는 대화형 멀티미디어 방송의 상호 운용성을 높이기 위한 객체 저장 방법을 제안한다. 제안 방법은 객체의 마스크 영상에서 객체 영역을 균등 분할하고, 각 영역에 대하여 객체정보 포함 최소 비율 검사를 통해 저장 영역을 비트합 형태로 군집화하여 저장한다. 그리고 실험을 통하여, 제안하는 방법이 기존의 대화형 멀티미디어 방송에 비하여 객체영역 정보 저장을 위한 공간 사용을 줄임으로써 보다 효율적임을 확인한다. Interactive multimedia broadcasting can serve various additional information of object in multimedia because of the commercialized data broadcasting by communication and broadcasting convergence. One of the most important factors in interactive multimedia broadcasting is User-Centric Interoperability. The higher User-Centric Interoperability, the more information of user-interest objects are served quickly by user request. This proposed method finds own area of the object in mask video and divides the area into equal parts. And then it store as a form of bitsum after clustering the area. As a result of experiment, We confirm the method is efficient to use space for storing position information of the object.
BibTeX
@article{han2009object,
  author = {Dae-Young Han and Bu-Hyun Hwang and Daein Kim and Jaein Kim and Choul-Su Na},
  title = {{Object Store Method for Interactive Multimedia Broadcasting}},
  journal = {The Journal of the Korea Contents Association},
  year = {2009},
  doi = {10.5392/jkca.2009.9.2.051},
}
Figure