In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
A new algorithm, based on area-deviation, is proposed for the detection of corner points of digitized curves. The algorithm consists of two steps. In the first step, a fixed-lengt...
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...