A shape descriptor based on circular Hidden Markov Model

2000-09-07
Given the shape information of an object, can we find visually meaningful "n" objects in an image database, which is ranked from the most similar to the n(th) similar one? The answer to this question depends on the complexity of the images in the database and the complexity of the objects in the query.
Citation Formats
N. Arica and F. T. Yarman Vural, “A shape descriptor based on circular Hidden Markov Model,” 2000, p. 924, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/62709.