Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 7 of 7
Full-Text Articles in Engineering
Motion Retrieval By Temporal Slices Analysis, Chong-Wah Ngo, Chong-Wah Ngo, Hong-Jiang Zhang
Motion Retrieval By Temporal Slices Analysis, Chong-Wah Ngo, Chong-Wah Ngo, Hong-Jiang Zhang
Research Collection School Of Computing and Information Systems
In this papel; we investigate video shots retrieval based on the analysis of temporal slice images. Temporal slices are a set of2D images extracted along the time dimension of image sequences. They encode rich set of motion clues for shot similarity measure. Because motion is depicted as texture orientation in temporal slices, we utilize various texture features such as tensor histogram, Gabor feature, and the statistical feature of co-occurrence matrix extracted directly from slices for motion description and retrieval. In this way, motion retrieval can be treated in a similar way as texture retrieval problem. Experimental results indicate that the …
On Clustering And Retrieval Of Video Shots Through Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang
On Clustering And Retrieval Of Video Shots Through Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang
Research Collection School Of Computing and Information Systems
Based on the analysis of temporal slices, we propose novel approaches for clustering and retrieval of video shots. Temporal slices are a set of two-dimensional (2-D) images extracted along the time dimension of an image volume. They encode rich set of visual patterns for similarity measure. In this paper, we first demonstrate that tensor histogram features extracted from temporal slices are suitable for motion retrieval. Subsequently, we integrate both tensor and color histograms for constructing a two-level hierarchical clustering structure. Each cluster in the top level contains shots with similar color while each cluster in bottom level consists of shots …
Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang
Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang
Research Collection School Of Computing and Information Systems
In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuristics to generate an initial solution. In the second phase, a tabu search method is proposed to improve the solution. Another contribution of this paper is a strategy to generate good problem instances and benchmarking solutions for PDPTW, based on Solomon' s benchmark test cases for VRPTW. Experimental results show that our approach yields very …
Organizing And Personalizing Intelligence Gathering From The Web, Hwee-Leng Ong, Ah-Hwee Tan, Jamie Ng, Pan Hong, Qiu-Xiang Li
Organizing And Personalizing Intelligence Gathering From The Web, Hwee-Leng Ong, Ah-Hwee Tan, Jamie Ng, Pan Hong, Qiu-Xiang Li
Research Collection School Of Computing and Information Systems
In this paper, we describe how an integrated web‐based application, code‐named FOCI (Flexible Organizer for Competitive Intelligence), can help the knowledge worker in the gathering, organizing, tracking and dissemination of competitive intelligence (CI). It combines the use of a novel user‐configurable clustering, trend analysis and visualization techniques to manage information gathered from the web. FOCI allows its users to define and personalize the organization of the information clusters according to their needs and preferences into portfolios. These personalized portfolios created are saved and can be subsequently tracked and shared with other users. The paper runs through an example to show …
Integrating Local Search And Network Flow To Solve The Inventory Routing Problem, Hoong Chuin Lau, Q Liu, H. Ono
Integrating Local Search And Network Flow To Solve The Inventory Routing Problem, Hoong Chuin Lau, Q Liu, H. Ono
Research Collection School Of Computing and Information Systems
The inventory routing problem is one of important and practical problems in logistics. It involves the integration of inventory management and vehicle routing, both of which are known to be NP-hard. In this paper, we combine local search and network flows to solve the inventory management problem, by utilizing the minimum cost flow sub-solutions as a guiding measure for local search. We then integrate with a standard VRPTW solver to present experimental results for the overall inventory routing problem, based on instances extended from the Solomon benchmark problems.
Proteome Database Of Hepatocellular Carcinoma., Cynthia Liang, Jason Neo, Siaw Ling Lo, Gek San Tan, Teck Keong Seow, Maxey Chung
Proteome Database Of Hepatocellular Carcinoma., Cynthia Liang, Jason Neo, Siaw Ling Lo, Gek San Tan, Teck Keong Seow, Maxey Chung
Research Collection School Of Computing and Information Systems
Hepatocellular carcinoma (HCC or hepatoma) is the most common primary cancer of the liver. Persistent viral infection by the hepatic B or C virus is probably the most important cause of HCC worldwide. It is responsible for approximately one million deaths each year, predominantly in the underdeveloped and developing countries, but its incidence is also on the rise in the developed countries. For most patients suffering from HCC, long-term survival is rare, as they are presented late and are often unsuitable for curative treatment. Thus there is great interest to identify novel HCC diagnostic markers for early detection of the …
A New Approach For Weighted Constraint Satisfaction, Hoong Chuin Lau
A New Approach For Weighted Constraint Satisfaction, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We consider the Weighted Constraint Satisfaction Problem which is an important problem in Artificial Intelligence. Given a set of variables, their domains and a set of constraints between variables, our goal is to obtain an assignment of the variables to domain values such that the weighted sum of satisfied constraints is maximized. In this paper, we present a new approach based on randomized rounding of semidefinite programming relaxation. Besides having provable worst-case bounds for domain sizes 2 and 3, our algorithm is simple and efficient in practice, and produces better solutions than some other polynomial-time algorithms such as greedy and …