We introduce a new interpretation of multiscale random fields (MSRFs) that admits efficient optimization in the framework of regular (single level) random fields (RFs). It is base...
Longin Jan Latecki, ChengEn Lu, Marc Sobel, Xiang ...
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
: The basic line of our action is first to use natural language processing to prune the texts and the query, and secondly to use an ontology to expand the queries. Last year The sy...
Abstract. Automatic identification of a script in a given document image facilitates many important applications such as automatic archiving of multilingual documents, searching on...
Gopal Datt Joshi, Saurabh Garg, Jayanthi Sivaswamy
Image mosaics are useful for a variety of tasks in vision and computer graphics. A particularly convenient way to generate mosaics is by `stitching' together many ordinary ph...