Show simple item record

Resource Allocation in Computer Vision

dc.contributor.advisorJacobs, David Wen_US
dc.contributor.authorChen, Daozhengen_US
dc.date.accessioned2013-06-28T05:59:12Z
dc.date.available2013-06-28T05:59:12Z
dc.date.issued2013en_US
dc.identifier.urihttp://hdl.handle.net/1903/14021
dc.description.abstractWe broadly examine resource allocation in several computer vision problems. We consider human resource or computational resource constraints. Human resources, such as human operators monitoring a camera network, provide reliable information, but are typically limited by the huge amount of data to be processed. Computational resources refer to the resources used by machines, such as running time, to execute the programs. It is important to develop algorithms to make effective use of these resources in computer vision applications. We approach human resource constraints with a frame retrieval problem in a camera network. This work addresses the problem of using active inference to direct human attention in searching a camera network for people that match a query image. We find that by representing the camera network using a graphical model, we can more accurately determine which video frames match the query, and improve our ability to direct human attention. We experiment with different methods to determine from which frames to sample expert information from humans, and discover that a method that learns to predict which frame is misclassified gives the best performance. We approach the problem of allocating computational resource in a video processing task. We consider a video processing application in which we combine the outputs from two algorithms so that the budget-limited computationally more expensive algorithm is run in the most useful video frames to maximize processing performance. We model the video frames as a chain graphical model and extend a dynamic programming algorithm to determine on which frames to run the more expensive algorithm. We perform experiments on moving object detection and face detection to demonstrate the effectiveness of our approaches. Finally, we consider an idea for saving computational resources and maintaining program performance. We work on a problem of learning model complexity in latent variable models. Specifically, we learn the latent variable state space complexity in latent support vector machines using group norm regularization. We apply our method to handwritten digit recognition and object detection with deformable part models. Our approach reduces latent variable state size and performs faster inference with similar or better performance.en_US
dc.titleResource Allocation in Computer Visionen_US
dc.typeDissertationen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.contributor.departmentComputer Scienceen_US
dc.subject.pqcontrolledComputer scienceen_US
dc.subject.pquncontrolledComputer Visionen_US
dc.subject.pquncontrolledGraphical Modelsen_US
dc.subject.pquncontrolledLatent Structural SVMsen_US
dc.subject.pquncontrolledObject Detectionen_US
dc.subject.pquncontrolledOptimizationen_US
dc.subject.pquncontrolledResource Allocationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record