The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Hypergraph Based Visual Segmentation and Retrieval
Abstract
This chapter explores original techniques for the construction of hypergraph models for computer vision applications. A hypergraph is a generalization of a pairwise simple graph, where an edge can connect any number of vertices. The expressive power of the hypergraph models places a special emphasis on the relationship among three or more objects, which has made hypergraphs better models of choice in a lot of problems. This is in sharp contrast with the more conventional graph representation of visual patterns where only pairwise connectivity between objects is described. This chapter draws up from three aspects to carry the discussion of hypergraph based methods in computer vision: (i) The advantage of the hypergraph neighborhood structure is analyzed. The author argues that the summarized local grouping information contained in hypergraphs causes an ‘averaging’ effect which is beneficial to the clustering problems; (ii)The chapter discusses how to build hypergraph incidence structures and how to solve the related unsupervised and semi-supervised problems for two different computer vision scenarios: video object segmentation and image retrieval; (iii) For the application of image retrieval, the chapter introduces a novel hypergraph model — probabilistic hypergraph to exploit the structure of the data manifold by considering not only the local grouping information, but also the similarities between vertices in hyperedges.
Related Content
|
Aswathy Ravikumar, Harini Sriraman.
© 2023.
18 pages.
|
|
Ezhilarasie R., Aishwarya N., Subramani V., Umamakeswari A..
© 2023.
10 pages.
|
|
Sangeetha J..
© 2023.
13 pages.
|
|
Manivannan Doraipandian, Sriram J., Yathishan D., Palanivel S..
© 2023.
14 pages.
|
|
T. Kavitha, Malini S., Senbagavalli G..
© 2023.
36 pages.
|
|
Uma K. V., Aakash V., Deisy C..
© 2023.
23 pages.
|
|
Alageswaran Ramaiah, Arun K. S., Yathishan D., Sriram J., Palanivel S..
© 2023.
17 pages.
|
|
|