Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Entire DC Network
Boosted Decision Trees For Word Recognition In Handwritten Document Retrieval, Nicholas Howe, Toni M. Rath, R. Manmatha
Boosted Decision Trees For Word Recognition In Handwritten Document Retrieval, Nicholas Howe, Toni M. Rath, R. Manmatha
Computer Science: Faculty Publications
Recognition and retrieval of historical handwritten material is an unsolved problem. We propose a novel approach to recognizing and retrieving handwritten manuscripts, based upon word image classification as a key step. Decision trees with normalized pixels as features form the basis of a highly accurate AdaBoost classifier, trained on a corpus of word images that have been resized and sampled at a pyramid of resolutions. To stem problems from the highly skewed distribution of class frequencies, word classes with very few training samples are augmented with stochastically altered versions of the originals. This increases recognition performance substantially. On a standard …
Hot Event Detection And Summarization By Graph Modeling And Matching, Yuxin Peng, Chong-Wah Ngo
Hot Event Detection And Summarization By Graph Modeling And Matching, Yuxin Peng, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normalized cut (NC). Initially, OM is employed to measure the visual similarity between all pairs of events under the one-to-one mapping constraint among video shots. Then, news events are represented as a complete weighted graph and NC is carried out to globally and optimally partition the graph into event clusters. Finally, based on the cluster size and globality of events, hot events can be automatically detected and selected as the summaries of …
Live Data Views: Programming Pervasive Applications That Use “Timely” And “Dynamic” Data, Jay Black, Paul Castro, Archan Misra, Jerome White
Live Data Views: Programming Pervasive Applications That Use “Timely” And “Dynamic” Data, Jay Black, Paul Castro, Archan Misra, Jerome White
Research Collection School Of Computing and Information Systems
In the absence of generic programming abstractions for dynamic data in most enterprise programming environments, individual applications treat data streams as a special case requiring custom programming. With the growing number of live data sources such as RSS feeds, messaging and presence servers, multimedia streams, and sensor data. a general-purpose client-server programming model is needed to easily incorporate live data into applications. In this paper, we present Live Data Views, a programming abstraction that represents live data as a time-windowed view over a set of data streams. Live Data Views allow applications to create and retrieve stateful abstractions of dynamic …
An Efficient Scheme For Authenticating Public Keys In Sensor Networks, Wenliang Du, Ronghua Wang, Peng Ning
An Efficient Scheme For Authenticating Public Keys In Sensor Networks, Wenliang Du, Ronghua Wang, Peng Ning
Electrical Engineering and Computer Science - All Scholarship
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of some public key algorithms, such as Elliptic Curve Cryptography (ECC), is already close to being practical on sensor nodes. However, the energy consumption of PKC is still expensive, especially compared to symmetric-key algorithms. To maximize the lifetime of batteries, we should minimize the use of PKC whenever possible in sensor networks. This paper investigates how to replace one of the important PKC operations–the public key authentication–with symmetric key operations that are …