Algorithm beats jigsaw-solving record

For example, if one piece becomes progressively lighter from left to right, it is likely that the piece nestles between a lighter piece on the left and a darker one on the right. In addition to solving puzzles, Gallagher also used elements of his algorithm to enter last year's DARPA Shredder Challenge, in which participants had to piece together a series of shredded documents. Gallagher's attempt came in at 17 overall he says because the puzzle pieces in the challenge were digital images of shredded documents made it harder for the algorithm, as the jagged edges did not line up perfectly and some pieces were missing. Ohad Ben-Shahar, a computer scientist at Ben-Gurion University in Beer-Sheva, Israel, whose team holds the previous puzzle-solving record, says that Gallagher's algorithm is impressive because it can handle puzzles in which the orientation of the pieces is unknown, a more challenging problem.

Author: Publication Date: Crawl Date: Source: Topic: Contributor: Type: Language: Format:
June 16, 2012 June 17, 2012 NewScientist Applications MachineLearning Vision NewsFinder Text English HTML

Whitelist words:

  1. comput vision: 1 occurrence
  2. pattern recognit: 1 occurrence

Categorization (need >= 0.5 to match):

  1. AIOverview: 0.0264964
  2. Agents: 0.00449579
  3. Applications: 0.720693
  4. CognitiveScience: 0.0248798
  5. Education: 0.00059737
  6. Ethics: 0.00916253
  7. Games: 0.0105484
  8. History: 0.132221
  9. Interfaces: 0.0131177
  10. MachineLearning: 0.659302
  11. NaturalLanguage: 0.0119391
  12. Philosophy: 0.00181353
  13. Reasoning: 0.0485407
  14. Representation: 0.0101843
  15. Robots: 0.0730208
  16. ScienceFiction: 0.0167964
  17. Speech: 0.0424103
  18. Systems: 0.013999
  19. Vision: 0.607446

Duplicates (threshold=0.17):


  1. Published
AAAI   Recent Changes   Edit   History   Print   Contact Us
Page last modified on June 18, 2012, at 12:00 AM