@conference {10.1007/978-3-030-00665-5_68,
	title = {Highly Repeatable Feature Point Detection in Images Using Laplacian Graph Centrality},
	booktitle = {Proceedings of the International Conference on ISMAC in Computational Vision and Bio-Engineering 2018 (ISMAC-CVB)},
	year = {2019},
	note = {n/a},
	pages = {687{\textendash}697},
	publisher = {Springer International Publishing},
	organization = {Springer International Publishing},
	address = {Cham},
	abstract = {<p>Image registration is an indispensible task required in many image processing applications, which geometrically aligns multiple images of a scene, with differences caused due to time, viewpoint or by heterogeneous sensors. Feature-based registration algorithms are more robust to handle complex geometrical and intensity distortions when compared to area-based techniques. A set of appropriate geometrically invariant features forms the cornerstone for a feature-based registration framework. Feature point or interest point detectors extract salient structures such as points, lines, curves, regions, edges, or objects from the images. A novel interest point detector is presented in this paper. This algorithm computes interest points in a grayscale image by utilizing a graph centrality measure derived from a local image network. This approach exhibits superior repeatability in images where large photometric and geometric variations are present. The practical utility of this highly repeatable feature detector is evident from the simulation results.</p>
},
	isbn = {978-3-030-00665-5},
	author = {Pournami, P. N. and V. K. Govindan},
	editor = {Pandian, Durai and Fernando, Xavier and Baig, Zubair and Shi, Fuqian}
}
