✦ LIBER ✦

Color edge detection using the minimal spanning tree

✍ Scribed by Ch. Theoharatos; G. Economou; S. Fotopoulos

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 160 KB
Volume: 38
Category: Article
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2004.09.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multidimensional minimal spanning tree:

Multidimensional minimal spanning tree: The Dow Jones case

✍ Juan Gabriel Brida; Wiston Adrián Risso 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 491 KB

This paper introduces a new methodology in order to construct Minimal Spanning Trees (MST) and Hierarchical Trees (HT) using the information provided by more than one variable. In fact, the Symbolic Time Series Analysis (STSA) approach is applied to the Dow Jones companies using information not only

Color edge detection using multiscale qu

Color edge detection using multiscale quaternion convolution

✍ Jiangyan Xu; Linning Ye; Wang Luo 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 461 KB

## Abstract This article presents a novel color edge detection algorithm based on quaternion convolution. A set of multiscale quaternion masks are presented, and the filtered results are multiplied at adjacent scales using dot product to enhance the edge structures while diluting noise. Experimenta

Random minimal spanning tree and percola

Random minimal spanning tree and percolation on the N-cube

✍ Mathew D. Penrose 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB 👁 1 views

The N-cube is a graph with 2 N vertices and N 2 Ny1 edges. Suppose indepen- dent uniform random edge weights are assigned and let T be the spanning tree of minimal Ž . y 1 N ϱ y3 total weight. Then the weight of T is asymptotic to N 2 Ý i as N ª ϱ. Asymp-is1 totics are also given for the local stru

The minimal spanning tree as an estimato

The minimal spanning tree as an estimator for generalized dimensions

✍ Rien van de Weygaert; Bernard J.T. Jones; Vincent J. Martínez 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 506 KB

AnO(NlogN) minimal spanning tree algorit

AnO(NlogN) minimal spanning tree algorithm forNpoints in the plane

✍ R. C. Chang; R. C. T. Lee 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 564 KB

Multicast in Wormhole-Switched Torus Net

Multicast in Wormhole-Switched Torus Networks Using Edge-Disjoint Spanning Trees

✍ Honge Wang; Douglas M. Blough 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 486 KB

A tree-based multicast algorithm for wormhole-switched networks which makes use of multiple edge-disjoint spanning trees is presented. The disjoint spanning-tree multicast, or DSTM, algorithm provides deadlock-free multicast routing that is fully compatible with unicast. The application of the DSTM