@proceedings {46351,
	title = {Learning to Agglomerate Superpixel Hierarchies},
	volume = {24},
	year = {2011},
	month = {12/2011},
	publisher = {MIT Press},
	address = {Granada, Spain},
	abstract = {<p>An agglomerative clustering algorithm merges the most similar pair of clusters at every iteration. The function that evaluates similarity is traditionally hand- designed, but there has been recent interest in supervised or semisupervised settings in which ground-truth clustered data is available for training. Here we show how to train a similarity function by regarding it as the action-value function of a reinforcement learning problem. We apply this general method to segment images by clustering superpixels, an application that we call Learning to Agglomerate Superpixel Hierarchies (LASH). When applied to a challenging dataset of brain images from serial electron microscopy, LASH dramatically improved segmentation accuracy when clustering supervoxels generated by state of the boundary detection algorithms. The naive strategy of directly training only supervoxel similarities and applying single linkage clustering produced less improvement.</p>
},
	author = {Viren Jain and Srinivas C. Turaga and K Briggman and Moritz N. Helmstaedter and Winfried Denk and H. S. Seung}
}
