Pub Date : 2006-07-09DOI: 10.1109/ICME.2006.262591
Beilei Huang, E. Lai
The resampling of discrete-time signals where the underlying analog signal is non-bandlimited is considered in this paper. We extend the generalized sampling theory developed based on the principle of consistency to resampling. Realizing the resampling system has both discrete input and output, the performance of the resampling filter is considered in l2 instead of the traditionally used L2 . We show that the performance of the resampling system depends on the resampling rate instead of the actual interpolating kernels. The theory can be applied to image processing applications like zooming to provide better response to high frequency components. Since the resampling process is discrete in nature, our filter designed to optimize resampling in l2 is shown to outperform other techniques designed in L2
{"title":"Non-Bandlimited Resampling of Images","authors":"Beilei Huang, E. Lai","doi":"10.1109/ICME.2006.262591","DOIUrl":"https://doi.org/10.1109/ICME.2006.262591","url":null,"abstract":"The resampling of discrete-time signals where the underlying analog signal is non-bandlimited is considered in this paper. We extend the generalized sampling theory developed based on the principle of consistency to resampling. Realizing the resampling system has both discrete input and output, the performance of the resampling filter is considered in l2 instead of the traditionally used L2 . We show that the performance of the resampling system depends on the resampling rate instead of the actual interpolating kernels. The theory can be applied to image processing applications like zooming to provide better response to high frequency components. Since the resampling process is discrete in nature, our filter designed to optimize resampling in l2 is shown to outperform other techniques designed in L2","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116357153","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 : 2006-07-09DOI: 10.1109/ICME.2006.262931
N. Nezamoddini-Kachouie, P. Fieguth
In this paper a combined Bayesshrink wavelet-ridgelet de-noising method is presented. In our previous work we have showed that Bayesshrink ridgelet performs better than Visushrink ridgelet and Visushrink wavelet. Although our Bayesshrink ridgelet technique performs somewhat poorer in comparison with Bayesshrink wavelet, based on SNR, visually it produces smoother results, especially for images with straight lines. In the proposed method Bayesshrink wavelet is combined with Bayesshrink ridgelet denoising method which performs better than each filter individually. The proposed combined denoising method gains the advantage of each filter in its specific domain, i.e., wavelet for natural and ridgelet for straight regions, and produces better and smoother results, both visually and in terms of SNR
{"title":"A Combined Bayesshrinkwavelet-Ridgelet Technique for Image Denoising","authors":"N. Nezamoddini-Kachouie, P. Fieguth","doi":"10.1109/ICME.2006.262931","DOIUrl":"https://doi.org/10.1109/ICME.2006.262931","url":null,"abstract":"In this paper a combined Bayesshrink wavelet-ridgelet de-noising method is presented. In our previous work we have showed that Bayesshrink ridgelet performs better than Visushrink ridgelet and Visushrink wavelet. Although our Bayesshrink ridgelet technique performs somewhat poorer in comparison with Bayesshrink wavelet, based on SNR, visually it produces smoother results, especially for images with straight lines. In the proposed method Bayesshrink wavelet is combined with Bayesshrink ridgelet denoising method which performs better than each filter individually. The proposed combined denoising method gains the advantage of each filter in its specific domain, i.e., wavelet for natural and ridgelet for straight regions, and produces better and smoother results, both visually and in terms of SNR","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114823920","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 : 2006-07-09DOI: 10.1109/ICME.2006.262520
Franck Favetta, R. Laurini
Landscape architecture projects have many specific requirements such as particular multimedia and geographic data integration and structure, information preview, user-friendly interface, and means of multi-actor participation. This article presents a solution for an efficient, quick and user-friendly integration, structure, exploration and management of landscape information. Our proposal extends different existing solutions and introduces useful preview abilities. A recently developed prototype implements the solution
{"title":"Towards an Efficient Integration, Structure and Exploration of Landscape Architecture Project Information","authors":"Franck Favetta, R. Laurini","doi":"10.1109/ICME.2006.262520","DOIUrl":"https://doi.org/10.1109/ICME.2006.262520","url":null,"abstract":"Landscape architecture projects have many specific requirements such as particular multimedia and geographic data integration and structure, information preview, user-friendly interface, and means of multi-actor participation. This article presents a solution for an efficient, quick and user-friendly integration, structure, exploration and management of landscape information. Our proposal extends different existing solutions and introduces useful preview abilities. A recently developed prototype implements the solution","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124511677","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 : 2006-07-09DOI: 10.1109/ICME.2006.262421
M. Toyoura, M. Iiyama, K. Kakusho, M. Minoh
In this article, we discuss 3D shape reconstruction of an object in a rigid motion with the volume intersection method. When the object moves rigidly, the cameras change their relative positions to the object at every moment. To estimate the motion correctly, we propose new feature points called outcrop points on the reconstructed 3D shape. These points are guaranteed to be located on the real surface of the object. If the rigid motion of the object can be correctly estimated, cameras at different moments serve as the cameras in different positions virtually. With these cameras in time sequences, we can increase accuracy of the reconstructed 3D shape without increasing the number of cameras. Based on this idea, we reconstruct an accurate shape of the object in motion from images obtained by limited number of cameras. As the result, we can acquire an accurate shape from images in time sequences
{"title":"Extraction of Outcrop Points from Visual Hulls for Motion Estimation","authors":"M. Toyoura, M. Iiyama, K. Kakusho, M. Minoh","doi":"10.1109/ICME.2006.262421","DOIUrl":"https://doi.org/10.1109/ICME.2006.262421","url":null,"abstract":"In this article, we discuss 3D shape reconstruction of an object in a rigid motion with the volume intersection method. When the object moves rigidly, the cameras change their relative positions to the object at every moment. To estimate the motion correctly, we propose new feature points called outcrop points on the reconstructed 3D shape. These points are guaranteed to be located on the real surface of the object. If the rigid motion of the object can be correctly estimated, cameras at different moments serve as the cameras in different positions virtually. With these cameras in time sequences, we can increase accuracy of the reconstructed 3D shape without increasing the number of cameras. Based on this idea, we reconstruct an accurate shape of the object in motion from images obtained by limited number of cameras. As the result, we can acquire an accurate shape from images in time sequences","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124004179","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 : 2006-07-09DOI: 10.1109/ICME.2006.262949
L. Ghouti, A. Bouridane, M. K. Ibrahim
Driven by the recent advances in digital entertainment technologies, digital multimedia content (such as music and movies) is becoming a major part of the average computer user experience. Through daily interaction with digital multimedia content, large digital collections of music, audio and sound effects have emerged. Furthermore, these collections are produced/consumed by different groups of users such as the entertainment, music, movie and animation industries. Therefore, the need for identification and management of such content grows proportionally to the increasing widespread availability of such media virtually "any time and any where" over the internet. In this paper, we propose a novel algorithm for robust perceptual hashing of musical content using balanced multiwavelets (BMW). The procedure for generating robust perceptual hash values (or fingerprints) is described in details. The generated hash values are used for identifying, searching, and retrieving musical content from large musical databases. Furthermore, we illustrate, through extensive computer simulation, the robustness of the proposed framework to efficiently represent audio content and withstand several signal processing attacks and manipulations
{"title":"A Fingerprinting System for Musical Content","authors":"L. Ghouti, A. Bouridane, M. K. Ibrahim","doi":"10.1109/ICME.2006.262949","DOIUrl":"https://doi.org/10.1109/ICME.2006.262949","url":null,"abstract":"Driven by the recent advances in digital entertainment technologies, digital multimedia content (such as music and movies) is becoming a major part of the average computer user experience. Through daily interaction with digital multimedia content, large digital collections of music, audio and sound effects have emerged. Furthermore, these collections are produced/consumed by different groups of users such as the entertainment, music, movie and animation industries. Therefore, the need for identification and management of such content grows proportionally to the increasing widespread availability of such media virtually \"any time and any where\" over the internet. In this paper, we propose a novel algorithm for robust perceptual hashing of musical content using balanced multiwavelets (BMW). The procedure for generating robust perceptual hash values (or fingerprints) is described in details. The generated hash values are used for identifying, searching, and retrieving musical content from large musical databases. Furthermore, we illustrate, through extensive computer simulation, the robustness of the proposed framework to efficiently represent audio content and withstand several signal processing attacks and manipulations","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127645870","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 : 2006-07-09DOI: 10.1109/ICME.2006.262463
Gao Chen, Shouxun Lin, Yongdong Zhang, Gang Cao
In this paper, a fast transform method is proposed to convert MPEG-2 8-tap discrete cosine transform (DCT) coefficients to H.264/AVC 4-tap integer transform coefficients directly in the transform domain. The proposed transform method saves 16 operations for each 8times8 DCT block by utilizing a novel transform kernel matrix and a fast computing method for multiplication of this new matrix. The simulation results show that the proposed method causes only a very little quality degradation, which is completely negligible in practice with the maximum value lower than 8times10-33dB, as compared with Jun Xin' s method. Hence, it can be efficiently used in the transform-domain MPEG-2 to H.264 transcoding
{"title":"An New Coefficients Transform Matrix for the Transform Domain MPEG-2 TO H.264/AVC Transcoding","authors":"Gao Chen, Shouxun Lin, Yongdong Zhang, Gang Cao","doi":"10.1109/ICME.2006.262463","DOIUrl":"https://doi.org/10.1109/ICME.2006.262463","url":null,"abstract":"In this paper, a fast transform method is proposed to convert MPEG-2 8-tap discrete cosine transform (DCT) coefficients to H.264/AVC 4-tap integer transform coefficients directly in the transform domain. The proposed transform method saves 16 operations for each 8times8 DCT block by utilizing a novel transform kernel matrix and a fast computing method for multiplication of this new matrix. The simulation results show that the proposed method causes only a very little quality degradation, which is completely negligible in practice with the maximum value lower than 8times10-33dB, as compared with Jun Xin' s method. Hence, it can be efficiently used in the transform-domain MPEG-2 to H.264 transcoding","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"148 Pt 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126319412","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 : 2006-07-09DOI: 10.1109/ICME.2006.262657
B. Erol, K. Berkner, S. Joshi, J. Hull
It is difficult to view multipage, high resolution documents on devices with small displays. As a solution, we introduce a multimedia thumbnail representation, which can be seen as a multimedia clip that provides an automated guided tour through a document. Multimedia thumbnails are automatically generated by taking a document image as input and first performing visual and audible information analysis on the document to determine salient document elements. Next, the time and information attributes for each document element are computed by taking into account the display and application constraints. An optimization routine, given a time constraint, selects elements to be included in the multimedia thumbnail. Last, the selected elements are synthesized into animated images and audio to create the final multimedia representation
{"title":"Computing a Multimedia Representation for Documents Given Time and Display Constraints","authors":"B. Erol, K. Berkner, S. Joshi, J. Hull","doi":"10.1109/ICME.2006.262657","DOIUrl":"https://doi.org/10.1109/ICME.2006.262657","url":null,"abstract":"It is difficult to view multipage, high resolution documents on devices with small displays. As a solution, we introduce a multimedia thumbnail representation, which can be seen as a multimedia clip that provides an automated guided tour through a document. Multimedia thumbnails are automatically generated by taking a document image as input and first performing visual and audible information analysis on the document to determine salient document elements. Next, the time and information attributes for each document element are computed by taking into account the display and application constraints. An optimization routine, given a time constraint, selects elements to be included in the multimedia thumbnail. Last, the selected elements are synthesized into animated images and audio to create the final multimedia representation","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126208512","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 : 2006-07-09DOI: 10.1109/ICME.2006.262815
Li Zhang, Wen Gao
Video encoding now is being implemented in various computing platforms with different computing capability, the requirement on the encoding complexity is also different according to different applications. As the most computation-intensive part of video encoding, the ME (motion estimation) should have a scalable complexity. This paper proposes a ME algorithm with fine-granular scalable complexity, a more important feature of the proposed algorithm is that it seeks for the complexity-distortion optimization. The given computation budget will be allocated to each MB (macroblock) in one frame. Each MB will consume its allocated computation by a hybrid search pattern. Experimental results show that the proposed algorithm can get a better computation-distortion performance than the existing ME algorithms
{"title":"Complexity-Distortion Optimized Motion Estimation Algorithm with Fine-Granular Scalable Complexity","authors":"Li Zhang, Wen Gao","doi":"10.1109/ICME.2006.262815","DOIUrl":"https://doi.org/10.1109/ICME.2006.262815","url":null,"abstract":"Video encoding now is being implemented in various computing platforms with different computing capability, the requirement on the encoding complexity is also different according to different applications. As the most computation-intensive part of video encoding, the ME (motion estimation) should have a scalable complexity. This paper proposes a ME algorithm with fine-granular scalable complexity, a more important feature of the proposed algorithm is that it seeks for the complexity-distortion optimization. The given computation budget will be allocated to each MB (macroblock) in one frame. Each MB will consume its allocated computation by a hybrid search pattern. Experimental results show that the proposed algorithm can get a better computation-distortion performance than the existing ME algorithms","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128153587","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 : 2006-07-09DOI: 10.1109/ICME.2006.262619
A. Woodward, Da An, G. Gimel'farb, P. Delmas
We compare three computer vision approaches to 3-D reconstruction, namely passive binocular stereo and active structured lighting and photometric stereo, in application to human face reconstruction for modelling virtual humans. An integrated lab environment was set up to simultaneously acquire images for 3-D reconstruction and corresponding data from a 3-D scanner. This allowed us to quantitatively compare reconstruction results to accurate ground truth. Our goal was to determine whether any current computer vision approach is accurate enough for practically useful 3-D facial surface reconstruction. Comparative experiments show the combination of structured lighting with symmetric dynamic programming based binocular stereo has good prospects due to reasonable processing time and sufficient accuracy
{"title":"A Comparison of Three 3-D Facial Reconstruction Approaches","authors":"A. Woodward, Da An, G. Gimel'farb, P. Delmas","doi":"10.1109/ICME.2006.262619","DOIUrl":"https://doi.org/10.1109/ICME.2006.262619","url":null,"abstract":"We compare three computer vision approaches to 3-D reconstruction, namely passive binocular stereo and active structured lighting and photometric stereo, in application to human face reconstruction for modelling virtual humans. An integrated lab environment was set up to simultaneously acquire images for 3-D reconstruction and corresponding data from a 3-D scanner. This allowed us to quantitatively compare reconstruction results to accurate ground truth. Our goal was to determine whether any current computer vision approach is accurate enough for practically useful 3-D facial surface reconstruction. Comparative experiments show the combination of structured lighting with symmetric dynamic programming based binocular stereo has good prospects due to reasonable processing time and sufficient accuracy","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125983929","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 : 2006-07-09DOI: 10.1109/ICME.2006.262830
S. Davis, I. Burnett
XML is a popular approach to interoperable exchange of multimedia metadata between a wide range of devices. This paper explores extending the use of the remote XML exchange protocol (previously proposed by the authors) as a mechanism to provide efficient interaction with complex multimedia XML documents and their associated schemas. This is particularly applicable to users with limited application complexity devices and/or limited bandwidth connections. Many XML documents do not fully utilize all the information present in a given schema; thus, users download substantial redundant information for the current application. This paper introduces the use of RXEP for the transmission of small, relevant schema sections. The paper investigates the advantages of schema retrieval using RXEP in terms of the bandwidth saved
{"title":"On-Demand Partial Schema Delivery for Multimedia Metadata","authors":"S. Davis, I. Burnett","doi":"10.1109/ICME.2006.262830","DOIUrl":"https://doi.org/10.1109/ICME.2006.262830","url":null,"abstract":"XML is a popular approach to interoperable exchange of multimedia metadata between a wide range of devices. This paper explores extending the use of the remote XML exchange protocol (previously proposed by the authors) as a mechanism to provide efficient interaction with complex multimedia XML documents and their associated schemas. This is particularly applicable to users with limited application complexity devices and/or limited bandwidth connections. Many XML documents do not fully utilize all the information present in a given schema; thus, users download substantial redundant information for the current application. This paper introduces the use of RXEP for the transmission of small, relevant schema sections. The paper investigates the advantages of schema retrieval using RXEP in terms of the bandwidth saved","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121922153","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
扫码关注我们
求助内容：
应助结果提醒方式：