{"title":"View synthesis for 3D video scene composition","authors":"Amanda Wang, Chun-Liang Chien, H. Hang","doi":"10.1109/MMSP.2015.7340824","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340824","url":null,"abstract":"Scene composition is a method widely used in movie and TV production. Merging two sets of 3D videos into one is a very challenging task. There are several main issues on video composition. Our focus is compositing two sets of videos with different camera motion parameters. The key techniques are the camera motion estimation and view synthesis technique used to produce the synthesized motion-compensated background video. We propose a refined backward warping technique for view synthesis and adopt the ICP algorithm to calculate the camera motion parameters.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132389212","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}
{"title":"Rectangle fitting via quadratic programming","authors":"Jingyu Yang, Zhongyu Jiang","doi":"10.1109/MMSP.2015.7340875","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340875","url":null,"abstract":"This paper investigates rectangle fitting via optimization approaches. We summarize two basic requirements for rectangular fitting, leading to a basic model that are non-convex and difficult to attack. To avoid potential trapping of local minima, we extend the basic model with centroid and orientation constraints into a quadratic programming. To achieve reliable fitting from noisy points, slack variables are introduced to soften hard constraints. The scalability to problem size are further addressed by careful selecting only a small fraction of slack variables. Results on clean dataset, noisy dataset, and practical data show that our method is able to reliably fit rectangles for various kinds of data.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125164985","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}
{"title":"Epipolar plane image based rendering for 3D video coding","authors":"Catarina Brites, J. Ascenso, F. Pereira","doi":"10.1109/MMSP.2015.7340854","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340854","url":null,"abstract":"In current 3D video coding solutions, such as the 3D-HEVC standard, depth data is instrumental to have a continuum of views synthesized at the decoder based on a limited set of coded views. In order view synthesis may be performed at the decoder, depth data is currently directly acquired or estimated at the encoder based on very few neighboring views and transmitted to the decoder after appropriate compression. At the decoder, further views then those decoded are synthesized using again very few neighboring decoded views, thus using a local synthesis approach. A promising alternative synthesis approach may consider not a few but rather all the views available at the decoder, thus offering a scene global approach to synthesis. One way to implement this approach involves cutting the views cube along the viewpoint direction, creating the so-called epipolar plane images (EPI) which provide a rather compact representation of the scene. In this context, this paper proposes an EPI based view rendering framework for 3D video coding solution and identifies the major benefits of such framework, notably in comparison with the traditional local synthesis approach.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121415630","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}
{"title":"Non-invasive imaging based on sparse representation","authors":"K. Wei, Xin Jin, Yifu Hu, Qionghai Dai","doi":"10.1109/MMSP.2015.7340865","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340865","url":null,"abstract":"In this paper, we propose a method based on sparse representation to accelerate the scanning technique to perform non-invasive imaging through scattering layers. The scanning time is proportional to the size of the collected integrated intensity pattern and it usually takes tens of hours to finish the collecting process. To speed up the scanning technique, only a much smaller integrated intensity pattern is collected. A training set of integrated intensity pattern pairs with sizes corresponding to the necessary integrated intensity pattern that makes the scanning technique work well and the much smaller one is constructed. And a pair of dictionaries is trained from the constructed set exploiting the K-SVD algorithm. Based on sparse representation, the necessary integrated intensity pattern can be recovered from the much smaller one using the trained dictionaries, thus realizing non-invasive imaging successfully. Experimental results show that our method can successfully make the scanning time reduced by 8/9 without deteriorating the imaging quality of the scanning technique.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130533656","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}
Damien Schroeder, Adithyan Ilangovan, E. Steinbach
{"title":"Multi-rate encoding for HEVC-based adaptive HTTP streaming with multiple resolutions","authors":"Damien Schroeder, Adithyan Ilangovan, E. Steinbach","doi":"10.1109/MMSP.2015.7340822","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340822","url":null,"abstract":"Adaptive HTTP streaming requires a video to be encoded at different rates and qualities called representations. The encoding of multiple representations with the new video coding standard HEVC is computationally complex. In this paper, we propose a multi-rate encoding method which reduces the complexity of encoding a video at multiple spatial resolutions. We first examine block structure similarities at different resolutions and propose a method to derive the block structure for a low resolution representation from a reference high resolution encoding. The derived block structure is used to speed up the encoding of low resolution representations. We further consider the content of the videos in order to achieve a rate-distortion (RD) performance similar to independent HEVC encoding. Experimental results show that the encoding time can be reduced by 50% on average for a low resolution video without degrading the RD performance.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115758507","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}
{"title":"Human action recognition using temporal hierarchical pyramid of depth motion map and KECA","authors":"Nour El-Din El-Madany, Yifeng He, L. Guan","doi":"10.1109/MMSP.2015.7340857","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340857","url":null,"abstract":"Human action recognition is one of the challenging research problems in computer vision. In this paper, we propose a novel approach for human action recognition. The proposed approach employs a temporal hierarchical pyramid of depth motion map to capture the temporal variations over the time. In addition, Kernel Entropy Component Analysis (KECA) is used to reduce the dimension and to enhance the discriminatory power for action recognition. The proposed method was evaluated using two datasets, MSR-Action 3D dataset and MSR-Gesture 3D dataset. The experimental results demonstrated that the proposed method can achieve a higher average accuracy compared to several existing methods.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113988591","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}
{"title":"Scalable logo recognition based on compact sparse dictionary for mobile devices","authors":"Sheng Tang, Yongdong Zhang, Hui Chen","doi":"10.1109/MMSP.2015.7340863","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340863","url":null,"abstract":"In this paper, we present a novel scalable logo recognition system which can recognize a large number of logo categories locally on mobile devices. The system is unsupervised without any supervised training procedure, and very time efficient at low memory cost. It is also robust against challenging conditions such as noise addition, different image scale, rotation, etc. To achieve this goal, we propose an efficient segmental quantization approach for generation of large visual words over one million size with a very compact vocabulary. The vocabulary consists of two small dictionaries learned through sparse non-negative matrix factorization (NMF) of local SIFT descriptors. With an inverted index structure built through the large visual words, query images containing logos can be recognized through efficient retrieval of K-nearest neighbors (K-NN) of logo instances in the dataset. Our vocabulary size is very small, only one thousandth of that of traditional Approximate K-Means (AKM) method, which is of great importance for mobile devices with limited memory. Furthermore, based on the compact dictionary, we present a promising verification way of filtering false positives via sparse reconstruction of SIFT descriptors with a very few number of sparse codes due to the sparsity's property of lowest reconstruction error. Experiments on our dataset with 400 logo classes show that our system is very efficient and effective.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131407695","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}
{"title":"Contrast and distribution based saliency detection in infrared images","authors":"Lu Li, Yu Zheng, F. Zhou","doi":"10.1109/MMSP.2015.7340825","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340825","url":null,"abstract":"Saliency-based approaches has been well studied and successfully used in object detection for visible images. However, few researches have been done for saliency detection in infrared images, which are characterized with low resolution, SNR and contrast, fuzzy edge and lack of color features. In this paper, a contrast and distribution based saliency detection approach is proposed for infrared images. First, we develop an enhanced multi-scale saliency feature by improving the quality and contrast of the image in frequency domain. Second, luminance-distribution and gradient feature are explored to highlight the object with great gradient and compact distribution. Finally, by integrating the above two features, the final saliency map for infrared image were obtained. Experimental results on real infrared images demonstrate the effectiveness of the proposed approach against the state-of-the-art algorithms.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133308332","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}
{"title":"Visual summarization for place-of-interest by social-contextual constrained geo-clustering","authors":"Yayun Ren, Xueming Qian, Shuhui Jiang","doi":"10.1109/MMSP.2015.7340837","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340837","url":null,"abstract":"With the rapid development of social networks, more and more users choose to share their own photos with their friends. Especially, users prefer to share the photos they took during traveling, thus there emerges many user generated content for place-of-interests (POIs). So based on the user contributed photos, we can summarize each POI by mining location-of-interest (LOI, which represents the attractive viewpoints of POI) and selecting some representative images from them. It is important for scheduling a traveling, and in this paper, an effective POI summarization approach is proposed by an improved geo-clustering with visual and views verification, which helps us to have a representative and comprehensive perception for POI. In our approach, we firstly collect POI related photos from social media, and filter the raw data by the combination of tags and geo-locations. Secondly, we mine LOIs for each POI by the improved geo-location clustering method. Finally, we employ visual and views verification to select images from LOIs to summarize the POI. We conduct a series of experiments based on Flcoickr dataset. Experimental results demonstrate the effectiveness of our proposed method.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114216013","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}
Yuan Yuan, Gene Cheung, P. Frossard, P. Callet, H. V. Zhao
{"title":"Contour approximation & depth image coding for virtual view synthesis","authors":"Yuan Yuan, Gene Cheung, P. Frossard, P. Callet, H. V. Zhao","doi":"10.1109/MMSP.2015.7340855","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340855","url":null,"abstract":"A depth image provides geometric information of a 3D scene, namely the shapes of physical objects captured from a particular viewpoint. This information is important for synthesizing images corresponding to different virtual camera viewpoints via depth-image-based rendering (DIBR). Since it has been shown that blurring of object contours in the depth images leads to bleeding artefacts in virtual images. The most effective way to compress depth images relies on edge-adaptive image codecs that preserve contours, which are losslessly coded as side information (SI). However, lossless coding of the exact object contours can be expensive. In this paper, we argue that the contours themselves can be suitably approximated to save bits, while the depth images piecewise smooth (PWS) characteristic stays preserved. Specifically, we first propose a metric that estimates contour coding rate based on edge statistics. Given an initial rate estimate, we then pro-actively approximate object contours in a way that guarantees rate reduction when coded using arithmetic edge coding (AEC) as SI. Given the sharp but approximated contours, we finally encode the image using an edge-adaptive image codec with graph Fourier transform (GFT) for edge preservation. We show in our experiments that by maintaining sharp but slightly inaccurate object contours, the resulting quality of virtual views synthesized via DIBR exceeds those synthesized using depth images compressed with edge-adaptive codecs that losslessly encode object contours as SI, in particular when the total coding rate budget is low. This confirms that optimized coding of depth images results in an effective tradeoff in the representation of contour and respective depth information.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122562457","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}