Constraint methods for neural networks and computer graphics:
Abstract: "Both computer graphics and neural networks are related, in that they model natural phenomena. Physically-based models are used by computer graphics researchers to create realistic, natural animation, and neural models are used by neural network researchers to create new algorithms or...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Pasadena, Calif.
1989
|
Schlagworte: | |
Zusammenfassung: | Abstract: "Both computer graphics and neural networks are related, in that they model natural phenomena. Physically-based models are used by computer graphics researchers to create realistic, natural animation, and neural models are used by neural network researchers to create new algorithms or new circuits. To exploit these graphical and neural models, engineers want models that fulfill designer-specified goals. These goals are converted into mathematical constraints. This thesis presents constraint methods for computer graphics and neural networks. The mathematical constraint methods modify the differential equations that govern the neural or physically-based models. The constraint methods gradually enforce the constraints exactly. This thesis also describes applications of constrained models to real problems The first half of this thesis discusses constrained neural networks. The desired models and goals are often converted into constrained optimization problems. These optimization problems are solved using first-order differential equations. There are a series of constraint methods which are applicable to optimization using differential equations: the Penalty Method adds terms to the optimization function which penalize violations of constraints, the Differential Multiplier Method adds subsidiary differential equations which estimate Lagrange multipliers to fulfill the constraints gradually and exactly, Rate-Controlled Constraints compute extra terms for the differential equation that force the system to fulfill the constraints exponentially The applications of constrained neural networks include the creation of constrained circuits, error-correcting codes, symmetric edge detection for computer vision, and heuristics for the traveling salesman problem. The second half of this thesis discusses constrained computer graphics models. In computer graphics, the desired models and goals become constrained mechanical systems, which are typically simulated with second-order differential equations. The Penalty Method adds springs to the mechanical system to penalize violations of the constraints. Rate-Controlled Constraints add forces and impulses to the mechanical system to fulfill the constraints with critically damped motion. Constrained computer graphics models can be used to make deformable physically-based models follow the directives of a animator. |
Beschreibung: | Zugl.: Pasadena, Calif., Calif. Inst. of Technol., Diss. |
Beschreibung: | Getr. Zählung graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV004160439 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 901119s1989 d||| m||| 00||| eng d | ||
035 | |a (OCoLC)21005725 | ||
035 | |a (DE-599)BVBBV004160439 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
084 | |a DAT 750d |2 stub | ||
084 | |a DAT 717d |2 stub | ||
088 | |a Caltech CS TR 89 07 | ||
100 | 1 | |a Platt, John |e Verfasser |4 aut | |
245 | 1 | 0 | |a Constraint methods for neural networks and computer graphics |
264 | 1 | |a Pasadena, Calif. |c 1989 | |
300 | |a Getr. Zählung |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
500 | |a Zugl.: Pasadena, Calif., Calif. Inst. of Technol., Diss. | ||
520 | 3 | |a Abstract: "Both computer graphics and neural networks are related, in that they model natural phenomena. Physically-based models are used by computer graphics researchers to create realistic, natural animation, and neural models are used by neural network researchers to create new algorithms or new circuits. To exploit these graphical and neural models, engineers want models that fulfill designer-specified goals. These goals are converted into mathematical constraints. This thesis presents constraint methods for computer graphics and neural networks. The mathematical constraint methods modify the differential equations that govern the neural or physically-based models. The constraint methods gradually enforce the constraints exactly. This thesis also describes applications of constrained models to real problems | |
520 | 3 | |a The first half of this thesis discusses constrained neural networks. The desired models and goals are often converted into constrained optimization problems. These optimization problems are solved using first-order differential equations. There are a series of constraint methods which are applicable to optimization using differential equations: the Penalty Method adds terms to the optimization function which penalize violations of constraints, the Differential Multiplier Method adds subsidiary differential equations which estimate Lagrange multipliers to fulfill the constraints gradually and exactly, Rate-Controlled Constraints compute extra terms for the differential equation that force the system to fulfill the constraints exponentially | |
520 | 3 | |a The applications of constrained neural networks include the creation of constrained circuits, error-correcting codes, symmetric edge detection for computer vision, and heuristics for the traveling salesman problem. The second half of this thesis discusses constrained computer graphics models. In computer graphics, the desired models and goals become constrained mechanical systems, which are typically simulated with second-order differential equations. The Penalty Method adds springs to the mechanical system to penalize violations of the constraints. Rate-Controlled Constraints add forces and impulses to the mechanical system to fulfill the constraints with critically damped motion. Constrained computer graphics models can be used to make deformable physically-based models follow the directives of a animator. | |
650 | 4 | |a Computer graphics | |
650 | 4 | |a Neural circuitry | |
650 | 0 | 7 | |a Differentialgleichung |0 (DE-588)4012249-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Computergrafik |0 (DE-588)4010450-3 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Neuronales Netz |0 (DE-588)4226127-2 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Differentialgleichung |0 (DE-588)4012249-9 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 1 | |8 2\p |5 DE-604 | |
689 | 2 | 0 | |a Neuronales Netz |0 (DE-588)4226127-2 |D s |
689 | 2 | |8 3\p |5 DE-604 | |
689 | 3 | 0 | |a Computergrafik |0 (DE-588)4010450-3 |D s |
689 | 3 | |8 4\p |5 DE-604 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-002594492 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804118371977920512 |
---|---|
any_adam_object | |
author | Platt, John |
author_facet | Platt, John |
author_role | aut |
author_sort | Platt, John |
author_variant | j p jp |
building | Verbundindex |
bvnumber | BV004160439 |
classification_tum | DAT 750d DAT 717d |
ctrlnum | (OCoLC)21005725 (DE-599)BVBBV004160439 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04323nam a2200541 c 4500</leader><controlfield tag="001">BV004160439</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">901119s1989 d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)21005725</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004160439</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 750d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 717d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">Caltech CS TR 89 07</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Platt, John</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Constraint methods for neural networks and computer graphics</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pasadena, Calif.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Getr. Zählung</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Pasadena, Calif., Calif. Inst. of Technol., Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Both computer graphics and neural networks are related, in that they model natural phenomena. Physically-based models are used by computer graphics researchers to create realistic, natural animation, and neural models are used by neural network researchers to create new algorithms or new circuits. To exploit these graphical and neural models, engineers want models that fulfill designer-specified goals. These goals are converted into mathematical constraints. This thesis presents constraint methods for computer graphics and neural networks. The mathematical constraint methods modify the differential equations that govern the neural or physically-based models. The constraint methods gradually enforce the constraints exactly. This thesis also describes applications of constrained models to real problems</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The first half of this thesis discusses constrained neural networks. The desired models and goals are often converted into constrained optimization problems. These optimization problems are solved using first-order differential equations. There are a series of constraint methods which are applicable to optimization using differential equations: the Penalty Method adds terms to the optimization function which penalize violations of constraints, the Differential Multiplier Method adds subsidiary differential equations which estimate Lagrange multipliers to fulfill the constraints gradually and exactly, Rate-Controlled Constraints compute extra terms for the differential equation that force the system to fulfill the constraints exponentially</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The applications of constrained neural networks include the creation of constrained circuits, error-correcting codes, symmetric edge detection for computer vision, and heuristics for the traveling salesman problem. The second half of this thesis discusses constrained computer graphics models. In computer graphics, the desired models and goals become constrained mechanical systems, which are typically simulated with second-order differential equations. The Penalty Method adds springs to the mechanical system to penalize violations of the constraints. Rate-Controlled Constraints add forces and impulses to the mechanical system to fulfill the constraints with critically damped motion. Constrained computer graphics models can be used to make deformable physically-based models follow the directives of a animator.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer graphics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Neural circuitry</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Differentialgleichung</subfield><subfield code="0">(DE-588)4012249-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computergrafik</subfield><subfield code="0">(DE-588)4010450-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Neuronales Netz</subfield><subfield code="0">(DE-588)4226127-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Differentialgleichung</subfield><subfield code="0">(DE-588)4012249-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Neuronales Netz</subfield><subfield code="0">(DE-588)4226127-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Computergrafik</subfield><subfield code="0">(DE-588)4010450-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002594492</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV004160439 |
illustrated | Illustrated |
indexdate | 2024-07-09T16:09:15Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002594492 |
oclc_num | 21005725 |
open_access_boolean | |
physical | Getr. Zählung graph. Darst. |
publishDate | 1989 |
publishDateSearch | 1989 |
publishDateSort | 1989 |
record_format | marc |
spelling | Platt, John Verfasser aut Constraint methods for neural networks and computer graphics Pasadena, Calif. 1989 Getr. Zählung graph. Darst. txt rdacontent n rdamedia nc rdacarrier Zugl.: Pasadena, Calif., Calif. Inst. of Technol., Diss. Abstract: "Both computer graphics and neural networks are related, in that they model natural phenomena. Physically-based models are used by computer graphics researchers to create realistic, natural animation, and neural models are used by neural network researchers to create new algorithms or new circuits. To exploit these graphical and neural models, engineers want models that fulfill designer-specified goals. These goals are converted into mathematical constraints. This thesis presents constraint methods for computer graphics and neural networks. The mathematical constraint methods modify the differential equations that govern the neural or physically-based models. The constraint methods gradually enforce the constraints exactly. This thesis also describes applications of constrained models to real problems The first half of this thesis discusses constrained neural networks. The desired models and goals are often converted into constrained optimization problems. These optimization problems are solved using first-order differential equations. There are a series of constraint methods which are applicable to optimization using differential equations: the Penalty Method adds terms to the optimization function which penalize violations of constraints, the Differential Multiplier Method adds subsidiary differential equations which estimate Lagrange multipliers to fulfill the constraints gradually and exactly, Rate-Controlled Constraints compute extra terms for the differential equation that force the system to fulfill the constraints exponentially The applications of constrained neural networks include the creation of constrained circuits, error-correcting codes, symmetric edge detection for computer vision, and heuristics for the traveling salesman problem. The second half of this thesis discusses constrained computer graphics models. In computer graphics, the desired models and goals become constrained mechanical systems, which are typically simulated with second-order differential equations. The Penalty Method adds springs to the mechanical system to penalize violations of the constraints. Rate-Controlled Constraints add forces and impulses to the mechanical system to fulfill the constraints with critically damped motion. Constrained computer graphics models can be used to make deformable physically-based models follow the directives of a animator. Computer graphics Neural circuitry Differentialgleichung (DE-588)4012249-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Computergrafik (DE-588)4010450-3 gnd rswk-swf Neuronales Netz (DE-588)4226127-2 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Differentialgleichung (DE-588)4012249-9 s 1\p DE-604 Algorithmus (DE-588)4001183-5 s 2\p DE-604 Neuronales Netz (DE-588)4226127-2 s 3\p DE-604 Computergrafik (DE-588)4010450-3 s 4\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Platt, John Constraint methods for neural networks and computer graphics Computer graphics Neural circuitry Differentialgleichung (DE-588)4012249-9 gnd Algorithmus (DE-588)4001183-5 gnd Computergrafik (DE-588)4010450-3 gnd Neuronales Netz (DE-588)4226127-2 gnd |
subject_GND | (DE-588)4012249-9 (DE-588)4001183-5 (DE-588)4010450-3 (DE-588)4226127-2 (DE-588)4113937-9 |
title | Constraint methods for neural networks and computer graphics |
title_auth | Constraint methods for neural networks and computer graphics |
title_exact_search | Constraint methods for neural networks and computer graphics |
title_full | Constraint methods for neural networks and computer graphics |
title_fullStr | Constraint methods for neural networks and computer graphics |
title_full_unstemmed | Constraint methods for neural networks and computer graphics |
title_short | Constraint methods for neural networks and computer graphics |
title_sort | constraint methods for neural networks and computer graphics |
topic | Computer graphics Neural circuitry Differentialgleichung (DE-588)4012249-9 gnd Algorithmus (DE-588)4001183-5 gnd Computergrafik (DE-588)4010450-3 gnd Neuronales Netz (DE-588)4226127-2 gnd |
topic_facet | Computer graphics Neural circuitry Differentialgleichung Algorithmus Computergrafik Neuronales Netz Hochschulschrift |
work_keys_str_mv | AT plattjohn constraintmethodsforneuralnetworksandcomputergraphics |