Algorithms for graphics and image processing Theo Pavlidis

Pavlidis, Theodosios (Verfasser):

ISBN 10: 354011338X / ISBN 13: 9783540113386

Published by Berlin ; Heidelberg : Springer [1982]., 1982

About this Item

XVII, 416, 29 S. : Ill., graph. Darst. ; 23 x 3 cm, 839 g - gutes u. sauberesExemplar mit wenigen bis normalen Spuren am Einband, Schnittkanten der Seiten alters- bzw. papierbedingt leicht gedunkelt, unkenntlich gemachter Namensaufkleber (siehe auch mein Foto) [sw.] si Sprache: Englisch Gewicht in Gramm: 839.

Seller Inventory # 50783

Bibliographic Details

• Title: Algorithms for graphics and image processing Theo Pavlidis
• Publisher: Berlin ; Heidelberg : Springer [1982].
• Publication Date: 1982
• Language: English
• ISBN 10: 354011338X
• ISBN 13: 9783540113386
• Binding: *Pp.
• Condition: Gut
• Weight: 839 grams
• Seller catalogs:
  • Computer Informatik

About this title

Synopsis

The technological developments of the last ten years have made com­ puter graphics and image processing by computer popular. Pictorial pat­ tern recognition has also shown significant progress. Clearly, there exist overlapping interests among the three areas of research. Graphic displays are of concern to anyone involved in image processing or pic­ torial pattern recognition and many problems in graphics require methodologies from image processing for their solutions. The data structures used in all three areas are similar. It seems that there is a common body of knowledge underlying all three areas, pictorial informa­ tion processing by computer. The novelty of these fields makes it difficult to design a course or to a write a book covering their basic concepts. Some of the treatises on graphics focus on the hardware and methods of current interest while treatises on image processing often emphasize applications and classical signal processing. The fast evolution of technology causes such material to lose its relevance. For example, the development of optical fibers has reduced the importance of bandwidth compression.