Digital geometry in image processing by Jayanta Mukhopadhyay, (College teacher); et al

By Jayanta Mukhopadhyay, (College teacher); et al

Show description

Read Online or Download Digital geometry in image processing PDF

Similar imaging systems books

3D Videocommunication: Algorithms, concepts and real-time systems in human centred communication

The 1st e-book to offer an entire assessment of 3D video expertise, 3D Videocommunication offers either theoretical research and implementation concerns. The editors of this e-book are all key figures within the improvement of this new box and feature introduced jointly a couple of key specialists to supply an essential evaluate of 3D Video and the comparable communications applied sciences at the moment less than improvement.

Fiber Optics Handbook

Fiber optics is the most popular subject in communications and this e-book from the world's best specialists sincerely lays out the entire info of optical communications engineering
* crucial technical consultant and recommendations equipment for the super-fast, super-broad fiber platforms and units powering the fastest-growing communications infrastructure
* tools for producing above height performance
* transparent motives and solutions to difficult demanding situations for WDM, DWDM, amplifiers, solitons, and different key applied sciences

Acoustical imaging : techniques and applications for engineers

''Acoustical Imaging starts off with an advent to the elemental theories and rules of acoustics and acoustical imaging, then progresses to debate its diverse functions: nondestructive checking out, scientific imaging, underwater imaging and SONAR and geophysical exploration. the writer attracts jointly the various applied sciences, highlighting the similarities among subject components and their universal underlying thought.

Extra resources for Digital geometry in image processing

Sample text

Let us consider the case of 2-D skeletonization first. We define a point simple, if its deletion still preserves the topology of the picture. A simple point can be characterized in various ways. The following theorem [155, 175] states a characterization of simple points in 2-D. 1. Let p be a non-isolated border point in a digital picture. Let S be its foreground pixel set, and let S = S − {p}. Then the following are equivalent: 1. p is a simple point. 2. p is adjacent to just one component of N (p) S.

In this case, C1 and C2 are the foreground components, and B1 and B2 are background components. The respective adjacency tree formed by nodes corresponding to components and edges between two adjacent components is shown in Fig. 19(b). However, if the pattern of Fig. 15 is taken in a (4, 8) grid, the set of connected components and their adjacency tree differ significantly (see Fig. 20). From these figures, we may observe the following for an adjacency tree, which is also in general true. These properties are discussed in [36].

3 Boundary and Interior . . . . . . . . . . . . . . . . . . 1 Contour Tracing . . . . . . . . . . . . . . 2 Chain Code . . . . . . . . . . . . . . . . 3 Neighborhood Plane Set (NPS) . . . . . . Topology Preserving Operations . . . . . . . . . . . . . . . . . 1 Skeletonization . . . . . . . . . . . . . . . . . . . . . . 2 Adjacency Tree . . . . . . . . . . . . . . . .

Download PDF sample

Rated 4.00 of 5 – based on 23 votes