東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Piecewise linear homeomorphisms for ...

Groff, Richard E.

Linked to FindBook

Google Book

Amazon

博客來

Piecewise linear homeomorphisms for approximation of invertible maps.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Piecewise linear homeomorphisms for approximation of invertible maps./
Author:	Groff, Richard E.
Description:	139 p.
Notes:	Source: Dissertation Abstracts International, Volume: 64-06, Section: B, page: 2821.
Contained By:	Dissertation Abstracts International64-06B.
Subject:	Engineering, Electronics and Electrical. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3096102

Piecewise linear homeomorphisms for approximation of invertible maps.
Groff, Richard E.

Piecewise linear homeomorphisms for approximation of invertible maps. - 139 p.

Source: Dissertation Abstracts International, Volume: 64-06, Section: B, page: 2821.

Thesis (Ph.D.)--University of Michigan, 2003.

Changes of coordinates play an important role in design and analysis for a wide variety of fields, including control systems, robotics, and color systems management. Though not necessarily explicitly called a change of coordinates, many other applications require simultaneous approximation of forward and inverse models from data. This thesis proposes piecewise linear homeomorphisms (PLH) as a computationally effective, finitely parameterized family of nonlinear changes of coordinates. Other approximation techniques generally require that separate approximations be computed for the forward and inverse maps, whereas piecewise linear homeomorphisms are invertible in closed form, requiring only a single model. Motivated by the industrially significant problem of color systems management identified in collaboration with Xerox Corp., this dissertation presents work on the design and analysis of algorithms to compute piecewise linear homeomorphism approximations from data.Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Piecewise linear homeomorphisms for approximation of invertible maps.
LDR:03376nmm 2200301 4500 001 1865194
005 20041216142221.5
008 130614s2003 eng d
035 $a (UnM)AAI3096102
035 $a AAI3096102
040 $a UnM $c UnM
100 1 $a Groff, Richard E. $3 1952652
245 1 0 $a Piecewise linear homeomorphisms for approximation of invertible maps.
300 $a 139 p.
500 $a Source: Dissertation Abstracts International, Volume: 64-06, Section: B, page: 2821.
500 $a Chairs: Daniel E. Koditschek; Pramod P. Khargonekar.
502 $a Thesis (Ph.D.)--University of Michigan, 2003.
520 $a Changes of coordinates play an important role in design and analysis for a wide variety of fields, including control systems, robotics, and color systems management. Though not necessarily explicitly called a change of coordinates, many other applications require simultaneous approximation of forward and inverse models from data. This thesis proposes piecewise linear homeomorphisms (PLH) as a computationally effective, finitely parameterized family of nonlinear changes of coordinates. Other approximation techniques generally require that separate approximations be computed for the forward and inverse maps, whereas piecewise linear homeomorphisms are invertible in closed form, requiring only a single model. Motivated by the industrially significant problem of color systems management identified in collaboration with Xerox Corp., this dissertation presents work on the design and analysis of algorithms to compute piecewise linear homeomorphism approximations from data.
520 $a This thesis introduces two algorithms: the MINVAR algorithm for computing continuous multidimensional piecewise linear approximations to data, and the Graph Intersection algorithm, the scalar specialization of MINVAR. A geometrically influenced parameterization of PL functions as well as a theoretical framework for proving their properties is developed. The theoretical framework facilitates the main theoretical result, a proof of local convergence for MINVAR under the condition that the data generating function is piecewise linear with the same combinatorial structure as the approximation. Numerical studies of MINVAR and the Graph Intersection algorithm show that PL approximation compares favorably against other approximation techniques in terms of error and computational cost.
520 $a The color systems management problem in electrophotography is shown to reduce to a search for the change of coordinates embodied by the print engine. PLH approximations are proposed as a replacement for the current industry standard, lookup tables. A preliminary numerical study on a set of simulated color data provided by Xerox Corp. indicates that MINVAR-generated PLH approximations compare favorably to lookup tables, providing good approximations with a more parsimonious parameterization. Further study is required, but the author remains cautiously optimistic that these methods may have an eventual impact on the printing industry.
590 $a School code: 0127.
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Engineering, System Science. $3 1018128
690 $a 0544
690 $a 0790
710 2 0 $a University of Michigan. $3 777416
773 0 $t Dissertation Abstracts International $g 64-06B.
790 1 0 $a Koditschek, Daniel E., $e advisor
790 1 0 $a Khargonekar, Pramod P., $e advisor
790 $a 0127
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3096102