Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 4 of 4

Full-Text Articles in Engineering

Blind Speaker Clustering, Ananth N. Iyer, Uchechukwu O. Ofoegbu, Robert E. Yantorno, Brett Y. Smolenski Dec 2006

Blind Speaker Clustering, Ananth N. Iyer, Uchechukwu O. Ofoegbu, Robert E. Yantorno, Brett Y. Smolenski

Ananth N Iyer

A novel approach to performing speaker clustering in telephone conversations is presented in this paper. The method is based on a simple observation that the distance between populations of feature vectors extracted from different speakers is greater than a preset threshold. This observation is incorporated into the clustering problem by the formulation of a constrained optimization problem. A modified c-means algorithm is designed to solve the optimization problem. Another key aspect in speaker clustering is to determine the number of clusters, which is either assumed or expected as an input in traditional methods. The proposed method does not require such …


Information-Aware Collaborative Routing In Wireless Sensor Network, Ji Sun Lee, Chang Wen Chen May 2006

Information-Aware Collaborative Routing In Wireless Sensor Network, Ji Sun Lee, Chang Wen Chen

Electrical Engineering and Computer Science Faculty Publications

In this paper, we propose a new approach to routing protocol called information-aware collaborative routing for wireless sensor networks. Clustering and local data aggregation schemes have been developed to reduce the energy for transmitting redundant data in the wireless sensor network. Most existing approaches have been developed for the cases when there is direct communication between cluster head and base station. Even though these schemes are able to reduce data redundancy to be transmitted from the cluster heads to the base station, they have not exploited the data redundancy between neighboring clusters. In this research, we study a more general …


Partitioning Of The Degradation Space For Ocr Training, Elisa H. Barney Smith, Tim Andersen Jan 2006

Partitioning Of The Degradation Space For Ocr Training, Elisa H. Barney Smith, Tim Andersen

Electrical and Computer Engineering Faculty Publications and Presentations

Generally speaking optical character recognition algorithms tend to perform better when presented with homogeneous data. This paper studies a method that is designed to increase the homogeneity of training data, based on an understanding of the types of degradations that occur during the printing and scanning process, and how these degradations affect the homogeneity of the data. While it has been shown that dividing the degradation space by edge spread improves recognition accuracy over dividing the degradation space by threshold or point spread function width alone, the challenge is in deciding how many partitions and at what value of edge …


Development And Implementation Of Optimized Energy-Delay Sub-Network Routing Protocol For Wireless Sensor Networks, Maciej Jan Zawodniok, Jagannathan Sarangapani, Steve Eugene Watkins, James W. Fonda Jan 2006

Development And Implementation Of Optimized Energy-Delay Sub-Network Routing Protocol For Wireless Sensor Networks, Maciej Jan Zawodniok, Jagannathan Sarangapani, Steve Eugene Watkins, James W. Fonda

Electrical and Computer Engineering Faculty Research & Creative Works

The development and implementation of the optimized energy-delay sub-network routing (OEDSR) protocol for wireless sensor networks (WSN) is presented. This ondemand routing protocol minimizes a novel link cost factor which is defined using available energy, end-to-end (E2E) delay and distance from a node to the base station (BS), along with clustering, to effectively route information to the BS. Initially, the nodes are either in idle or sleep mode, but once an event is detected, the nodes near the event become active and start forming sub-networks. Formation of the inactive network into a sub-network saves energy because only a portion of …