Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 5611 - 5640 of 8722

Full-Text Articles in Entire DC Network

A Convolution Kernel Approach To Identifying Comparisons In Text, Maksim Tkachenko, Hady W. Lauw Jul 2015

A Convolution Kernel Approach To Identifying Comparisons In Text, Maksim Tkachenko, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Comparisons in text, such as in online reviews, serve as useful decision aids. In this paper, we focus on the task of identifying whether a comparison exists between a specific pair of entity mentions in a sentence. This formulation is transformative, as previous work only seeks to determine whether a sentence is comparative, which is presumptuous in the event the sentence mentions multiple entities and is comparing only some, not all, of them. Our approach leverages not only lexical features such as salient words, but also structural features expressing the relationships among words and entity mentions. To model these features …

Go to article

Cross-Promotion In Social Media: Choosing The Right Allies, Tingting Song, Qian Tang Jul 2015

Cross-Promotion In Social Media: Choosing The Right Allies, Tingting Song, Qian Tang

Research Collection School Of Computing and Information Systems

This paper investigates the strategic use of cross-promotion for content producers in social media. In particular, we study how a producer chooses other producers to cross-promote so as to maximize the expected benefits of them cross-promoting him/her in return. Theories on homophily effect and social influence suggest that cross-promoted producers are more likely to cross-promote the initiator in return when they are in the similar categories or share more common friends and when the initiator has higher status. However, the cross-promotion from producers of different categories and social groups (i.e., share fewer common friends) tend to benefit the initiator more. …

Go to article

Direct Structure Estimation For 3d Reconstruction, Nianjuan Jiang, Wen-Yan Lin, Minh N. Do, Jiangbo Lu Jun 2015

Direct Structure Estimation For 3d Reconstruction, Nianjuan Jiang, Wen-Yan Lin, Minh N. Do, Jiangbo Lu

Research Collection School Of Computing and Information Systems

Most conventional structure-from-motion (SFM) techniques require camera pose estimation before computing any scene structure. In this work we show that when combined with single/multiple homography estimation, the general Euclidean rigidity constraint provides a simple formulation for scene structure recovery without explicit camera pose computation. This direct structure estimation (DSE) opens a new way to design a SFM system that reverses the order of structure and motion estimation. We show that this alternative approach works well for recovering scene structure and camera poses from sideway motion given planar or general man-made scenes.

Go to article

Qcri: Answer Selection For Community Question Answering - Experiment For Arabic And English, Massimo Nicosia, Simone Filice, Alberto Barron-Cedeno, Iman Saleh, Hamdy Mubarak, Wei Gao, Preslav Nakov, Giovanni Da San Martino, Alessandro Moschitti, Kareem Darwish, Lluis Marquz Marquz, Shafiq Joty, Walid Magdy Magdy Jun 2015

Qcri: Answer Selection For Community Question Answering - Experiment For Arabic And English, Massimo Nicosia, Simone Filice, Alberto Barron-Cedeno, Iman Saleh, Hamdy Mubarak, Wei Gao, Preslav Nakov, Giovanni Da San Martino, Alessandro Moschitti, Kareem Darwish, Lluis Marquz Marquz, Shafiq Joty, Walid Magdy Magdy

Research Collection School Of Computing and Information Systems

This paper describes QCRI’s participation in SemEval-2015 Task 3 “Answer Selection in Community Question Answering”, which targeted real-life Web forums, and was offered in both Arabic and English. We apply a supervised machine learning approach considering a manifold of features including among others word n-grams, text similarity, sentiment analysis, the presence of specific words, and the context of a comment. Our approach was the best performing one in the Arabic subtask and the third best in the two English subtasks

Go to article

Projection Metric Learning On Grassmann Manifold With Application To Video Based Face Recognition, Zhiwu Huang, R. Wang, S. Shan, X. Chen Jun 2015

Projection Metric Learning On Grassmann Manifold With Application To Video Based Face Recognition, Zhiwu Huang, R. Wang, S. Shan, X. Chen

Research Collection School Of Computing and Information Systems

In video based face recognition, great success has been made by representing videos as linear subspaces, which typically lie in a special type of non-Euclidean space known as Grassmann manifold. To leverage the kernel-based methods developed for Euclidean space, several recent methods have been proposed to embed the Grassmann manifold into a high dimensional Hilbert space by exploiting the well established Project Metric, which can approximate the Riemannian geometry of Grassmann manifold. Nevertheless, they inevitably introduce the drawbacks from traditional kernel-based methods such as implicit map and high computational cost to the Grassmann manifold. To overcome such limitations, we propose …

Go to article

Dynamic Redeployment To Counter Congestion Or Starvation In Vehicle Sharing Systems, Supriyo Ghosh, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet Jun 2015

Dynamic Redeployment To Counter Congestion Or Starvation In Vehicle Sharing Systems, Supriyo Ghosh, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet

Research Collection School Of Computing and Information Systems

Extensive usage of private vehicles has led to increased traffic congestion, carbon emissions, and usage of non-renewable resources. These concerns have led to the wide adoption of vehicle sharing (ex: bike sharing, car sharing) systems in many cities of the world. In vehicle-sharing systems, base stations (ex: docking stations for bikes) are strategically placed throughout a city and each of the base stations contain a pre-determined number of vehicles at the beginning of each day. Due to the stochastic and individualistic movement of customers,there is typically either congestion (more than required)or starvation (fewer than required) of vehicles at certain base …

Go to article

Should We Use The Sample? Analyzing Datasets Sampled From Twitter's Stream Api, Yazhe Wang, Jamie Callan, Baihua Zheng Jun 2015

Should We Use The Sample? Analyzing Datasets Sampled From Twitter's Stream Api, Yazhe Wang, Jamie Callan, Baihua Zheng

Research Collection School Of Computing and Information Systems

Researchers have begun studying content obtained from microblogging services such as Twitter to address a variety of technological, social, and commercial research questions. The large number of Twitter users and even larger volume of tweets often make it impractical to collect and maintain a complete record of activity; therefore, most research and some commercial software applications rely on samples, often relatively small samples, of Twitter data. For the most part, sample sizes have been based on availability and practical considerations. Relatively little attention has been paid to how well these samples represent the underlying stream of Twitter data. To fill …

Go to article

Continuous Non-Malleable Key Derivation And Its Application To Related-Key Security, Baodong Qin, Shenli Liu, Tsz Hon Yuen, Robert H. Deng, Kefei Chen Jun 2015

Continuous Non-Malleable Key Derivation And Its Application To Related-Key Security, Baodong Qin, Shenli Liu, Tsz Hon Yuen, Robert H. Deng, Kefei Chen

Research Collection School Of Computing and Information Systems

Related-Key Attacks (RKAs) allow an adversary to observe the outcomes of a cryptographic primitive under not only its original secret key e.g., s, but also a sequence of modified keys ϕ(s), where ϕ is specified by the adversary from a class Φ of so-called Related-Key Derivation (RKD) functions. This paper extends the notion of non-malleable Key Derivation Functions (nm-KDFs), introduced by Faust et al. (EUROCRYPT’14), to continuous nm-KDFs. Continuous nm-KDFs have the ability to protect against any a-priori unbounded number of RKA queries, instead of just a single time tampering attack as in the definition of …

Go to article

The Role Of Intermediary In Sustainable Lending: An Economic Analysis Of Crowdfunding Platform, Ling Ge, Zhiling Guo Jun 2015

The Role Of Intermediary In Sustainable Lending: An Economic Analysis Of Crowdfunding Platform, Ling Ge, Zhiling Guo

Research Collection School Of Computing and Information Systems

Is the interest-free crowdfunding platform a promising alternative to the non-zero interest platform? This study investigates the lenders and borrowers’ incentives and choices between an indirect, non-zero interest rate platform intermediated by a field partner and a direct-lending, interest-free platform. We model the field partner as a profit maximizer that filters qualified borrowers to enable the lenders’ capital to be better utilized on the crowdfunding platform. We show that, under certain conditions, both the borrowers and lenders are better off from the existence of the field partner. The existence of field partner is necessary to effectively segment the market and …

Go to article

Assessing The Opportunities And Challenges With Big Data In The Mobile Payments Ecosystem, Jun Liu, Robert John Kauffman, Dan Ma Jun 2015

Assessing The Opportunities And Challenges With Big Data In The Mobile Payments Ecosystem, Jun Liu, Robert John Kauffman, Dan Ma

Research Collection School Of Computing and Information Systems

Information and communication technology (ICT) is an important driver of mobile payments in the financial services industry. Mobile payments (m-payments) technologies enable new channels for consumer payments for goods and services purchases, and other forms of economic exchange. The m-payments ecosystem involves multiple distinct stakeholders, and a high level of consumer data-sharing. In this paper, we will assess the current m-payments ecosystem, and discuss the challenges and opportunities with big data captured from mpayments transactions. We will also propose new directions to encourage research that will shed the light on how stakeholders can facilitate the successful adoption and realize the …

Go to article

Showrooming Vs. Competing: How Does Brand Selection Matter?, Qian Tang, Mei Lin Jun 2015

Showrooming Vs. Competing: How Does Brand Selection Matter?, Qian Tang, Mei Lin

Research Collection School Of Computing and Information Systems

In this study, we empirically examine the effect of local shoe store openings on the sales of a competing, major online shoe retailer. Both showrooming and competing effects can play a role: Under the showrooming effect, the local store opening can lead to more online sales for the online retailer, whereas the competing effect created by the local store opening can substitute away the demand for the online retailer. We examine when one effect dominates the other by classifying local stores into single- and mixed-brand stores. We find that the showrooming effect is dominant for a single-brand store opening, and …

Go to article

Retail Precinct Management: A Case Of Commercial Decentralization In Singapore, Robert De Souza, Hoong Chuin Lau, Mark Goh, Lindawati, Wee-Siong Ng, Puay-Siew Tan Jun 2015

Retail Precinct Management: A Case Of Commercial Decentralization In Singapore, Robert De Souza, Hoong Chuin Lau, Mark Goh, Lindawati, Wee-Siong Ng, Puay-Siew Tan

Research Collection School Of Computing and Information Systems

The synchronized last mile logistics concept seeks to address, through coordinated collaboration, several challenges that hinder reliability, cost efficiency, effective resource planning, scheduling and utilization; and increasingly, sustainability objectives. Subsequently, the meeting of service level and contractual commitments are competitively impacted with any loss of efficiency. These challenges, against a backdrop of Singapore, can essentially be addressed in selected industry sectors through a better understanding of logistics structures; innovative supply chain designs and coordination of services, operations and processes coupled with concerted policies and supply chain strategies.

Go to article

Replica Placement For Availability In The Worst Case, Peng Li, Debin Gao, Mike Reiter Jun 2015

Replica Placement For Availability In The Worst Case, Peng Li, Debin Gao, Mike Reiter

Research Collection School Of Computing and Information Systems

We explore the problem of placing object replicas on nodes in a distributed system to maximize the number of objects that remain available when node failures occur. In our model, failing (the nodes hosting) a given threshold of replicas is sufficient to disable each object, and the adversary selects which nodes to fail to minimize the number of objects that remain available. We specifically explore placement strategies based on combinatorial structures called t-packings; provide a lower bound for the object availability they offer; show that these placements offer availability that is c-competitive with optimal; propose an efficient algorithm for computing …

Go to article

Reliable Patch Trackers: Robust Visual Tracking By Exploiting Reliable Patches, Yang Li, Jianke Zhu, Steven C. H. Hoi Jun 2015

Reliable Patch Trackers: Robust Visual Tracking By Exploiting Reliable Patches, Yang Li, Jianke Zhu, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Most modern trackers typically employ a bounding box given in the first frame to track visual objects, where their tracking results are often sensitive to the initialization. In this paper, we propose a new tracking method, Reliable Patch Trackers (RPT), which attempts to identify and exploit the reliable patches that can be tracked effectively through the whole tracking process. Specifically, we present a tracking reliability metric to measure how reliably a patch can be tracked, where a probability model is proposed to estimate the distribution of reliable patches under a sequential Monte Carlo framework. As the reliable patches distributed over …

Go to article

Author Topic Model-Based Collaborative Filtering For Personalized Poi Recommendations, Shuhui Jiang, Xueming Qian, Jialie Shen, Yun Fu, Tao Mei Jun 2015

Author Topic Model-Based Collaborative Filtering For Personalized Poi Recommendations, Shuhui Jiang, Xueming Qian, Jialie Shen, Yun Fu, Tao Mei

Research Collection School Of Computing and Information Systems

From social media has emerged continuous needs for automatic travel recommendations. Collaborative filtering (CF) is the most well-known approach. However, existing approaches generally suffer from various weaknesses. For example, sparsity can significantly degrade the performance of traditional CF. If a user only visits very few locations, accurate similar user identification becomes very challenging due to lack of sufficient information for effective inference. Moreover, existing recommendation approaches often ignore rich user information like textual descriptions of photos which can reflect users' travel preferences. The topic model (TM) method is an effective way to solve the "sparsity problem," but is still far …

Go to article

Wifi-Based Indoor Line-Of-Sight Identification, Zimu Zhou, Zheng Yang, Chenshu Wu, Longfei Shangguan, Haibin Cai, Yunhao Liu, Lionel M. Ni Jun 2015

Wifi-Based Indoor Line-Of-Sight Identification, Zimu Zhou, Zheng Yang, Chenshu Wu, Longfei Shangguan, Haibin Cai, Yunhao Liu, Lionel M. Ni

Research Collection School Of Computing and Information Systems

Wireless LANs, particularly WiFi, have been pervasively deployed and have fostered myriad wireless communication services and ubiquitous computing applications. A primary concern in designing these applications is to combat harsh indoor propagation environments, particularly Non-Line-Of-Sight (NLOS) propagation. The ability to identify the existence of the Line-Of-Sight (LOS) path acts as a key enabler for adaptive communication, cognitive radios, and robust localization. Enabling such capability on commodity WiFi infrastructure, however, is prohibitive due to the coarse multipath resolution with MAC-layer received signal strength. In this paper, we propose two PHY-layer channel-statistics-based features from both the time and frequency domains. To further …

Go to article

Wifi-Based Indoor Line-Of-Sight Identification, Zimu Zhou, Zheng Yang, Chenshu Wu, Longfei Shangguan, Haibin Cai, Yunhao Liu, Lionel M. Ni Jun 2015

Wifi-Based Indoor Line-Of-Sight Identification, Zimu Zhou, Zheng Yang, Chenshu Wu, Longfei Shangguan, Haibin Cai, Yunhao Liu, Lionel M. Ni

Research Collection School Of Computing and Information Systems

Wireless LANs, particularly WiFi, have been pervasively deployed and have fostered myriad wireless communication services and ubiquitous computing applications. A primary concern in designing these applications is to combat harsh indoor propagation environments, particularly Non-Line-Of-Sight (NLOS) propagation. The ability to identify the existence of the Line-Of-Sight (LOS) path acts as a key enabler for adaptive communication, cognitive radios, and robust localization. Enabling such capability on commodity WiFi infrastructure, however, is prohibitive due to the coarse multipath resolution with MAC-layer received signal strength. In this paper, we propose two PHY-layer channel-statistics-based features from both the time and frequency domains. To further …

Go to article

Adaptive Resource Provisioning Mechanism In Vees For Improving Performance Of Hla-Based Simulations, Zengxiang Li, Wentong Cai, Stephen John Turner, Xiaorong Li, Nguyen Binh Duong Ta Jun 2015

Adaptive Resource Provisioning Mechanism In Vees For Improving Performance Of Hla-Based Simulations, Zengxiang Li, Wentong Cai, Stephen John Turner, Xiaorong Li, Nguyen Binh Duong Ta

Research Collection School Of Computing and Information Systems

Parallel and distributed simulations (or High-Level Architecture (HLA)-based simulations) employing optimistic synchronization allow federates to advance simulation time freely at the risk of overoptimistic executions and execution rollbacks. As a result, the simulation performance may degrade significantly due to the simulation workload imbalance among federates. In this article, we investigate the execution of parallel and distributed simulations on Cloud and data centers with Virtual Execution Environments (VEEs). In order to speed up simulation execution, an Adaptive Resource Provisioning Mechanism in Virtual Execution Environments (ArmVee) is proposed. It is composed of a performance monitor and a resource manager. The former measures …

Go to article

Integrated Low-Rank-Based Discriminative Feature Learning For Recognition, Pan Zhou, Zhouchen Lin, Chao Zhang Jun 2015

Integrated Low-Rank-Based Discriminative Feature Learning For Recognition, Pan Zhou, Zhouchen Lin, Chao Zhang

Research Collection School Of Computing and Information Systems

Feature learning plays a central role in pattern recognition. In recent years, many representation-based feature learning methods have been proposed and have achieved great success in many applications. However, these methods perform feature learning and subsequent classification in two separate steps, which may not be optimal for recognition tasks. In this paper, we present a supervised low-rank-based approach for learning discriminative features. By integrating latent low-rank representation (LatLRR) with a ridge regression-based classifier, our approach combines feature learning with classification, so that the regulated classification error is minimized. In this way, the extracted features are more discriminative for the recognition …

Go to article

Verifying Parameterized Timed Security Protocols, Li Li, Jun Sun, Yang Liu, Jin Song Dong Jun 2015

Verifying Parameterized Timed Security Protocols, Li Li, Jun Sun, Yang Liu, Jin Song Dong

Research Collection School Of Computing and Information Systems

Quantitative timing is often explicitly used in systems for better security, e.g., the credentials for automatic website logon often has limited lifetime. Verifying timing relevant security protocols in these systems is very challenging as timing adds another dimension of complexity compared with the untimed protocol verification. In our previous work, we proposed an approach to check the correctness of the timed authentication in security protocols with fixed timing constraints. However, a more difficult question persists, i.e., given a particular protocol design, whether the protocol has security flaws in its design or it can be configured secure with proper parameter values? …

Go to article

Face Video Retrieval With Image Query Via Hashing Across Euclidean Space And Riemannian Manifold, Y. Li, R. Wang, Zhiwu Huang, S. Shan, X. Chen Jun 2015

Face Video Retrieval With Image Query Via Hashing Across Euclidean Space And Riemannian Manifold, Y. Li, R. Wang, Zhiwu Huang, S. Shan, X. Chen

Research Collection School Of Computing and Information Systems

Retrieving videos of a specific person given his/her face image as query becomes more and more appealing for applications like smart movie fast-forwards and suspect searching. It also forms an interesting but challenging computer vision task, as the visual data to match, i.e., still image and video clip are usually represented quite differently. Typically, face image is represented as point (i.e., vector) in Euclidean space, while video clip is seemingly modeled as a point (e.g., covariance matrix) on some particular Riemannian manifold in the light of its recent promising success. It thus incurs a new hashing-based retrieval problem of matching …

Go to article

Online Multimodal Co-Indexing And Retrieval Of Weakly Labeled Web Image Collections, Lei Meng, Ah-Hwee Tan, Cyril Leung, Liqiang Nie, Tan-Seng Chua, Chunyan Miao Jun 2015

Online Multimodal Co-Indexing And Retrieval Of Weakly Labeled Web Image Collections, Lei Meng, Ah-Hwee Tan, Cyril Leung, Liqiang Nie, Tan-Seng Chua, Chunyan Miao

Research Collection School Of Computing and Information Systems

Weak supervisory information of web images, such as captions, tags, and descriptions, make it possible to better understand images at the semantic level. In this paper, we propose a novel online multimodal co-indexing algorithm based on Adaptive Resonance Theory, named OMC-ART, for the automatic co-indexing and retrieval of images using their multimodal information. Compared with existing studies, OMC-ART has several distinct characteristics. First, OMCART is able to perform online learning of sequential data. Second, OMC-ART builds a two-layer indexing structure, in which the first layer co-indexes the images by the key visual and textual features based on the generalized distributions …

Go to article

Extracting Development Tasks To Navigate Software Documentation, Christoph Treude, Martin P. Robillard, Barthélémy Dagenais Jun 2015

Extracting Development Tasks To Navigate Software Documentation, Christoph Treude, Martin P. Robillard, Barthélémy Dagenais

Research Collection School Of Computing and Information Systems

Knowledge management plays a central role in many software development organizations. While much of the important technical knowledge can be captured in documentation, there often exists a gap between the information needs of software developers and the documentation structure. To help developers navigate documentation, we developed a technique for automatically extracting tasks from software documentation by conceptualizing tasks as specific programming actions that have been described in the documentation. More than 70 percent of the tasks we extracted from the documentation of two projects were judged meaningful by at least one of two developers. We present TaskNavigator, a user interface …

Go to article

Unsupervised Celebrity Face Naming In Web Videos, Lei Pang, Chong-Wah Ngo Jun 2015

Unsupervised Celebrity Face Naming In Web Videos, Lei Pang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper investigates the problem of celebrity face naming in unconstrained videos with user-provided metadata. Instead of relying on accurate face labels for supervised learning, a rich set of relationships automatically derived from video content and knowledge from image domain and social cues is leveraged for unsupervised face labeling. The relationships refer to the appearances of faces under different spatio-temporal contexts and their visual similarities. The knowledge includes Web images weakly tagged with celebrity names and the celebrity social networks. The relationships and knowledge are elegantly encoded using conditional random field (CRF) for label inference. Two versions of face annotation …

Go to article

Discriminant Analysis On Riemannian Manifold Of Gaussian Distributions For Face Recognition With Image Sets, Wen. Wang, Ruiping. Wang, Zhiwu Huang, Shiguang. Shan, Xilin. Chen Jun 2015

Discriminant Analysis On Riemannian Manifold Of Gaussian Distributions For Face Recognition With Image Sets, Wen. Wang, Ruiping. Wang, Zhiwu Huang, Shiguang. Shan, Xilin. Chen

Research Collection School Of Computing and Information Systems

This paper presents a method named Discriminant Analysis on Riemannian manifold of Gaussian distributions (DARG) to solve the problem of face recognition with image sets. Our goal is to capture the underlying data distribution in each set and thus facilitate more robust classification. To this end, we represent image set as Gaussian Mixture Model (GMM) comprising a number of Gaussian components with prior probabilities and seek to discriminate Gaussian components from different classes. In the light of information geometry, the Gaussians lie on a specific Riemannian manifold. To encode such Riemannian geometry properly, we investigate several distances between Gaussians and …

Go to article

Semi-Supervised Domain Adaptation With Subspace Learning For Visual Recognition, Ting Yao, Yingwei Pan, Chong-Wah Ngo, Houqiang Li, Tao Mei Jun 2015

Semi-Supervised Domain Adaptation With Subspace Learning For Visual Recognition, Ting Yao, Yingwei Pan, Chong-Wah Ngo, Houqiang Li, Tao Mei

Research Collection School Of Computing and Information Systems

In many real-world applications, we are often facing the problem of cross domain learning, i.e., to borrow the labeled data or transfer the already learnt knowledge from a source domain to a target domain. However, simply applying existing source data or knowledge may even hurt the performance, especially when the data distribution in the source and target domain is quite different, or there are very few labeled data available in the target domain. This paper proposes a novel domain adaptation framework, named Semi-supervised Domain Adaptation with Subspace Learning (SDASL), which jointly explores invariant lowdimensional structures across domains to correct data …

Go to article

Improving Automatic Name-Face Association Using Celebrity Images On The Web, Zhineng Chen, Bailan Feng, Chong-Wah Ngo, Caiyan Jia, Xiangsheng Huang Jun 2015

Improving Automatic Name-Face Association Using Celebrity Images On The Web, Zhineng Chen, Bailan Feng, Chong-Wah Ngo, Caiyan Jia, Xiangsheng Huang

Research Collection School Of Computing and Information Systems

This paper investigates the task of automatically associating faces appearing in images (or videos) with their names. Our novelty lies in the use of celebrity Web images to facilitate the task. Specifically, we first propose a method named Image Matching (IM), which uses the faces in images returned from name queries over an image search engine as the gallery set of the names, and a probe face is classified as one of the names, or none of them, according to their matching scores and compatibility characterized by a proposed Assigning-Thresholding (AT) pipeline. Noting IM could provide guidance for association for …

Go to article

Multimodal Learning With Deep Boltzmann Machine For Emotion Prediction In User Generated Videos, Lei Pang, Chong-Wah Ngo Jun 2015

Multimodal Learning With Deep Boltzmann Machine For Emotion Prediction In User Generated Videos, Lei Pang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Detecting emotions from user-generated videos, such as“anger” and “sadness”, has attracted widespread interest recently. The problem is challenging as effectively representing video data with multi-view information (e.g., audio, video or text) is not trivial. In contrast to the existing works that extract features from each modality (view) separately followed by early or late fusion, we propose to learn a joint density model over the space of multi-modal inputs (including visual, auditory and textual modalities) with Deep Boltzmann Machine (DBM). The model is trained directly on the user-generated Web videos without any labeling effort. More importantly, the deep architecture enlightens the …

Go to article

Emif: Towards A Scalable And Effective Indexing Framework For Large Scale Music Retrieval, Jialie Shen, Tao Mei, Dacheng Tao, Xuelong Li, Yong Rui Jun 2015

Emif: Towards A Scalable And Effective Indexing Framework For Large Scale Music Retrieval, Jialie Shen, Tao Mei, Dacheng Tao, Xuelong Li, Yong Rui

Research Collection School Of Computing and Information Systems

This article presents a novel indexing framework called EMIF (Effective Music Indexing Framework) to facilitate scalable and accurate content based music retrieval. EMIF system architecture is designed based on a "classification-and-indexing" principle and consists of two main functionality layers: 1) a novel semantic-sensitive classification to identify input music's category and 2) multiple indexing structures - one local indexing structure corresponds to one semantic category. EMIF's layered architecture not only enables superior search accuracy but also reduces query response time significantly. To evaluate the system, a set of comprehensive experimental studies have been carried out using large test collection and EMIF …

Go to article

Method For Matching Probabilistic Encrypted Data, Hwee Hwa Pang, Xuhua Ding Jun 2015

Method For Matching Probabilistic Encrypted Data, Hwee Hwa Pang, Xuhua Ding

Research Collection School Of Computing and Information Systems

Determining if a first encrypted data of a first data value is equal to a second encrypted data of a second data value. Comprising: a first cyclic group; a second cyclic group including a first element. Applying an operation to the first cyclic group to map its elements to an element in the second cyclic group. Randomly selecting a second element from the first cyclic group; producing the first encrypted data by mapping the second element and the first data value into one or more elements of the first cyclic group. Randomly selecting a third element from the first cyclic …

Go to article

First Prev Next Last