Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A pyramidal approach for the recognition of neurons using key features
Li Z., Uhr L. (ed) Pattern Recognition19 (1):55-62,1986.Type:Article
Date Reviewed: Jul 1 1988

This paper describes the use of a pyramidal architecture in recognizing and obtaining coordinate information of the neurons in an image. The input is an image from an electron microscope of the neuropil segment of the larval corn borer.

The pyramidal structure of 10 levels (numbered 0–9). The input image is of 256 × 256 size. A 64 × 64 portion of it is presented as test data and is stored at level 6. The nodes at level 5 perform median filtering on a 3 × 3 child set of level 6. Then Prewitt’s edge detection operators (for 8 directions) are applied to each of the nodes at level 5, and the ones having the maximum weight are retained. These weights and the directions are assigned to the microedges so obtained.

On the next level (level 4) the edges are combined to obtain short curves and the weights of the short curves are computed as w = &Sgr;wi &Sgr;wj, where wj is the weight of the microedge j (j=1, . . . ,8). Here also a 3 × 3 child set is used, and the sums are taken within this window.

The short curves are further combined to form long curves at level 3, again using a 3 × 3 window. Finally these are merged to form a whole nerve cell. If at this stage the system detects some unmatched pairs of curves, it looks for the missing curves during a second pass with a larger window size and lower threshold. If this also fails, the system still predicts the cells but with a lower confidence level.

The key features of this method are small windows, local operations, and highly parallel computations.

It is to be noted that increasing the window size increases overlapping and introduces redundancy. To some extent this makes the system insensitive to noise. The system also preserves key features like edges even at low resolutions. The results of running the system on a test image are presented in the paper.

Reviewer:  Rama Chellapa Review #: CR111667
Bookmark and Share
 
Edge And Feature Detection (I.4.6 ... )
 
 
Biology And Genetics (J.3 ... )
 
 
Geometric (I.5.1 ... )
 
 
Representations, Data Structures, And Transforms (I.2.10 ... )
 
 
Applications (I.5.4 )
 
Would you recommend this review?
yes
no
Other reviews under "Edge And Feature Detection": Date
Object detection based on gray level cooccurrence
Trivedi M. (ed), Harlow C., Conners R., Goh S. Computer Vision, Graphics, and Image Processing 28(2): 199-219, 1984. Type: Article
Jun 1 1985
Plan-based boundary extraction and 3-D reconstruction for orthogonal 2-D echocardiography
Tamura S., Yata K., Matsumoto M., Matsuyama T., Shimazu T., Inoue M. Pattern Recognition 20(2): 155-162, 1987. Type: Article
Nov 1 1988
A thinning algorithm by contour generation
Kwok P. Communications of the ACM 31(11): 1314-1324, 1988. Type: Article
Jun 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy