Finding Junctions Using the Image Gradient

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5991

Full metadata record

DC Field	Value	Language
dc.creator	Beymer, David J.	-
dc.date	2004-10-04T14:25:34Z	-
dc.date	2004-10-04T14:25:34Z	-
dc.date	1991-12-01	-
dc.date.accessioned	2013-10-09T02:42:19Z	-
dc.date.available	2013-10-09T02:42:19Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-1266	-
dc.identifier	http://hdl.handle.net/1721.1/5991	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	Junctions are the intersection points of three or more intensity surfaces in an image. An analysis of zero crossings and the gradient near junctions demonstrates that gradient-based edge detection schemes fragment edges at junctions. This fragmentation is caused by the intrinsic pairing of zero crossings and a destructive interference of edge gradients at junctions. Using the previous gradient analysis, we propose a junction detector that finds junctions in edge maps by following gradient ridges and using the minimum direction of saddle points in the gradient. The junction detector is demonstrated on real imagery and previous approaches to junction detection are discussed.	-
dc.format	46 p.	-
dc.format	4948418 bytes	-
dc.format	3522601 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-1266	-
dc.subject	machine vision	-
dc.subject	edge detection	-
dc.subject	junction detection	-
dc.subject	zeroscrossings	-
dc.subject	feature extraction	-
dc.subject	image gradient	-
dc.title	Finding Junctions Using the Image Gradient	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI