<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T17:53:42Z</responseDate><request verb="GetRecord" identifier="oai:krex.k-state.edu:2097/3651" metadataPrefix="dim">https://krex.k-state.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:krex.k-state.edu:2097/3651</identifier><datestamp>2026-09-02T16:02:07Z</datestamp><setSpec>com_2097_1</setSpec><setSpec>col_2097_4</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Jakkula, Vinayak Reddy</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-04-19T16:39:21Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-04-19T16:39:21Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2010-04-19T16:39:21Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="published">2010</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="graduationmonth">May</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/2097/3651</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">This thesis presents a novel approach for detecting robust and scale invariant interest points in images. The detector accurately and efficiently approximates the Laplacian of Gaussian using an optimal set of weighted box filters that take advantage of integral images to reduce computations. When combined with state-of-the art descriptors for matching, the algorithm performs better than leading feature tracking algorithms including SIFT and SURF in terms of speed and accuracy.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree">Master of Science</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="level">Masters</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="department">Department of Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="advisor">Christopher L. Lewis</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en_US</dim:field>
   <dim:field mdschema="dc" element="publisher">Kansas State University</dim:field>
   <dim:field mdschema="dc" element="rights">© the author. This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">http://rightsstatements.org/vocab/InC/1.0/</dim:field>
   <dim:field mdschema="dc" element="subject">Feature Extraction</dim:field>
   <dim:field mdschema="dc" element="subject">Laplacian of Gaussian</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="umi">Engineering, Electronics and Electrical (0544)</dim:field>
   <dim:field mdschema="dc" element="title">Efficient feature detection using OBAloG: optimized box approximation of Laplacian of Gaussian</dim:field>
   <dim:field mdschema="dc" element="type">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>