The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
As an increasing number of digital images are generated, a demand for an efficient and effective image retrieval mechanisms grows. In this work, we present a new skeleton-based shape retrieval algorithm, which starts by drawing circles of increasing radius around skeleton points. Since each skeleton corresponds to the center of a maximally inscribed circle, this process results in circles that are...
As an increasing number of digital images are generated, a demand for an efficient and effective image retrieval mechanisms grows. In this work, we present a new skeleton-based shape retrieval algorithm, which starts by drawing circles of increasing radius around skeleton points. Since each skeleton corresponds to the center of a maximally inscribed circle, this process results in circles that are...
In this paper, we proposed a novel approach to shape classification. A new shape tree based on junction nodes can represent the global structure in a simple way. The statistic distribution of junctions can be learned by merging the shape trees. In the process of learning, context of a junction node is obtained to improve the rate of classification. We illustrate the utility of the proposed method...
Graph matching algorithms have proven to be useful in many applications, such as character recognition, shape analysis and image analysis. As the graph matching problem is one of exponential computational complexity, various heuristics and estimations have been proposed. While many of these algorithms succeed in improving the time taken to perform a match, most do not guarantee that an optimal solution...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.