Code covered by the BSD License  

Highlights from
Region Adjacency Graph (RAG)

4.6

4.6 | 5 ratings Rate this file 58 Downloads (last 30 days) File Size: 180 KB File ID: #16938
image thumbnail

Region Adjacency Graph (RAG)

by

 

17 Oct 2007 (Updated )

Computes the graph of adjacent regions in a labeled image

| Watch this File

File Information
Description

Computes region adjacency graph of a labeled 2D or 3D image.

Two regions are considered as neighbor if they are separated by a small number of pixel in the horizontal or vertical direction, as well as depth direction for 3D images.

The result is a N*2 array, containing 2 indices for each couple of neighbor regions.

usage:
ADJ = imRAG(IMG);
ADJ has the format [LBL1 LBL2], LBL1 and LBL2 being vertical arrays the same size.
 
LBL1 is given in ascending order, LBL2 is given in ascending order for each LBL1. Ex :
    [1 2]
    [1 3]
    [1 4]
    [2 3]
    [2 5]
    [3 4]
 
Alternative syntax:
[NODES, ADJ] = imRAG(IMG);
Return two arrays: the first one is a [N*2] array containing centroids of the N labeled region, and ADJ is the adjacency previously described.

For 3D images, the node array is [N*3].

The algorithm proceed in scanning each line (horizontal, vertical, and in z-direction for 3D images), and by detection transitions in the labels. A background gap of width 1 pixel/voxel is assumed to exist between regions. It is possible to specify different gaps:
ADJ = imRAG(IMG, GAP);

* gap = 0 if regions are contiguous (no background),
* gap = 1, when considering the result of a watershed, for example
* gap > 1 if regions are separated by thick background (some neignborhoods can be missed)

MATLAB release MATLAB 7.9 (R2009b)
Other requirements image processing toolbox is not required to run the function, but is required to run the example code.
Tags for This File   Please login to tag files.
Please login to add a comment or rating.
Comments and Ratings (7)
21 May 2013 G. Sken

helpfull to compute adjacency relationship between 3D regions segmented via watershed methods.

03 Oct 2012 David Legland

Hi Kerem,
I have submitted an updated version, in which you can control the "gap" between two regions. If you chosse a gap value equal to 2, it should fit your needs (hopefully !).

20 Aug 2012 Kerem Sahin

Any help for the extension to 8-connected neighborhood of this implementation is appreciated.

21 May 2012 Chen  
20 Apr 2011 Ryan

Very useful.

31 May 2010 Joao Henriques  
14 Mar 2008 Perrine Paul

Very efficient. Some example of use would be of interest, for accessing data.

Updates
29 Jul 2010

removed dependencies to image processing toolbox, updated doc

02 Oct 2012

changes the algorithms to remove the 'diff' function, reducing the amount of memory required, and add psb to use different gaps between regions.

21 May 2013

correct processing of gap>1, and simplification of the code

Contact us