Pub Date : 2002-11-07DOI: 10.1109/VIPROM.2002.1026660
F. Cavalli, R. Cucchiara, M. Piccardi, A. Prati
A performance analysis of MPEG-4 encoder and decoder programs on a standard personal computer is presented. The paper first describes the MPEG-4 computational load and discusses related works, then outlines the performance analysis. Experimental results show that while the decoder program can be easily executed in real time, the encoder requires execution times in the order of seconds per frame which call for substantial optimisation to satisfy real-time constraints.
{"title":"Performance analysis of MPEG-4 decoder and encoder","authors":"F. Cavalli, R. Cucchiara, M. Piccardi, A. Prati","doi":"10.1109/VIPROM.2002.1026660","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026660","url":null,"abstract":"A performance analysis of MPEG-4 encoder and decoder programs on a standard personal computer is presented. The paper first describes the MPEG-4 computational load and discusses related works, then outlines the performance analysis. Experimental results show that while the decoder program can be easily executed in real time, the encoder requires execution times in the order of seconds per frame which call for substantial optimisation to satisfy real-time constraints.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132997313","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 : 2002-11-07DOI: 10.1109/VIPROM.2002.1026642
M. Bernas
This paper is devoted to subjective and objective tests of image quality. The images were processed using different compressing algorithms (JPEG, KLT, Lura-wavelet) with compression ratio up to 100. After decompression they were tested on the quality changes. At first the subjective image quality test (DSCQS) was used. Then the objective quality test using the metric based on the human visual system was applied. Finally, a discussion of the results is presented.
{"title":"Image quality evaluation","authors":"M. Bernas","doi":"10.1109/VIPROM.2002.1026642","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026642","url":null,"abstract":"This paper is devoted to subjective and objective tests of image quality. The images were processed using different compressing algorithms (JPEG, KLT, Lura-wavelet) with compression ratio up to 100. After decompression they were tested on the quality changes. At first the subjective image quality test (DSCQS) was used. Then the objective quality test using the metric based on the human visual system was applied. Finally, a discussion of the results is presented.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130844178","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 : 2002-11-07DOI: 10.1109/VIPROM.2002.1026665
R. Lancini, F. Mapelli, S. Tubaro
We propose a watermarking scheme applied to digital audio signals. The goal of the project is to hide information which can identify both the tracks and the user who requests them. This technique is used for automatic identification of audio signals in broadcast programs. There are two main features that have to be satisfied: inaudibility and robustness to common editing operations. The algorithm works in a hybrid way: the watermark masking is in the frequency domain while the insertion is in the time domain. This approach allows detection to be performed directly in the time domain. In order to insert the watermark, the signal is split into frames, each of which hides binary information inserted using a spread spectrum sequence. To improve robustness, we use an error correcting code which allows the reduction of error probability. We discuss first the watermark embedding system, then the detection approach and finally the main results are presented.
{"title":"Embedding indexing information in audio signal using watermarking technique","authors":"R. Lancini, F. Mapelli, S. Tubaro","doi":"10.1109/VIPROM.2002.1026665","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026665","url":null,"abstract":"We propose a watermarking scheme applied to digital audio signals. The goal of the project is to hide information which can identify both the tracks and the user who requests them. This technique is used for automatic identification of audio signals in broadcast programs. There are two main features that have to be satisfied: inaudibility and robustness to common editing operations. The algorithm works in a hybrid way: the watermark masking is in the frequency domain while the insertion is in the time domain. This approach allows detection to be performed directly in the time domain. In order to insert the watermark, the signal is split into frames, each of which hides binary information inserted using a spread spectrum sequence. To improve robustness, we use an error correcting code which allows the reduction of error probability. We discuss first the watermark embedding system, then the detection approach and finally the main results are presented.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129622095","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 : 2002-11-07DOI: 10.1109/VIPROM.2002.1026671
S. Askar, P. Kauff, N. Brandenburg, O. Schreer
Image upscaling approaches are required especially when algorithms are applied to subsampled images in order to speed up processing time. Conventional techniques for upscaling images yield often blurred or blocky results, but more complicated methods are time consuming. We present an adaptive upscaling approach for low structured images, which provides real time capability for images in full TV resolution and produces clear and non-blocky edges due to a hierarchical filling strategy.
{"title":"Fast adaptive upscaling of low structured images using a hierarchical filling strategy","authors":"S. Askar, P. Kauff, N. Brandenburg, O. Schreer","doi":"10.1109/VIPROM.2002.1026671","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026671","url":null,"abstract":"Image upscaling approaches are required especially when algorithms are applied to subsampled images in order to speed up processing time. Conventional techniques for upscaling images yield often blurred or blocky results, but more complicated methods are time consuming. We present an adaptive upscaling approach for low structured images, which provides real time capability for images in full TV resolution and produces clear and non-blocky edges due to a hierarchical filling strategy.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126438322","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 : 2002-11-07DOI: 10.1109/VIPROM.2002.1026648
S. Ghofrani, A. Ayatollahi
Using a good statistical model of speckle formation is important in designing an adaptive filter for speckle reduction in ultrasound B-scan images. Most clinical ultrasound imaging systems use a nonlinear logarithmic function to reduce the dynamic range of the input echo signal and emphasize objects with weak backscatter. The statistic of log-compressed images for Nakagami distribution was derived (Ghofrani et al. 2001) and in this paper we use the results for designing an adaptive nonlinear filter in speckle reduction. We processed two original ultrasound images of kidney and liver to demonstrate the efficiency of the designed filter.
利用良好的散斑形成统计模型对设计一种自适应滤波器来降低b超扫描图像中的散斑是非常重要的。大多数临床超声成像系统使用非线性对数函数来减小输入回波信号的动态范围，并强调弱反向散射的物体。导出了Nakagami分布的对数压缩图像的统计量(Ghofrani et al. 2001)，并在本文中使用该结果设计了一种自适应非线性散斑减少滤波器。我们对肾脏和肝脏的两张原始超声图像进行了处理，以证明所设计的滤波器的效率。
{"title":"Speckle suppression by adaptive nonlinear filtering","authors":"S. Ghofrani, A. Ayatollahi","doi":"10.1109/VIPROM.2002.1026648","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026648","url":null,"abstract":"Using a good statistical model of speckle formation is important in designing an adaptive filter for speckle reduction in ultrasound B-scan images. Most clinical ultrasound imaging systems use a nonlinear logarithmic function to reduce the dynamic range of the input echo signal and emphasize objects with weak backscatter. The statistic of log-compressed images for Nakagami distribution was derived (Ghofrani et al. 2001) and in this paper we use the results for designing an adaptive nonlinear filter in speckle reduction. We processed two original ultrasound images of kidney and liver to demonstrate the efficiency of the designed filter.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121339811","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 : 2002-11-07DOI: 10.1109/VIPROM.2002.1026667
M. Elhassouni, H. Cherifi, D. Aboutajdine
This paper deals with the use of higher order statistics (HOS) in a spatio-temporal filtering scheme to reduce noise in video sequences. Prior to filtering, motion compensation is performed by a robust estimator. Then, we apply a 3-D order statistic filter. Both stages are based on Kurtosis minimization. Experimental results on noisy real video sequences illustrate the efficiency of the proposed approach.
{"title":"An adaptive motion-compensated filter using cumulants","authors":"M. Elhassouni, H. Cherifi, D. Aboutajdine","doi":"10.1109/VIPROM.2002.1026667","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026667","url":null,"abstract":"This paper deals with the use of higher order statistics (HOS) in a spatio-temporal filtering scheme to reduce noise in video sequences. Prior to filtering, motion compensation is performed by a robust estimator. Then, we apply a 3-D order statistic filter. Both stages are based on Kurtosis minimization. Experimental results on noisy real video sequences illustrate the efficiency of the proposed approach.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123344331","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 : 2002-11-07DOI: 10.1109/VIPROM.2002.1026673
K. Mohana Rao, A. Dempster
We present a new procedure for computing the granulometry function. Computation of granulometry is normally done by morphological opening/closing performed on an image with structuring elements of increasing size. This can pose problems, if pixels within the image components are not nearly uniform gray level (or have large variations) or if there are patches within the objects of interest. The proposed procedure computes the granulometry function by a two-stage process; first the sizes of patches within the image components are estimated, then they are filled and the granulometry function is computed. As an example, this method is applied to estimating the size of red blood cells in malaria affected blood slides, where pixels of the objects of interest (red blood cells) are non-flat with some patches because of the shape of the cells. The results obtained are very encouraging.
{"title":"Use of area-closing to improve granulometry performance","authors":"K. Mohana Rao, A. Dempster","doi":"10.1109/VIPROM.2002.1026673","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026673","url":null,"abstract":"We present a new procedure for computing the granulometry function. Computation of granulometry is normally done by morphological opening/closing performed on an image with structuring elements of increasing size. This can pose problems, if pixels within the image components are not nearly uniform gray level (or have large variations) or if there are patches within the objects of interest. The proposed procedure computes the granulometry function by a two-stage process; first the sizes of patches within the image components are estimated, then they are filled and the granulometry function is computed. As an example, this method is applied to estimating the size of red blood cells in malaria affected blood slides, where pixels of the objects of interest (red blood cells) are non-flat with some patches because of the shape of the cells. The results obtained are very encouraging.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115298237","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 : 2002-11-07DOI: 10.1109/VIPROM.2002.1026664
R. Lancini, F. Mapelli, S. Tubaro
We present a scheme for robust watermark insertion into video sequences. The proposed approach works in the uncompressed image domain, and it is robust against a large set of possible attacks. It has been developed for two principle applications: copyright protection and invisible embedding of indexing information. The proposed scheme has been tested and the results show that a robust watermark can be embedded in video sequences, and extracted after different attacks, in particular MPEG compression and geometrical attacks like cropping and resizing. We also compared two different error correcting codes used to improve robustness: convolutional and turbo codes.
{"title":"A robust video watermarking technique in the spatial domain","authors":"R. Lancini, F. Mapelli, S. Tubaro","doi":"10.1109/VIPROM.2002.1026664","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026664","url":null,"abstract":"We present a scheme for robust watermark insertion into video sequences. The proposed approach works in the uncompressed image domain, and it is robust against a large set of possible attacks. It has been developed for two principle applications: copyright protection and invisible embedding of indexing information. The proposed scheme has been tested and the results show that a robust watermark can be embedded in video sequences, and extracted after different attacks, in particular MPEG compression and geometrical attacks like cropping and resizing. We also compared two different error correcting codes used to improve robustness: convolutional and turbo codes.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115783066","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 : 2002-11-07DOI: 10.1109/VIPROM.2002.1026653
N. Sprljan, S. Grgic, M. Grgic
SPIHT is a very efficient image compression algorithm that is based on the idea of coding groups of wavelet coefficients as zerotrees. This method is well suited for the dyadic wavelet transform, where child-parent relations are easily established. In this paper we investigate how the SPIHT algorithm can be used for any arbitrary wavelet packet basis.
{"title":"Modified SPIHT algorithm for wavelet packet image coding","authors":"N. Sprljan, S. Grgic, M. Grgic","doi":"10.1109/VIPROM.2002.1026653","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026653","url":null,"abstract":"SPIHT is a very efficient image compression algorithm that is based on the idea of coding groups of wavelet coefficients as zerotrees. This method is well suited for the dyadic wavelet transform, where child-parent relations are easily established. In this paper we investigate how the SPIHT algorithm can be used for any arbitrary wavelet packet basis.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127242842","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 : 2002-11-07DOI: 10.1109/VIPROM.2002.1026650
R. Dobrescu, F. Taloş, Catalin Vasilescu
The paper presents an algorithm able to compute and to display the graphic of the distribution of fractal dimensions obtained from microscopic images of malignant tumors in various stages of evolution. Some considerations on the medical interpretation of these histograms are offered too.
{"title":"Using fractal dimension for cancer diagnosis","authors":"R. Dobrescu, F. Taloş, Catalin Vasilescu","doi":"10.1109/VIPROM.2002.1026650","DOIUrl":"https://doi.org/10.1109/VIPROM.2002.1026650","url":null,"abstract":"The paper presents an algorithm able to compute and to display the graphic of the distribution of fractal dimensions obtained from microscopic images of malignant tumors in various stages of evolution. Some considerations on the medical interpretation of these histograms are offered too.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124949009","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
扫码关注我们
求助内容：
应助结果提醒方式：