text:
keywords = {image classification, independent component analysis},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396350,
author = {Zhang, Jiemi and Wu, Chenxia and Cai, Deng},
title = {Search Web Images Using Objects, Backgrounds and Conditions},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396350},
doi = {10.1145/2393347.2396350},
abstract = {As the volumes of web images have grown rapidly in the last decade, Content-Based Image Retrieval (CBIR) has attracted substantial interests as an effective tool to manage the images. Most existing CBIR systems focus on the object in the image, while ignoring the conditions (day/night, sunny/rain, etc) and the backgrounds, both of which are very helpful to meet the user's information need. To overcome this shortcoming, in this paper, we present a novel CBIR system depending on a novel query formulation considering three aspects: Object, Background and Condition. Specifically, we design a user-friendly interface to help the user formulate a query. The interface can allow the user to give the percentage, relative position and size of each object in the background. Moreover, a corresponding effective ranking method is proposed to return the desirable search results. Experimental results demonstrate that our proposed system improves the searching performance and the user experience compared with the existing searching systems.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {933–936},
numpages = {4},
keywords = {user experience, content based image retrieval, query formulation},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396351,
author = {Hsu, Huan-Cheng and Huang, Chun-Rong and Lu, Chun-Shien},
title = {Sparsity Cue in Image Copy Detection},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396351},
doi = {10.1145/2393347.2396351},
abstract = {Image copy detection is an art of searching duplicates from a target database. Computationally efficient and robust detection is still a challenging issue. Inspired by the recent study of sparsity in the context of compressed sensing, we propose a sparse representation-based image copy detection method exploiting sparsity as the cue for searching duplicates. We find that although sparse representation can describe an image in a compact manner, the inherent discriminable features, as far as we know, are not entirely explored. In this paper, we study the discrimination ability inherent in sparsity via online dictionary learning and compact feature descriptor representation. Experimental results show that our method, compared with state-of-the-art, is computationally efficient and attains better or comparable detection performance measured in terms of precision and recall rates.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {937–940},
numpages = {4},
keywords = {spare representation, attack, sparsity, copy detection, online dictionary learning},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396352,
author = {Wang, Yandan and Belkhatir, Mohammed and Tahayna, Bashar},
title = {Near-Duplicate Video Retrieval Based on Clustering by Multiple Sequence Alignment},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396352},
doi = {10.1145/2393347.2396352},
abstract = {In Near-Duplicate Video Retrieval (NDVR), recent works have focused on bettering index structures and matching schemes not only to improve retrieval accuracy but also to enforce scalability in an effort to keep up with the ever-growing size of video collections. In this paper, we propose a framework for the retrieval of Near-Duplicate Videos (NDVs) based on a pre-processing step of clustering inspired by Multiple Sequence Alignment (MSA) of DNA sequences. In our technique, we represent videos as alphabetical genomes and MSA is employed to automatically cluster a video collection. NDVR is then conducted on these formed clusters instead of the original video collection. Experimentally, we show that our clustering-based approach, while being significantly faster than state-of-the-art techniques that are not based on a pre-processing clustering step, i.e. the n-gram and Dynamic Time Warping (DTW) techniques, yields equivalent results in a precision/recall evaluation framework.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {941–944},
numpages = {4},
keywords = {multiple sequence alignment, clustering, near-duplicate video retrieval},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396353,
author = {Liu, Cong and Ling, Hefei and Zou, Fuhao and Yan, Lingyu},
title = {Neighborhood Preserving Hashing for Fast Similarity Search},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396353},
doi = {10.1145/2393347.2396353},
abstract = {Fast similarity search methods are increasingly critical for many large-scale learning tasks, particularly in the communities of machine learning and data mining. Recently, data-aware hashing method is regarded as a promising approach for similarity search which maps high-dimensional feature vectors into efficient and compact hash codes while preserving the corresponding neighborhood structure. Although some recent hashing methods based on eigenvalue decomposition perform well, they suffer from semantic loss. In this paper, we concentrate on this issue and propose a novel neighborhood preserving hashing approach which adopts a brand-new method to combine non-negative matrix factorization and locality linear embedding without introducing any additional parameter. The combination of these two classical techniques ensures that we obtain a parts-based representation which not only fulfill the psychological and physiological requirements of human perception but also conserve the intrinsic neighborhood structure of the original data. Experiments are conducted to demonstrate that the proposed approach is superior to some state-of-the-art methods.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {945–948},
numpages = {4},
keywords = {non-negative matrix factorization, fast similarity search, locally linear embedding, semantic loss},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396354,
author = {Kiani Galoogahi, Hamed and Sim, Terence},
title = {Face Photo Retrieval by Sketch Example},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396354},
doi = {10.1145/2393347.2396354},
abstract = {Face photo-sketch matching has received great attention in recent years due to its vital role in law enforcement. The major challenge of matching face photo and sketch is difference of visual characteristics between face photo and sketch which is referred as modality gap. Earlier approaches have reduced the modality gap by synthesizing face photos and sketches in a same modality (photo or sketch). However, the effectiveness of these approaches is highly affected by synthesis results. That means a poor synthesis might degrade the performance of matching. Therefore, recent works have focused to directly match face photo and sketch of different modalities. However, the features used by these approaches are not robust against modality gap. In this paper, a modality-invariant face descriptor called Gabor Shape is proposed to retrieve face photos based on a probe sketch. Experiments on CUFS and CUFSF datasets show that the new descriptor outperforms the state-of-the-art approaches.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {949–952},
numpages = {4},
keywords = {radon transform, gabor filters, photo retrieval, face sketch},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396355,
author = {Xia, Junhai and Gao, Ke and Zhang, Dongming and Mao, Zhendong},
title = {Geometric Context-Preserving Progressive Transmission in Mobile Visual Search},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396355},
doi = {10.1145/2393347.2396355},
abstract = {Progressive transmission is very effective to reduce retrieval latency in mobile visual search. However, the acceleration effects of existing progressive transmission strategies are often limited because of the neglect of geometric information in the query image. This paper proposes an effective and efficient geometric context-preserving progressive transmission method, which is suitable for mobile visual search. Here a query image is divided into blocks and local features in the same block are used as query units rather than a single feature. Since clustered features with geometric information are more discriminative, only a few of them could support correct matching with high precision. Thus our method significantly decreases the number of features needed for transmission, and dramatically reduces the retrieval latency. Experiments on Stanford dataset for mobile visual search show that, with comparable precision, we uses 43% less retrieval time than existing progressive transmission method. Moreover, we establish and release a large-scale image dataset called MVSBench which is more difficult and suitable for mobile visual search. It contains 75500 images and considers many variations like view change, blur, scale, illumination and rotation. MVSBench is another major contribution of this paper, and our method also outperforms other strategies on this dataset.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {953–956},
numpages = {4},
keywords = {mobile visual search, progressive transmission, geometric context},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396356,
author = {Gao, Haidong and Tang, Siliang and Zhang, Yin and Jiang, Dapeng and Wu, Fei and Zhuang, Yueting},
title = {Supervised Cross-Collection Topic Modeling},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396356},
doi = {10.1145/2393347.2396356},
abstract = {Nowadays, vast amounts of multimedia data can be obtained across different collections (or domains). Therefore, it poses significant challenges for the utilization of those cross-collection data, for examples, the summarization of similarities and differences of data across different domains (e.g., CNN and NYT), as well as finding visually similar images across different visual domains (e.g., photos, paintings and hand-drawn sketches). In this paper, a supervised cross-collection Latent Dirichlet Allocation (scLDA) approach is proposed to utilize the data across different collections. As a natural extension of traditional Latent Dirichlet Allocation (LDA), scLDA not only takes the structural priors of different collections into consideration, but also exploits the category information. The strength of this work lies in integrating topic modeling, cross-domain learning and supervised learning together. We conduct scLDA for comparative text mining as well as classification of news articles and images from different collections. The results suggest that our proposed scLDA can generate meaningful collection-specific topics and achieves better retrieval accuracy than other related topic models.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {957–960},
numpages = {4},
keywords = {latent dirichlet allocation, cross-collection classification, topic modeling},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396357,
author = {Zhai, Xiaohua and Peng, Yuxin and Xiao, Jianguo},
title = {PDSS: Patch-Descriptor-Similarity Space for Effective Face Verification},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396357},
doi = {10.1145/2393347.2396357},
abstract = {In this paper, we propose the Patch-Descriptor-Similarity Space (PDSS) for unconstrained face verification, which is challenging due to image variations in pose, lighting, facial expression, and occlusion. Our proposed PDSS considers jointly patch, descriptor and similarity measure, which are ignored by the existing work. PDSS is extremely effective for face verification because each axis of PDSS will boost each other and could maximize the effect of every axis. Each point in PDSS reflects a distinct partial-matching between two facial images, which could be robust to variations in the facial images. Moreover, by selecting the discriminating point subset from PDSS, we could describe accurately the characteristic similarities and differences between two facial images, and further decide whether they represent the same person. In PDSS, each axis can describe effectively the distinct features of the faces: each patch (the first axis) reflects a distinct trait of a face; the descriptor (the second axis) is used to describe such face trait; and the similarity between two features can be measured by a certain kind of similarity measure (the third axis). The experiment adopts the extensively-used Labeled Face in the Wild (LFW) unconstrained face recognition dataset (13K faces), and our proposed PDSS approach achieves the best result, compared with the state-of-the-art methods.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {961–964},
numpages = {4},
keywords = {context-based partial matching, unconstrained, patch-descriptor-similarity space, face verification},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396358,
author = {Revaud, Jerome and Douze, Matthijs and Schmid, Cordelia},
title = {Correlation-Based Burstiness for Logo Retrieval},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396358},
doi = {10.1145/2393347.2396358},
abstract = {Detecting logos in photos is challenging. A reason is that logos locally resemble patterns frequently seen in random images. We propose to learn a statistical model for the distribution of incorrect detections output by an image matching algorithm. It results in a novel scoring criterion in which the weight of correlated keypoint matches is reduced, penalizing irrelevant logo detections. In experiments on two very different logo retrieval benchmarks, our approach largely improves over the standard matching criterion as well as other state-of-the-art approaches.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {965–968},
numpages = {4},
keywords = {burstiness, correlation, image retrieval},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396359,
author = {Wu, Chun-Che and Kuo, Yin-Hsi and Hsu, Winston},
title = {Large-Scale Simultaneous Multi-Object Recognition and Localization via Bottom up Search-Based Approach},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396359},
doi = {10.1145/2393347.2396359},
abstract = {Recently, smart phones not only perform the basic communication function but also become the first choice in information collection. For instance, when smartphone users want to obtain relevant information about the products on the shelf, all they have to do is take a snapshot and send it back to the server. In order to save time and effort for the users, it is important to retrieve information as many as possible from one shot. Thus, multiple object recognition and localization over large-scale object classes (database) is the first bottleneck to break through. To tackle this issue, we propose a bottom up search-based approach, which localizes the grid-based search candidates in Markov Random Field (MRF). The proposed approach enables simultaneously recognizing and localizing multiple objects; therefore, it reduces response time and ensures the accuracy as well. Experimental results show that the proposed method can have 40% relative improvement over the state-of-the-art bag-of-words model. We also demonstrate the proposed method in two datasets and show that our method can have good improvement in running time (5 times faster), and also competitive accuracy for multi-object recognition and localization.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {969–972},
numpages = {4},
keywords = {algorithm, multi-object recognition, markov random field},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396360,
author = {Zhou, Rong and Chen, Liuli and Zhang, Liqing},
title = {Sketch-Based Image Retrieval on a Large Scale Database},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396360},
doi = {10.1145/2393347.2396360},
abstract = {The paper presents a simple and effective sketch-based algorithm for large scale image retrieval. One of the main challenges in image retrieval is to localize a region in an image which would be matched with the query image in contour. To tackle this problem, we use the human perception mechanism to identify two types of regions in one image: the first type of region (the main region) is defined by a weighted center of image features, suggesting that we could retrieve objects in images regardless of their sizes and positions. The second type of region, called region of interests (ROI), is to find the most salient part of an image, and is helpful to retrieve images with objects similar to the query in a complicated scene. So using the two types of regions as candidate regions for feature extraction, our algorithm could increase the retrieval rate dramatically. Besides, to accelerate the retrieval speed, we first extract orientation features and then organize them in a hierarchal way to generate global-to-local features. Based on this characteristic, a hierarchical database index structure could be built which makes it possible to retrieve images on a very large scale image database online. Finally a real-time image retrieval system on 4.5 million database is developed to verify the proposed algorithm. The experiment results show excellent retrieval performance of the proposed algorithm and comparisons with other algorithms are also given.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {973–976},
numpages = {4},
keywords = {contour, sketch, saliency, hierarchical retrieval},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396361,
author = {Borth, Damian and Ulges, Adrian and Breuel, Thomas M.},
title = {Dynamic Vocabularies for Web-Based Concept Detection by Trend Discovery},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396361},
doi = {10.1145/2393347.2396361},
abstract = {We present a novel approach towards automatic vocabulary selection for video concept detection. Our key idea is to expand concept vocabularies with trending topics that we mine automatically on other media like Wikipedia or Twitter. We evaluate several strategies for extending concept detection to auto-detect these topics in new videos, either by linking them to a static concept vocabulary, by a visual learning of trends on the fly, or by an expansion of the vocabulary.Our study on 6,800 YouTube clips and the top 23 target trends (covering a timespan of 6 months) demonstrates that a direct visual classification of trends (by a "live" learning on trend videos) outperforms an inference from static vocabularies. However, further improvements can be achieved by a combination of both approaches.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {977–980},
numpages = {4},
keywords = {concept detection, vocabulary, social media, trends},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396362,
author = {Wang, Meng and Ishwar, Prakash and Konrad, Janusz and Gazen, Cenk and Saboo, Rohit},
title = {Coherent Image Selection Using a Fast Approximation to the Generalized Traveling Salesman Problem},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396362},
doi = {10.1145/2393347.2396362},
abstract = {Searching for images on-line using keywords returns results that are often difficult to interpret. This becomes even more complicated if one attempts to compare image search output for several keywords with a common theme. We focus on the latter problem and propose a method to efficiently compare sets of images in order to find representative images, one from each set, that are coherent in certain sense. However, the search for an optimal set of representative images is very complex even for as few as 10 sets of 20 images each since all possible combinations of 10 images need to be considered. Therefore, we formulate our problem as the Generalized Traveling Salesman Problem (GTSP) and propose an efficient approximation algorithm to solve it. Our approximate GTSP algorithm is faster than other well-known approximations and is also more likely to reach the exact solution for large-scale inputs. We present a number of experimental results using the proposed algorithm and conclude that it can be a useful, almost real-time tool for on-line search.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {981–984},
numpages = {4},
keywords = {image retrieval, visualization, general traveling salesman problem (gtsp), image ranking},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396363,
author = {Tolchinsky, Pancho and Chiarandini, Luca and Jaimes, Alejandro},
title = {PRiSMA: Searching Images in Parallel},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396363},
doi = {10.1145/2393347.2396363},
abstract = {PRiSMA is an image search application for tablet and desktop devices intended to facilitate and promote the searching of images in parallel. With an intuitive user interface, users can branch their queries into multiple horizontal sliding strips to simultaneously explore different perspectives of large image collections (e.g., colors, geographical location or topic). Strips can be easily created, tailored, merged, and removed, allowing users to effectively perform multiple queries and manage the results in a dynamic and orderly fashion. With PRiSMA we aim to explore the potential and limitations of parallel image search from a user perspective.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {985–988},
numpages = {4},
keywords = {image browsing, parallel search},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396364,
author = {Wu, Yue and Lu, Shiyang and Mei, Tao and Zhang, Jian and Li, Shipeng},
title = {Local Visual Words Coding for Low Bit Rate Mobile Visual Search},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396364},
doi = {10.1145/2393347.2396364},
abstract = {Mobile visual search has attracted extensive attention for its huge potential for numerous applications. Research on this topic has been focused on two schemes: sending query images, and sending compact descriptors extracted on mobile phones. The first scheme requires about 30-40KB data to transmit, while the second can reduce the bit rate by 10 times. In this paper, we propose a third scheme for extremely low bit rate mobile visual search, which sends compressed visual words consisting of vocabulary tree histogram and descriptor orientations rather than descriptors. This scheme can further reduce the bit rate with few extra computational costs on the client. Specifically, we store a vocabulary tree and extract visual descriptors on the mobile client. A light-weight pre-retrieval is performed to obtain the visited leaf nodes in the vocabulary tree. The orientation of each local descriptor and the tree histogram are then encoded to be transmitted to server. Our new scheme transmits less than 1KB data, which reduces the bit rate in the second scheme by 3 times, and obtains about 30% improvement in terms of search accuracy over the traditional Bag-of-Words baseline. The time cost is only 1.5 secs on the client and 240 msecs on the server.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {989–992},
numpages = {4},
keywords = {visual word, vocabulary tree, compression, mobile visual search},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396365,
author = {Huitl, Robert and Schroth, Georg and Hilsenbeck, Sebastian and Schweiger, Florian and Steinbach, Eckehard},
title = {Virtual Reference View Generation for CBIR-Based Visual Pose Estimation},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396365},
doi = {10.1145/2393347.2396365},
abstract = {Determining the pose of a mobile device based on visual information is a promising approach to solve the indoor localization problem. We present an approach that transforms localized images along a mapping trajectory into virtual viewpoints that cover a set of densely sampled camera positions and orientations in a confined environment. The viewpoints are represented by their respective bag-of-features vectors and image retrieval techniques are applied to determine the most likely pose of query images at very low computational complexity. As virtual image locations and orientations are decoupled from actual image locations, the system is able to work with sparse reference imagery and copes well with perspective distortion. Experiments confirm that pose retrieval performance is significantly improved.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {993–996},
numpages = {4},
keywords = {visual localization, synthetic view, virtual view, image retrieval, pose estimation},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396366,
author = {Huang, Yen-Ta and Chen, Kuan-Ting and Hsieh, Liang-Chi and Hsu, Winston and Su, Ya-Fan},
title = {Detecting the Directions of Viewing Landmarks for Recommendation by Large-Scale User-Contributed Photos},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396366},
doi = {10.1145/2393347.2396366},
abstract = {In this work, we try to estimate the viewing directions of photos to browse landmarks with different views. To detect the viewing directions of the photos, we propose to leverage tags and geo-information associated with user-contributed photos to predict the locations of the landmarks. By utilizing the tags along with these photos, we demonstrate that the deviation between the estimated locations and the landmarks is about 30 meters on average. The detected locations of the landmarks can be used to further estimate the viewing directions in which the photos were taken. In the experiments, we show that the average error to the real viewing directions is less than 14 degrees. The estimated viewing directions enable illustrating landmarks from different views and recommending users the popular views for taking photos on the landmarks.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {997–1000},
numpages = {4},
keywords = {photo aesthetics, viewing direction, landmark, location},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396367,
author = {Yap, Kim-Hui and Li, Zhen and Zhang, Da-Jiang and Ng, Zhan-Ke},
title = {Efficient Mobile Landmark Recognition Based on Saliency-Aware Scalable Vocabulary Tree},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396367},
doi = {10.1145/2393347.2396367},
abstract = {In recent years, the Scalable Vocabulary Tree (SVT) has been shown to be effective in image recognition. However, in mobile landmark image recognition where the foreground is the landmark to be recognized while the background is cluttered, the current SVT framework ignores different local importance of image, hence restricting its performance. In this paper, we propose a new landmark recognition framework that can incorporate saliency information to improve the recognition performance relative to the baseline SVT method. Specifically, the saliency information is incorporated in three phases: image descriptor calculation, vocabulary tree generation, and image representation. We constructed a city-scale landmark dataset in Singapore, and the experimental results show that the proposed mobile landmark recognition by incorporating saliency information outperforms the baseline SVT recognition by about 9%.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1001–1004},
numpages = {4},
keywords = {scalable vocabulary tree, saliency map, mobile landmark recognition},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396368,
author = {Kharitonova, Yekaterina and Tung, Qiyam and Danehy, Alexander and Efrat, Alon and Barnard, Kobus},
title = {Client-Side Backprojection of Presentation Slides into Educational Video},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396368},
doi = {10.1145/2393347.2396368},
abstract = {A significant part of many videos of lectures is presentation slides that occupy much of the field of view. Further, for a student studying the lecture, having the slides sharply displayed is especially important, compared with the speaker, background, and audience. However, even if the original capture supports it, the bandwidth required for real time viewing is substantive, especially in the context of mobile devices. Here we propose reconstructing the video on the client side by backprojecting high resolution slide images into the video stream with the slide area blacked out. The high resolution slide deck can be sent once, and inserted into the video on the client side based on the transformation (a homography) computed in advance. We further introduce the idea that needed homography transformations can be approximated using affine transformations, which allows it to be done using built-in capabilities of HTML 5. We find that it is possible to significantly reduce bandwidth by compressing the modified video, while improving the slide area quality, but leaving the non-slide area roughly the same.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1005–1008},
numpages = {4},
keywords = {homography, presentation slides, lecture video, backprojection, affine transformation},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396369,
author = {Bernardo, Marco V. and Pinheiro, Ant\'{o}nio M. G. and Pereira, Manuela and Fiadeiro, Paulo Torr\~{a}o},
title = {A Study on the User Perception to Color Variations},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396369},
doi = {10.1145/2393347.2396369},
abstract = {A study on the perceived quality of images displayed with color changes is presented. Under the D65 standard illuminant colors are changed in the CIE 1976 (L*a*b*) color space, with the application of a predefined chromatic error ΔE*ab. The colors were initially divided into clusters with the K-Means algorithm. Each color cluster is shifted by the predefined chromatic error with a random direction in a*b* chromatic coordinates. Applying the ΔE*ab errors of 3, 6, 9, 12 and 15 units to the five hyperspectral images a set of modified images was collected. Those images were shown to individuals, that were asked to rank those images quality based on their naturalness. The Medium Opinion Scores was computed and allowed to test and quantify the sensibility to color changes.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1009–1012},
numpages = {4},
keywords = {color, assessment, quality, mean opinion score},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396370,
author = {Pieters, Bart and Hollemeersch, Charles and De Cock, Jan and De Neve, Wesley and Lambert, Peter and Van de Walle, Rik},
title = {Parallel Deblocking Filtering in H.264/AVC Using Multiple CPUs and GPUs},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396370},
doi = {10.1145/2393347.2396370},
abstract = {Deblocking filtering in the H.264/AVC standard is a computationally complex process because of the filter's high content adaptivity. Furthermore, the deblocking filter introduces a significant number of data dependencies, making parallel processing not obvious. Our previous works analyzed the dependencies of the filter and proposed a massively-parallel implementation, specifically tailored for execution on a single GPU. In this paper, we extend this work by proposing a parallel processing scheme for accelerating deblocking filtering using multiple CPU cores or GPUs. This scheme allows for standard-compliant filtering, regardless of slice configuration. Results show that our multi-GPU implementation using our proposed scheme achieves faster-than real-time deblocking at over 3794 frames per second for 1080p video pictures by using three GPUs. A multi-core CPU implementation using 8 CPU cores allows 1080p deblocking filtering of up to 695 frames per second.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1013–1016},
numpages = {4},
keywords = {parallel decoding, multi core, h.264/avc deblocking, gpu},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396371,
author = {Hosseini, Mohammad and Fedorova, Alexandra and Peters, Joseph and Shirmohammadi, Shervin},
title = {Energy-Aware Adaptations in Mobile 3d Graphics},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396371},
doi = {10.1145/2393347.2396371},
abstract = {Smartphone devices are becoming the de facto personal computing platform, rivaling the desktop, as the number of smartphone users is projected to reach 1.1 billion by 2013. Unlike the desktop, smartphones have a constrained energy budget, which is further challenged by increasingly sophisticated applications. Amongst the most popular applications on smartphone devices are games and virtual environments that rely on 3D graphics. Due to the computational intensity of geometry and rasterization, as well as the perpetually illuminated display, these applications are extremely power-hungry. To prolong the battery life of devices running these applications, we propose two new energy-aware adaptation schemes that can be employed in 3D graphics applications: lighting limitation and textural transformation. Our results show that we can conserve between 20% and 33% of energy with acceptable sacrifices to a user's visual experience.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1017–1020},
numpages = {4},
keywords = {energy-efficient rendering, mobile 3d graphics, graphics adaptation},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396372,
author = {Nguyen, Viet Anh and Vu, Tien Dung and Yang, Hongsheng and Lu, Jiangbo and Do, Minh N.},
title = {ITEM: Immersive Telepresence for Entertainment and Meetings with Commodity Setup},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396372},
doi = {10.1145/2393347.2396372},
abstract = {This paper presents an Immersive Telepresence system for Entertainment and Meetings (ITEM). The system aims to provide a radically new video communication experience by seamlessly merging participants into the same virtual space to allow a natural interaction among them and shared collaborative contents. With the goal to make a scalable, flexible system for various business solutions as well as easily accessible by massive consumers, we address the challenges in the whole pipeline of media processing, communication, and displaying in our design and realization of such a system. Extensive experiments show the developed system runs reliably and comfortably in real time with a minimal setup requirement (e.g., a webcam, a laptop/desktop connected to the public Internet) for tele-immersive video communication. With such a really minimal deployment requirement, we present a variety of interesting applications and user experiences created by ITEM.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1021–1024},
numpages = {4},
keywords = {tele-immersive system, video conferencing, video object cutout},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396373,
author = {Shen, Zhijie and Zimmermann, Roger},
title = {Reducing Cross-Group Traffic with a Cooperative Streaming Architecture},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396373},
doi = {10.1145/2393347.2396373},
abstract = {Cooperative approaches, such as P2P networks, have demonstrated their effectiveness in video delivery. However, with underlay structure considered, it is still possible to further improve traffic efficiency. In this paper, we discuss the problem of localizing the traffic traversal across peer groups, which are partitioned according to underlay characteristics. We first provide three concrete examples to demonstrate this common challenge, which we theoretically formulate afterwards. Finally, we propose a ring overlay approach, which performs excellently to solve the problem, while tolerating peer dynamics and supporting peer heterogeneity.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1025–1028},
numpages = {4},
keywords = {cooperative networks, peer-to-peer, traffic locality, wireless},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396374,
author = {Ji, Wen and Li, Zhu and Chen, Yiqiang},
title = {QoE-Based Opportunistic Transmission for Video Broadcasting in Heterogeneous Circumstance},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396374},
doi = {10.1145/2393347.2396374},
abstract = {This paper presents an opportunistic transmission scheme for layered video broadcasting to multiple heterogeneous devices. In contrast to conventional wireless video broadcasting system, the main ideas proposed here include: (i) exploit the quality of heterogeneous user experience (QoE) metric under wireless broadcasting scenario, with consideration of various channel state, device capability, video content urgency and the number of demanding users. (ii) formulate reliable multiple video streams broadcasting to heterogeneous devices as an aggregate maximum utility achieving problem. (iii) use opportunistic scheduling to select suitable users in each transmission interval so as to improve the broadcasting utility. (iv) use parallel-pipe structure to transmit the layered video with Fountain coding protection, which provide reliable and low-latency transmission in heterogeneous circumstance. Numerical experiments demonstrate that the proposed scheme outperforms conventional methods.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1029–1032},
numpages = {4},
keywords = {broadcasting, heterogeneous, opportunistic, video},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396375,
author = {Calagari, Kiana and Pakravan, Mohammad Reza and Shirmohammadi, Shervin},
title = {ROI-Based Protection Scheme for High Definition Interactive Video Applications},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396375},
doi = {10.1145/2393347.2396375},
abstract = {In this work, first, a Region of Interest (ROI)-based Unequal Loss Protection (ULP) scheme with no delay is proposed for High Definition (HD) interactive video applications such as video calls. The proposed scheme uses Data Partitioning and Flexible Macro block Ordering (FMO) tools of H.264/AVC and reduces error propagation. The obtained data demonstrates that this scheme achieves better ROI quality than others in high Packet Loss Rates (PLR). Second, it is also shown that the efficient scheme for protecting ROI-based interactive video applications in wide PLR ranges is switching both the Forward Error Correction (FEC) distribution pattern and the codec configuration between various scenarios depending on network conditions. This is shown by using both PSNR and SSIM metrics for quality measurement.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1033–1036},
numpages = {4},
keywords = {error propagation, fmo, data partitioning, fec, hd video, h.264/avc, roi, ulp, interactive video, slicing},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396376,
author = {Wirth, Thomas and S\'{a}nchez, Yago and Holfeld, Bernd and Schierl, Thomas},
title = {Advanced Downlink LTE Radio Resource Management for HTTP-Streaming},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396376},
doi = {10.1145/2393347.2396376},
abstract = {Video traffic contributes to the majority of data packets transported over cellular wireless. Future broadband wireless access networks based on 3GPP's Long Term Evolution offer mechanisms for optimized transmission with high data rates and low delay. However, especially when packets are transmitted in the LTE downlink and if services are run over-the-top (OTT), optimization of radio resources in a multi-user environment for video services becomes infeasible. The current market trend is moving to OTT solutions, also for video transmission, where an emerging standard based on HTTP streaming - DASH - is expected to have a huge success in the upcoming years. The solution presented in this paper consists of a novel technique, which combines LTE features with knowledge on DASH sessions for optimization of the wireless resources. The combined optimization yields an improved transmission of videos over cellular wireless systems which are based on LTE and LTE-Advanced.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1037–1040},
numpages = {4},
keywords = {radio resource management, cross-layer design, http-streaming, lte/lte-a, dash},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/3246412,
author = {Panchanathan, Sethuraman},
title = {Session Details: Poster Session 3},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3246412},
doi = {10.1145/3246412},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396378,
author = {Xu, Mengdi and Ni, Bingbing and Dong, Jian and Huang, Zhongyang and Wang, Meng and Yan, Shuicheng},
title = {Touch Saliency},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396378},
doi = {10.1145/2393347.2396378},
abstract = {In this work, we propose a new concept of touch saliency, and attempt to answer the question of whether the underlying image saliency map may be implicitly derived from the accumulative touch behaviors (or more specifically speaking, zoom-in and panning manipulations) when many users browse the image on smart mobile devices with multi-touch display of small size. The touch saliency maps are collected for the images of the recently released NUSEF dataset, and the preliminary comparison study demonstrates: 1) the touch saliency map is highly correlated with human eye fixation map for the same stimuli, yet compared to the latter, the touch data collection is much more flexible and requires no cooperation from users; and 2) the touch saliency is also well predictable by popular saliency detection algorithms. This study opens a new research direction of multimedia analysis by harnessing human touch information on increasingly popular multi-touch smart mobile devices.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1041–1044},
numpages = {4},
keywords = {touch saliency, visual saliency, fixations},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396379,
author = {Yang, Yang and Yang, Yi and Huang, Zi and Liu, Jiajun and Ma, Zhigang},
title = {Robust Cross-Media Transfer for Visual Event Detection},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396379},
doi = {10.1145/2393347.2396379},
abstract = {In this paper, we present a novel approach, named Robust Cross-Media Transfer  (RCMT), for visual event detection in social multimedia environments. Different from most existing methods, the proposed method can directly take different types of noisy social multimedia data as input and conduct robust event detection. More specifically, we build a robust model by employing an l2,1-norm regression model featuring noise tolerance, and also manage to integrate different types of social multimedia data by minimizing the distribution difference among them. Experimental results on real-life Flickr image dataset and YouTube video dataset demonstrate the effectiveness of our proposal, compared to state-of-the-art algorithms.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1045–1048},
numpages = {4},
keywords = {cross-media, visual event detection, transfer learning},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396380,
author = {Yu, Gang and Yuan, Junsong and Liu, Zicheng},
title = {Predicting Human Activities Using Spatio-Temporal Structure of Interest Points},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396380},
doi = {10.1145/2393347.2396380},
abstract = {Early recognition and prediction of human activities are of great importance in video surveillance, e.g., by recognizing a criminal activity at its beginning stage, it is possible to avoid unfortunate outcomes. We address early activity recognition by developing a Spatial-Temporal Implicit Shape Model (STISM), which characterizes the space-time structure of the sparse local features extracted from a video. The early recognition of human activities is accomplished by pattern matching through STISM. To enable efficient and robust matching, we propose a new random forest structure, called multi-class balanced random forest, which makes a good trade-off between the balance of the trees and the discriminative abilities. The prediction is done simultaneously for multiple classes, which saves both the memory and computational cost. The experiments show that our algorithm significantly outperforms the state of the arts for the human activity prediction problem.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1049–1052},
numpages = {4},
keywords = {random forest, action prediction, hough voting},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396381,
author = {Lin, Yan-Ching and Hu, Min-Chun and Cheng, Wen-Huang and Hsieh, Yung-Huan and Chen, Hong-Ming},
title = {Human Action Recognition and Retrieval Using Sole Depth Information},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396381},
doi = {10.1145/2393347.2396381},
abstract = {Observing the widespread use of Kinect-like depth cameras, in this work, we investigate into the problem of using sole depth data for human action recognition and retrieval in videos. We proposed the use of simple depth descriptors without learning optimization to achieve promising performances as compatible to those of the leading methods based on color images and videos, and can be effectively applied for real-time applications. Because of the infrared nature of depth cameras, the proposed approach will be especially useful under poor lighting conditions, e.g. the surveillance environments without sufficient lighting. Meanwhile, we proposed a large Depth-included Human Action video dataset, namely DHA, which contains 357 videos of performed human actions belonging to 17 categories. To the best of our knowledge, the DHA is one of the largest depth-included video datasets of human actions.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1053–1056},
numpages = {4},
keywords = {human action recognition, human action video retrieval, depth information},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396382,
author = {Yang, Xiaodong and Zhang, Chenyang and Tian, YingLi},
title = {Recognizing Actions Using Depth Motion Maps-Based Histograms of Oriented Gradients},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396382},
doi = {10.1145/2393347.2396382},
abstract = {In this paper, we propose an effective method to recognize human actions from sequences of depth maps, which provide additional body shape and motion information for action recognition. In our approach, we project depth maps onto three orthogonal planes and accumulate global activities through entire video sequences to generate the Depth Motion Maps (DMM). Histograms of Oriented Gradients (HOG) are then computed from DMM as the representation of an action video. The recognition results on Microsoft Research (MSR) Action3D dataset show that our approach significantly outperforms the state-of-the-art methods, although our representation is much more compact. In addition, we investigate how many frames are required in our framework to recognize actions on the MSR Action3D dataset. We observe that a short sub-sequence of 30-35 frames is sufficient to achieve comparable results to that operating on entire video sequences.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1057–1060},
numpages = {4},
keywords = {rgbd camera, feature representation, depth maps, 3d action recognition},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396383,
author = {Lu, Jiwen and Hu, Junlin and Zhou, Xiuzhuang and Shang, Yuanyuan},
title = {Activity-Based Person Identification Using Sparse Coding and Discriminative Metric Learning},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396383},
doi = {10.1145/2393347.2396383},
abstract = {This paper presents a new activity-based person identification method using sparse coding and discriminative metric learning. Different from gait recognition where human walking activity is only utilized for person identification, we aim to recognize people from different activities such as running, jumping, skipping, and so on. For each activity video clip, we extract the binary human body mask using background substraction. Then, we cluster these body masks into a number of clusters by sparse coding with mean pooling to extract features for each video clip. Subsequently, we learn a discriminative distance metric under which intraclass (activities performed by the same person) variations are minimized and the interclass (activities performed by different persons) are maximized, simultaneously, such that more discriminative information can be exploited for recognition. Experimental results on a publicly available database are presented to show the efficacy of our proposed method.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1061–1064},
numpages = {4},
keywords = {metric learning, person identification, sparse coding},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396384,
author = {Althoff, Tim and Song, Hyun Oh and Darrell, Trevor},
title = {Detection Bank: An Object Detection Based Video Representation for Multimedia Event Recognition},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396384},
doi = {10.1145/2393347.2396384},
abstract = {While low-level image features have proven to be effective representations for visual recognition tasks such as object recognition and scene classification, they are inadequate to capture complex semantic meaning required to solve high-level visual tasks such as multimedia event detection and recognition. Recognition or retrieval of events and activities can be improved if specific discriminative objects are detected in a video sequence. In this paper, we propose an image representation, called Detection Bank, based on the detection images from a large number of windowed object detectors where an image is represented by different statistics derived from these detections. This representation is extended to video by aggregating the key frame level image representations through mean and max pooling. We empirically show that it captures complementary information to state-of-the-art representations such as Spatial Pyramid Matching and Object Bank. These descriptors combined with our Detection Bank representation significantly outperforms any of the representations alone on TRECVID MED 2011 data.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1065–1068},
numpages = {4},
keywords = {object detection, multimedia event recognition, trecvid, representation},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396385,
author = {Chu, Hang and Lin, Weiyao and Wu, Jianxin and Zhou, Xingtong and Chen, Yuanzhe and Li, Hongxiang},
title = {A New Heat-Map-Based Algorithm for Human Group Activity Recognition},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396385},
doi = {10.1145/2393347.2396385},
abstract = {In this paper, a new heat-map-based (HMB) algorithm is proposed for human group activity recognition. The proposed algorithm first models people trajectories as series of "heat sources" and then applies a thermal diffusion process to create a heat map (HM) for representing the group activities. Based on this heat map, a new surface-fitting (SF) method is also proposed for recognizing human group activities. Our proposed HM feature can efficiently keep the temporal motion information of the group activities while the proposed SF method can effectively catch the characteristics of the heat map for activity recognition. Experimental results demonstrate the effectiveness of our proposed algorithm.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1069–1072},
numpages = {4},
keywords = {heat map, human group activity recognition, surface fitting},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396386,
author = {Yu, Qian and Liu, Jingen and Cheng, Hui and Divakaran, Ajay and Sawhney, Harpreet},
title = {Multimedia Event Recounting with Concept Based Representation},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396386},
doi = {10.1145/2393347.2396386},
abstract = {Multimedia event detection has drawn a lot of attention in recent years. Given a recognized event, in this paper, we conduct a pilot study of the multimedia event recounting problem, which answers the question why this video is recognized as this event, i.e. what evidences this decision is made on. In order to provide a semantic recounting of the multimedia event, we adopt a concept-based event representation for learning a discriminative event model. Then, we present a recounting approach that exactly recovers the contribution of semantic evidence to the event classification decision. This approach can be applied on any additive discriminative classifiers. The promising result is shown on the MED11 dataset that contains 15 events in thousands of YouTube like videos.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1073–1076},
numpages = {4},
keywords = {multimedia event representation, textual descriptions of video content, multimedia event recounting},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396387,
author = {Tian, Gang and Guan, Genliang and Wang, Zhiyong and Feng, Dagan},
title = {What is Happening: Annotating Images with Verbs},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396387},
doi = {10.1145/2393347.2396387},
abstract = {Image annotation has been widely investigated to discover the semantics of an image. However, most of the existing algorithms focus on noun tags (e.g. concepts and objects). Since an image is a snapshot of the real world event, annotating images with verbs will enable richer understanding of an image. In this paper, we propose a data-driven approach to verb oriented image annotation. At first, we obtain verb candidates by generating search queries for a given image with initial noun tags and establishing a sentence corpus from those queries. We utilize visualness to filter tags which are not visually presentable (e.g. pain) and differentiate tags into two categories (i.e. scene based and object based) to impose linguistic rules in verb extraction. Then we further re-rank the candidate verbs with the tag context discovered from the images which are both semantically and visually similar to the given image in the MIRFlickr dataset. Our experimental results from user study demonstrate that our proposed approach is promising.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1077–1080},
numpages = {4},
keywords = {semantic similarity, image annotation, verb tag, re-ranking, visualness, visual similarity},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396388,
author = {Wu, Zhe and Li, Xiong and Zhao, Xu and Liu, Yuncai},
title = {Hybrid Generative-Discriminative Recognition of Human Action in 3D Joint Space},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396388},
doi = {10.1145/2393347.2396388},
abstract = {We propose a novel human action recognition method based on the generative feature mapping over 3D human body joint sequences. The proposed method relies on Hidden Markov Model (HMM), but differs from the previous methods in the way of incorporating HMM and discriminative classifier, aiming to capture more discriminative information. Firstly, we use HMMs to model the joint sequences of human body. Then the Posterior Divergence is used to build feature mappings from the trained HMMs. The derived feature mappings map a variable-length joint sequence to a fixed-dimension feature vector which will be delivered to SVM for classification. We evaluate the proposed method and related methods on a large number of 3D joint sequences. The experimental results show its competitive performance, in comparison with other state-of-the-art methods.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1081–1084},
numpages = {4},
keywords = {action recognition, posterior divergence},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396389,
author = {Zhang, Cong and Yang, Xiaokang and Zhu, Jun and Lin, Weiyao},
title = {Parsing Collective Behaviors by Hierarchical Model with Varying Structure},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396389},
doi = {10.1145/2393347.2396389},
abstract = {Collective behaviors are usually composed of several groups. Considering the interactions among groups, this paper presents a novel framework to parse collective behaviors for video surveillance applications. We first propose a latent hierarchical model (LHM) with varying structure to represent the behavior with multiple groups. Furthermore, we also propose a multi-layer-based (MLB) inference method, where a sample-based heuristic search (SHS) is introduced to infer the group affiliation. And latent SVM is adopted to learn our model. With the proposed LHM, not only are the collective behaviors detected effectively, but also the group affiliation in the collective behaviors is figured out. Experiment results demonstrate the effectiveness of the proposed framework.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1085–1088},
numpages = {4},
keywords = {sampling-based heuristic search, multi-layer-based inference method, collective behavior, latent hierarchical model},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396390,
author = {Connaghan, Damien and O'Connor, Noel},
title = {Toward next Generation Coaching Tools for Court Based Racquet Sports},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396390},
doi = {10.1145/2393347.2396390},
abstract = {Even with today's advances in automatic indexing of multimedia content, existing coaching tools for court sports lack the ability to automatically index a competitive match into key events. This paper proposes an automatic event indexing and event retrieval system for tennis, which can be used to coach from beginners upwards. Event indexing is possible using either visual or inertial sensing, with the latter potentially providing system portability. To achieve maximum performance in event indexing, multi-sensor data integration is implemented, where data from both sensors is merged to automatically index key tennis events. A complete event retrieval system is also presented to allow coaches to build advanced queries which existing sports coaching solutions cannot facilitate without an inordinate amount of manual indexing.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1089–1092},
numpages = {4},
keywords = {visual sensing, event indexing, inertial sensing, sports coaching},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396391,
author = {O'Hare, Neil and Aiello, Luca Maria and Jaimes, Alejandro},
title = {Predicting Participants in Public Events Using Stock Photos},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396391},
doi = {10.1145/2393347.2396391},
abstract = {Pictures taken by journalists for distribution and for inclusion in stock photo collections are often enriched with metadata. One key aspect of such photos is that they focus largely on events and feature celebrities and other public figures. They may provide interesting insights into how such public figures are related to each other in terms of the events they attend, and in their social proximity in terms of how often they are photographed together. In this paper, we study a corpus of approximately 9 million stock photographs taken over a 10 year period and, using their metadata, we extract a social network from co-appearance of public figures in events depicted in the photographs. We exploit this latent social information and combine it with the rich image metadata to explore the possibility of predicting attendees at future events, showing promising performance for this task.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1093–1096},
numpages = {4},
keywords = {photo collections, public events, public figures social network},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396392,
author = {Li, Weihai and Yan, Yupeng and Yu, Nenghai},
title = {Breaking Row-Column Shuffle Based Image Cipher},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396392},
doi = {10.1145/2393347.2396392},
abstract = {In this paper, a redundancy based cipher-only attack is proposed to break row-column shuffle based image encryption algorithms, which are considered to be safe under cipher-only attack before although it is well known that they are fragile under known-plaintext attack. This attack is carried out on the shuffle operations itself by analyzing the redundancy remained in cipher image, and doesn't care how the shuffle tables are generated. So, no matter how the shuffling tables are generated, this attack is valid. Experimental results show high quality deciphered images from one single cipher image, and that demonstrate the validity of our attack method. This attack method is also a potential threat to shuffle-scramble combined encryptions.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1097–1100},
numpages = {4},
keywords = {row-column shuffle, image encryption, cryptanalysis, redundancy},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396393,
author = {Li, Wei and Zhu, Bilei and Wang, Zhurong},
title = {On the Music Content Authentication},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396393},
doi = {10.1145/2393347.2396393},
abstract = {Digital audio has been ubiquitous over the past decade. Since it can be easily modified by editing tools, there has been a strong need to protect its content for secure multimedia applications. Existing audio authentication algorithms are mainly focused on either human speech or general audio with music as part of the test data, while special research on music authentication has been somewhat neglected. In this article, we propose a novel algorithm to protect the integrity and authenticity of music signals. Its main contributions include: (1) Music is segmented into beat-based frames, which not only endows the authentication units with more semantic meaning but also perfectly resolves the challenging synchronization problem; (2) Robust hashes are generated from Chroma-based mid-level audio feature which can appropriately characterize the music content, and integrated with an encryption procedure to ensure the security against malicious block-wise vector quantization attack; (3) Fuzzy logic is adopted to make the authentication decision in light of three measures defined on bit errors, coinciding with the inherent blurred nature of authentication. Experiments exhibit good discriminative ability between admissible and malicious operations.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1101–1104},
numpages = {4},
keywords = {fuzzy classification, tamper classification, authenticity degree, music content authentication, beat-based segmentation},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396394,
author = {Mohanty, Manoranjan and Atrey, Pradeep and Ooi, Wei Tsang},
title = {Secure Cloud-Based Medical Data Visualization},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396394},
doi = {10.1145/2393347.2396394},
abstract = {Outsourcing the tasks of medical data visualization to cloud centers presents new security challenges. In this paper, we propose a framework for cloud-based remote medical data visualization that protects the security of data at the cloud centers. To achieve this, we integrate the cryptographic secret sharing with pre-classification volume ray-casting and propose a secure volume ray-casting pipeline that hides the color-coded information of the secret medical data during rendering at the data centers. Results and analysis show the utility of the proposed framework.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1105–1108},
numpages = {4},
keywords = {secret sharing, cloud computing, ray casting, 3d medical data visualization},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396395,
author = {Zhou, Ke and Liu, Jin and Tian, Hui and Li, Chunhua},
title = {State-Based Steganography in Low Bit Rate Speech},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396395},
doi = {10.1145/2393347.2396395},
abstract = {Common least significant bit (LSB) relevant steganography methods in speech frames often base on bits evaluation by certain speech quality evaluation criterion and together with some coding and embedding strategies to enhance imperceptibility and efficiency. However, some embedding capabilities and security strategy are neglected. This paper proposes a state-based steganography method which fully investigates speech frame features in order to expand embedding capabilities and enhance steganography security. In the proposed method, embedding capabilities are measured by available numbers of states relative to current frame parameters rather than information bits. And secret information embedding procedure is performed by the chosen states mapped operations. This is a basic fine-grained steganography solution which is useful for other algorithms based on it. The experimental results have demonstrated that statebased method outperforms traditional LSB substitution in overall performance and introduces limited latency, which meets the realtime requirement in covert communications.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1109–1112},
numpages = {4},
keywords = {state-based, low bit rate speech, steganography, least significant bit},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396396,
author = {Yin, Jing and Fang, Yanmei},
title = {Markov-Based Image Forensics for Photographic Copying from Printed Picture},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396396},
doi = {10.1145/2393347.2396396},
abstract = {Nowadays, photographic-copying technique is very popular along with the rapid development of the image-capturing device, especially digital camera. As a result, the recaptured images, i.e., images taken from real-scene images displayed on various medium, e.g., LCD screen, are used in illegal cases now and then. In this paper, by comparing the recaptured images with their corresponding real-scene images, we find the recapturing procedure changes the statistics of the images. Then the Markov process based features extracted from the Discrete Cosine Transform(DCT) coefficients array are proposed to characterize this changes. During experimentation, a large and typical image dataset, which consisted of 3994 real-scene images and 3994 recaptured images that are taken from printed pictures with diversified image contents and camera models, is build and used for training and testing the classifier Support Vector Machine(SVM). Experimental results show that the proposed forensics scheme performs very well and outperforms the state-of-art methods.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1113–1116},
numpages = {4},
keywords = {photographic copying, digital image forensics, svm, markov process},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396397,
author = {Ye, Conghuan and Ling, Hefei and Zou, Fuhao and Liu, Cong},
title = {Secure Content Sharing for Social Network Using Fingerprinting and Encryption in the TSH Transform Domain},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396397},
doi = {10.1145/2393347.2396397},
abstract = {In this paper, a JFE (joint fingerprinting and encryption) scheme based on the Tree-Structured Harr (TSH) transform is proposed with the purpose of protecting media distribution in social network environment. The motivation is to map hierarchical community structure of social network into tree structure of TSH transform for fingerprinting and encryption. Firstly, the fingerprint code is produced using social network analysis. Secondly, the content is decomposed by the TSH transform. Thirdly, the content is fingerprinted and encrypted in the TSH transform domain. At last, the encrypted contents are delivered to users via hybrid multicast-unicast. The proposed method, to the best of our knowledge, is the first JFE method in the TSH transform domain using social network analysis. The use of fingerprinting along with encryption can provide a double-layer of protection to media sharing in social network environment. Theory analysis and experimental results show the effectiveness of the proposed JFE scheme.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1117–1120},
numpages = {4},
keywords = {fingerprinting, tsh, media sharing, collusion attack, encryption, social network},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396398,
author = {Cristani, Marco and Roffo, Giorgio and Segalin, Cristina and Bazzani, Loris and Vinciarelli, Alessandro and Murino, Vittorio},
title = {Conversationally-Inspired Stylometric Features for Authorship Attribution in Instant Messaging},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396398},
doi = {10.1145/2393347.2396398},
abstract = {Authorship attribution (AA) aims at recognizing automatically the author of a given text sample. Traditionally applied to literary texts, AA faces now the new challenge of recognizing the identity of people involved in chat conversations. These share many aspects with spoken conversations, but AA approaches did not take it into account so far. Hence, this paper tries to fill the gap and proposes two novelties that improve the effectiveness of traditional AA approaches for this type of data: the first is to adopt features inspired by Conversation Analysis (in particular for turn-taking), the second is to extract the features from individual turns rather than from entire conversations. The experiments have been performed over a corpus of dyadic chat conversations (77 individuals in total). The performance in identifying the persons involved in each exchange, measured in terms of area under the Cumulative Match Characteristic curve, is 89.5%.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1121–1124},
numpages = {4},
keywords = {chat analysis, re-identification, authorship attribution},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396399,
author = {Sankoh, Hiroshi and Sugano, Masaru and Naito, Sei},
title = {Dynamic Camera Calibration Method for Free-Viewpoint Experience in Sport Videos},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396399},
doi = {10.1145/2393347.2396399},
abstract = {In this paper, we propose a dynamic camera calibration and object extraction method for sport videos captured with a moving pan-tilt-zoom camera. Such technology realizes an immersive free-viewpoint experience whereby audiences can see real sport scenes from any viewpoint. Camera calibration and object extraction are two of the most important processes for rendering free-viewpoint video, since a 3-dimensional model of each object needs to be reconstructed in every frame based on objects' textures and camera parameters. Most conventional rendering methods only use static cameras whose camera parameters and background models change little. However, since the cameras have to be set apart widely enough to capture the entire scene, the resolution of each object becomes low and is not sufficient for rendering high-quality free-viewpoint video. In order to obtain the texture of an object in high resolution from a moving pan-tilt-zoom camera, our proposed method estimates camera parameters by identifying reliable corresponding feature points between video frames, and also extracts the precise textures of objects using estimated camera parameters. Experimental results revealed that the proposed method successfully estimated precise camera parameters compared to the conventional method. Furthermore, by applying our proposed approach, the free-viewpoint video was rendered without visual defects.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1125–1128},
numpages = {4},
keywords = {free-viewpoint video, object extraction, homography matrix, camera parameter, graph cut, calibration},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396400,
author = {Ruhl, Kai and Hell, Benjamin and Klose, Felix and Lipski, Christian and Petersen, S\"{o}ren and Magnor, Marcus},
title = {Improving Dense Image Correspondence Estimation with Interactive User Guidance},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396400},
doi = {10.1145/2393347.2396400},
abstract = {High quality dense image correspondence estimation between two images is an essential pre-requisite for view interpolation in visual media production. Due to the ill-posed nature of the problem, automated estimation approaches are prone to erroneous correspondences and subsequent quality degradation, e.g. in the presence of ambiguous movements that require human scene understanding to resolve. Where visually convincing results are essential, artifacts resulting from estimation errors must be repaired by hand with image editing tools. In this paper, we propose a new workflow alternative by fixing the correspondences instead of fixing the interpolated images. We combine realtime interactive correspondence display, multi-level user guidance and algorithmic subpixel precision to counteract failure cases of automated estimation algorithms. Our results show that already few interactions improve the visual quality considerably.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1129–1132},
numpages = {4},
keywords = {user input, dense image correspondence estimation, view interpolation, interactive, optical flow},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396401,
author = {Chen, Bisheng and Wang, Jingdong and Huang, Qinghua and Mei, Tao},
title = {Personalized Video Recommendation through Tripartite Graph Propagation},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396401},
doi = {10.1145/2393347.2396401},
abstract = {The rapid growth of the number of videos on the Internet provides enormous potential for users to find content of interest to them. Video search, such as Google, Youtube, Bing, is a popular way to help users to find desired videos. However, it is still very challenging to discover new video contents for users. In this paper, we address the problem of providing personalized video suggestions for users. Rather than only exploring the user-video graph that is formulated using the click-through information, we also investigate other two useful graphs, the user-query graph indicating if a user ever issues a query, and the query-video graph indicating if a video appears in the search result of a query. The two graphs act as a bridge to connect users and videos, and have a large potential to improve the recommendation as the queries issued by a user essentially imply his interest. As a result, we reach a tripartite graph over (user, video, query). We develop an iterative propagation scheme over the tripartite graph to compute the preference information of each user. Experimental results on a dataset of 2,893 users, 23,630 queries and 55,114 videos collected during Feb. 1-28, 2011 demonstrate that the proposed method outperforms existing state-of-the-art approaches, co-views and random walks on the user-video bipartite graph.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1133–1136},
numpages = {4},
keywords = {personalized video recommendation, tripartite graph},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396402,
author = {Hidayati, Shintami C. and Cheng, Wen-Huang and Hua, Kai-Lung},
title = {Clothing Genre Classification by Exploiting the Style Elements},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396402},
doi = {10.1145/2393347.2396402},
abstract = {This paper presents a novel approach to automatically classify the upperwear genre from a full-body input image with no restrictions of model poses, image backgrounds, and image resolutions. Five style elements, that are crucial for clothing recognition, are identified based on the clothing design theory. The corresponding features of each of these style elements are also designed. We illustrate the effectiveness of our approach by showing that the proposed algorithm achieved overall precision of 92.04%, recall of 92.45%, and F score of 92.25% with 1,077 clothing images crawled from popular online stores.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1137–1140},
numpages = {4},
keywords = {style element, clothing genre, classification},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396403,
author = {You, Chuang-Wen and Hsieh, Yung-Huan and Cheng, Wen-Huang},
title = {AttachedShock: Facilitating Moving Targets Acquisition on Augmented Reality Devices Using Goal-Crossing Actions},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396403},
doi = {10.1145/2393347.2396403},
abstract = {The prevalence of augmented reality devices in our daily lives offers increasing opportunities for users to navigate the real world. However, as users move, on-screen targets move unpredictably, and eventually disappear from the screen in mobile navigation scenarios. The changing target movement pattern creates difficulty for users in selecting the targets on time before targets escape from the screen. This study proposes a novel target selecting technique, AttachedShock, for easing target selection tasks on augmented reality devices by crossing a naturally expanding wave pattern that is attached to targets. We evaluated the effectiveness of the proposed technique by conducting comparative studies on measuring the performance of four techniques under various mobile navigation scenarios. The results indicate that the proposed technique assists users in selecting moving targets to improve the error rate substantially, by a minimum of 61.75%, and incurs acceptable distractions to users, compared to other techniques.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1141–1144},
numpages = {4},
keywords = {moving target selection, target acquisition},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396404,
author = {Yang, Xin and Liao, Chunyuan and Liu, Qiong},
title = {MixPad: Augmenting Interactive Paper with Mice & Keyboards for Cross-Media and Fine-Grained Interaction with Documents},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396404},
doi = {10.1145/2393347.2396404},
abstract = {Existing interactive paper systems suffer from the disparate input devices for paper and computers. The finger-pen-only input on paper causes frequent devices switching (e.g. pen vs. mouse) during cross-media interactions, and may have issues of occlusion and precision. We propose MixPad, a novel interactive paper system, which allows users to exploit mice and keyboards to digitally manipulate fine-grained document content on paper, such as copying an arbitrary image region to a computer and clicking on a word for web search. With the combined input channels, MixPad enables richer digital functions on paper and facilitates bimanual operations cross different media. A preliminary user study shows positive feedback on this interaction technique.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1145–1148},
numpages = {4},
keywords = {fine-grained, mouse, document, keyboard, cross-media, interactive paper, bimanual},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396405,
author = {Mai, Long and Le, Hoang and Niu, Yuzhen and Lai, Yu-Chi and Liu, Feng},
title = {Detecting Rule of Simplicity from Photos},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396405},
doi = {10.1145/2393347.2396405},
abstract = {Simplicity refers to one of the most important photography composition rules. Simplicity states that simplifying the image background can draw viewers' attention to the subject of interest in a photograph and help them better comprehend and appreciate it. Understanding whether a photo respects photography rules or not facilitates photo quality assessment. In this paper, we present a method to automatically detect whether a photo is composed according to the rule of simplicity. We design features according to the definition, implementation and effect of the rule. First, we make use of saliency analysis to infer the subject of interest in a photo and measure its compactness. Second, we segment an image into background and foreground and measure the homogeneity within the background as another feature. Third, when looking at an image created with the rule of simplicity, different viewers tend to agree on what the subject of interest is in this photo. We accordingly measure the consistency among various saliency detection results as a feature. We experiment with these features in a range of machine learning methods. Our experiments show that our methods, together with these features, provide an encouraging result in detecting the rule of simplicity in a photo.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1149–1152},
numpages = {4},
keywords = {photo quality assessment, photography rules detection},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396406,
author = {Yeh, Mei-Chen and Li, Po-Yi},
title = {An Approach to Automatic Creation of Cinemagraphs},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396406},
doi = {10.1145/2393347.2396406},
abstract = {A cinemagraph is a new type of medium that infuses a static image with the dynamics of one particular region. It is in many ways intermediate between a photograph and a video, and has a number of attractive potential applications, such as the creation of dynamic scenes for games and interactive environments. However, creating cinemagraphs is time consuming and requires certain level of proficiency on photo editing techniques. In this paper, we present a fully automatic approach that creates cinemagraphs from video sequences. Specifically, we view cinemagraph construction as a constrained optimization problem that seeks a sub-volume in video with the maximum cumulative flow fields. The problem can be efficiently solved by a branch and-bound search scheme. A user survey is conducted to understand user preferences and demonstrate the performance of the proposed approach. The findings of this study should provide information for various design choices for an easy and versatile authoring tool for cinemagraphs.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1153–1156},
numpages = {4},
keywords = {motion analysis, cinemagraph, user study},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396407,
author = {Yasunaga, Takuya and Nakazawa, Atsushi and Takemura, Haruo},
title = {Human-Computer Dance Interaction with Realtime Accelerometer Control},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396407},
doi = {10.1145/2393347.2396407},
abstract = {Motion-capture-based character animations are widely used in computer graphics and interactive games.In this paper, we show a novel approach to create dancing character animations that react to input music and an accelerometer manipulated by a user. Since the sensor reads express intensities of users' body movements, the system can synthesize character motions whose intensities are synchronized to those of users. Our system consists of analysis phase and synthesis phase. In the analysis phase, the musical beat and segments are detected from input sound, and motion rhythm and intensities are found from motion capture data. With the results of this analysis, we generate a motion graph that can generate character motions matched to the musical rhythm. In synthesis phase, the system receives the output data from an accelerometer and traverses the motion graph according to the matching result between the sensor data and the motion intensity. As the result, our system adds an interactive component to live dancing performed by virtual characters.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1157–1160},
numpages = {4},
keywords = {character animation, motion capture, music analysis, interactive system, accelerometer control},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396408,
author = {Komai, Yuto and Yang, Nan and Takiguchi, Tetsuya and Ariki, Yasuo},
title = {Robust AAM-Based Audio-Visual Speech Recognition against Face Direction Changes},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396408},
doi = {10.1145/2393347.2396408},
abstract = {As one of the techniques for robust speech recognition under noisy environments, audio-visual speech recognition (AVSR) using lip dynamic scene information together with audio information is attracting attention, and the research has advanced in recent years. However, in visual speech recognition (VSR), when a face turns sideways, the shape of the lip as viewed from the camera changes and the recognition accuracy degrades significantly. Therefore, many of the conventional VSR methods are limited to situations in which the face is viewed from the front. This paper proposes a VSR method to convert faces viewed from various directions into faces that are viewed from the front using Active Appearance Models (AAM). In the experiment, even when the face direction changes about 30 degrees relative to a frontal view, the recognition accuracy improved significantly.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1161–1164},
numpages = {4},
keywords = {audio-visual, speech recognition, face direction},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396409,
author = {Ochi, Daisuke and Kimata, Hideaki and Noto, Hajime and Kojima, Akira},
title = {A Study on Making Camera Trajectory from Panorama Watching Manipulation},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396409},
doi = {10.1145/2393347.2396409},
abstract = {We propose a new interactive panorama video delivery system that enables users not only to select favorite parts of an event site, but also to watch repeatedly with stable and the user-selected camera trajectory. In this paper, we present a system that makes a favorable and stable camera trajectory as a scenario from user's manipulations of a tablet device in a format that can be easily shared with others. We also evaluate the validity of the camera trajectory results obtained our stabilization technique.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1165–1168},
numpages = {4},
keywords = {panorama video, tablet manipulation, video stabilization, camera trajectory},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396410,
author = {Takenaka, Kazuhito and Bando, Takashi and Nagasaka, Shogo and Taniguchi, Tadahiro},
title = {Drive Video Summarization Based on Double Articulation Structure of Driving Behavior},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396410},
doi = {10.1145/2393347.2396410},
abstract = {This paper provides a novel summarization method for drive videos using driving behavior, such as driver maneuvers and vehicle reaction, recorded simultaneously alongside video. We segmented the driving behavior into chunks via an unsupervised manner and summarized the drive videos using the chunks, i.e., the switching points of the chunks were emphasized and the middle of the chunks were compressed. As the result of subjective evaluation, we found that the chunks were more consistent with human-recognized driving context than the image-based method and that the summarized video was more suitable for reviewing entire driving scenes, i.e., our method achieved an efficient summarization.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1169–1172},
numpages = {4},
keywords = {drive video summarization, double articulation structure},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396411,
author = {Khosla, Rajiv and Chu, Mei-Tai and Kachouie, Reza and Yamada, Keiji and Yoshihiro, Fujita and Yamaguchi, Tomoharu},
title = {Interactive Multimodal Social Robot for Improving Quality of Care of Elderly in Australian Nursing Homes},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396411},
doi = {10.1145/2393347.2396411},
abstract = {This paper describes the design of multimodal robotic system, embodiment of multimodal interaction (voice, gestures, emotion, touch panel and dance) in assistive social robot (Matilda) for modeling group based and one-to-one interactions with technology adverse elderly in nursing homes. It describes the human-centered evaluation of Matilda based on quality, naturalness, user satisfaction and predictive accuracy based on first ever field trials in Australia. The multimodal social robots have facilitated breaking the technology barriers with the elderly leading to several aged care facilities and community centers showing interest in future trials.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1173–1176},
numpages = {4},
keywords = {old people, multimodal interaction, dementia, assitive social tobot},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396412,
author = {Xu, Lei and Fang, Yikai and Wang, Kongqiao and Li, Jiangwei},
title = {Plug&Touch: A Mobile Interaction Solution for Large Display via Vision-Based Hand Gesture Detection},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396412},
doi = {10.1145/2393347.2396412},
abstract = {Smart phones and external large displays are a superior combination for content sharing and multiple person interaction. However, the potential of such a combination is not fully explored due to the lack of effective and portable interaction solutions. To solve this problem, we present a novel mobile solution called Plug&Touch, which is very easy to be set up and enables mobile users to directly and naturally operate on the large display surface. Plug&Touch utilizes vision-based methods to detect the user's finger tip and then control user interface. The Local Binary Pattern asymmetric texture difference is proposed to extract the foreground region, and the coarse-to-fine intersection process is adopted to precisely localize the finger tip. Plug&Touch has been implemented on the Symbian3 platform with two defined gestures - click and scroll. Experimental results and user evaluation has shown the practicability of Plug&Touch.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1177–1180},
numpages = {4},
keywords = {free hand gesture, mobile phone, asymmetric texture difference, large display},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396413,
author = {Chen, Yingju and Lee, Jeongkyu},
title = {Ulcer Detection in Wireless Capsule Endoscopy Video},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396413},
doi = {10.1145/2393347.2396413},
abstract = {Wireless Capsule Endoscopy (WCE) is a painless and noninvasive technique that allows physicians to visualize the entire small bowel. Before WCE was introduced, examining the entire small bowel was impossible without surgical procedure. Although WCE is a technology breakthrough, the manual video diagnosis session is time consuming and is prone to human cognition errors. Therefore, gastroenterologists urge computer vision researchers to develop computer-aided diagnosis systems to assist the review session. In this paper, we would like to present an ulcer detection scheme that identifies ulcers in WCE video. A saliency map is created by means of channel mixer to highlight suspicious regions. Once the suspicious regions are identified, we extract textural features along the contour and classify them using a trained classifier for ulcer validation.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1181–1184},
numpages = {4},
keywords = {wireless capsule endoscopy, ulcer detection},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396414,
author = {Grace, Lindsay D.},
title = {Critical Gameplay: Designing Games to Critique Convention},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396414},
doi = {10.1145/2393347.2396414},
abstract = {This paper discusses the critical gameplay design project and its newest evolution. After being exhibited in several international venues in 2009-2011, the project has evolved to employ a more pointed critique of game culture and how people play. The paper describes, Big Huggin', an affection game, Match, a game of procedural racism and Healer, and an unshooter about the Nanjing Massacre. These games continue to explore the notion of values in design.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1185–1188},
numpages = {4},
keywords = {game process workflow, game art, rapid game development, critical gameplay, game design, procedural rhetoric, critical design},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396415,
author = {Xu, Mingliang and Wu, Yunpeng and Ye, Yangdong},
title = {Smooth and Efficient Crowd Transformation},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396415},
doi = {10.1145/2393347.2396415},
abstract = {Crowd transformation has been an important research field due to its diverse range of applications that include film production, computer games, robotics and performance training. We propose a novel approach with continuous space and continuous time for smooth crowd transformation. Most algorithms simulating the transformation of crowds focus on the trajectories of individual participants. As a contrast, the approach we proposed here focuses on the balanced assignment to maintain the collective behavior of the full crowd. We use a bitmap-based recognition of the starting and final formations and quantify the performance of the transformation with the mutual information. We demonstrate that our method is computationally efficient for several group sizes and formations.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1189–1192},
numpages = {4},
keywords = {social force model, mutual information, intelligent virtual agent, crowd simulation, crowd formation control, collective behavior},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396416,
author = {Myojin, Seiko and Sato, Arata and Shimada, Nobutaka},
title = {Augmented Reality Card Game Based on User-Specific Information Control},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396416},
doi = {10.1145/2393347.2396416},
abstract = {In this paper, we describe new way to use augmented reality (AR) for entertainment. AR is a technology that overlays virtual objects on real objects in real world as a natural and intuitive interface. We think AR also can provide multiple users with different sight in real world and control information displayed for each user. We use these AR features for entertainment to present another enjoyment for users. As an example of our proposal, we implemented a card game system and evaluated it to examine usefulness of our concept for entertainment.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1193–1196},
numpages = {4},
keywords = {augmented reality, game design, card game, user-specific information control, entertainment computing},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396417,
author = {D'Amico, Gianpaolo and Del Bimbo, Alberto and Ferracani, Andrea and Landucci, Lea and Pezzatini, Daniele},
title = {Indoor and Outdoor Profiling of Users in Multimedia Installations},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396417},
doi = {10.1145/2393347.2396417},
abstract = {We present a work-in-progress interactive exhibit for the mu- seum of Onna (L'Aquila, Italy). The Onna Onlus and the citizens of Onna have the ambitious project to rebuild the town affected by the earthquake of April 2009 and to create a museum in memory of Onna. In addition to the tradi- tional fruition tools for museums, we have been asked for an interactive system capable to communicate the past events and the efforts invested. We are working on a multi-modal system composed of an indoor environment in which visitors can interact with a natural interface system and an outdoor module based on a cross-platform mobile application. A pro- filing method is also exploited in order to extract a profile of interest of each visitor and then use it to suggest in-depth personalized and geo-located information about the disaster and the local history via multimedia contents.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1197–1200},
numpages = {4},
keywords = {real-time location, interactive museums, RFID, multimedia installations, interaction design, location awareness, user interfaces, natural interaction, mobile application},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396418,
author = {Han, Yoon Chung and Han, Byeong-jun},
title = {Digiti Sonus: An Interactive Fingerprint Sonification},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396418},
doi = {10.1145/2393347.2396418},
abstract = {Fingerprints are one of the most unique visual patterns on human body. It represents both innate and acquired identities of an individual. In this paper, we focus on relationship between fingerprint patterns and human identities by transforming image into audio. Digiti Sonus, an interactive fingerprint sonification installation, contains a novel idea to facilitate and enhance an interactive auditory meaning by transforming user-intended fingerprint expression into audio spectrogram. In order to enable personalized sonification, the installation employed dynamic filter generation based on minutiae extraction using core-invariant scanning method and image skeletonization.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1201–1204},
numpages = {4},
keywords = {fingerprint sonification, heterogeneous data interpretation, fingerprint image processing, interactive multimedia art},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396419,
author = {McVeigh-Schultz, Joshua and Stein, Jen and Watson, Jeff and Fisher, Scott},
title = {Extending the Lifelog to Non-Human Subjects: Ambient Storytelling for Human-Object Relationships},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396419},
doi = {10.1145/2393347.2396419},
abstract = {In this paper, we describe an approach to lifelogging that positions everyday objects, vehicles, and built environments as worthy of their own lifelog systems. We use this approach to anchor what we call ambient storytelling, and we argue that this methodology opens up new opportunities to design for rich and enduring relationships between humans and non-humans. We will explore this research approach through a series of examples, including: (1) a building that learns about its occupants and reveals its lifelog through playful solicitation and reciprocation, (2) story-objects that reveal backstory to their users, and (3) an automotive-sensor system and lifelog platform that facilitates context-specific playful interaction between a driver and their car. In this last example, we were interested in how a vehicle-based lifelog could augment drivers' existing propensities to project character onto their cars. In each of these examples, we reposition the concept of the lifelog to consider the "lives" of objects and the relationship between humans and non-humans as a worthwhile area of research.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1205–1208},
numpages = {4},
keywords = {human-object relationship, interactive architecture, architecture, ambient storytelling, environmental lifelogging, vehicular lifelog, story objects, lifelog},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/3246413,
author = {Jaimes, Alejandro and Chua, Tat-seng},
title = {Session Details: Brave New Ideas Program},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3246413},
doi = {10.1145/3246413},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396421,
author = {Singh, Vivek K. and Gao, Mingyan and Jain, Ramesh},
title = {Situation Recognition: An Evolving Problem for Heterogeneous Dynamic Big Multimedia Data},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396421},
doi = {10.1145/2393347.2396421},
abstract = {With the growth in social media, internet of things, and planetary-scale sensing there is an unprecedented need to assimilate spatio-temporally distributed multimedia streams into actionable information. Consequently the concepts like objects, scenes, and events, need to be extended to recognize situations (e.g. epidemics, traffic jams, seasons, flash mobs). This paper motivates and computationally grounds the problem of situation recognition. It describes a systematic approach for combining multimodal real-time big data into actionable situations. Specifically it presents a generic approach for modeling and recognizing situations. A set of generic building blocks and guidelines help the domain experts model their situations of interest. The created models can be tested, refined, and deployed into practice using a developed system (EventShop). Results of applying this approach to create multiple situation-aware applications by combining heterogeneous streams (e.g. Twitter, Google Insights, Satellite imagery, Census) are presented.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1209–1218},
numpages = {10},
keywords = {situation awareness, situation detection, events, situation, social networks, modeling, sensor networks},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396422,
author = {Bruni, Elia and Uijlings, Jasper and Baroni, Marco and Sebe, Nicu},
title = {Distributional Semantics with Eyes: Using Image Analysis to Improve Computational Representations of Word Meaning},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396422},
doi = {10.1145/2393347.2396422},
abstract = {The current trend in image analysis and multimedia is to use information extracted from text and text processing techniques to help vision-related tasks, such as automated image annotation and generating semantically rich descriptions of images. In this work, we claim that image analysis techniques can "return the favor" to the text processing community and be successfully used for a general-purpose representation of word meaning. We provide evidence that simple low-level visual features can enrich the semantic representation of word meaning with information that cannot be extracted from text alone, leading to improvement in the core task of estimating degrees of semantic relatedness between words, as well as providing a new, perceptually-enhanced angle on word semantics. Additionally, we show how distinguishing between a concept and its context in images can improve the quality of the word meaning representations extracted from images.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1219–1228},
numpages = {10},
keywords = {visual words, semantics, language, object recognition},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396423,
author = {Wang, Xin-Jing and Xu, Zheng and Zhang, Lei and Liu, Ce and Rui, Yong},
title = {Towards Indexing Representative Images on the Web},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396423},
doi = {10.1145/2393347.2396423},
abstract = {Even after 20 years of research on real-world image retrieval, there is still a big gap between what search engines can provide and what users expect to see. To bridge this gap, we present an image knowledge base, ImageKB, a graph representation of structured entities, categories, and representative images, as a new basis for practical image indexing and search. ImageKB is automatically constructed via a both bottom-up and top-down, scalable approach that efficiently matches 2 billion web images onto an ontology with millions of nodes. Our approach consists of identifying duplicate image clusters from billions of images, obtaining a candidate set of entities and their images, discovering definitive texts to represent an image and identifying representative images for an entity. To date, ImageKB contains 235.3M representative images corresponding to 0.52M entities, much larger than the state-of-the-art alternative ImageNet that contains 14.2M images for 0.02M synsets. Compared to existing image databases, ImageKB reflects the distributions of both images on the web and users' interests, contains rich semantic descriptions for images and entities, and can be widely used for both text to image search and image to text understanding.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1229–1238},
numpages = {10},
keywords = {image understanding, large-scale text to image translation, image knowledge base},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396424,
author = {Hanjalic, Alan and Kofler, Christoph and Larson, Martha},
title = {Intent and Its Discontents: The User at the Wheel of the Online Video Search Engine},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396424},
doi = {10.1145/2393347.2396424},
abstract = {We embrace the position of the user in the driver's seat of the video search engine by proposing a principled framework for multimedia retrieval that moves beyond what users are searching for also to encompass why they search. This 'why' is understood as the reason, purpose or immediate goal behind a user information need, which we identify as the underlying user 'intent'. Breaking information needs down into a topical dimension representing 'what' and an intent dimension representing 'why' will allow online video search engines to provide users with more satisfying search results. Until now, research on intent has remained small scale, limited by the lack of a systematic method for arriving at possible dimensions of user intent that provide productive areas of inquiry for multimedia research. We demonstrate how mining information from user descriptions of video information needs on the social Web makes it possible to identify useful intent categories for online video search and carry out validation experiments showing that these categories display enough invariance to be successfully modeled by a video search engine. In a final experiment, we demonstrate the potential for these categories to improve video retrieval with a large user study confirming that users associate salient differences within topically homogenous video search engine results lists with these intent categories. This reveals the potential to refine video results list using user intent.},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
pages = {1239–1248},
numpages = {10},
keywords = {user intent, search, multimedia information retrieval, multimedia indexing, retrieval algorithms},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/3246414,
author = {Kato, Hirokazu},
title = {Session Details: Technical Demo Session 1},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3246414},
doi = {10.1145/3246414},
booktitle = {Proceedings of the 20th ACM International Conference on Multimedia},
location = {Nara, Japan},
series = {MM '12}
}

@inproceedings{10.1145/2393347.2396426,
author = {Lin, Yuan and Lin, Qian and Tang, Feng and Wang, Shengjin},
title = {Face Replacement with Large-Pose Differences},
year = {2012},
isbn = {9781450310895},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2393347.2396426},
doi = {10.1145/2393347.2396426},
abstract = {In this paper, we present a novel face replacement system exchanging faces with large-pose differences. Traditional 2D image based face replacement can only replace faces with similar pose and appearance. This significantly limits the application of face replacement. In this paper, we propose to build a 3D head model from a single frontal face photo. The automatically constructed 3D head can be rendered under arbitrary poses and

license: Unlicense

repository: goyalkaraniit/acm-cr

repo_name: goyalkaraniit/acm-cr

branch_name: refs/heads/main