Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 6 of 6
Full-Text Articles in Physical Sciences and Mathematics
An Effective Approach To 3d Deformable Surface Tracking, Jianke Zhu, Steven C. H. Hoi, Zenglin Xu, Michael R. Lyu
An Effective Approach To 3d Deformable Surface Tracking, Jianke Zhu, Steven C. H. Hoi, Zenglin Xu, Michael R. Lyu
Research Collection School Of Computing and Information Systems
The key challenge with 3D deformable surface tracking arises from the difficulty in estimating a large number of 3D shape parameters from noisy observations. A recent state-of-the-art approach attacks this problem by formulating it as a Second Order Cone Programming (SOCP) feasibility problem. The main drawback of this solution is the high computational cost. In this paper, we first reformulate the problem into an unconstrained quadratic optimization problem. Instead of handling a large set of complicated SOCP constraints, our new formulation can be solved very efficiently by resolving a set of sparse linear equations. Based on the new framework, a …
Modeling Video Hyperlinks With Hypergraph For Web Video Reranking, Hung-Khoon Tan, Chong-Wah Ngo, Xiao Wu
Modeling Video Hyperlinks With Hypergraph For Web Video Reranking, Hung-Khoon Tan, Chong-Wah Ngo, Xiao Wu
Research Collection School Of Computing and Information Systems
In this paper, we investigate a novel approach of exploiting visual-duplicates for web video reranking using hypergraph. Current graph-based reranking approaches consider mainly the pair-wise linking of keyframes and ignore reliability issues that are inherent in such representation. We exploit higher order relation to overcome the issues of missing links in visual-duplicate keyframes and in addition identify the latent relationships among keyframes. Based on hypergraph, we consider two groups of video threads: visual near-duplicate threads and story threads, to hyperlink web videos and describe the higher order information existing in video content. To facilitate reranking using random walk algorithm, the …
Accelerating Near-Duplicate Video Matching By Combining Visual Similarity And Alignment Distortion, Hung-Khoon Tan, Xiao Wu, Chong-Wah Ngo, Wan-Lei Zhao
Accelerating Near-Duplicate Video Matching By Combining Visual Similarity And Alignment Distortion, Hung-Khoon Tan, Xiao Wu, Chong-Wah Ngo, Wan-Lei Zhao
Research Collection School Of Computing and Information Systems
In this paper, we investigate a novel approach to accelerate the matching of two video clips by exploiting the temporal coherence property inherent in the keyframe sequence of a video. Motivated by the fact that keyframe correspondences between near-duplicate videos typically follow certain spatial arrangements, such property could be employed to guide the alignment of two keyframe sequences. We set the alignment problem as an integer quadratic programming problem, where the cost function takes into account both the visual similarity of the corresponding keyframes as well as the alignment distortion among the set of correspondences. The set of keyframe-pairs found …
Knowledge Transfer Via Multiple Model Local Structure Mapping, Jing Gao, Wei Fan, Jing Jiang, Jiawei Han
Knowledge Transfer Via Multiple Model Local Structure Mapping, Jing Gao, Wei Fan, Jing Jiang, Jiawei Han
Research Collection School Of Computing and Information Systems
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from which test examples are to be drawn. The task can be especially difficult when the training examples are from one or several domains different from the test domain. In this paper, we propose a locally weighted ensemble framework to combine multiple models for transfer learning, where the weights are dynamically assigned according to a model's predictive power on each test example. It can integrate the advantages of various learning algorithms and the labeled information from multiple …
Ranked Reverse Nearest Neighbor Search, Ken C. K. Lee, Baihua Zheng, Wang-Chien Lee
Ranked Reverse Nearest Neighbor Search, Ken C. K. Lee, Baihua Zheng, Wang-Chien Lee
Research Collection School Of Computing and Information Systems
Given a set of data points P and a query point q in a multidimensional space, Reverse Nearest Neighbor (RNN) query finds data points in P whose nearest neighbors are q. Reverse k-Nearest Neighbor (RkNN) query (where k ≥ 1) generalizes RNN query to find data points whose kNNs include q. For RkNN query semantics, q is said to have influence to all those answer data points. The degree of q's influence on a data point p (∈ P) is denoted by κp where q is the κp-th NN of p. We introduce a new variant of RNN query, namely, …
Capacity Constrained Assignment In Spatial Databases, Hou U Leong, Man Lung Yiu, Kyriakos Mouratidis, Nikos Mamoulis
Capacity Constrained Assignment In Spatial Databases, Hou U Leong, Man Lung Yiu, Kyriakos Mouratidis, Nikos Mamoulis
Research Collection School Of Computing and Information Systems
Given a point set P of customers (e.g., WiFi receivers) and a point set Q of service providers (e.g., wireless access points), where each q 2 Q has a capacity q.k, the capacity constrained assignment (CCA) is a matching M Q × P such that (i) each point q 2 Q (p 2 P) appears at most k times (at most nce) in M, (ii) the size of M is maximized (i.e., it comprises min{|P|,P q2Q q.k} pairs), and (iii) the total assignment cost (i.e., the sum of Euclidean distances within all pairs) is minimized. Thus, the CCA problem is …