We explore the problem of reconstructing an image from a bag of square, non-overlapping image patches, the jigsaw puzzle problem. Completing jigsaw puzzles is challenging and requ...
This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for eff...
Ya'akov Gal, Swapna Reddy, Stuart M. Shieber, Ande...
This paper presents a particle swarm optimizer for solving constrained optimization problems which adopts a very small population size (five particles). The proposed approach uses...
Juan Carlos Fuentes Cabrera, Carlos A. Coello Coel...
Abstract. Many supervised and unsupervised learning algorithms depend on the choice of an appropriate distance metric. While metric learning for supervised learning tasks has a lon...
? Robust feature matching across different views of the same scene taken by two cameras with wide baseline and arbitrary rotation is still an open problem. Matching based on appear...