Coarse-to-Fine Boundary Location With a SOM-Like Method

被引:4
作者
Zeng, Delu [1 ]
Zhou, Zhiheng [1 ]
Xie, Shengli [1 ]
机构
[1] S China Univ Technol, Guangzhou 510641, Guangdong, Peoples R China
来源
IEEE TRANSACTIONS ON NEURAL NETWORKS | 2010年 / 21卷 / 03期
基金
美国国家科学基金会;
关键词
Boundary location; boundary stopping function; coarse-to-fine; self-organizing map (SOM); universal gravitation; GRADIENT VECTOR FLOW; GEODESIC ACTIVE CONTOURS; LEVEL SET METHOD; SEGMENTATION; ALGORITHMS; EXTRACTION; FRONTS; SNAKES; MODEL;
D O I
10.1109/TNN.2009.2039493
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A coarse-to-fine boundary location with a self-organizing map (SOM)-like method is proposed in this paper. Inspired from the conventional SOM and universal gravitation, given a small quantity of supervision seeds from the desired boundaries, neurons are used to evolve to the desired boundaries in a coarse-to-fine framework. The major components of this framework are the designs of union action and evolving rate. In the course of neuron evolution, the union actions acting on these neurons will offer them the evolving directions. Also controlled by the corresponding referenced gradients, the neurons' evolving rates are adaptively adjusted at different positions. With the union actions and evolving rates, the neurons will evolve with appropriate manners to expand the set of feature points on the desired boundaries. The newly expanded feature points will cause the generation updates for feature points and neurons, and offer new information to guide the new generation of neurons to the boundaries. What is more, the proposed multiround evolution is as well a coarse-to-fine way for boundary location. Experiments and comparisons show that the proposed method performs well in complex long concavities, inhomogeneous and weak boundary location with good initialization flexibility.
引用
收藏
页码:481 / 493
页数:13
相关论文
共 34 条
[1]   Class of constrained clustering algorithms for object boundary extraction [J].
Abrantes, AJ ;
Marques, JS .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1996, 5 (11) :1507-1521
[2]   A FAST LEVEL SET METHOD FOR PROPAGATING INTERFACES [J].
ADALSTEINSSON, D ;
SETHIAN, JA .
JOURNAL OF COMPUTATIONAL PHYSICS, 1995, 118 (02) :269-277
[3]  
[Anonymous], 2006, PROC 23 INT C MACH L, DOI DOI 10.1145/1143844.1143863
[4]   Geodesic active contours [J].
Caselles, V ;
Kimmel, R ;
Sapiro, G .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1997, 22 (01) :61-79
[5]   A GEOMETRIC MODEL FOR ACTIVE CONTOURS IN IMAGE-PROCESSING [J].
CASELLES, V ;
CATTE, F ;
COLL, T ;
DIBOS, F .
NUMERISCHE MATHEMATIK, 1993, 66 (01) :1-31
[6]  
CASELLES V, 1995, FIFTH INTERNATIONAL CONFERENCE ON COMPUTER VISION, PROCEEDINGS, P694, DOI 10.1109/ICCV.1995.466871
[7]   Active contours without edges [J].
Chan, TF ;
Vese, LA .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2001, 10 (02) :266-277
[8]   Dynamic directional gradient vector flow for snakes [J].
Cheng, Jierong ;
Foo, Say Wei .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2006, 15 (06) :1563-1571
[9]   COMPUTING MINIMAL-SURFACES VIA LEVEL SET CURVATURE FLOW [J].
CHOPP, DL .
JOURNAL OF COMPUTATIONAL PHYSICS, 1993, 106 (01) :77-91
[10]   DEATH CERTIFICATES - AN EFFICIENT SOURCE FOR ASCERTAINMENT OF CREUTZFELDT-JAKOB-DISEASE CASES [J].
DAVANIPOUR, Z ;
SMOAK, C ;
BOHR, T ;
SOBEL, E ;
LIWNICZ, B ;
CHANG, S .
NEUROEPIDEMIOLOGY, 1995, 14 (01) :1-6