Junping Song, Yanwei Liu, Jinxia Liu, S. Ci, Xu Zhou, Yan Zhang
{"title":"A playback length changeable 3D data segmentation algorithm for scalable 3D video P2P streaming system","authors":"Junping Song, Yanwei Liu, Jinxia Liu, S. Ci, Xu Zhou, Yan Zhang","doi":"10.1109/ICME.2013.6607578","DOIUrl":"https://doi.org/10.1109/ICME.2013.6607578","url":null,"abstract":"Scalable 3D video P2P streaming systems can supply diverse 3D experiences for heterogeneous clients with high efficiencies. Data characteristics of the scalable 3D video make the P2P streaming efficiency more depends on the data segmentation algorithm. However, traditional data segmentation algorithm is not very appropriate for scalable 3D video P2P streaming systems. In this paper, we propose a Playback Length Changeable 3D video Segmentation (PLC3DS) algorithm. It considers the particular source-data characteristics of scalable 3D video, and provides different error resilience strengths to video and depth as well as layers with different importance levels in the transmission. The simulation results show that the proposed PLC3DS algorithm can increase the success delivery rates of chunks in more important layers, and further improve the 3D experiences of the client. Moreover, it improves the network utilization ratio remarkably.","PeriodicalId":419218,"journal":{"name":"2013 IEEE International Conference on Multimedia and Expo (ICME)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130374384","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":"Block-based long-term content-based image retrieval using multiple features","authors":"Zhongmiao Xiao, Xiaojun Qi","doi":"10.1109/ICME.2013.6607471","DOIUrl":"https://doi.org/10.1109/ICME.2013.6607471","url":null,"abstract":"This paper proposes a novel content-based image retrieval technique, which integrates block-based visual features and user's query concept-based semantic features. It also facilitates short-term and long-term learning processes by integrating users' historical relevance feedback information. The history is compactly stored in a semantic feature matrix and efficiently represented as semantic features of the images. The short-term relevance feedback technique can benefit from long-term learning. The high-level semantic features are dynamically updated based on users' query concept and therefore represent the image's semantic meaning more accurately. Our extensive experimental results demonstrate that the proposed system outperforms its seven state-of-the-art peer systems in terms of retrieval precision and storage space.","PeriodicalId":419218,"journal":{"name":"2013 IEEE International Conference on Multimedia and Expo (ICME)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123148192","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":"Design of a monocular simultaneous localisation and mapping system with ORB feature","authors":"Li Jun, Tien-Szu Pan, K. Tseng, Jeng-Shyang Pan","doi":"10.1109/ICME.2013.6607458","DOIUrl":"https://doi.org/10.1109/ICME.2013.6607458","url":null,"abstract":"Vision-based Simultaneous Localisation and Mapping (Visual SLAM) is a new hot topic in intelligent robotic applications. A new method for the implementation of a visual SLAM system with monocular vision is proposed in this paper. The general framework of our system is first displayed, and then all the main sub-processes are described step by step. In our design we use the ORB feature to represent each natural landmark with an improved map management and modified covariance extended Kalman filter (MVEKF) to estimate the 6D pose of a free-moving camera. In order to validate and demonstrate the performance of the system, some related experiments are carried out. The experimental results show that our method is feasible, robust and efficient.","PeriodicalId":419218,"journal":{"name":"2013 IEEE International Conference on Multimedia and Expo (ICME)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121341751","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 method for calculating the minimum number of cameras in a light field based free viewpoint video system","authors":"H. Shidanshidi, F. Safaei, Wanqing Li","doi":"10.1109/ICME.2013.6607491","DOIUrl":"https://doi.org/10.1109/ICME.2013.6607491","url":null,"abstract":"Calculation of the number of cameras required to capture the scene is an essential problem in a practical light field based free viewpoint video (FVV) system. Existing methods calculate the Nyquist rate by assuming a band-limited signal and perfect reconstruction of an arbitrary view using linear interpolation, which often results in an impractically high number of cameras. This paper proposes a new method based on the concept of effective sampling density (ESD). It is demonstrated that there is a trade-off between the depth information accuracy, the required number of cameras, and the desired rendering quality, which could be exploited to minimize the number of cameras for a given objective. Theoretical and numerical results show that the resulting number of cameras is significantly lower than what was reported in other studies with only a few percent reduction in the output PSNR. Moreover, it is shown that the methods proposed in those studies are special cases of the one presented in this paper.","PeriodicalId":419218,"journal":{"name":"2013 IEEE International Conference on Multimedia and Expo (ICME)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131363242","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}
O. Mzoughi, Itheri Yahiaoui, N. Boujemaa, E. Zagrouba
{"title":"Automated semantic leaf image categorization by geometric analysis","authors":"O. Mzoughi, Itheri Yahiaoui, N. Boujemaa, E. Zagrouba","doi":"10.1109/ICME.2013.6607636","DOIUrl":"https://doi.org/10.1109/ICME.2013.6607636","url":null,"abstract":"Unravelling mysteries of the diversity of the plant community is a crucial issue both for the development of many botanical industries as well as for the conservation of ecosystem biodiversity. Traditionally, botanists have proposed detailed dichotomous key descriptions (called also characters or concepts) about the morphology of plants and particularly of leaves that allow them to construct relationships between different plants and between plants and their environment. However, extracting these concepts is complicated, painstaking and can only be carried out by experts. One way to accelerate and broaden the use of these concepts is to automatically extract them directly from images. In this paper, we focus on one of the most basic and important concepts: the leaf arrangement. According to this concept, leaves are divided into four categories: simple, pinnnately compound, palmately compound and compound trifoliate. To accomplish this task, we follow a hierarchical scheme, reducing ambiguity between categories from the most different shapes to the most similar ones. The choice of appropriate features is performed based on botanical observations and validated by a statistical study. The method was tested on real world leaf images (the Pl@ntLeaves scans). Experimental results show its robustness for a high number of leaf species (70 species) and even in the presence of some distortions (such as rotation and partial leaf overlapping).","PeriodicalId":419218,"journal":{"name":"2013 IEEE International Conference on Multimedia and Expo (ICME)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131931431","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":"Sparse optical flow regularization for real-time visual tracking","authors":"Vincent Spruyt, A. Ledda, W. Philips","doi":"10.1109/ICME.2013.6607495","DOIUrl":"https://doi.org/10.1109/ICME.2013.6607495","url":null,"abstract":"Optical flow can greatly improve the robustness of visual tracking algorithms. While dense optical flow algorithms have various applications, they can not be used for real-time solutions without resorting to GPU calculations. Furthermore, most optical flow algorithms fail in challenging lighting environments due to the violation of the brightness constraint. We propose a simple but effective iterative regularisation scheme for real-time, sparse optical flow algorithms, that is shown to be robust to sudden illumination changes and can handle large displacements. The algorithm proves to outperform well known techniques in real life video sequences, while being much faster to calculate. Our solution increases the robustness of a real-time particle filter based tracking application, consuming only a fraction of the available CPU power. Furthermore, a new and realistic optical flow dataset with annotated ground truth is created and made freely available for research purposes.","PeriodicalId":419218,"journal":{"name":"2013 IEEE International Conference on Multimedia and Expo (ICME)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126573125","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":"Social grouping for target handover in multi-view video","authors":"Zhen Qin, C. Shelton, Lunshao Chai","doi":"10.1109/ICME.2013.6607433","DOIUrl":"https://doi.org/10.1109/ICME.2013.6607433","url":null,"abstract":"This paper uses a social grouping model to improve target handover across multiple non-overlapping cameras to enable wide-area video understanding. Prior work focuses on modeling appearance and spatial-temporal cues for target handover. In cameras with different conditions, these cues are weak, at best. We provide a complete generative social grouping model which generalizes a recent single-camera case. Our extension requires strengthening the probabilistic interpretations and the resulting optimization over track handovers and social groupings can be formulated in terms of standard fast algorithms. We demonstrate the effectiveness of the method over existing techniques on challenging real-world multi-camera video.","PeriodicalId":419218,"journal":{"name":"2013 IEEE International Conference on Multimedia and Expo (ICME)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125219397","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":"User-aided single image shadow removal","authors":"H. Gong, D. Cosker, Chuan Li, Matthew A. Brown","doi":"10.1109/ICME.2013.6607463","DOIUrl":"https://doi.org/10.1109/ICME.2013.6607463","url":null,"abstract":"This paper presents a novel user-aided method for texture-preserving shadow removal from single images which only requires simple user input. Compared with the state-of-the-art, our algorithm addresses limitations in uneven shadow boundary processing and umbra recovery. We first detect an initial shadow boundary by growing a user specified shadow outline on an illumination-sensitive image. Interval-variable intensity sampling is introduced to avoid artefacts raised from uneven boundaries. We extract the initial scale field by applying local group intensity spline fittings around the shadow boundary. Bad intensity samples are replaced by their nearest alternatives based on a log-normal probability distribution of fitting errors. Finally, we use a gradual colour transfer to correct post-processing artefacts such as gamma correction and lossy compression. Compared with state-of-the-art methods, we offer highly user-friendly interaction, produce improved umbra recovery and improved processing given uneven shadow boundaries.","PeriodicalId":419218,"journal":{"name":"2013 IEEE International Conference on Multimedia and Expo (ICME)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127812397","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":"Gradual training of cascaded shape regression for facial landmark localization and pose estimation","authors":"Moh Edi Wibowo, D. Tjondronegoro","doi":"10.1109/ICME.2013.6607601","DOIUrl":"https://doi.org/10.1109/ICME.2013.6607601","url":null,"abstract":"Facial landmarks play an important role in face recognition. They serve different steps of the recognition such as pose estimation, face alignment, and local feature extraction. Recently, cascaded shape regression has been proposed to accurately locate facial landmarks. A large number of weak regressors are cascaded in a sequence to fit face shapes to the correct landmark locations. In this paper, we propose to improve the method by applying gradual training. With this training, the regressors are not directly aimed to the true locations. The sequence instead is divided into successive parts each of which is aimed to intermediate targets between the initial and the true locations. We also investigate the incorporation of pose information in the cascaded model. The aim is to find out whether the model can be directly used to estimate head pose. Experiments on the Annotated Facial Landmarks in the Wild database have shown that the proposed method is able to improve the localization and give accurate estimates of pose.","PeriodicalId":419218,"journal":{"name":"2013 IEEE International Conference on Multimedia and Expo (ICME)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115460275","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}
Ting-Yu Ko, Chi-Jung Tseng, Hsin-Hui Chen, Jian-Jiun Ding, N. Babaguchi
{"title":"Efficient DC term encoding scheme based on double prediction algorithms and Pareto probability models","authors":"Ting-Yu Ko, Chi-Jung Tseng, Hsin-Hui Chen, Jian-Jiun Ding, N. Babaguchi","doi":"10.1109/ICME.2013.6607534","DOIUrl":"https://doi.org/10.1109/ICME.2013.6607534","url":null,"abstract":"In this paper, a new algorithm which adopts the techniques of double prediction and the Pareto probability model was applied to encode the DC term in the JPEG compression process. Conventionally, the DC term was encoded by differential coding, i.e., the difference of the DC values between the current block and the previous block. In this paper, we first use the DC terms of four adjacent blocks to predict the current DC value. We then further use the prediction error of the four adjacent blocks to estimate the variance of the prediction error of the current block. We call it the double prediction algorithm. Next, the Pareto distribution is applied to model the probability distribution of the prediction error. Simulation results show that, with the proposed algorithms, the data size required for DC terms is significantly reduced by 25% ~ 60% and a much higher compression rate can be achieved.","PeriodicalId":419218,"journal":{"name":"2013 IEEE International Conference on Multimedia and Expo (ICME)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114875477","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}