2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)最新文献

筛选
英文 中文
VRank: Voting system on Ranking model for human age estimation VRank:基于排名模型的投票系统,用于人类年龄估计
2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP) Pub Date : 2015-12-03 DOI: 10.1109/MMSP.2015.7340789
Tekoing Lim, K. Hua, Hong-Cyuan Wang, Kai Zhao, Min-Chun Hu, Wen-Huang Cheng
{"title":"VRank: Voting system on Ranking model for human age estimation","authors":"Tekoing Lim, K. Hua, Hong-Cyuan Wang, Kai Zhao, Min-Chun Hu, Wen-Huang Cheng","doi":"10.1109/MMSP.2015.7340789","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340789","url":null,"abstract":"Ranking algorithms have proven the potential for human age estimation. Currently, a common paradigm is to compare the input face with reference faces of known age to generate a ranking relation whereby the first-rank reference is exploited for labeling the input face. In this paper, we proposed a framework to improve upon the typical ranking model, called Voting system on Ranking model (VRank), by leveraging relational information (comparative relations, i.e. if the input face is younger or older than each of the references) to make a more robust estimation. Our approach has several advantages: firstly, comparative relations can be explicitly involved to benefit the estimation task; secondly, few incorrect comparisons will not influence much the accuracy of the result, making this approach more robust than the conventional approach; finally, we propose to incorporate the deep learning architecture for training, which extracts robust facial features for increasing the effectiveness of classification. In comparison to the best results from the state-of-the-art methods, the VRank showed a significant outperformance on all the benchmarks, with a relative improvement of 5.74% ~ 69.45% (FG-NET), 19.09% ~ 68.71% (MORPH), and 0.55% ~ 17.73% (IoG).","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128971721","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}
引用次数: 5
Future buffer based adaptation for VBR video streaming over HTTP 未来基于缓冲区的基于HTTP的VBR视频流适应
2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP) Pub Date : 2015-12-03 DOI: 10.1109/MMSP.2015.7340878
T. Vu, Hung T. Le, Duc V. Nguyen, N. P. Ngoc, T. Thang
{"title":"Future buffer based adaptation for VBR video streaming over HTTP","authors":"T. Vu, Hung T. Le, Duc V. Nguyen, N. P. Ngoc, T. Thang","doi":"10.1109/MMSP.2015.7340878","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340878","url":null,"abstract":"HTTP streaming has become a cost effective means for video delivery nowadays. To enable adaptivity to networks and terminals, a provider should generate multiple representations of an original video as well as the related signaling metadata. So far, most previous studies have just focused on the case of CBR (constant bit rate) video. In this paper, we propose a novel adaptation method for VBR (variable bitrate) video streaming. Based on a trellis representation to estimate future buffer levels, the proposed method can provide smooth video quality while avoiding buffer underflows. The experimental results show that our approach can perform effectively under drastic changes of both connection throughput and video bitrate.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124170666","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}
引用次数: 5
RIFO: Restoring images with fence occlusions 复原带有栅栏遮挡的图像
2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP) Pub Date : 2015-12-03 DOI: 10.1109/MMSP.2015.7340834
Jingyu Yang, J. Wang, Leijie Liu, Chunping Hou
{"title":"RIFO: Restoring images with fence occlusions","authors":"Jingyu Yang, J. Wang, Leijie Liu, Chunping Hou","doi":"10.1109/MMSP.2015.7340834","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340834","url":null,"abstract":"Many scenes, e.g., zoos, parks, and gardens, are guarded by fences, and people can only take pictures through the fences. It is desirable to remove visually-annoying fence occlusions from images. This paper proposes a novel approach to restore images from fence occlusions (RIFO). The proposed method consists of two steps: fence detection, and disocclusion restoration. In fence detection, the image is first clustered into superpixels, which are fitted into rectangles. We collect fence pixels from superpixels by determining the elongation of their fitted rectangles. A primary shape of the fence is obtained by a color-based classifier learned from sampled pixels. Then, multi-RANSAC and moving least squares (MLS) are used for sketching the fence structure. Complete fence is detected by expanding the fence structure. Disoccluded regions are restorated by a patch-based approach using matrix completion. Experimental results show that our method detects complete fences from images, and the disoccluded regions are faithfully recovered, yielding clean and complete images.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"48 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130008100","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}
引用次数: 6
Reducing Wedgelet lookup table size with down-sampling for depth map coding in 3D-HEVC 减少Wedgelet查找表的大小与下采样深度图编码在3D-HEVC
2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP) Pub Date : 2015-12-03 DOI: 10.1109/MMSP.2015.7340849
S. Ma, Yong Wang, Ce Zhu, Yongbing Lin, Jianhua Zheng
{"title":"Reducing Wedgelet lookup table size with down-sampling for depth map coding in 3D-HEVC","authors":"S. Ma, Yong Wang, Ce Zhu, Yongbing Lin, Jianhua Zheng","doi":"10.1109/MMSP.2015.7340849","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340849","url":null,"abstract":"In 3D-HEVC, a new coding standard of 3D video, Explicit Wedgelet mode within Depth Modelling Modes (DMM) partitions a depth block into two non-rectangular regions using a Wedgelet pattern selected from a Wedgelet lookup table. The Wedgelet lookup table is constructed during both encoder and decoder initialization for each block size ranging from 4×4 to 16×16, while the Wedgelet lookup table consists of a large number of Wedgelet bi-patterns, which involves relatively high computational complexity and may cause cache storing problem. In this paper, we propose a down-sampling method to reduce the number of Wedgelet patterns in the Wedgelet lookup table. The experimental results show our proposed down-sampling method can achieve storage size reduction by 27.8% with negligible 0.03% and 0.05% coding loss in both configurations of Common Test Conditions (CTC) and All Intra (AI), respectively.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114446506","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}
引用次数: 12
Learning query and image similarities with listwise supervision 用列表监督学习查询和图像相似度
2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP) Pub Date : 2015-12-03 DOI: 10.1109/MMSP.2015.7340793
Yuan Liu, Zhongchao Shi, Zhenhua Liu, Xue Li, G. Wang
{"title":"Learning query and image similarities with listwise supervision","authors":"Yuan Liu, Zhongchao Shi, Zhenhua Liu, Xue Li, G. Wang","doi":"10.1109/MMSP.2015.7340793","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340793","url":null,"abstract":"One of the fundamental problems in image search is to learn the ranking functions, i.e., similarity between the textual query and visual image. A number of research paradigms, ranging from feature-based vector model to image ranker learning, have been applied to measure query-image similarity. However, most of the existing similarity learning methods either depend on surrounding texts for ranking images or learn image rankers to satisfy pairwise or tripletwise supervision. In this paper, we propose to leverage listwise supervision into a principled click-through-based query-image similarity learning framework. In particular, the algorithm utilizes click counts for each image in response to a query to get a ranking list. The ranking information is represented by a set of rank triplets that can be used to assess the quality of the ranking list. The image ranking problem is then solved efficiently by learning two linear projections for query and image space respectively, through maximizing the ranking quality over all the training data. When the two linear projections are learnt, query-image similarity can be directly computed by dot product on this projected subspace. On a large-scale click-through-based image dataset with 11.7 million queries and one million images, our learnt model via listwise supervision is shown to be powerful for keyword-based image search with superior performance over several state-of-the-art methods.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"1067 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123164999","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}
引用次数: 1
Rating prediction via exploring service reputation 通过探索服务声誉进行评级预测
2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP) Pub Date : 2015-12-03 DOI: 10.1109/MMSP.2015.7340814
Xiaojiang Lei, Xueming Qian
{"title":"Rating prediction via exploring service reputation","authors":"Xiaojiang Lei, Xueming Qian","doi":"10.1109/MMSP.2015.7340814","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340814","url":null,"abstract":"With the explosion of e-commerce, it presents a great opportunity for people to share their consumption experience in review websites. However, at the same time we face the information overloading problem. How to mine valuable information from these reviews and make an accurate recommendation is crucial for us. Traditional recommender systems (RS) consider many factors, such as product category, geographic location, user's purchase records, and the other social network factors. In this paper, we firstly propose a social user's reviews sentiment measurement approach and calculate each user's sentiment score on items/services. Secondly, we consider service reputation, which reflects the customers' comprehensive evaluation. At last, we fuse service reputation factor into our recommender system to make an accurate rating prediction, which is based on probabilistic matrix factorization. We conduct a series of experiments on Yelp dataset, and experimental results show the proposed approach outperforms the existing RS approaches.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126547664","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}
引用次数: 25
Accurate silhouette extraction of multiple moving objects for free viewpoint sports video synthesis 准确的轮廓提取多个运动对象的自由视点体育视频合成
2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP) Pub Date : 2015-12-03 DOI: 10.1109/MMSP.2015.7340803
Qiang Yao, Hiroshi Sankoh, H. Sabirin, S. Naito
{"title":"Accurate silhouette extraction of multiple moving objects for free viewpoint sports video synthesis","authors":"Qiang Yao, Hiroshi Sankoh, H. Sabirin, S. Naito","doi":"10.1109/MMSP.2015.7340803","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340803","url":null,"abstract":"In this paper, we propose a new method of automatic silhouette extraction of multiple moving objects with high accuracy for free viewpoint stadium sports video synthesis. The proposed method is basically composed of three parts, including a global extraction based on temporal background subtraction, a classification step based on the constraints of extracted candidates of objects, and local refinement based on the statistical information of the chrominance component of each extracted object. Experimental results show that the proposal outperforms the temporal background subtraction model and Gaussian Mixture Model (GMM) in terms of both objective and subjective evaluations. In addition, the quality of the synthesized free viewpoint sports video is also enhanced by adopting more accurate silhouettes of objects that are extracted by our proposed method. Furthermore, as there is no manual operation in the proposed method, the automatic multiple silhouettes extraction has also been fully realized.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126087665","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}
引用次数: 7
Spatial-temporal correlation for trajectory based action video retrieval 基于轨迹的动作视频检索的时空相关性
2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP) Pub Date : 2015-12-03 DOI: 10.1109/MMSP.2015.7340811
Xi Shen, Lelin Zhang, Zhiyong Wang, D. Feng
{"title":"Spatial-temporal correlation for trajectory based action video retrieval","authors":"Xi Shen, Lelin Zhang, Zhiyong Wang, D. Feng","doi":"10.1109/MMSP.2015.7340811","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340811","url":null,"abstract":"The bag-of-visual-words model has been widely utilized for content based image and video retrieval due to its scalability. In this paper, we extend this model for human action video retrieval. We adopt dense trajectory features which are able to achieve the state-of-the-art performance on action recognition, while most of the existing video retrieval methods utilize descriptors of local interest points. In order to improve similarity measurement between bag-of-visual-words model based representation, we propose to discover and incorporate spatial-temporal correlation (STC) among the trajectories in a given query video. The spatial-temporal correlation consists of spatial proximity and temporal consistence among trajectories, which is capable of strengthening discriminative power among visual words. Note that such query focused spatial-temporal correlation makes our method dynamic for different queries and is able to improve retrieval performance without significantly increasing the size of a visual vocabulary. The experimental results on an action video dataset demonstrate that our proposed method outperforms other similar methods.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"80 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134330735","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}
引用次数: 2
Dictionary design for sensor network localization via block-sparsity 基于块稀疏的传感器网络定位词典设计
2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP) Pub Date : 2015-12-03 DOI: 10.1109/MMSP.2015.7340843
Alessandro Bay, Diego Carrera, S. Fosson, P. Fragneto, Marco Grella, C. Ravazzi, E. Magli
{"title":"Dictionary design for sensor network localization via block-sparsity","authors":"Alessandro Bay, Diego Carrera, S. Fosson, P. Fragneto, Marco Grella, C. Ravazzi, E. Magli","doi":"10.1109/MMSP.2015.7340843","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340843","url":null,"abstract":"In this paper, we consider the problem of RSS-fingerprinting localization in wireless sensor networks. In particular, inspired by the recent advances in sparse approximation and compressive sensing theory, we propose a localization scheme based on the dictionary design of block-sparse signals. We show via numerical simulations and real experiments that the proposed technique outperforms traditional fingerprinting methods.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125696694","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}
引用次数: 2
Fast learning discriminative dictionaries for large-scale visual recognition 面向大规模视觉识别的快速学习判别字典
2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP) Pub Date : 2015-12-03 DOI: 10.1109/MMSP.2015.7340876
Tianyi Zhao, Yanyun Qu, Jianping Fan
{"title":"Fast learning discriminative dictionaries for large-scale visual recognition","authors":"Tianyi Zhao, Yanyun Qu, Jianping Fan","doi":"10.1109/MMSP.2015.7340876","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340876","url":null,"abstract":"In this paper, we aim at improving the discriminative jointly dictionaries for large-scale image classification. Sparse representation is a popular tool for image classification. Visual dictionary is very critical to the classification performance. A visual tree is constructed according to the visual similarity, in which the higher layer represents the coarser membership and the lower layer represents the finer membership. Jointly dictionary is learned according to the visual tree. Bregman iterative algorithm is implemented to solve the optimal problem of joint dictionary learning, which makes the solution accurate and the running speed fast. Furthermore, we try to implement the pre-trained features learned from the convolution neural network (CNN) to represent an image, and the residual error of the sparse representation is utilized for image classification. The experimental results demonstrate that the CNN feature is more distinct than SIFT, and the hierarchical classification framework with the Bregman iteration algorithm can greatly improve the performance of classification.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115849315","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书