Binary digital image processing: a discrete approach by Stéphane Marchand-Maillet, Yazid M. Sharaiha

By Stéphane Marchand-Maillet, Yazid M. Sharaiha

Show description

Read Online or Download Binary digital image processing: a discrete approach PDF

Best computers books

Profitable Customer Relationships The Keys to Maximizing Acquisition, Retention, and Loyalty

Contained in the Minds: ecocnomic consumer Relationships is the main authoritative e-book ever written at the necessities at the back of winning buyer dating administration. This identify beneficial properties Chairmen, Presidents, and CEOs from a number of the nation's most sensible CRM businesses, who've every one contributed chapters similar to target, experience-related white papers or essays at the special demanding situations they face of their box.

Artificial Intelligence: Methodology, Systems, and Applications: 11th International Conference, AIMSA 2004, Varna, Bulgaria, September 2-4, 2004. Proceedings

The eleventh convention “Artificial Intelligence: method, structures, purposes – Semantic internet demanding situations” (AIMSA 2004) endured effectively pursuing the most goal of the AIMSA sequence of meetings – to foster the multidisciplinary neighborhood of man-made intelligence researchers, embracing either the theoretic underpinnings of the sphere and the sensible matters taken with improvement, deployment, and upkeep of structures with clever habit.

Computer Entrepreneur

Ancient sketches of a few of the well-known innovators and marketers of this dynamic slice of yank lifestyles. It ain't uninteresting.

Additional resources for Binary digital image processing: a discrete approach

Example text

In this case, the only possible definition of a discrete distance that is geometrically consistent is that of the d4 distance, where a - 1. A simple extension of the 4-neighbourhood leads to the 8-neighbourhood. Diagonal moves are added to the horizontal and vertical moves. The length of such diagonal moves is denoted b. In this respect, diagonal moves are called b-moves and the chamfer distance obtained in the 8-neighbourhood is denoted da,b. e. the length for all 4-moves), in order to preserve a geometrical consistency within the 8-neighbourhood, the diagonal moves should be associated with a length b larger than a.

E • • • • o. o- o. • o. • • • • • o- • • • • • • o. (::~iCL"" -9:°"": .... • • ,, • • • • • • • • • .. 21 Neighbourhoods corresponding to Farey sequences. (A) Order 3. (B) Order 4 Based on these moves, a general definition of chamfer distances can be given as follows. ), the chamfer distance between p and q relative to this neighbourhood is the length of the shortest digital arc from p to q. General conditions on move lengths can be defined for chamfer distances to satisfy the metric properties [162].

15. 30" Note that there exists a strong similarity between the n o r m s IlUill - I X f f l + lYffl, Ilgl12 -- v/IX~I 2 + ly~l 2 and Ilgll~ - sup(Ix~l, lY~I) defined in the continuous space IR 2 and d4, dE and ds on the digital space. Recalling that I1~111 ~ IlUl12 ~ IlUll~ Vff c IR 2, this property is mapped in the digital space as dn(p, q) <_ dE(p,q) <_ ds(p, q ) Vp, q E ~Z 2. The knight-neighbourhood is studied because of its analogy with the moves of a knight on the chess board. 31. 31" Knight-distance The knight-distance between p and q is the length of the shortest knight-arc joining p and q when the move lengths are all set to unity.

Download PDF sample

Rated 4.92 of 5 – based on 10 votes