Show simple item record

dc.rights.licenseCC BY-NC-ND. Users may download and share copies with attribution in accordance with a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License. No commercial use or derivatives are permitted without the explicit approval of the author.
dc.contributorStewart, Charles V.
dc.contributorCutler, Barbara M.
dc.contributorYener, Bülent, 1959-
dc.contributorRadke, Richard J., 1974-
dc.contributor.authorCrall, Jonathan P.
dc.date.accessioned2021-11-03T08:50:30Z
dc.date.available2021-11-03T08:50:30Z
dc.date.created2017-07-26T09:47:07Z
dc.date.issued2017-08
dc.identifier.urihttps://hdl.handle.net/20.500.13015/1988
dc.descriptionAugust 2017
dc.descriptionSchool of Science
dc.description.abstractIn this thesis we address the problem of identifying individual animals using images in the context of assisting an ecologist in performing a population census. We are motivated by events like the "Great Zebra Count" where thousands of images of zebras and giraffes were collected in Nairobi National Park over two days. By grouping all images that contain the same individual we can census these populations. This problem is challenging because images are collected outdoors and contain occlusion, lighting, and quality variations and because the animals exhibit viewpoint and pose variations.
dc.description.abstractOur third contribution is a semi-automatic graph identification algorithm. The approach represents each image as a node in the graph and incrementally forms edges between nodes determined to the same animal. The ranking and verification algorithms are used to search for candidate edges and estimate their probability of matching. Based on these probabilities, edges are prioritized for review and placed in the graph when they are automatically verified or manually reviewed. Redundant connections are added to detect and recover from errors. A termination criterion determines when identification is finished. Using the graph algorithm we perform a population census on the scale of the Great Zebra Count using less than 25% of the manual reviews required by the original method.
dc.description.abstractOur first contribution is an algorithm that ranks a database of images by their similarity to a query. A manual reviewer inspects only the top few results for each query --- significantly reducing the search space --- and determines if the animals match. Using this algorithm alone, we analyzed the images from the Great Zebra Count and performed a population census. Our second contribution is a verification algorithm that determines the probability that two images are from the same animal, that they are not, or that there is not enough to decide. This algorithm is used with the ranking algorithm to re-rank results and automatically verify high confidence image pairs.
dc.language.isoENG
dc.publisherRensselaer Polytechnic Institute, Troy, NY
dc.relation.ispartofRensselaer Theses and Dissertations Online Collection
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectComputer science
dc.titleIdentifying individual animals using ranking, verification, and connectivity
dc.typeElectronic thesis
dc.typeThesis
dc.digitool.pid178316
dc.digitool.pid178317
dc.digitool.pid178318
dc.rights.holderThis electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
dc.description.degreePhD
dc.relation.departmentDept. of Computer Science


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

CC BY-NC-ND. Users may download and share copies with attribution in accordance with a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License. No commercial use or derivatives are permitted without the explicit approval of the author.
Except where otherwise noted, this item's license is described as CC BY-NC-ND. Users may download and share copies with attribution in accordance with a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License. No commercial use or derivatives are permitted without the explicit approval of the author.