Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Active Learning (1)
- Algorithm design and analysis (1)
- Association Rule (1)
- Association rule mining (1)
- Audio retrieval (1)
-
- Audio similarity measure (1)
- Bipartite graph matching under transformation sets (1)
- Classification (1)
- Content-based image retrieval (1)
- Databases (1)
- Gestalt principle (1)
- Global Positioning System (1)
- Guidelines (1)
- Indoor environments (1)
- Kernel Logistic Regressions (1)
- Kernel Machines (1)
- Keyframe tracking (1)
- Keypoint matching (1)
- Log data (1)
- Log-based relevance feedback (1)
- Near-duplicate detection (1)
- Nearest neighbor searches (1)
- Pattern entropy (1)
- Performance analysis (1)
- Phase estimation (1)
- RDF mining (1)
- Relevance feedback (1)
- Resource Description Framework (1)
- Resource Description Framework Data (1)
- Root Closure (1)
Articles 1 - 9 of 9
Full-Text Articles in Physical Sciences and Mathematics
Cosign: A Parallel Algorithm For Coordinated Traffic Signal Control, Shih-Fen Cheng, Marina A. Epelman, Robert L. Smith
Cosign: A Parallel Algorithm For Coordinated Traffic Signal Control, Shih-Fen Cheng, Marina A. Epelman, Robert L. Smith
Research Collection School Of Computing and Information Systems
The problem of finding optimal coordinated signal timing plans for a large number of traffic signals is a challenging problem because of the exponential growth in the number of joint timing plans that need to be explored as the network size grows. In this paper, the game-theoretic paradigm of fictitious play to iteratively search for a coordinated signal timing plan is employed, which improves a system-wide performance criterion for a traffic network. The algorithm is robustly scalable to realistic-size networks modeled with high-fidelity simulations. Results of a case study for the city of Troy, MI, where there are 75 signalized …
Fast Tracking Of Near-Duplicate Keyframes In Broadcast Domain With Transitivity Propagation, Chong-Wah Ngo, Wan-Lei Zhao, Yu-Gang Jiang
Fast Tracking Of Near-Duplicate Keyframes In Broadcast Domain With Transitivity Propagation, Chong-Wah Ngo, Wan-Lei Zhao, Yu-Gang Jiang
Research Collection School Of Computing and Information Systems
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this paper, we propose a novel approach for the discovery and tracking of NDK pairs and threads in the broadcast domain. The detection of NDKs in a large data set is a challenging task due to the fact that when the data set increases linearly, the computational cost increases in a quadratic speed, and so does the number of false alarms. This paper explores the symmetric and transitive nature of near-duplicate for the effective …
Audio Similarity Measure By Graph Modeling And Matching, Yuxin Peng, Chong-Wah Ngo, Cuihua Fang, Xiaoou Chen, Jianguo Xiao
Audio Similarity Measure By Graph Modeling And Matching, Yuxin Peng, Chong-Wah Ngo, Cuihua Fang, Xiaoou Chen, Jianguo Xiao
Research Collection School Of Computing and Information Systems
This paper proposes a new approach for the similarity measure and ranking of audio clips by graph modeling and matching. Instead of using frame-based or salient-based features to measure the acoustical similarity of audio clips, segment-based similarity is proposed. The novelty of our approach lies in two aspects: segment-based representation, and the similarity measure and ranking based on four kinds of similarity factors. In segmentbased representation, segments not only capture the change property of audio clip, but also keep and present the change relation and temporal order of audio features. In the similarity measure and ranking, four kinds of similarity …
Mining Rdf Metadata For Generalized Association Rules, Tao Jiang, Ah-Hwee Tan
Mining Rdf Metadata For Generalized Association Rules, Tao Jiang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
In this paper, we present a novel frequent generalized pattern mining algorithm, called GP-Close, for mining generalized associations from RDF metadata. To solve the over-generalization problem encountered by existing methods, GP-Close employs the notion of generalization closure for systematic over-generalization reduction. Empirical experiments conducted on real world RDF data sets show that our method can substantially reduce pattern redundancy and perform much better than the original generalized association rule mining algorithm Cumulate in term of time efficiency.
Wireless Indoor Positioning System With Enhanced Nearest Neighbors In Signal Space Algorithm, Quang Tran, Juki Wirawan Tantra, Ah-Hwee Tan, Ah-Hwee Tan, Kin-Choong Yow, Dongyu Qiu
Wireless Indoor Positioning System With Enhanced Nearest Neighbors In Signal Space Algorithm, Quang Tran, Juki Wirawan Tantra, Ah-Hwee Tan, Ah-Hwee Tan, Kin-Choong Yow, Dongyu Qiu
Research Collection School Of Computing and Information Systems
With the rapid development and wide deployment of wireless Local Area Networks (WLANs), WLAN-based positioning system employing signal-strength-based technique has become an attractive solution for location estimation in indoor environment. In recent years, a number of such systems has been presented, and most of the systems use the common Nearest Neighbor in Signal Space (NNSS) algorithm. In this paper, we propose an enhancement to the NNSS algorithm. We analyze the enhancement to show its effectiveness. The performance of the enhanced NNSS algorithm is evaluated with different values of the parameters. Based on the performance evaluation and analysis, we recommend some …
Learning The Unified Kernel Machines For Classification, Steven C. H. Hoi, Michael R. Lyu, Edward Y. Chang
Learning The Unified Kernel Machines For Classification, Steven C. H. Hoi, Michael R. Lyu, Edward Y. Chang
Research Collection School Of Computing and Information Systems
Kernel machines have been shown as the state-of-the-art learning techniques for classification. In this paper, we propose a novel general framework of learning the Unified Kernel Machines (UKM) from both labeled and unlabeled data. Our proposed framework integrates supervised learning, semi-supervised kernel learning, and active learning in a unified solution. In the suggested framework, we particularly focus our attention on designing a new semi-supervised kernel learning method, i.e., Spectral Kernel Learning (SKL), which is built on the principles of kernel target alignment and unsupervised kernel design. Our algorithm is related to an equivalent quadratic programming problem that can be efficiently …
Mining Rdf Metadata For Generalized Association Rules: Knowledge Discovery In The Semantic Web Era, Tao Jiang, Ah-Hwee Tan
Mining Rdf Metadata For Generalized Association Rules: Knowledge Discovery In The Semantic Web Era, Tao Jiang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
In this paper, we present a novel frequent generalized pattern mining algorithm, called GP-Close, for mining generalized associations from RDF metadata. To solve the over-generalization problem encountered by existing methods, GP-Close employs the notion of emphgeneralization closure for systematic over-generalization reduction.
Gestalt-Based Feature Similarity Measure In Trademark Database, Hui Jiang, Chong-Wah Ngo, Hung-Khoon Tan
Gestalt-Based Feature Similarity Measure In Trademark Database, Hui Jiang, Chong-Wah Ngo, Hung-Khoon Tan
Research Collection School Of Computing and Information Systems
Motivated by the studies in Gestalt principle, this paper describes a novel approach on the adaptive selection of visual features for trademark retrieval. We consider five kinds of visual saliencies: symmetry, continuity, proximity, parallelism and closure property. The first saliency is based on Zernike moments, while the others are modeled by geometric elements extracted illusively as a whole from a trademark. Given a query trademark, we adaptively determine the features appropriate for retrieval by investigating its visual saliencies. We show that in most cases, either geometric or symmetric features can give us good enough accuracy. To measure the similarity of …
A Unified Log-Based Relevance Feedback Scheme For Image Retrieval, Steven Hoi, Michael R. Lyu, Rong Jin
A Unified Log-Based Relevance Feedback Scheme For Image Retrieval, Steven Hoi, Michael R. Lyu, Rong Jin
Research Collection School Of Computing and Information Systems
Relevance feedback has emerged as a powerful tool to boost the retrieval performance in content-based image retrieval (CBIR). In the past, most research efforts in this field have focused on designing effective algorithms for traditional relevance feedback. Given that a CBIR system can collect and store users' relevance feedback information in a history log, an image retrieval system should be able to take advantage of the log data of users' feedback to enhance its retrieval performance. In this paper, we propose a unified framework for log-based relevance feedback that integrates the log of feedback data into the traditional relevance feedback …