Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
111
search results - page 23 / 23
»
cvpr 2001
Sort
relevance
views
votes
recent
update
View
thumb
title
121
Voted
CVPR
2001
IEEE
181
views
Computer Vision
»
more
CVPR 2001
»
On Solving 2D and 3D Puzzles Using Curve Matching
16 years 4 months ago
Download
www.lems.brown.edu
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
Weixin Kong, Benjamin B. Kimia
claim paper
Read More »
« Prev
« First
page 23 / 23
Last »
Next »