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

Digital Commons Network

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

PDF

UNLV Retrospective Theses & Dissertations

2006

Algorithms

Articles 1 - 2 of 2

Full-Text Articles in Entire DC Network

Study Of Document Clustering Using The K-Means Algorithm, Meghna Sharma Gummuluru Jan 2006

Study Of Document Clustering Using The K-Means Algorithm, Meghna Sharma Gummuluru

UNLV Retrospective Theses & Dissertations

One of the most commonly used data mining techniques is document clustering or unsupervised document classification which deals with the grouping of documents based on some document similarity function; This thesis deals with research issues associated with categorizing documents using the k-means clustering algorithm which groups objects into K number of groups based on document representations and similarities; The proposed hypothesis of this thesis is to prove that unsupervised clustering of a set of documents produces similar results to that of their supervised categorization.


An Improved Algorithm For Deinterlacing Video Streams, Christopher Weiss Jan 2006

An Improved Algorithm For Deinterlacing Video Streams, Christopher Weiss

UNLV Retrospective Theses & Dissertations

The MPEG-4 standard for computerized video incorporates the concept of a video object pLane While in the simplest case this can be the full rectangular frame, the standard supports a hierarchical set of arbitrary shaped planes, one for each content sensitive video object. Herein is proposed a method for extracting arbitrary planes from video that does not already contain video object plane information; Deinterlacing is the process of taking two video fields, each at half the height of the finalized image frame, and combining them into that finalized frame. As the fields are not captured simultaneously, temporal artifacts may result. …