Andrea Bernardini, C. Delogu, E. Pallotti, Luca Costantini
Archeological remnants in urban areas tend to be included in the urban landscape or even remain hidden in subterranean locations which are not visible and, for these reasons, they are accessed with difficulty by visitors. In our previous experience, we developed a mobile application, which guided visitors in real time through various archaeological sites using texts, images, and videos. The results of an evaluation test which collected visitors' impressions and suggestions showed us that the mobile application allowed them to visit archeological remnants in a more participative way but that most visitors were unable to imagine what relation the archaeological remnants had with the ancient urban landscape. To solve this problem and improve the visitors' experience, we are now working at another application, which combines historical and archeological details with an immersive experience. The mobile application recognizes a cultural heritage element by image recognition or by positioning and it augments the interface with various layers of information. Furthermore, the application will provide not only information but it will offer to visitors an emotional experience.
{"title":"Living the Past: Augmented Reality and Archeology","authors":"Andrea Bernardini, C. Delogu, E. Pallotti, Luca Costantini","doi":"10.1109/ICMEW.2012.67","DOIUrl":"https://doi.org/10.1109/ICMEW.2012.67","url":null,"abstract":"Archeological remnants in urban areas tend to be included in the urban landscape or even remain hidden in subterranean locations which are not visible and, for these reasons, they are accessed with difficulty by visitors. In our previous experience, we developed a mobile application, which guided visitors in real time through various archaeological sites using texts, images, and videos. The results of an evaluation test which collected visitors' impressions and suggestions showed us that the mobile application allowed them to visit archeological remnants in a more participative way but that most visitors were unable to imagine what relation the archaeological remnants had with the ancient urban landscape. To solve this problem and improve the visitors' experience, we are now working at another application, which combines historical and archeological details with an immersive experience. The mobile application recognizes a cultural heritage element by image recognition or by positioning and it augments the interface with various layers of information. Furthermore, the application will provide not only information but it will offer to visitors an emotional experience.","PeriodicalId":385797,"journal":{"name":"2012 IEEE International Conference on Multimedia and Expo Workshops","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123174379","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}
In texture-plus-depth format of 3D visual data, texture and depth maps of multiple viewpoints are coded and transmitted at sender. At receiver, decoded texture and depth maps of two neighboring viewpoints are used to synthesize a desired intermediate view via depth-image-based rendering (DIBR). In this paper, to enable transmission of depth maps at low resolution for bit saving, we propose a novel super-resolution (SR) algorithm to increase the resolution of the received depth map at decoder to match the corresponding received high resolution texture map for DIBR. Unlike previous depth map SR techniques that only utilize the texture map of the same view 0 to interpolate missing depth pixels of view 0, we use texture maps of the same and neighboring viewpoints, 0 and 1, so that the error between the original texture map of view 1 and the synthesized image of view 1 (interpolated using texture and depth maps of view 0) can be used as a regularization term during depth map SR of view 0. Further, piecewise smoothness of the reconstructed depth map is enforced by computing only the lowest frequency coefficients in Graph based Transform (GBT) domain for each interpolated block. Experimental results show that our SR scheme out-performed a previous scheme by up to 1.7dB in synthesized view quality in PSNR.
{"title":"Depth Map Super-Resolution Using Synthesized View Matching for Depth-Image-Based Rendering","authors":"Wei Hu, Gene Cheung, Xin Li, O. Au","doi":"10.1109/ICMEW.2012.111","DOIUrl":"https://doi.org/10.1109/ICMEW.2012.111","url":null,"abstract":"In texture-plus-depth format of 3D visual data, texture and depth maps of multiple viewpoints are coded and transmitted at sender. At receiver, decoded texture and depth maps of two neighboring viewpoints are used to synthesize a desired intermediate view via depth-image-based rendering (DIBR). In this paper, to enable transmission of depth maps at low resolution for bit saving, we propose a novel super-resolution (SR) algorithm to increase the resolution of the received depth map at decoder to match the corresponding received high resolution texture map for DIBR. Unlike previous depth map SR techniques that only utilize the texture map of the same view 0 to interpolate missing depth pixels of view 0, we use texture maps of the same and neighboring viewpoints, 0 and 1, so that the error between the original texture map of view 1 and the synthesized image of view 1 (interpolated using texture and depth maps of view 0) can be used as a regularization term during depth map SR of view 0. Further, piecewise smoothness of the reconstructed depth map is enforced by computing only the lowest frequency coefficients in Graph based Transform (GBT) domain for each interpolated block. Experimental results show that our SR scheme out-performed a previous scheme by up to 1.7dB in synthesized view quality in PSNR.","PeriodicalId":385797,"journal":{"name":"2012 IEEE International Conference on Multimedia and Expo Workshops","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115282872","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}
Liang Yin, Mingzhi Dong, Weihong Deng, Jun Guo, Bin Zhang
This paper, guided by Statistical Color Models, proposes a real-time Adult Video detector to filter the adult content in the video. A generic color model is constructed by statistical analysis of the sample images containing adult pixels. We fully utilize the video continuity characteristics, i.e. preceding and following N frames considered in the classification. Our method, through experimental, displays a satisfactory performance for detecting adult content. The reminder of the paper addresses the application of real-time adult video filter that blocks adult content from kids.
{"title":"Statistical Color Model Based Adult Video Filter","authors":"Liang Yin, Mingzhi Dong, Weihong Deng, Jun Guo, Bin Zhang","doi":"10.1109/ICMEW.2012.66","DOIUrl":"https://doi.org/10.1109/ICMEW.2012.66","url":null,"abstract":"This paper, guided by Statistical Color Models, proposes a real-time Adult Video detector to filter the adult content in the video. A generic color model is constructed by statistical analysis of the sample images containing adult pixels. We fully utilize the video continuity characteristics, i.e. preceding and following N frames considered in the classification. Our method, through experimental, displays a satisfactory performance for detecting adult content. The reminder of the paper addresses the application of real-time adult video filter that blocks adult content from kids.","PeriodicalId":385797,"journal":{"name":"2012 IEEE International Conference on Multimedia and Expo Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116748237","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}
Yunhui Shi, He Li, Jin Wang, Wenpeng Ding, Baocai Yin
This paper proposes a new method of inter prediction based on low-rank matrix completion. By collection and rearrangement, image regions with high correlations can be used to generate a low-rank or approximately low-rank matrix. We view prediction values as the missing part in an incomplete low-rank matrix, and obtain the prediction by recovering the generated low-rank matrix. Taking advantage of exact recovery of incomplete matrix, the low-rank based prediction can exploit temporal correlation better. Our proposed prediction has the advantage of higher accuracy and less extra information, as the motion vector doesn't need to be encoded. Simulation results show that the bit-rate saving of the proposed scheme can reach up to 9.91% compared with H.264/AVC. Our scheme also outperforms the counterpart of the Template Matching Averaging (TMA) prediction by 8.06% at most.
{"title":"Inter Prediction Based on Low-rank Matrix Completion","authors":"Yunhui Shi, He Li, Jin Wang, Wenpeng Ding, Baocai Yin","doi":"10.1109/ICMEW.2012.98","DOIUrl":"https://doi.org/10.1109/ICMEW.2012.98","url":null,"abstract":"This paper proposes a new method of inter prediction based on low-rank matrix completion. By collection and rearrangement, image regions with high correlations can be used to generate a low-rank or approximately low-rank matrix. We view prediction values as the missing part in an incomplete low-rank matrix, and obtain the prediction by recovering the generated low-rank matrix. Taking advantage of exact recovery of incomplete matrix, the low-rank based prediction can exploit temporal correlation better. Our proposed prediction has the advantage of higher accuracy and less extra information, as the motion vector doesn't need to be encoded. Simulation results show that the bit-rate saving of the proposed scheme can reach up to 9.91% compared with H.264/AVC. Our scheme also outperforms the counterpart of the Template Matching Averaging (TMA) prediction by 8.06% at most.","PeriodicalId":385797,"journal":{"name":"2012 IEEE International Conference on Multimedia and Expo Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122627128","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}
Allocating computing resources to different tasks of surveillance systems has always been a big challenge. The problem becomes complicated when it requires dealing with real-time computation and decision making as the system cannot afford of processing all sensory feeds and execute computationally expensive algorithms. In multi-modal surveillance systems, real-time event detection and understanding of a situation is crucial. So, the proper use of computing resources is necessary to control and manage an area of surveillance. This paper introduces a dynamic task scheduling technique considering available computing resources and real-time requirement according to the current surveillance context. The task scheduler determines the importance of each sensor with respect to its observation and surrounding context. The scheduler dynamically allocates CPU clock to data streams of each sensor so that it can minimize event detection time from the time of its occurrence. The simulation results reveal that the task scheduler can offer proper resource utilization which is valuable for surveillance systems.
{"title":"Dynamic Resource Allocation for Event Processing in Surveillance Systems","authors":"D. Ahmed","doi":"10.1109/ICMEW.2012.74","DOIUrl":"https://doi.org/10.1109/ICMEW.2012.74","url":null,"abstract":"Allocating computing resources to different tasks of surveillance systems has always been a big challenge. The problem becomes complicated when it requires dealing with real-time computation and decision making as the system cannot afford of processing all sensory feeds and execute computationally expensive algorithms. In multi-modal surveillance systems, real-time event detection and understanding of a situation is crucial. So, the proper use of computing resources is necessary to control and manage an area of surveillance. This paper introduces a dynamic task scheduling technique considering available computing resources and real-time requirement according to the current surveillance context. The task scheduler determines the importance of each sensor with respect to its observation and surrounding context. The scheduler dynamically allocates CPU clock to data streams of each sensor so that it can minimize event detection time from the time of its occurrence. The simulation results reveal that the task scheduler can offer proper resource utilization which is valuable for surveillance systems.","PeriodicalId":385797,"journal":{"name":"2012 IEEE International Conference on Multimedia and Expo Workshops","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122733632","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}
Different conditions, such as occlusions, changes of lighting, shadows and rotations, make vehicle type classification still a challenging task, especially for real-time applications. Most existing methods rely on presumptions on certain conditions, such as lighting conditions and special camera settings. However, these presumptions usually do not work for applications in real world. In this paper, we propose a robust vehicle type classification method based on adaptive multi-class Principal Components Analysis (PCA). We treat car images captured at daytime and night-time separately. Vehicle front is extracted by examining vehicle front width and the location of license plate. Then, after generating eigenvectors to represent extracted vehicle fronts, we propose a PCA method with self-clustering to classify vehicle type. The comparison experiments with the state of art methods and real-time evaluations demonstrate the promising performance of our proposed method. Moreover, as we do not find any public database including sufficient desired images, we built up online our own database including 4924 high-resolution images of vehicle front view for further research on this topic.
{"title":"Vehicle Type Classification Using PCA with Self-Clustering","authors":"Yu Peng, Jesse S. Jin, S. Luo, Min Xu, Yue Cui","doi":"10.1109/ICMEW.2012.73","DOIUrl":"https://doi.org/10.1109/ICMEW.2012.73","url":null,"abstract":"Different conditions, such as occlusions, changes of lighting, shadows and rotations, make vehicle type classification still a challenging task, especially for real-time applications. Most existing methods rely on presumptions on certain conditions, such as lighting conditions and special camera settings. However, these presumptions usually do not work for applications in real world. In this paper, we propose a robust vehicle type classification method based on adaptive multi-class Principal Components Analysis (PCA). We treat car images captured at daytime and night-time separately. Vehicle front is extracted by examining vehicle front width and the location of license plate. Then, after generating eigenvectors to represent extracted vehicle fronts, we propose a PCA method with self-clustering to classify vehicle type. The comparison experiments with the state of art methods and real-time evaluations demonstrate the promising performance of our proposed method. Moreover, as we do not find any public database including sufficient desired images, we built up online our own database including 4924 high-resolution images of vehicle front view for further research on this topic.","PeriodicalId":385797,"journal":{"name":"2012 IEEE International Conference on Multimedia and Expo Workshops","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133536192","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}
J. Rzepecki, Jonathan Delcourt, Matthieu Perreira Da Silva, P. Callet
Science and technology progress fast, but mouse and keyboard are still used to control multimedia devices. One of the limiting factors of gesture based HCIs adoption is the detection of the user's intention to interact. This study tries to make a step in that direction with use of consumer EEG sensor headset. EEG headset records in real-time data that can help to identify intention of the user based on his emotional state. For each subject EEG responses for different stimuli are recorded. Acquiring these data allows to determine the potential of EEG based intention detection. The findings are promising and with proper implementation should allow to building a new type of HCI devices.
{"title":"Virtual interactions: Can EEG Help Make the Difference with Real Interaction?","authors":"J. Rzepecki, Jonathan Delcourt, Matthieu Perreira Da Silva, P. Callet","doi":"10.1109/ICMEW.2012.33","DOIUrl":"https://doi.org/10.1109/ICMEW.2012.33","url":null,"abstract":"Science and technology progress fast, but mouse and keyboard are still used to control multimedia devices. One of the limiting factors of gesture based HCIs adoption is the detection of the user's intention to interact. This study tries to make a step in that direction with use of consumer EEG sensor headset. EEG headset records in real-time data that can help to identify intention of the user based on his emotional state. For each subject EEG responses for different stimuli are recorded. Acquiring these data allows to determine the potential of EEG based intention detection. The findings are promising and with proper implementation should allow to building a new type of HCI devices.","PeriodicalId":385797,"journal":{"name":"2012 IEEE International Conference on Multimedia and Expo Workshops","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122795308","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}
Junyao Shao, Gang Liu, Zhiyuan Guo, Baoxiang Li, Yueming Lu
This paper presents an improved pruning method taking into account of the number of states possessed by hypotheses in some certain frames. With conventional pruning strategy, the hypotheses with a low score or a bad ranking will be discarded. However, it neglects a fact that the hypotheses several states ahead of or behind the right hypothesis in the prefix tree, which should be discarded, have similar scores and rankings with the right hypothesis. If a state is part of a partial path hypothesis, we say it is possessed by the hypothesis. So in a speech frame, we can deduce that the hypotheses which possess the most states and the hypotheses which possess the least states have little chance to be the right hypothesis. The proposed method analysis the range of the number of the states possessed by the hypotheses, and discards the hypotheses that possess too many or too few states. According to the experiments, This method could effectively improve the performance of the ASR.
{"title":"An Improved Pruning Method Based on the Number of States Possessed by Hypotheses","authors":"Junyao Shao, Gang Liu, Zhiyuan Guo, Baoxiang Li, Yueming Lu","doi":"10.1109/ICMEW.2012.106","DOIUrl":"https://doi.org/10.1109/ICMEW.2012.106","url":null,"abstract":"This paper presents an improved pruning method taking into account of the number of states possessed by hypotheses in some certain frames. With conventional pruning strategy, the hypotheses with a low score or a bad ranking will be discarded. However, it neglects a fact that the hypotheses several states ahead of or behind the right hypothesis in the prefix tree, which should be discarded, have similar scores and rankings with the right hypothesis. If a state is part of a partial path hypothesis, we say it is possessed by the hypothesis. So in a speech frame, we can deduce that the hypotheses which possess the most states and the hypotheses which possess the least states have little chance to be the right hypothesis. The proposed method analysis the range of the number of the states possessed by the hypotheses, and discards the hypotheses that possess too many or too few states. According to the experiments, This method could effectively improve the performance of the ASR.","PeriodicalId":385797,"journal":{"name":"2012 IEEE International Conference on Multimedia and Expo Workshops","volume":"106 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116469018","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}
M. Mcgarry, Jesus Hernandez, R. Ferzli, V. Syrotiuk
We investigated the use of caching of packets containing video at intermediary routers to reduce the delay and energy consumption of Automatic Repeat reQuest (ARQ) error recovery. We modeled the two mathematical programs that select the optimal set of routers to have caching ability, one to minimize energy consumption and the other to minimize retransmission delay. Both of these mathematical programs have identical structure. We then solve these mathematical programs with a dynamic programming solution whose execution time growth is polynomial in the size of the input parameters. Our performance analysis indicates that the optimal solution significantly outperforms several heuristic solutions.
{"title":"Minimizing Video Retransmission Delay and Energy Consumption with Caching Routers","authors":"M. Mcgarry, Jesus Hernandez, R. Ferzli, V. Syrotiuk","doi":"10.1109/ICMEW.2012.25","DOIUrl":"https://doi.org/10.1109/ICMEW.2012.25","url":null,"abstract":"We investigated the use of caching of packets containing video at intermediary routers to reduce the delay and energy consumption of Automatic Repeat reQuest (ARQ) error recovery. We modeled the two mathematical programs that select the optimal set of routers to have caching ability, one to minimize energy consumption and the other to minimize retransmission delay. Both of these mathematical programs have identical structure. We then solve these mathematical programs with a dynamic programming solution whose execution time growth is polynomial in the size of the input parameters. Our performance analysis indicates that the optimal solution significantly outperforms several heuristic solutions.","PeriodicalId":385797,"journal":{"name":"2012 IEEE International Conference on Multimedia and Expo Workshops","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116219501","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}
Although video conferencing and its related applications have grown into a significant research area, the limited scalability of conference size is still a major problem. In this paper, a range of strategies for real-time area of interest (AOI) management in a 3D immersive video conference (IVC) are evaluated with the objective of minimising the required video transmission capacity and hence maximising the number of concurrent users. The paper shows that with judicious application of these techniques, the download capacity requirements of clients can be reduced by as much as 90% in a crowded virtual space.
{"title":"Distributed Area of Interest Management for Large-Scale Immersive Video Conferencing","authors":"Pedram Pourashraf, F. Safaei, D. Franklin","doi":"10.1109/ICMEW.2012.31","DOIUrl":"https://doi.org/10.1109/ICMEW.2012.31","url":null,"abstract":"Although video conferencing and its related applications have grown into a significant research area, the limited scalability of conference size is still a major problem. In this paper, a range of strategies for real-time area of interest (AOI) management in a 3D immersive video conference (IVC) are evaluated with the objective of minimising the required video transmission capacity and hence maximising the number of concurrent users. The paper shows that with judicious application of these techniques, the download capacity requirements of clients can be reduced by as much as 90% in a crowded virtual space.","PeriodicalId":385797,"journal":{"name":"2012 IEEE International Conference on Multimedia and Expo Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114889971","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
扫码关注我们
求助内容：
应助结果提醒方式：