Pub Date : 2002-06-16DOI: 10.1109/VIPROM.2002.1026662
Boris Vassaux, P. Nguyen, Séverine Baudry, Patrick Bas, J. Chassery
The MPEG-4 video standard is nowadays more and more used for applications such as video editing, Internet or wireless video communications. This growing development has shown that these data must have a copyright protection such as watermarking. However one of the key points of the MPEG-4 video standard is the possibility to access and manipulate objects within a video sequence. And this particularity may have unfortunate consequences on many watermarking methods and may make them inefficient, especially methods which are not content-based. This paper presents a so-called scrambling technique which allows the adaptation of any classical spread spectrum watermarking scheme operating in the spatial domain to the MPEG-4 requirements concerning VO (video object) manipulation. This technique can be easily added to the embedding and detection schemes without changing the watermarking algorithm. Finally thanks to the usage of a spread spectrum technique and error correcting codes, an efficient algorithm for video watermarking is then proposed Our results show that the algorithm is robust to video object manipulations and lossy compression.
{"title":"Scrambling technique for video object watermarking resisting to MPEG-4","authors":"Boris Vassaux, P. Nguyen, Séverine Baudry, Patrick Bas, J. Chassery","doi":"10.1109/VIPROM.2002.1026662","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026662","url":null,"abstract":"The MPEG-4 video standard is nowadays more and more used for applications such as video editing, Internet or wireless video communications. This growing development has shown that these data must have a copyright protection such as watermarking. However one of the key points of the MPEG-4 video standard is the possibility to access and manipulate objects within a video sequence. And this particularity may have unfortunate consequences on many watermarking methods and may make them inefficient, especially methods which are not content-based. This paper presents a so-called scrambling technique which allows the adaptation of any classical spread spectrum watermarking scheme operating in the spatial domain to the MPEG-4 requirements concerning VO (video object) manipulation. This technique can be easily added to the embedding and detection schemes without changing the watermarking algorithm. Finally thanks to the usage of a spread spectrum technique and error correcting codes, an efficient algorithm for video watermarking is then proposed Our results show that the algorithm is robust to video object manipulations and lossy compression.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121847656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/VIPROM.2002.1026670
T. Sappasitwong, S. Aramvith, S. Jitapunkul, A. Tamtrakarn, P. Kitti-punyangam, H. Kortrakulkij
In this paper, an adaptive asymmetric diamond search (AADS) for block based motion estimation is presented. The proposed method exploits an adaptive search pattern based on the predicted motion vector. In addition, the accuracy of the prediction is improved by changing the initial search center position. Simulation results show that the proposed algorithm can reduce the search points up to about 30% compared to the regular diamond search while keeping the picture quality similar to other fast search algorithms.
{"title":"Adaptive asymmetric diamond search algorithm for block-based motion estimation","authors":"T. Sappasitwong, S. Aramvith, S. Jitapunkul, A. Tamtrakarn, P. Kitti-punyangam, H. Kortrakulkij","doi":"10.1109/VIPROM.2002.1026670","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026670","url":null,"abstract":"In this paper, an adaptive asymmetric diamond search (AADS) for block based motion estimation is presented. The proposed method exploits an adaptive search pattern based on the predicted motion vector. In addition, the accuracy of the prediction is improved by changing the initial search center position. Simulation results show that the proposed algorithm can reduce the search points up to about 30% compared to the regular diamond search while keeping the picture quality similar to other fast search algorithms.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123115817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/VIPROM.2002.1026674
S. Minasyan, D. Guevorkian, S. Agaian, H. Sarukhanyan
A concept for the construction of fast orthogonal transforms with matrices containing one or more predefined rows is proposed. In particular, two new families of "slant-like" transforms with matrices of arbitrary orders, including a constant row and a slant row of arbitrary slanting angle, are introduced. Transforms from these families may be computed with fast regular algorithms suitable for parallel implementation with a unified VLSI architecture that may be tuned to every representative of the family. An example of a new slant-like transform of order seven is also presented.
{"title":"On \"slant-like\" fast orthogonal transforms of arbitrary order","authors":"S. Minasyan, D. Guevorkian, S. Agaian, H. Sarukhanyan","doi":"10.1109/VIPROM.2002.1026674","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026674","url":null,"abstract":"A concept for the construction of fast orthogonal transforms with matrices containing one or more predefined rows is proposed. In particular, two new families of \"slant-like\" transforms with matrices of arbitrary orders, including a constant row and a slant row of arbitrary slanting angle, are introduced. Transforms from these families may be computed with fast regular algorithms suitable for parallel implementation with a unified VLSI architecture that may be tuned to every representative of the family. An example of a new slant-like transform of order seven is also presented.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115666464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/VIPROM.2002.1026676
A. Anbu, G. Agarwal, G. Srivastava
We present a fast algorithm for achieving motion-based object detection in an image sequence. While in most existing object-detection algorithms, segmentation of the image is done as the first step followed by grouping of segments, the proposed algorithm first uses motion information to identify what we call a region of interest. Segmentation (which is computationally very expensive) is done only within a square of interest (whose area is smaller than that of the entire image), which ensures a speed up. The segments are then combined to obtain the final segment, which closely matches the shape of the object to be detected. Since the square of interest is always smaller than the image, the proposed algorithm is 2 to 4 times faster than every existing algorithm for object detection. In terms of the accuracy with which a desired object is detected, the performance of our algorithm is comparable to existing algorithms.
{"title":"A fast object detection algorithm using motion-based region of interest determination","authors":"A. Anbu, G. Agarwal, G. Srivastava","doi":"10.1109/VIPROM.2002.1026676","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026676","url":null,"abstract":"We present a fast algorithm for achieving motion-based object detection in an image sequence. While in most existing object-detection algorithms, segmentation of the image is done as the first step followed by grouping of segments, the proposed algorithm first uses motion information to identify what we call a region of interest. Segmentation (which is computationally very expensive) is done only within a square of interest (whose area is smaller than that of the entire image), which ensures a speed up. The segments are then combined to obtain the final segment, which closely matches the shape of the object to be detected. Since the square of interest is always smaller than the image, the proposed algorithm is 2 to 4 times faster than every existing algorithm for object detection. In terms of the accuracy with which a desired object is detected, the performance of our algorithm is comparable to existing algorithms.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115907399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/VIPROM.2002.1026617
K.R. Rao, Y. Huh
JPEG 2000 Part I which has become an international standard (IS) in December 2000 is reviewed. Parts II to VII relating to extensions, motion JPEG 2000, conformance, reference software, file format and technical report are in various stages of development with IS targeted for the year 2001. JPEG 2000 focuses on efficient coding of grey level and binary still images (compound documents, text, annotation, multi-component, and rendered graphics). JPEG 2000 is superior to the widely popular JPEG and addresses various functionalities and services. It is aimed at emerging technologies such as Internet, E-commerce, mobile multimedia, color facsimile, and digital libraries while providing user controlled bit rates, quality levels and scalabilities (both SNR and spatial). It has lossy, lossless and progressive lossy to lossless modes. Algorithmic operations that constitute the JPEG 2000 standard are presented. Performance evaluation of this new standard and comparison with JPEG and JPEG-LS are discussed.
{"title":"JPEG 2000","authors":"K.R. Rao, Y. Huh","doi":"10.1109/VIPROM.2002.1026617","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026617","url":null,"abstract":"JPEG 2000 Part I which has become an international standard (IS) in December 2000 is reviewed. Parts II to VII relating to extensions, motion JPEG 2000, conformance, reference software, file format and technical report are in various stages of development with IS targeted for the year 2001. JPEG 2000 focuses on efficient coding of grey level and binary still images (compound documents, text, annotation, multi-component, and rendered graphics). JPEG 2000 is superior to the widely popular JPEG and addresses various functionalities and services. It is aimed at emerging technologies such as Internet, E-commerce, mobile multimedia, color facsimile, and digital libraries while providing user controlled bit rates, quality levels and scalabilities (both SNR and spatial). It has lossy, lossless and progressive lossy to lossless modes. Algorithmic operations that constitute the JPEG 2000 standard are presented. Performance evaluation of this new standard and comparison with JPEG and JPEG-LS are discussed.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114826758","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：