✦ LIBER ✦

Neighborhood sequences in the diamond grid: Algorithms with two and three neighbors

✍ Scribed by Benedek Nagy; Robin Strand

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 560 KB
Volume: 19
Category: Article
ISSN: 0899-9457
DOI: 10.1002/ima.20182

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In the digital image processing, digital distances are useful; distances based on neighborhood sequences are widely used. In this article, the diamond grid is considered, that is, the three‐dimensional grid of carbon atoms in the diamond crystal. An algorithm to compute a shortest path defined by a neighborhood sequence between any two points in the diamond grid is presented. A formula to compute the distance based on neighborhood sequences with two neighborhood relations is given. The metric and nonmetric properties of some distances based on neighborhood sequences are also discussed. Finally, the constrained distance transformation is shown. © 2009 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 19, 146–157, 2009.

📜 SIMILAR VOLUMES

In vivo MRI of submillisecond T2 species

In vivo MRI of submillisecond T2 species with two-dimensional and three-dimensional radial sequences and applications to the measurement of cortical bone water

✍ Aranee Techawiboonwong; Hee Kwon Song; Felix W. Wehrli 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 279 KB 👁 1 views

## Abstract Water in dense collagenous tissues such as tendons and ligaments, as well as water in cortical bone that occupies the spaces of the lacuno‐canicular system or is tightly bound to collagen, is not ordinarily detectable by MRI. Water proton __T__~2~ in these structures is generally less t