Sciweavers

517 search results - page 8 / 104
» An Approximate Algorithm for Structural Matching of Images
Sort
View
CVPR
2007
IEEE
14 years 10 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
SEMWEB
2007
Springer
14 years 1 months ago
Structure Preserving Semantic Matching
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 20 days ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
ICIP
2003
IEEE
14 years 9 months ago
Approximation and compression of piecewise smooth images using a wavelet/wedgelet geometric model
Inherent to photograph-like images are two types of structures: large smooth regions and geometrically smooth edge contours separating those regions. Over the past years, efficien...
Justin K. Romberg, Michael B. Wakin, Richard G. Ba...
IPPS
2002
IEEE
14 years 23 days ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee