Abstract A logical approach to compose qualitative shape descriptors (LogC-QSD) is presented in this paper. Each object shape is described qualitatively by its edges, angles, convexities, and lengths. LogC-QSD describes… Click to show full abstract
Abstract A logical approach to compose qualitative shape descriptors (LogC-QSD) is presented in this paper. Each object shape is described qualitatively by its edges, angles, convexities, and lengths. LogC-QSD describes the shape of composed objects qualitatively adding circuits to describe the connections among the shapes. It also infers new angles and lengths using composition tables. Its main contributions are: (i) describing qualitatively the resulting boundary of connecting N shapes and (ii) its application to solve spatial reasoning tests. LogC-QSD approach has been implemented using Prolog programming language, which is based on Horn clauses and first order logic. The testing framework was SWI-Prolog on the LogC-QSD dataset. The obtained results show that the LogC-QSD approach was able to correctly answer all the questions in the LogC-QSD dataset, which involved compositions up to five shapes. The correct answer for 60 % of the questions was obtained in an average time of 2.45 · 10 - 4 s by comparing the concavities and right angles of the final QSD composed shape with the possible answers. The rest of the questions required a matching algorithm and they were solved by LogC-QSD in an average time of 19.50 · 10 - 4 s. Analysis of the execution times obtained showed that the algorithmic cost of LogC-QSD is lower than O ( n 2 ) in the worst case.
               
Click one of the above tabs to view related content.