Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Old Dominion University (67)
- Singapore Management University (15)
- University of Arkansas, Fayetteville (10)
- University of Nebraska - Lincoln (9)
- Air Force Institute of Technology (6)
-
- California Polytechnic State University, San Luis Obispo (6)
- Embry-Riddle Aeronautical University (6)
- Portland State University (5)
- California State University, San Bernardino (4)
- City University of New York (CUNY) (4)
- Georgia Southern University (4)
- Loyola University Chicago (4)
- University of Nevada, Las Vegas (4)
- Michigan Technological University (3)
- Purdue University (3)
- University of Kentucky (3)
- University of New Mexico (3)
- Clemson University (2)
- Columbus State University (2)
- Indian Statistical Institute (2)
- LSU New Orleans (2)
- San Jose State University (2)
- Southern Methodist University (2)
- Technological University Dublin (2)
- The University of Southern Mississippi (2)
- University of Denver (2)
- University of Louisville (2)
- Western Kentucky University (2)
- Belmont University (1)
- Brigham Young University (1)
- Keyword
-
- Algorithms (10)
- Computer algorithms (9)
- Wireless communication systems (8)
- Sensor networks (7)
- Image processing (6)
-
- Security (6)
- Algorithm (4)
- Computer networks (4)
- Computer programs (4)
- Data flow computing (4)
- Machine Learning (4)
- Machine learning (4)
- Neural networks (4)
- Simulation (4)
- Wireless sensor networks (4)
- Automatic speech recognition (3)
- Computer architecture (3)
- Cryptography (3)
- Digital techniques (3)
- Encryption (3)
- Genetic algorithms (3)
- Graph (3)
- Heterogeneous computing (3)
- Localization (3)
- Mobile communication systems (3)
- Real-time data processing (3)
- Robotics (3)
- Anomaly detection (2)
- Artificial Intelligence (2)
- Artificial neural networks (2)
- Publication Year
- Publication
-
- Electrical & Computer Engineering Theses & Dissertations (48)
- Research Collection School Of Computing and Information Systems (15)
- Theses and Dissertations (10)
- Computer Science Theses & Dissertations (7)
- School of Computing: Dissertations, Theses, and Student Research (5)
-
- Computer Science Faculty Publications (4)
- Computer Science and Computer Engineering Undergraduate Honors Theses (4)
- Computer Science: Faculty Publications and Other Works (4)
- Electronic Theses and Dissertations (4)
- Computer Science Faculty Publications and Presentations (3)
- Dissertations, Master's Theses and Master's Reports (3)
- Doctoral Dissertations and Master's Theses (3)
- Graduate Theses and Dissertations (3)
- Journal of International Technology and Information Management (3)
- Master's Theses (3)
- Publications (3)
- All Dissertations (2)
- College of Graduate Studies: Theses & Dissertations (2)
- Computer Engineering (2)
- Computer Science and Computer Engineering Faculty Publications and Presentations (2)
- Conference papers (2)
- Dissertations (2)
- Dissertations and Theses (2)
- Electrical & Computer Engineering Faculty Publications (2)
- Electrical & Computer Engineering Faculty Research (2)
- Faculty Publications (2)
- Honors College Theses (2)
- LSU New Orleans Theses and Dissertations (2)
- Masters Theses & Specialist Projects (2)
- Master’s Dissertations (2)
- Publication Type
Articles 91 - 120 of 198
Full-Text Articles in Theory and Algorithms
Scalable And Fully Distributed Localization In Large-Scale Sensor Networks, Miao Jin, Su Xia, Hongyi Wu, Xianfeng David Gu
Scalable And Fully Distributed Localization In Large-Scale Sensor Networks, Miao Jin, Su Xia, Hongyi Wu, Xianfeng David Gu
Electrical & Computer Engineering Faculty Publications
This work proposes a novel connectivity-based localization algorithm, well suitable for large-scale sensor networks with complex shapes and a non-uniform nodal distribution. In contrast to current state-of-the-art connectivity-based localization methods, the proposed algorithm is highly scalable with linear computation and communication costs with respect to the size of the network; and fully distributed where each node only needs the information of its neighbors without cumbersome partitioning and merging process. The algorithm is theoretically guaranteed and numerically stable. Moreover, the algorithm can be readily extended to the localization of networks with a one-hop transmission range distance measurement, and the propagation of …
Music Feature Matching Using Computer Vision Algorithms, Mason Hollis
Music Feature Matching Using Computer Vision Algorithms, Mason Hollis
Computer Science and Computer Engineering Undergraduate Honors Theses
This paper seeks to establish the validity and potential benefits of using existing computer vision techniques on audio samples rather than traditional images in order to consistently and accurately identify a song of origin from a short audio clip of potentially noisy sound. To do this, the audio sample is first converted to a spectrogram image, which is used to generate SURF features. These features are compared against a database of features, which have been previously generated in a similar fashion, in order to find the best match. This algorithm has been implemented in a system that can run as …
Impact Of Reviewer Social Interaction On Online Consumer Review Fraud Detection, Kunal Goswami, Younghee Park, Chungsik Song
Impact Of Reviewer Social Interaction On Online Consumer Review Fraud Detection, Kunal Goswami, Younghee Park, Chungsik Song
Faculty Publications
Background Online consumer reviews have become a baseline for new consumers to try out a business or a new product. The reviews provide a quick look into the application and experience of the business/product and market it to new customers. However, some businesses or reviewers use these reviews to spread fake information about the business/product. The fake information can be used to promote a relatively average product/business or can be used to malign their competition. This activity is known as reviewer fraud or opinion spam. The paper proposes a feature set, capturing the user social interaction behavior to identify fraud. …
An Arithmetic-Based Deterministic Centroid Initialization Method For The K-Means Clustering Algorithm, Matthew Michael Mayo
An Arithmetic-Based Deterministic Centroid Initialization Method For The K-Means Clustering Algorithm, Matthew Michael Mayo
Theses and Dissertations
One of the greatest challenges in k-means clustering is positioning the initial cluster centers, or centroids, as close to optimal as possible, and doing so in an amount of time deemed reasonable. Traditional fc-means utilizes a randomization process for initializing these centroids, and poor initialization can lead to increased numbers of required clustering iterations to reach convergence, and a greater overall runtime. This research proposes a simple, arithmetic-based deterministic centroid initialization method which is much faster than randomized initialization. Preliminary experiments suggest that this collection of methods, referred to herein as the sharding centroid initialization algorithm family, often outperforms random …
An Exploration Of Rule Clustering In Cellular Automata Rule Spaces, Jordon Huffman
An Exploration Of Rule Clustering In Cellular Automata Rule Spaces, Jordon Huffman
Theses and Dissertations
The study of complex systems examines the global behavior of a system and how the individual parts of the system affect that behavior [1]. The study of complex systems spans across many fields of science like biology, physics, engineering, and computer science. One area of complex systems that has not been fully explored is cellular automata. Since its discovery by John von Neumann, there have been no consistent ways of categorizing similarities between cellular automata rules or collecting similar rules for observation. This thesis introduces an approach to identifying clusters of similar rules and extracting rules from that cluster. Several …
Front Matter: Proceedings Of The Maics 2016 Conference, University Of Dayton
Front Matter: Proceedings Of The Maics 2016 Conference, University Of Dayton
Content presented at the MAICS conference
Front matter contains:
- A list of program chairs and committee members
- Foreword to the proceedings by James P. Buckley, conference chair; Saverio Perugini, general chair
Editors: Phu H. Phung, University of Dayton; Ju Shen, University of Dayton; Michael Glass, Valparaiso University
Object Tracking From Multiple Multi-Axis Platforms In Four Dimensions, Theodore A. Teates
Object Tracking From Multiple Multi-Axis Platforms In Four Dimensions, Theodore A. Teates
Electrical & Computer Engineering Theses & Dissertations
Object handoff in free space requires a sound framework between at least two optical sensors and one object. Previous work developed an algorithm that can determine the ap propriate time to initiate handoff of object tracking responsibilities from one optical sensor with an object in view to another optical sensor with the same object in view. In order to maintain persistent tracking of objects in this work, gimbal movements of optical sensors are determined by calculations using the Lagrange method to determine the trackability measures between the moving object and the handoff cone for the appropriate optical sensor. The rotation …
Verification Of Costless Merge Pairing Heaps, Joshua Vander Hook
Verification Of Costless Merge Pairing Heaps, Joshua Vander Hook
Journal of Undergraduate Research at Minnesota State University, Mankato
Most algorithms’ performance is limited by the data structures they use. Internal algorithms then decide the performance of the data structure. This cycle continues until fundamental results, verified by analysis and experiment, prevent further improvement. In this paper I examine one specific example of this. The focus of this work is primarily on a new variant of the pairing heap. I will review the new implementation, compare its theoretical performance, and discuss my original contribution: the first preliminary data on its experimental performance. It is instructive to provide some background information, followed by a formal definition of heaps in 1.1. …
Improved Microrobotic Control Through Image Processing And Automated Hardware Interfacing, Archit R. Aggarwal, Wuming Jing, David J. Cappelleri
Improved Microrobotic Control Through Image Processing And Automated Hardware Interfacing, Archit R. Aggarwal, Wuming Jing, David J. Cappelleri
The Summer Undergraduate Research Fellowship (SURF) Symposium
Untethered submilliliter-sized robots (microrobots) are showing potential use in different industrial, manufacturing and medical applications. A particular type of these microrobots, magnetic robots, have shown improved performance in power and control capabilities compared to the other thermal and electrostatic based robots. However, the magnetic robot designs have not been assessed in a robust manner to understand the degree of control in different environments and their application feasibility. This research project seeks to develop a custom control software interface to provide a holistic tool for researchers to evaluate the microrobotic performance through advance control features. The software deliverable involved two main …
A Comparative Study Of Underwater Robot Path Planning Algorithms For Adaptive Sampling In A Network Of Sensors, Sreeja Banerjee
A Comparative Study Of Underwater Robot Path Planning Algorithms For Adaptive Sampling In A Network Of Sensors, Sreeja Banerjee
School of Computing: Dissertations, Theses, and Student Research
Monitoring lakes, rivers, and oceans is critical to improving our understanding of complex large-scale ecosystems. We introduce a method of underwater monitoring using semi-mobile underwater sensor networks and mobile underwater robots in this thesis. The underwater robots can move freely in all dimension while the sensor nodes are anchored to the bottom of the water column and can move only up and down along the depth of the water column. We develop three different algorithms to optimize the path of the underwater robot and the positions of the sensors to improve the overall quality of sensing of an area of …
Ultimate Codes: Near-Optimal Mds Array Codes For Raid-6, Zhijie Huang, Hong Jiang, Chong Wang, Ke Zhou, Yuhong Zhao
Ultimate Codes: Near-Optimal Mds Array Codes For Raid-6, Zhijie Huang, Hong Jiang, Chong Wang, Ke Zhou, Yuhong Zhao
School of Computing: Technical Reports
As modern storage systems have grown in size and complexity, RAID-6 is poised to replace RAID-5 as the dominant form of RAID architectures due to its ability to protect against double disk failures. Many excellent erasure codes specially designed for RAID-6 have emerged in recent years. However, all of them have limitations. In this paper, we present a class of near perfect erasure codes for RAID-6, called the Ultimate codes. These codes encode, update and decode either optimally or nearly optimally, regardless of what the code length is. This implies that utilizing these codes we can build highly efficient and …
S-Code: Lowest Density Mds Array Codes For Raid-6, Zhijie Huang, Hong Jiang, Ke Zhou, Yuhong Zhao, Chong Wang
S-Code: Lowest Density Mds Array Codes For Raid-6, Zhijie Huang, Hong Jiang, Ke Zhou, Yuhong Zhao, Chong Wang
School of Computing: Technical Reports
RAID, a storage architecture designed to exploit I/O parallelism and provide data reliability, has been deployed widely in computing systems as a storage building block. In large scale storage systems, in particular, RAID-6 is gradually replacing RAID-5 as the dominant form of disk arrays due to its capability of tolerating concurrent failures of any two disks. MDS (maximum distance separable) array codes are the most popular erasure codes that can be used for implementing RAID-6, since they enable optimal storage efficiency and efficient encoding and decoding algorithms. In this paper, we propose a new class of MDS array codes called …
Idpal – A Partially-Adiabatic Energy-Efficient Logic Family: Theory And Applications To Secure Computing, Mihail T. Cutitaru
Idpal – A Partially-Adiabatic Energy-Efficient Logic Family: Theory And Applications To Secure Computing, Mihail T. Cutitaru
Electrical & Computer Engineering Theses & Dissertations
Low-power circuits and issues associated with them have gained a significant amount of attention in recent years due to the boom in portable electronic devices. Historically, low-power operation relied heavily on technology scaling and reduced operating voltage, however this trend has been slowing down recently due to the increased power density on chips. This dissertation introduces a new very-low power partially-adiabatic logic family called Input-Decoupled Partially-Adiabatic Logic (IDPAL) with applications in low-power circuits. Experimental results show that IDPAL reduces energy usage by 79% compared to equivalent CMOS implementations and by 25% when compared to the best adiabatic implementation. Experiments ranging …
Placing Videos On A Semantic Hierarchy For Search Result Navigation, Song Tan, Yu-Gang Jiang, Chong-Wah Ngo
Placing Videos On A Semantic Hierarchy For Search Result Navigation, Song Tan, Yu-Gang Jiang, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Organizing video search results in a list view is widely adopted by current commercial search engines, which cannot support efficient browsing for complex search topics that have multiple semantic facets. In this article, we propose to organize video search results in a highly structured way. Specifically, videos are placed on a semantic hierarchy that accurately organizes various facets of a given search topic. To pick the most suitable videos for each node of the hierarchy, we define and utilize three important criteria: relevance, uniqueness, and diversity. Extensive evaluations on a large YouTube video dataset demonstrate the effectiveness of our approach.
Regen: Optimizing Genetic Selection Algorithms For Heterogeneous Computing, Scott Kenneth Swinkleb Winkleblack
Regen: Optimizing Genetic Selection Algorithms For Heterogeneous Computing, Scott Kenneth Swinkleb Winkleblack
Master's Theses
GenSel is a genetic selection analysis tool used to determine which genetic markers are informational for a given trait. Performing genetic selection related analyses is a time consuming and computationally expensive task. Due to an expected increase in the number of genotyped individuals, analysis times will increase dramatically. Therefore, optimization efforts must be made to keep analysis times reasonable.
This thesis focuses on optimizing one of GenSel’s underlying algorithms for heterogeneous computing. The resulting algorithm exposes task-level parallelism and data-level parallelism present but inaccessible in the original algorithm. The heterogeneous computing solution, ReGen, outperforms the optimized CPU implementation achieving a …
Decaf: A New Event Detection Logic For The Purpose Of Fusing Delineated-Continuous Spatial Information, Kerry Q. Hart
Decaf: A New Event Detection Logic For The Purpose Of Fusing Delineated-Continuous Spatial Information, Kerry Q. Hart
School of Computing: Dissertations, Theses, and Student Research
Geospatial information fusion is the process of synthesizing information from complementary data sources located at different points in space and time. Spatial phenomena are often measured at discrete locations by sensor networks, technicians, and volunteers; yet decisions often require information about locations where direct measurements do not exist. Traditional methods assume the spatial phenomena to be either discrete or continuous, an assumption that underlies and informs all subsequent analysis. Yet certain phenomena defy this dichotomy, alternating as they move across spatial and temporal scales. Precipitation, for example, appears continuous at large scales, but it can be temporally decomposed into discrete …
Neutrosophic Logic Approaches Applied To ”Rabot” Real Time Control, Alexandru Gal, Luige Vladareanu, Florentin Smarandache, Hongnian Yu, Mincong Deng
Neutrosophic Logic Approaches Applied To ”Rabot” Real Time Control, Alexandru Gal, Luige Vladareanu, Florentin Smarandache, Hongnian Yu, Mincong Deng
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we present a way of deciding which control law should operate at a time for a mobile walking robot. The proposed deciding method is based on the new research field, called Neutrosophic Logic. The results are presented as a simulated system for which the output is related to the inputs according to the Neutrosophic Logic.
Near-Duplicate Video Retrieval: Current Research And Future Trends, Jiajun Liu, Zi Huang, Hongyun Cai, Heng Tao Shen, Chong-Wah Ngo, Wei Wang
Near-Duplicate Video Retrieval: Current Research And Future Trends, Jiajun Liu, Zi Huang, Hongyun Cai, Heng Tao Shen, Chong-Wah Ngo, Wei Wang
Research Collection School Of Computing and Information Systems
The exponential growth of online videos, along with increasing user involvement in video-related activities, has been observed as a constant phenomenon during the last decade. User's time spent on video capturing, editing, uploading, searching, and viewing has boosted to an unprecedented level. The massive publishing and sharing of videos has given rise to the existence of an already large amount of near-duplicate content. This imposes urgent demands on near-duplicate video retrieval as a key role in novel tasks such as video search, video copyright protection, video recommendation, and many more. Driven by its significance, near-duplicate video retrieval has recently attracted …
Protocases, Christopher M. Polis
Protocases, Christopher M. Polis
Computer Engineering
Design and implementation of a 3D printing web application.
On High-Performance Parallel Decimal Fixed-Point Multiplier Designs, Ming Zhu
On High-Performance Parallel Decimal Fixed-Point Multiplier Designs, Ming Zhu
College of Engineering: Graduate Celebration Programs
Decimal computations are required in finance, and etc.
- Precise representation for decimals (E.g. 0.2, 0.7… )
- Performance Requirements (Software simulations are very slow)
Impact Of Primary User Activity On The Performance Of Energy-Based Spectrum Sensing In Cognitive Radio Systems, Sara L. Macdonald
Impact Of Primary User Activity On The Performance Of Energy-Based Spectrum Sensing In Cognitive Radio Systems, Sara L. Macdonald
Electrical & Computer Engineering Theses & Dissertations
Increasing numbers of wireless devices and mobile data requirements have led to a spectrum shortage. However spectrum utilization percentages are often low due to the current static spectrum allocation process where primary users (PUs) are given exclusive use to spectrum. Several mechanisms to increase spectrum utilization have been proposed including opportunistic spectrum access (OSA). Cognitive Radio (CR) is an emerging concept in wireless communication systems that aims to enable OSA in licensed frequencies by secondary users (SUs). CR systems are expected to sense the spectrum in order to determine if the PU is transmitting. Therefore OSA performance relies on the …
Accelerated Data Delivery Architecture, Michael L. Grecol
Accelerated Data Delivery Architecture, Michael L. Grecol
College of Graduate Studies: Theses & Dissertations
This paper introduces the Accelerated Data Delivery Architecture (ADDA). ADDA establishes a framework to distribute transactional data and control consistency to achieve fast access to data, distributed scalability and non-blocking concurrency control by using a clean declarative interface. It is designed to be used with web-based business applications. This framework uses a combination of traditional Relational Database Management System (RDBMS) combined with a distributed Not Only SQL (NoSQL) database and a browser-based database. It uses a single physical and conceptual database schema designed for a standard RDBMS driven application. The design allows the architect to assign consistency levels to entities …
Automatic Detection Of Abnormal Behavior In Computing Systems, James Frank Roberts
Automatic Detection Of Abnormal Behavior In Computing Systems, James Frank Roberts
Theses and Dissertations--Computer Science
I present RAACD, a software suite that detects misbehaving computers in large computing systems and presents information about those machines to the system administrator. I build this system using preexisting anomaly detection techniques. I evaluate my methods using simple synthesized data, real data containing coerced abnormal behavior, and real data containing naturally occurring abnormal behavior. I find that the system adequately detects abnormal behavior and significantly reduces the amount of uninteresting computer health data presented to a system administrator.
Hardware-Software Co-Design, Acceleration And Prototyping Of Control Algorithms On Reconfigurable Platforms, Desta Kumsa Edosa
Hardware-Software Co-Design, Acceleration And Prototyping Of Control Algorithms On Reconfigurable Platforms, Desta Kumsa Edosa
UNLV Theses, Dissertations, Professional Papers, and Capstones
Differential equations play a significant role in many disciplines of science and engineering. Solving and implementing Ordinary Differential Equations (ODEs) and partial Differential Equations (PDEs) effectively are very essential as most complex dynamic systems are modeled based on these equations. High Performance Computing (HPC) methodologies are required to compute and implement complex and data intensive applications modeled by differential equations at higher speed. There are, however, some challenges and limitations in implementing dynamic system, modeled by non-linear ordinary differential equations, on digital hardware. Modeling an integrator involves data approximation which results in accuracy error if data values are not considered …
Error Estimation Techniques To Refine Overlapping Aerial Image Mosaic Processes Via Detected Parameters, William Glenn Bond
Error Estimation Techniques To Refine Overlapping Aerial Image Mosaic Processes Via Detected Parameters, William Glenn Bond
Dissertations
In this paper, I propose to demonstrate a means of error estimation preprocessing in the assembly of overlapping aerial image mosaics. The mosaic program automatically assembles several hundred aerial images from a data set by aligning them, via image registration using a pattern search method, onto a GIS grid.
The method presented first locates the images from a data set that it predicts will not align well via the mosaic process, then it uses a correlation function, optimized by a modified Hooke and Jeeves algorithm, to provide a more optimal transformation function input to the mosaic program. Using this improved …
Extreme Learning Machine Terrain-Based Navigation For Unmanned Aerial Vehicles, Ee May Kan, Meng Hiot Lim, Yew Soon Ong, Ah-Hwee Tan, Swee Ping Yeo
Extreme Learning Machine Terrain-Based Navigation For Unmanned Aerial Vehicles, Ee May Kan, Meng Hiot Lim, Yew Soon Ong, Ah-Hwee Tan, Swee Ping Yeo
Research Collection School Of Computing and Information Systems
Unmanned aerial vehicles (UAVs) rely on global positioning system (GPS) information to ascertain its position for navigation during mission execution. In the absence of GPS information, the capability of a UAV to carry out its intended mission is hindered. In this paper, we learn alternative means for UAVs to derive real-time positional reference information so as to ensure the continuity of the mission. We present extreme learning machine as a mechanism for learning the stored digital elevation information so as to aid UAVs to navigate through terrain without the need for GPS. The proposed algorithm accommodates the need of the …
Resizable, Scalable, Concurrent Hash Tables, Josh Triplett, Paul E. Mckenney, Jonathan Walpole
Resizable, Scalable, Concurrent Hash Tables, Josh Triplett, Paul E. Mckenney, Jonathan Walpole
Computer Science Faculty Publications and Presentations
We present algorithms for shrinking and expanding a hash table while allowing concurrent, wait-free, linearly scalable lookups. These resize algorithms allow the hash table to maintain constant-time performance as the number of entries grows, and reclaim memory as the number of entries decreases, without delaying or disrupting readers.
We implemented our algorithms in the Linux kernel, to test their performance and scalability. Benchmarks show lookup scalability improved 125x over readerwriter locking, and 56% over the current state-of-the-art for Linux, with no performance degradation for lookups during a resize.
To achieve this performance, this hash table implementation uses a new concurrent …
A Probabilistic Analysis Of Misparking In Reservation Based Parking Garages, Vikas G. Ashok
A Probabilistic Analysis Of Misparking In Reservation Based Parking Garages, Vikas G. Ashok
Computer Science Theses & Dissertations
Parking in major cities is an expensive and annoying affair, the reason ascribed to the limited availability of parking space. Modern parking garages provide parking reservation facility, thereby ensuring availability to prospective customers. Misparking in such reservation based parking garages creates confusion and aggravates driver frustration. The general conception about misparking is that it tends to completely cripple the normal functioning of the system leading to chaos and confusion. A single mispark tends to have a ripple effect and therefore spawns a chain of misparks. The chain terminates when the last mispark occurs at the parking slot reserved by the …
On The Applications Of Deterministic Chaos For Encrypting Data On The Cloud, Jonathan Blackledge, Nikolai Ptitsyn
On The Applications Of Deterministic Chaos For Encrypting Data On The Cloud, Jonathan Blackledge, Nikolai Ptitsyn
Conference papers
Cloud computing is expected to grow considerably in the future because it has so many advantages with regard to sale and cost, change management, next generation architectures, choice and agility. However, one of the principal concerns for users of the Cloud is lack of control and above all, data security. This paper considers an approach to encrypting information before it is ‘placed’ on the Cloud where each user has access to their own encryption algorithm, an algorithm that is based on a set of iterated function systems that outputs a chaotic number stream, designed to produce a cryptographically secure cipher. …
Topical Summarization Of Web Videos By Visual-Text Time-Dependent Alignment, Song Tan, Hung-Khoon Tan, Chong-Wah Ngo
Topical Summarization Of Web Videos By Visual-Text Time-Dependent Alignment, Song Tan, Hung-Khoon Tan, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Search engines are used to return a long list of hundreds or even thousands of videos in response to a query topic. Efficient navigation of videos becomes difficult and users often need to painstakingly explore the search list for a gist of the search result. This paper addresses the challenge of topical summarization by providing a timeline-based visualization of videos through matching of heterogeneous sources. To overcome the so called sparse-text problem of web videos, auxiliary information from Google context is exploited. Google Trends is used to predict the milestone events of a topic. Meanwhile, the typical scenes of web …