English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We propose a new method for shape recognition and retrieval based on dynamicprogramming. Our approach uses the dynamic programming algorithm to compute theoptimal score and to find the optimal alignment between two strings. First,each contour of shape is represented by a set of points. After alignment andmatching between two shapes, the contours are transformed into a string ofsymbols and numbers. Finally we find the best alignment of two complete stringsand compute the optimal cost of similarity. In general, dynamic programming hastwo phases: the forward phase and the backward phase. In the forward phase, wecompute the optimal cost for each subproblem. In the backward phase, wereconstruct the solution that gives the optimal cost. Our algorithm is testedin a database that contains various shapes such as MPEG-7.

A new algorithm for shape matching and pattern recognition using dynamic programming