Topological Algorithms for Digital Image ProcessingT.Y. Kong, A. Rosenfeld Elsevier, 1996. gada 17. jūl. - 291 lappuses Basic topological algorithms are the subject of this new book. It presents their underlying theory and discusses their applications. Due to the wide variety of topics treated in the seven chapters, no attempt has been made to standardize the notation and terminology used by the authors. Each chapter, however, is self-contained and can be read independently of the others. Some of the basic terminology and fundamental concepts of digital topology are reviewed in the appendix which also describes important areas of the field. A bibliography of over 360 references is also provided. The notations and terminologies used in this book will serve to introduce readers to the even wider variety that exists in the voluminous literature dealing with topological algorithms. |
Saturs
| 1 | |
| 31 | |
Chapter 3 Skeletons of Planar Patterns | 99 |
Chapter 4 Parallel ConnectivityPreserving Thinning Algorithms | 145 |
Chapter 5 On the Soundness of Surface Voxelizations | 181 |
Theory and Algorithms | 205 |
Basic Theory | 233 |
Digital Topology A Brief Introduction and Bibliography | 263 |
Citi izdevumi - Skatīt visu
Topological Algorithms for Digital Image Processing T. Yung Kong,Azriel Rosenfeld Priekšskatījums nav pieejams - 1996 |
Bieži izmantoti vārdi un frāzes
0-spels 4-adjacent 8-neighbors 8-simple adjacency relations application Arcelli binary image binary picture binary relation black pixels boundary Computer Vision connected component labeling connectedness connectivity preservation contains defined definition deleted residues digital images digital picture digital space digital topology distance transform element end points equivalence class equivalent Euclidean space example exterior FC1L FC3L Local Test Figure finite graph Graphics Image Process IEEE II(S image transformation input image integer interior iteration counts iteration operator iteration transformation Jordan pair kX-boundary Lemma m-component m-connected m-residue medial axis medial curve neighborhood neighbors nodes nonempty OLEv OTSF parallel thinning algorithms Pattern Recognition Letters preserves foreground connectivity Proof properties Proposition protrusion raster scan reduction operators reductive image algorithm reductive shrinking algorithm Ronse Rosenfeld Sanniti di Baja set of 1's set of voxels skeletal pixels skeleton branches spels labeled subfield subiterations subset surfels symmetric T-path terminates Theorem
Populāri fragmenti
210. lappuse - Rn be subdivided into hypercuboids by n mutually orthogonal families of orthogonal hyperplanes. We shall assume, with no loss of generality for our purposes, that the hyperplanes in each family have equal unit spacing so that the hypercuboids are unit hypercubes, and we shall choose coordinates so that the center of each hypercube has integer coordinates. The hypercubes will be called spels (an abbreviation for space elements). When n=2 and n=3, the spels are called pixels and voxels, respectively.
26. lappuse - M. Manohar and HK Ramapriyan, "Connected Component Labeling of Binary Images on a Mesh Connected Massively Parallel Processor," Computer Vision, Graphics, and Image Processing, Vol.
290. lappuse - YF Tsao and KS Fu. A parallel thinning algorithm for 3-d pictures.
291. lappuse - Skeletonization via the Realization of the Fire Front's Propagation and Extinction in Digital Binary Shapes", IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol.
234. lappuse - ... exactly one pcomponent. We note that a sufficient, but not necessary, condition for p-connectedness in A to be an equivalence relation is that p be symmetric.
141. lappuse - T. Fukumura: An analysis of topological properties of digitized binary pictures using local features, Computer Graphics and Image Processing, Vol.
273. lappuse - Thinning of gray-scale images with combined sequential and parallel conditions for pixel removal," in Visual Form Analysis and Recognition, C.
141. lappuse - On the Detection of Dominant Points on Digital Curves", IEEE Trans, on Pattern Analysis and Machine Intelligence, Vol.
177. lappuse - Wan, DL Stover, and RD Iverson, "A One-Pass Thinning Algorithm and Its Parallel Implementation," Computer Vision, Graphics, and Image Processing, 40, pp.30-40, 1987.
274. lappuse - C. Arcelli and G. Sanniti di Baja. A width-independent fast thinning algorithm, IEEE PAMI-7, p.
Atsauces uz šo grāmatu
Discrete Mathematical Problems with Medical Applications: DIMACS Workshop ... Dingzhu Du,Panos M. Pardalos,Jie Wang Ierobežota priekšskatīšana - 2000 |
Programmable Devices and Systems 2003 (PDS 2003): A Proceedings Volume from ... Vilém Srovnal,K. Vlček Priekšskatījums nav pieejams - 2003 |