
<mods xmlns="http://www.loc.gov/mods/v3" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-4.xsd">
    
    <titleInfo>
        <title>Computing robust viewpoints with multi-constraints using tree annealing</title>
    </titleInfo>
    <name type="personal">
        <namePart type="family">Yao</namePart>
        <namePart type="given">Yulin</namePart>
        <role>
            <roleTerm type="text">author</roleTerm>
        </role>
        <affiliation>Columbia University. Computer Science</affiliation>
    </name>
    <name type="personal" ID="pka1">
        <namePart type="family">Allen</namePart>
        <namePart type="given">Peter K.</namePart>
        <role>
            <roleTerm type="text">author</roleTerm>
        </role>
        <affiliation>Columbia University. Computer Science</affiliation>
    </name>
    <name type="corporate">
        <namePart>Columbia University. Computer Science</namePart>
        <role>
            <roleTerm type="text">originator</roleTerm>
        </role>
    </name>
    <typeOfResource>text</typeOfResource>
    <genre>Articles</genre>
    
    <originInfo>
        <dateIssued encoding="w3cdtf" keyDate="yes">1995</dateIssued>
    </originInfo>
    
    <language>
        <languageTerm type="text">English</languageTerm>
    </language>
    <abstract>In order to compute camera viewpoints during sensor planning, Tarabanis et al. (1991) present a group of feature detectability constraints which include six nonlinear inequalities in an eight-dimensional real space. It is difficult to compute robust viewpoints which satisfy all feature detectability constraints. In this paper, the viewpoint setting is formulated as an unconstrained optimization problem. Then a tree annealing algorithm, which is a general-purpose technique for finding minima of functions of continuously-valued variables, is applied to solve this nonlinear multiconstraint optimization problem. Our results show that the technique is quite effective to get robust viewpoints even in the presence of considerable amounts of noise.</abstract>
    <subject>
        <topic>Computer science</topic>
    </subject>
    <relatedItem type="host">
        <titleInfo>
            <title>1995 IEEE International Conference on Systems, Man, and Cybernetics: Intelligent systems for the 21st century: Vancouver, British Columbia, Canada, October 22-25, 1995</title>
        </titleInfo>
        <name type="personal">
            <namePart type="family"></namePart>
            <namePart type="given"></namePart>
            <role>
                <roleTerm type="text"></roleTerm>
            </role>
        </name>
        <originInfo>
            <place>
               <placeTerm type="text">Piscataway, N.J.</placeTerm>
            </place>
            <publisher>IEEE</publisher>
            <dateIssued encoding="w3cdtf">1995</dateIssued>
        </originInfo>
        <part>
            <extent unit="page">
                <start>993</start>
                <end>998</end>
            </extent>
        </part>
        <identifier type="doi">http://dx.doi.org/10.1109/ICSMC.1995.537898</identifier>
        <relatedItem type="series">
            <titleInfo>
                <title></title>
            </titleInfo>
        </relatedItem>
    </relatedItem>
    <identifier type="hdl">http://hdl.handle.net/10022/AC:P:15224</identifier>
    
    <location>
        <physicalLocation authority="marcorg">NNC</physicalLocation>
    </location>
    
    <recordInfo>
        <recordContentSource authority="marcorg">NNC</recordContentSource>
        <recordCreationDate encoding="w3cdtf">2012-11-07 15:44:52 -0500</recordCreationDate>
        <recordChangeDate encoding="w3cdtf">2012-11-07 15:54:42 -0500</recordChangeDate>
        <recordIdentifier>9226</recordIdentifier>
        <languageOfCataloging>
            <languageTerm authority="iso639-2b">eng</languageTerm>
        </languageOfCataloging>
    </recordInfo>
    
</mods>
