{"title":"Augmenting flower recognition by automatically expanding training data from web","authors":"Cheng-Yu Huang, Yen-Liang Lin, Winston H. Hsu","doi":"10.1109/MMSP.2015.7340809","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340809","url":null,"abstract":"Aiming to improve recognition rate, we propose a novel flower recognition system that automatically expands the training data from large-scale unlabeled image pools without human intervention. Existing flower recognition approaches often learn classifiers based on a small labeled dataset. However, it is difficult to build a generalizable model (e.g., for real-world environment) with only a handful of labeled training examples, and it is labor-intensive for manually annotating large-scale images. To resolve these difficulties, we propose a novel framework that automatically expands the training data to include visually diverse examples from large-scale web images with minimal supervision. Inspired by co-training methods, we investigate two conceptually independent modalities (i.e., shape and color) that provide complementary information to learn our discriminative classifiers. Experimental results show that the augmented training set can significantly improve the recognition accuracy (from 65.8% to 75.4%) with a very small initially labeled training set. We also conduct a set of sensitivity tests to analyze different learning strategies (i.e., co-training and self-training) and show that co-training is more efficient in our multi-view flower dataset.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"315 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":"115769976","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":"k-Nearest Neighbors algorithm based on weak bit implementation on Enhanced Vote Count circuit","authors":"H. Shu, Wenyu Jiang, R. Yu","doi":"10.1109/MMSP.2015.7340862","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340862","url":null,"abstract":"k-Nearest Neighbors (kNN) algorithm is a method to find the closest points in a dataset to a query point. The result of kNN can be used for classification and regression, both of which are commonly used in data mining and machine learning. In this paper, Enhanced Vote Count (EVC) circuit, which uses hardware to compare the quantized projected values of query and training/reference vectors instead of the vectors themselves, is considered to approximate the kNN search to provide a low complexity search solution. To improve the performance of EVC with limited projection number because projection number is directly related to implementation cost of EVC circuit, the concept of weak bit is considered and only reliable binary pattern matching is evaluated. The implementation of weak bit based on EVC circuit is also described. Simulation results show that, the performance of EVC can be significantly improved with weak bit implementation under limited projection number.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"31 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":"132078174","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":"Deep Matrix Factorization for social image tag refinement and assignment","authors":"Zechao Li, Jinhui Tang","doi":"10.1109/MMSP.2015.7340796","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340796","url":null,"abstract":"The number of images associated with user-provided tags has increased dramatically in recent years. User-provided tags are incomplete, subjective and noisy. In this work, we focus on the problem of image tag refinement and assignment. Different from previous work, we propose a novel Deep Matrix Factorization (DMF) algorithm, which uncovers the latent image representations and tag representations embedded in the latent subspace by exploiting the weakly-supervised tagging information and visual information. Due to the well-known semantic gap, the hidden representations of images are learned by a hierarchical model, which are progressively transformed from the visual feature space. It can naturally embed new images into the subspace using the learned deep architecture. Besides, to remove the noisy or redundant visual features, a sparse model is imposed on the transformation matrix of the first layer in the deep architecture. Finally, a unified optimization problem with a well-defined objective function is developed to formulate the proposed problem. Extensive experiments on real-world social image databases are conducted on the tasks of image tag refinement and assignment. Encouraging results are achieved with comparison to the state-of-the-art algorithms, which demonstrates the effectiveness of the proposed method.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"52 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":"121951271","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":"Affine scale space for viewpoint invariant keypoint detection","authors":"Biao Zhao, S. Lepsøy, E. Magli","doi":"10.1109/MMSP.2015.7340860","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340860","url":null,"abstract":"The research of affine scale space is to create a more general approach to the affine invariant image scale representation by modifying the corresponding Gaussian filters in order to cope with the specific change of view point. It has the purpose to retain a linear relationship with the transiting of the view point. With this linear relationship, the affine scale space could be established as a more general approach for the affine invariant image retrieval, including affine feature detection and affine feature descriptor. The scope of this paper is to discuss the accessible to the affine scale space, its performance and a practical implementation to construct it in order to cope with the high complexity brought in by the scale space and the affine adaptation.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"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":"122811019","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":"Graph spectral motion segmentation based on motion vanishing point analysis","authors":"Dong Tian, Jiun-Yu Kao, H. Mansour, A. Vetro","doi":"10.1109/MMSP.2015.7340869","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340869","url":null,"abstract":"Motion segmentation relies on identifying coherent relationships between image pixels that are associated with motion vectors. However, perspective differences can often deteriorate the performance of conventional techniques. In this paper, we develop a motion segmentation scheme that utilizes the motion map of a single frame to identify motion representations based on motion vanishing points. Segmentation is achieved using graph spectral clustering where a novel graph is constructed using the motion representation distances in the motion vanishing point image associated with the image pixels. Experimental results show that the proposed graph spectral motion segmentation algorithm outperforms state-of-the-art methods for dense segmentation on image sequences with strong perspective effects using motion vectors between only two images.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"35 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":"125562529","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}
Vinh-Tiep Nguyen, Dinh-Luan Nguyen, M. Tran, Duy-Dinh Le, D. Duong, S. Satoh
{"title":"Query-adaptive late fusion with neural network for instance search","authors":"Vinh-Tiep Nguyen, Dinh-Luan Nguyen, M. Tran, Duy-Dinh Le, D. Duong, S. Satoh","doi":"10.1109/MMSP.2015.7340795","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340795","url":null,"abstract":"Bag-of-Word based model is one of the state-of-the-art approaches for object retrieval or also known as instance search problem. Although this model and its extensions are good for rich-textured objects, it is still unsolved for searching on textureless ones. In this paper, we propose to combine this model with Deformable Part Models object detector using late fusion technique to improve final result. To find the optimal weights for each type of query objects, we further propose to use a neural network to learn query features including object area, number of shared visual words to get optimal weights for each model. Experimental results on TRECVID Instance Search (INS) dataset with queries in INS2013 and INS2014 show that our proposed method significantly improves 18.48% and 14.63% in mAP respectively comparing to standard BOW model and outperform other state-of-the-art methods. This method opens a new way of adaptively combining DPM, an object detector, in a hybrid model for visual instance search.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"168 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120898459","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":"Fast DASH bootstrap","authors":"Nassima Bouzakaria, C. Concolato, J. L. Feuvre","doi":"10.1109/MMSP.2015.7340868","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340868","url":null,"abstract":"Adaptive HTTP Streaming has become a widespread technology for delivering video to the end users. However, this technology usually suffers from various latencies, requiring an initial delay before playback. This is problematic for low delay or interactive applications, such as gaming or live event webcasting. A long initial waiting time is perceived by most users as bad quality, or even non-working content. In this paper, we review the causes of initial delays in MPEG-DASH and common strategies used to reduce this latency. We propose a new method based on HTTP/1.1 and compatible with existing infrastructures for the initial setup of an MPEG-DASH session. We compare our proposal to several existing approaches based on HTTP/1.x and on the HTTP/2 server push technique. Our experimental results show that 2 RTTs can be avoided and that the total downloaded size is reduced by 25% when using HTTP/1.1 and by 20% in HTTP/2 with similar latency.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"197 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":"125729400","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":"Popular song summarization using chorus section detection from audio signal","authors":"Sheng Gao, Haizhou Li","doi":"10.1109/MMSP.2015.7340798","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340798","url":null,"abstract":"Music signal is a one-dimensional temporal sequence. It thus incurs difficulty for the listeners to quickly capturing the mostly attracting parts in popular songs, unless the listeners play the song until the ending. In order to improve the listening experience, music summarization, a tool to summarize the song using the most attractive sections, is needed. In the paper, a system and method is presented to summarize the popular songs by detecting the chorus sections from the input audio signal. The proposed summarization system uses the unique audio feature representation method, i.e. the octave-dependent probabilistic latent semantic analysis, and the chorus detection algorithm that combines the repeated segment extraction and chorus identification. The performance of music summarization is evaluated on the song database with the ground truth of chorus sections, i.e. the start and ending time-stamp of each chorus section. As we know, it is the first systematically evaluation of music summary performance. In terms of multiple metrics such as the boundary accuracy, precision, recall and F1, we show that the proposed system is much superior to the widely accepted methods.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"32 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":"133931098","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":"Speech enhancement based on robust NMF solved by alternating direction method of multipliers","authors":"Yinan Li, Xiongwei Zhang, Meng Sun, Jingfeng Pan","doi":"10.1109/MMSP.2015.7340815","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340815","url":null,"abstract":"A robust version of non-negative matrix factorization (RNMF) with generalized Kullback-Leibler divergence designed for the task of unsupervised monaural speech enhancement is proposed. RNMF tackles unsupervised speech enhancement problem through factorizing the magnitude spectrum of mixture into the sum of a non-negative sparse matrix and a non-negative low-rank matrix. The parameters of nonnegative components are estimated through minimizing the reconstruction error defined by the divergence. The closed-from updating formulae of RNMF are derived using alternating direction method of multipliers. Experimental results demonstrated that the proposed algorithm yields superior results compared with the multiplicative updates at the expense of more computational complexity.","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":"123989004","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":"A calibration simplified method for gaze interaction based on using experience","authors":"C. Niu, Jiande Sun, Jing Li, Hua Yan","doi":"10.1109/MMSP.2015.7340846","DOIUrl":"https://doi.org/10.1109/MMSP.2015.7340846","url":null,"abstract":"The step of calibration prevents the gaze interaction from interacting naturally, which usually needs five or more calibration points to obtain the user's calibration information. In this paper, a calibration simplified method is proposed, which is based on user experience and consists of the user experience accumulation stage and the calibration simplified stage. In the user experience accumulation stage, the calibration is still needed as usual before each gaze interaction and the calibration parameters and the position of the user are stored as the calibration experience, where the calibration parameters include the actual coordinates of the calibration points and their estimation errors. In the calibration simplified stage, the user needs to fixate on only one calibration point for calibration before the calibration information can be estimated according to the user experience stored in the first stage. Even the calibration information can be estimated according to only the position of the user and the stored calibration parameters, which means the user can interact with computer via gaze directly without calibration. The simulations show that the gaze estimation accuracy of the proposed calibration simplified method can be 1.4047° with one calibration point and 1.7489° without calibration point, which are much higher than that without the user experience.","PeriodicalId":108577,"journal":{"name":"2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP)","volume":"28 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":"123280910","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}