On fuzzy clustering and content based access to networked video databases

A. Joshi, S. Auephanwiriyakul, R. Krishnapuram
{"title":"On fuzzy clustering and content based access to networked video databases","authors":"A. Joshi, S. Auephanwiriyakul, R. Krishnapuram","doi":"10.1109/RIDE.1998.658277","DOIUrl":null,"url":null,"abstract":"Video databases and video on demand represent an important application of the evolving global information infrastructure. However, video querying involves a lot of user interaction and feedback based query refinement, which can generate large traffic volumes on the network if full video segments are sent. To aid in efficient video browsing, search and retrieval across the network, we need to find good compact representations for long video sequences. Representative frames (Rframes) provide such a representation. Extant algorithms use scene change detection to segment video into shots and pick Rframes. However, scene change detection techniques fail badly in presence of gradual scene changes which are quite prevalent in most videos. We present another way of finding Rframes using fuzzy clustering without dealing with any scene change detection algorithms. Fuzzy clusters provide a more natural approach to this problem since membership of a frame in some particular scene is not binary. This allows us to handle gradual scene changes. We report on our approach, present preliminary experimental results, and discuss ongoing work.","PeriodicalId":199347,"journal":{"name":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIDE.1998.658277","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

Video databases and video on demand represent an important application of the evolving global information infrastructure. However, video querying involves a lot of user interaction and feedback based query refinement, which can generate large traffic volumes on the network if full video segments are sent. To aid in efficient video browsing, search and retrieval across the network, we need to find good compact representations for long video sequences. Representative frames (Rframes) provide such a representation. Extant algorithms use scene change detection to segment video into shots and pick Rframes. However, scene change detection techniques fail badly in presence of gradual scene changes which are quite prevalent in most videos. We present another way of finding Rframes using fuzzy clustering without dealing with any scene change detection algorithms. Fuzzy clusters provide a more natural approach to this problem since membership of a frame in some particular scene is not binary. This allows us to handle gradual scene changes. We report on our approach, present preliminary experimental results, and discuss ongoing work.
模糊聚类与基于内容的网络视频数据库访问
视频数据库和视频点播是不断发展的全球信息基础设施的重要应用。然而,视频查询涉及到大量的用户交互和基于反馈的查询细化,如果发送完整的视频片段,会在网络上产生很大的流量。为了帮助在网络上高效的视频浏览、搜索和检索,我们需要为长视频序列找到良好的紧凑表示。代表性帧(Rframes)提供了这样一种表示。现有的算法使用场景变化检测将视频分割成镜头并选择rframe。然而,场景变化检测技术在大多数视频中普遍存在的渐变场景变化中失败严重。我们提出了另一种使用模糊聚类查找Rframes的方法,而不需要处理任何场景变化检测算法。模糊聚类提供了一种更自然的方法来解决这个问题,因为某个特定场景中帧的隶属关系不是二元的。这允许我们处理渐进的场景变化。我们报告了我们的方法,提出了初步的实验结果,并讨论了正在进行的工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信