Զѧ
ACTA AUTOMATICA SINICA
1999ꡡ255ڡVol.25 No.5 1999



һµıڵĹ⻬߽
ĸ֪޸ģ1)
ӥʤ̹
ժҪо˱ڵĹ⻬߽Ĺ.һֻѧĹģ.ģڹؼϷֲĵĵ糡ģ˳Ӽͬʱһͼ.ͨģܸЧعڵ߽.Ӧ÷֤˸ģ͵Ч.
ؼʡڵ߽磬޸.
A NEW MODEL OF PERCEPTUAL COMPLETION FOR OCCLUDED
SMOOTH BOUNDARY AND ILLUSORY CONTOUR
LIU HaiyingHUANG ShenghuaHONG Jiguang
(National ASIC Design Engineering Center of China
Institute of Automation, Chinese Academy of Sciences, Beijing100080)
AbstractA novel model for constructing the occluded smooth boundary and illusory contour is presented. The model is based on an assumption that the boundary completion depends on some field attraction. An electric field generated by charges artificially distributed on key points of boundary fragments is selected to imitate the attraction. Then, the field stimulator and attraction are also defined according to electromagnetic theory. Moreover, a graph is constructed to solve the global grouping problem. By using this model, the occluded boundary and illusory contour can be quickly constructed without complex computing. A group of occluded boundary and illusory contour stimuli including an application is used to demonstrate the efficiency of our model.
Key wordsOccluded boundary, illusory contour, attracting field, perceptual completion
1
Ƶά˽ṹǼӾѽ֮һ.ͳģͶоȫɼ.ȻӾ˵صӾ֪ȷԡⲿĸ֪ⲿ籾ԵĶӦ.ʵϣӾϵͳعͼĴ󲿷ֶʹӾ.о֪ķɰԴ·Ϊࣺѧѧ.ѧӾϵͳĽѧѧΪģѧԸ֪͸֪ʵΪ.
оԱѧ.UllmanڴӾϵͳṹƳӾģͷЩڹ1.Grossberg  MingollaӾƤĽṹз˴ã2.Guy  Medioni˴ӾֲͼϢгȡȫֽṹķ3.
 Williams  Jacobs޸(stochatic completion fields)ĸԽ֪޸4.ݡ鶯ӾƤ㾫ϸضӦضλúͷѧף4λúͳλͼƽϵΪ߽״ʷֲģͣɴ˶һؼ֮䲻ͬ·ƶȣֺľ޸.Ǿӵļ㣬ֻܵõƵ޸޷ֱӵõ֪߽.
Ļ ͼ߽Ƭ֮һ³̶Ⱦܿһ߽Ŀԡ5ѧһָЧĸ֪޸ģ.ģؿǱ߽Ƭλúͳ򣬲ʹ߽Ƭ֮һ³̶ȡ.
2޸ģ
2.1ѧ
ѧΪ޸ı߽״ĳϢ磬˿õ糡ģ.յųۣڿռһʱԶĵλΪ0õڿռĳ㼤ĵλΪ
(1)
ʽqǵ0ս糣rǿռõ㵽ɵľ.ڶq1, q2,, qnҿռĳЩɵľֱΪr1, r2,,rnܵλΪ
(2)
ڶάЩɲĵ糡Ϊ
(3)
ʽ(x, y)λ꣬i,jƽĵλ.
ֻ֮λϢûаϢԱһֵɵԪʹ֮ͬʱλúͷϢ.
2.2Ĺ
һֽӵĵɵԪ߽ƬλúͿռһ.һΪlߵɣһλڹؼϣǱ߽Ƭڹؼϣͼ1(a)ʾ.ߵϵĵܶǴ+ѵ -(> 0) ȷֲģͼ1(b).Ӳͬʱ˱߽Ƭؼ㴦λúͷϢ.ӷõõܹĳعĸ֪߽.


ͼ1Ĺ
2.3ʽ
ߵɲĵλΪ
(4)
ʽЦ(x,y,z)ߵܶȷֲrǿռһ(x,y,z)ɵԪ(.)dӵľ.nߵɵܵλΪ
(5)
Ϊ
(6)
輤siλΪ(xi,yi)Ϊi,ΪliؼϵĵܶΪiΪtyp eiԴĿж壩,ĵλΪ
(7)
ʽ


ܵΪ
(8)
ڽڹؼԶ㴦Ϊ0һвڹؼԶ㴦ĵڳ¶յһؼԶ.ζĳؼһ΢СλƦdõ㶼ظùؼ㴦߷յһؼԶ.ֻҪӷõõ븴Ӽ㣬ͿԵõһ߽ƬϵĹ⻬֪߽.
ģͿֱӦڼ򵥵ľֲڵ߽ʹ޸.ͼνϸʱõĳЩӦе޸.Ϊ߽Ƭ֮Ƿڸ֪߽粻ȡھֲϢȡȫϵĸ֪߽Ƿһ£6.Զڸͼڽ֮ǰӦԼӽзԤ.
2.4鴦
ͼε޸⣬಻ȷ⣬״ĲȷԡԪĲȷԺϵĲȷ.(grouping problem) ɵԪĲȷԲģЩƬϺЩƬɱ߽硱6.λڹؼ㴦ɷֲܶΪ-ѵļӶΪԴλڹؼ㴦ɷֲܶΪ+ѵļӶΪĿķתˡԴ͡Ŀķֲƥ.
ôͳֹ򣬼ر߽нʱıλнҲ.ر߽нؼʱڹؼϷһԴر߽нؼʱڹؼϷһĿ.ÿһؼ㴦ӣһǡԴһǡĿ.ȻӶӦı߽Ƭڲͬ.
ڡԴ͡Ŀƥ⣬ɲͼеȨƥ䷨Խ.һͼÿһʾһӣÿһȨֵı߱ʾ֮Ŀӹϵ.ȨֵWijĶ£ 
(9)
ʽЦǱӣRijsi,sj֮ĿϵDijsi,sj֮ϵ.
ָ߽ƬϿһ⻬Ŀ.Ϊ˷ֹߵչԻȵ󣬻һ.Կɽرɹʽ(10).߽E1,E2ʹ Rrֱڹؼ㴦ֱE1, E2ʹRrΪRrļнǣͼ2ʾ.֤߽Ͽʽ (10)ʱһһ߿ɽ߽һ˷ֱ߽У7
0Rcosգr.(10)


ͼ2˵
ϿƽСֱ͹ߵϵΪ
(11)
ʽc11,c20;ti,tjǷĽ. RijԽʾ߽Խ.
ϵ£
(12)
DijԽؼԽӽ.
3ʵ
ùʽ(8)ֱӷ.ڼӷֲͼȨֵƥ.ǵЧʣɲGabow N-ηȨƥ㷨8.
ͼ3 ǶKanizsaε޸.㷨ȡ==1,c1=1,c2=-1. 


ͼ3Kanizsa ޸
Ϊ֪߽磻Ϊ߽ƬΪؼ
ͼ4ͼ5Ǹģڼɵ·(IC)ٵʵӦ. IC ֤ͷеҪ. IC оƬͼĶڵ⣬ٺԶ.ĵģΪṩһֽٵԶ̶.ͼ4(a) IC оƬͼоֲ256Ҷͼ.ͼ4(b)ͼ4(a) ı߽ϸ.ؼ1-7ϷֲԴؼ8-14ϷֲĿ.㷨ȡ==1,c1=1,c2=-1.ͼ5и˲޸.


ͼ4ɵ·ͼͼֲ

ͼ5ͼ4޸Ĳ
4ᡡ
֪޸Ӿ˵֮һ.ʹӾһֱһ.ģҪѧ֪ʶΪģǻٵغ屾Ը֪޸Ӱ.޸ģͣкѧݣǿ˱߽Ƭϱԣ䱾ڵһԣλһԺͷһԣƵЧļ㷽Ӷ㷨иӶȽϸߵľػֵ.Ҫǣܹõȷı߽磬㷨14ݾ󣬽õ߽ĿܷΧ.ʵӦģҲõ֤.
1) ҿƼصƼĿ΢ס΢׼ɵ·Զо֮һ.
߼飺ӥʿ.1993ҵڸݴѧϵ1998йѧԺԶоʿѧλ.Ϊֿϴѧϵʿ.ҪоΪģʽʶ𡢼Ӿ.
ʤʿ.1993ҵڱʦѧѧϵ1998йѧԺԶоʿѧλ.ڹһ.ҪоΪģʽʶͼ.
̹⡡оԱʿʦ.1962ҵڳɶѶѧԺ.ΪйѧԺԶоܹרüɵ·̼о.ҪоΪģʽʶ𡢼ɵ·ͼӾ.
ߵλרüɵ·ƹ̼оģйѧԺԶо100080
ο
1Ullman S. Filling-in the gaps: The shape of subjective contours and a model for their generation. Biological Cybernetics1976AC-21, 1-6
2Grossberg S, Mingolla, E. The Role of Illusory Contours in Visual Segmentation. In: The Perception of Illusory Contours. New York:SpringerVerlag, 1987. 116-125
3Guy G, Medioni G.Inferring Global Perceptual Contours from Local Features, In: Proc of the DARPA Image Understanding Workshop, Washington, D.C., 1993, 881-892
4Williams L R, Jacobs D W. Stochastic Completion Fields: A Neural Model of Illusory Contour Shape and Salience, In: Proc. of 5th Intl. Conf. on Computer Vision (ICCV'95), Cambridge, MA, 1995
5Gibson J J. The Perception of the Visual World. Boston, Houghton Mifflin, MA
6Williams L R, Hanson A R. Perceptual Completion of Occluded Surfaces , In: Proc. of IEEE Conf. on Computer Vision and Pattern Recognition (CVPR '94), Seattle, WA, 1994
7Kellman P J,Shipley T F. A theory of visual interpolation in object perception. Cognitive Psychology, 1991, AC-23,141-221
8Gabow's , Implementation of Algorithms for Maximum Matching on Nonbipartite Graphs, Ph.D. thesis. Stanford University, 1973
ոڣ1997-10-21
޸ڣ1999-03-01
