venkatesh-anefficient-1998.pdf (151.02 kB)
An efficient least common subgraph algorithm for video indexing
conference contribution
posted on 1998-01-01, 00:00 authored by K Shearer, Svetha VenkateshSvetha Venkatesh, H BunkeMany tasks in computer vision can be expressed as graph problems. This allows the task to be solved using a well studied algorithm, however many of these algorithms are of exponential complexity. This is a disadvantage when considered in the context of searching a database of images or videos for similarity. Work by Mesaner and Bunke (1995) has suggested a new class of graph matching algorithms which uses a priori knowledge about a database of models to reduce the time taken during online classification. This paper presents a new algorithm which extends the earlier work to detection of the largest common subgraph.
History
Event
International Conference on Pattern Recognition (14th : 1998 : Brisbane, Qld.)Pagination
1241 - 1243Publisher
IEEELocation
Brisbane, Qld.Place of publication
Los Alamitos, Calif.Publisher DOI
Start date
1998-08-16End date
1998-08-20ISBN-10
0818685131Language
engNotes
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.Publication classification
E1.1 Full written paper - refereedCopyright notice
1998, IEEEEditor/Contributor(s)
A Jain, S Venkatesh, B LovellTitle of proceedings
ICPR 1998 : Proceedings of the 14th International Conference on Pattern RecognitionUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC