├── data └── inventory.csv ├── requirements.txt ├── doc └── screenshots │ └── gatherer_downloader │ ├── image_formats.png │ └── download_card_db.png ├── misc └── magic_assistant_format │ ├── minimal_abbrev.csv │ ├── minimal.csv │ ├── dict.pl │ ├── export_from_magic_assistant.csv │ ├── abbrev_to_full.csv │ └── mapping ├── text2speech.py ├── .gitignore ├── setcache.py ├── cv_utils.py ├── detect_card.py ├── cache.py ├── README.mediawiki ├── test.py ├── magicassistantcsv.py ├── scan_card.py ├── match_card.py └── LICENSE /data/inventory.csv: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /requirements.txt: -------------------------------------------------------------------------------- 1 | numpy==1.6.1 2 | SQLAlchemy==0.7.8 3 | Flask==0.8 4 | elixir==0.7.1 5 | -------------------------------------------------------------------------------- /doc/screenshots/gatherer_downloader/image_formats.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/chrismeyersfsu/python-card_scan/HEAD/doc/screenshots/gatherer_downloader/image_formats.png -------------------------------------------------------------------------------- /doc/screenshots/gatherer_downloader/download_card_db.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/chrismeyersfsu/python-card_scan/HEAD/doc/screenshots/gatherer_downloader/download_card_db.png -------------------------------------------------------------------------------- /misc/magic_assistant_format/minimal_abbrev.csv: -------------------------------------------------------------------------------- 1 | NAME,ID,COST,TYPE,POWER,TOUGHNESS,ORACLE,SET,RARITY,CTYPE,COUNT,LOCATION,OWNERSHIP,COMMENT,PRICE,COST,DBPRICE,RATING,ARTIST,COLLNUM,SPECIAL,FORTRADECOUNT,LANG,TEXT,OWN_COUNT,OWN_UNIQUE,ERROR 2 | Manalith,,,,,,,M12,,,,,,,,,,,,,,,,,,, 3 | -------------------------------------------------------------------------------- /misc/magic_assistant_format/minimal.csv: -------------------------------------------------------------------------------- 1 | NAME,ID,COST,TYPE,POWER,TOUGHNESS,ORACLE,SET,RARITY,CTYPE,COUNT,LOCATION,OWNERSHIP,COMMENT,PRICE,COST,DBPRICE,RATING,ARTIST,COLLNUM,SPECIAL,FORTRADECOUNT,LANG,TEXT,OWN_COUNT,OWN_UNIQUE,ERROR 2 | Alaborn Cavalier,,,,,,,Duel Decks: Knights vs. Dragons,,,,,,,,,,,,,,,,,,, 3 | -------------------------------------------------------------------------------- /misc/magic_assistant_format/dict.pl: -------------------------------------------------------------------------------- 1 | #!/usr/bin/perl 2 | 3 | # Convert abbreviation to full csv to python dictionary 4 | # usage: cat abbrev_to_full.csv | ./dict.pl 5 | 6 | while (my $line = ) { 7 | chomp($line); 8 | 9 | my ($abbrev, $full) = split(/,/, $line); 10 | print "'$abbrev': '$full',\n"; 11 | } 12 | -------------------------------------------------------------------------------- /text2speech.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/python 2 | from subprocess import Popen, PIPE, STDOUT 3 | import os 4 | import sys 5 | 6 | class TTS: 7 | def __init__(self): 8 | cmd = "festival --tts" 9 | self.festival = Popen(['festival', '--pipe'], bufsize=0, stdin=PIPE) 10 | self.say("Loaded Text to Speech") 11 | 12 | def say(self, text): 13 | cmd = "(SayText \"%s\")" % (text) 14 | self.festival.stdin.write(cmd) 15 | self.festival.stdin.flush() 16 | 17 | 18 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | *.py[cod] 2 | 3 | # C extensions 4 | *.so 5 | 6 | # Packages 7 | *.egg 8 | *.egg-info 9 | dist 10 | build 11 | eggs 12 | parts 13 | bin 14 | var 15 | sdist 16 | develop-eggs 17 | .installed.cfg 18 | lib 19 | lib64 20 | 21 | # Installer logs 22 | pip-log.txt 23 | 24 | # Unit test / coverage reports 25 | .coverage 26 | .tox 27 | nosetests.xml 28 | 29 | # Translations 30 | *.mo 31 | 32 | # Mr Developer 33 | .mr.developer.cfg 34 | .project 35 | .pydevproject 36 | -------------------------------------------------------------------------------- /setcache.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/python 2 | import os 3 | import sys 4 | import pickle 5 | 6 | def save_set_cache(path, cards): 7 | f = file(path,"wb") 8 | pickle.dump(cards, f) 9 | f.close() 10 | 11 | def load_set_cache(path): 12 | try: 13 | f = file(path, "rb") 14 | # TODO: don't assume the ioerror means the file doesn't exist 15 | # check to see if the file exists 16 | except IOError: 17 | return None 18 | cards = pickle.load(f) 19 | f.close() 20 | return cards 21 | 22 | 23 | 24 | -------------------------------------------------------------------------------- /misc/magic_assistant_format/export_from_magic_assistant.csv: -------------------------------------------------------------------------------- 1 | NAME,ID,COST,TYPE,POWER,TOUGHNESS,ORACLE,SET,RARITY,CTYPE,COUNT,LOCATION,OWNERSHIP,COMMENT,PRICE,COST,DBPRICE,RATING,ARTIST,COLLNUM,SPECIAL,FORTRADECOUNT,LANG,TEXT,OWN_COUNT,OWN_UNIQUE,ERROR 2 | Alaborn Cavalier,243435,{2}{W}{W},Creature - Human Knight,2,2,"Whenever Alaborn Cavalier attacks, you may tap target creature.",Duel Decks: Knights vs. Dragons,Uncommon,mono,1,Collections/main,true,,0.0,{2}{W}{W},0.0,3.294,Kev Walker,18,,0,,"Whenever Alaborn Cavalier attacks, you may tap target creature.",1,1, 3 | -------------------------------------------------------------------------------- /cv_utils.py: -------------------------------------------------------------------------------- 1 | import numpy 2 | import cv 3 | import cv2 4 | 5 | def img_from_buffer(buffer): 6 | np_arr = numpy.fromstring(buffer,'uint8') 7 | np_mat = cv2.imdecode(np_arr,0) 8 | return cv.fromarray(np_mat) 9 | 10 | def show_scaled(win, img): 11 | min, max, pt1, pt2 = cv.MinMaxLoc(img) 12 | cols, rows = cv.GetSize(img) 13 | tmp = cv.CreateMat(rows, cols,cv.CV_32FC1) 14 | cv.Scale(img, tmp, 1.0/(max-min), 1.0*(-min)/(max-min)) 15 | cv.ShowImage(win,tmp) 16 | 17 | def float_version(img): 18 | tmp = cv.CreateImage( cv.GetSize(img), 32, 1) 19 | cv.ConvertScale(img, tmp, 1/255.0) 20 | return tmp 21 | 22 | def sum_squared(img1, img2): 23 | tmp = cv.CreateImage(cv.GetSize(img1), 8,1) 24 | cv.Sub(img1,img2,tmp) 25 | cv.Pow(tmp,tmp,2.0) 26 | return cv.Sum(tmp)[0] 27 | 28 | def ccoeff_normed(img1, img2): 29 | size = cv.GetSize(img1) 30 | tmp1 = float_version(img1) 31 | tmp2 = float_version(img2) 32 | 33 | cv.SubS(tmp1, cv.Avg(tmp1), tmp1) 34 | cv.SubS(tmp2, cv.Avg(tmp2), tmp2) 35 | 36 | norm1 = cv.CloneImage(tmp1) 37 | norm2 = cv.CloneImage(tmp2) 38 | cv.Pow(tmp1, norm1, 2.0) 39 | cv.Pow(tmp2, norm2, 2.0) 40 | 41 | #cv.Mul(tmp1, tmp2, tmp1) 42 | 43 | return cv.DotProduct(tmp1, tmp2) / (cv.Sum(norm1)[0]*cv.Sum(norm2)[0])**0.5 44 | 45 | def clone_image(img): 46 | return cv.CloneImage(img) 47 | 48 | def overlay_text_on_image(img,text,font,pos=(1,24),color=(255,255,255)): 49 | x = pos[0] 50 | y = pos[1] 51 | chunk = 100 52 | line = text[0:chunk] 53 | length = len(text) 54 | pos = chunk 55 | 56 | while True: 57 | cv.PutText(img, "%s" % line, (x,y), font, color) 58 | if pos >= length: 59 | break; 60 | line = text[pos:(pos+chunk)] 61 | pos = pos + chunk 62 | y = y + 24 63 | 64 | def create_dummy_image(img): 65 | return cv.CreateImage(cv.GetSize(img), 8,1) 66 | 67 | def flip_image(img): 68 | flipped = img 69 | cv.Flip(img, flipped, -1) 70 | return flipped 71 | 72 | def to_gray_image(img): 73 | gray = create_dummy_image(img) 74 | cv.CvtColor(img, gray, cv.CV_RGB2GRAY) 75 | return gray 76 | 77 | 78 | -------------------------------------------------------------------------------- /misc/magic_assistant_format/abbrev_to_full.csv: -------------------------------------------------------------------------------- 1 | 10,10-th Edition 2 | 4,4-th Edition 3 | 5,5-th Edition 4 | 6,6-th Edition 5 | 7,7-th Edition 6 | 8,8-th Edition 7 | 9,9-th Edition 8 | A,Alpha 9 | AL,Alliances 10 | ALA,Shards of Alara 11 | AN,Arabian Nights 12 | AP,Apocalypse 13 | AQ,Antiquities 14 | ARB,Alara Reborn 15 | ARC,Archmage 16 | AS,Astral 17 | AT,Anthologies 18 | AVG,Ajani VS Nicol Bolas 19 | AVR,Avacyn Restored 20 | B,Beta 21 | BD,Beatdown 22 | BOK,Betrayers of Kamigawa 23 | BR,Battle Royale 24 | BT,Box Topper 25 | CEI,Collector's Edition - International 26 | CON,Conflux 27 | CH,Chronicles 28 | CMA,Commander's Arsenal 29 | CMD,Commander 30 | CSP,Coldsnap 31 | COK,Champions of Kamigawa 32 | DDF,Elspeth VS Tezzeret 33 | DDI,Venser VS Koth 34 | DDJ,Izzet VS Golgari 35 | DDK,Sorin VS Tibalt 36 | DGM,Dragon's Maze 37 | DK,The Dark 38 | DKA,Dark Ascension 39 | DM,Deckmasters 40 | DPA,Duels of the Planeswalkers 41 | DRB,From the Vault: Dragons 42 | DS,Darksteel 43 | DIS,Dissension 44 | DVD,Divine VS Demonic 45 | EVE,Eventide 46 | EVG,Elves VS Goblins 47 | EX,Exodus 48 | FD,Fifth Dawn 49 | FE,Fallen Empires 50 | FUT,Future Sight 51 | FVE,From the Vault: Exiled 52 | FVR,From the Vault: Relics 53 | GEA,Magic Gear 54 | GPT,Guildpact 55 | GTC,Gatecrash 56 | GVL,Garruk VS Liliana 57 | HL,Homelands 58 | IA,Ice Age 59 | IN,Invasion 60 | INT,Introductory 61 | ISD,Innistrad 62 | JU,Judgment 63 | JVC,Jace VS Chandra 64 | LE,Legions 65 | LG,Legends 66 | LWN,Lorwyn 67 | M10,Magic 2010 68 | M11,Magic 2011 69 | M12,Magic 2012 70 | M13,Magic 2013 71 | M14,Magic 2014 72 | ME2,Masters Edition II 73 | ME3,Masters Edition III 74 | ME4,Masters Edition IV 75 | MBS,Mirrodin Besieged 76 | MED,Masters Edition 77 | MI,Mirage 78 | MM,Mercadian Masques 79 | MMA,Modern Masters 80 | MOR,Morningtide 81 | MR,Mirrodin 82 | NE,Nemesis 83 | NPH,New Phyrexia 84 | OD,Odyssey 85 | ON,Onslaught 86 | OS,9x12 Cards aka Oversized 87 | P2,Portal Second Age 88 | P3,Portal Three Kingdoms 89 | PAC,Packs & Boxes 90 | PC2,Planechase (2012 Edition) 91 | PCH,Planechase 92 | PD2,Premium Deck Series: File and Lightning 93 | PD3,Premium Deck Series: Graveborn 94 | PDS,Premium Deck Series: Slivers 95 | PSH,Shadowmoor 96 | PS,Planeshift 97 | PLC,Planar Chaos 98 | PT,Portal 99 | PY,Prophecy 100 | PVC,Phyrexia VS The Coalition 101 | R,Revised 102 | R1,Renaissance (French) 103 | R2,Renaissance (Italian) 104 | R3,Renaissance (German) 105 | RAV,Ravnica: City of Guilds 106 | ROE,Rise of the Eldrazi 107 | RTR,Return to Ravnica 108 | S2,Starter 2000 109 | SC,Scourge 110 | SH,Stronghold 111 | SM,Summer Magic 112 | SОK,Saviors of Kamigawa 113 | SОM,Scars of Mirrodin 114 | ST,Starter 1999 115 | TBA,Knights VS Dragons 116 | TE,Tempest 117 | TO,Torment 118 | TSP,Time Spiral 119 | U,Unlimited 120 | UD,Urza's Destiny 121 | UG,Unglued 122 | UH,Unhinged 123 | UL,Urza's Legacy 124 | US,Urza's Saga 125 | V11,From the Vault: Legends 126 | V12,From the Vault: Realms 127 | VG,"Vanguard, MTGO Vanguard" 128 | VI,Visions 129 | WL,Weatherlight 130 | WWK,Worldwake 131 | ZEN,Zendikar 132 | -------------------------------------------------------------------------------- /detect_card.py: -------------------------------------------------------------------------------- 1 | import cv 2 | import math 3 | import sys 4 | 5 | 6 | def longest_lines(hull): 7 | l = len(hull) 8 | lines = [0] * l 9 | for n in xrange(l): 10 | x1, y1 = hull[n] 11 | x2, y2 = hull[(n+1) % l] 12 | lines[n] = { 13 | 'c1': (x1, y1), 14 | 'c2': (x2, y2), 15 | 'len': ( (x2-x1)**2 + (y2-y1)**2 ) ** 0.5, 16 | 'angle': math.atan2(y2 - y1, x2-x1), 17 | } 18 | #make straight-ish lines actually straight 19 | n = 0 20 | while n+1 < len(lines): 21 | l1 = lines[n] 22 | l2 = lines[(n+1) % len(lines)] 23 | if abs(l1['angle'] - l2['angle']) / (math.pi*2) < 0.0027: 24 | x1, y1 = c1 = l1['c1'] 25 | x2, y2 = c2 = l2['c2'] 26 | lines[n] = { 27 | 'c1': c1, 28 | 'c2': c2, 29 | 'len': ( (x2-x1)**2 + (y2-y1)**2 ) ** 0.5, 30 | 'angle': math.atan2(y2 - y1, x2-x1), 31 | } 32 | del lines[n+1] 33 | else: 34 | n += 1 35 | 36 | lines.sort(key = lambda l: -l['len']) 37 | return lines 38 | 39 | def line_intersect(s1, s2): 40 | #just copied from wikipedia :) 41 | x1, y1 = s1['c1'] 42 | x2, y2 = s1['c2'] 43 | x3, y3 = s2['c1'] 44 | x4, y4 = s2['c2'] 45 | 46 | denom = (x1-x2)*(y3-y4) - (y1-y2)*(x3-x4) 47 | if denom == 0: 48 | return None 49 | x = ((x1*y2 - y1*x2)*(x3-x4) - (x1-x2)*(x3*y4 - y3*x4)) / float(denom) 50 | y = ((x1*y2 - y1*x2)*(y3-y4) - (y1-y2)*(x3*y4 - y3*x4)) / float(denom) 51 | 52 | return (int(round(x)),int(round(y))) 53 | 54 | 55 | def detect_card(grey_image, grey_base, thresh=100): 56 | diff = cv.CloneImage(grey_image) 57 | cv.AbsDiff(grey_image, grey_base, diff) 58 | 59 | edges = cv.CloneImage(grey_image) 60 | cv.Canny(diff, edges, thresh, thresh) 61 | 62 | contours = cv.FindContours(edges, cv.CreateMemStorage(0)) 63 | edge_pts = [] 64 | c = contours 65 | while c is not None: 66 | if len(c) > 10: 67 | edge_pts += list(c) 68 | if len(c) == 0: #'cus opencv is buggy and dumb 69 | break 70 | c = c.h_next() 71 | 72 | if len(edge_pts) == 0: 73 | return None 74 | hull = cv.ConvexHull2(edge_pts, cv.CreateMemStorage(0), cv.CV_CLOCKWISE, 1) 75 | lines = longest_lines(hull) 76 | perim = sum(l['len'] for l in lines) 77 | #print perim 78 | 79 | #likely to be a card. . . 80 | #if abs(perim - 1200) < 160: 81 | if perim > 700: 82 | #extrapolate the rectangle from the hull. 83 | #if our 4 longest lines make up 80% of our perimiter 84 | l = sum(l['len'] for l in lines[0:4]) 85 | #print "l = ",l 86 | if l / perim >0.7: 87 | #we probably have a high-quality rectangle. extrapolate! 88 | sides = sorted(lines[0:4], key = lambda x: x['angle']) 89 | #sides are in _some_ clockwise order. 90 | corners = [None]*4 91 | 92 | # TODO: figure out why we can get an IndexError on xrange(4) 93 | try: 94 | for n in xrange(4): 95 | corners[n] = line_intersect(sides[n], sides[(n+1) % 4]) 96 | if not all(corners): 97 | return None 98 | except IndexError: 99 | print >> sys.stderr, "detect_card() IndexError(), we should track down why this happens exactly" 100 | return None 101 | #rotate corners so top-left corner is first. 102 | #that way we're clockwise from top-left 103 | sorted_x = sorted(c[0] for c in corners) 104 | sorted_y = sorted(c[1] for c in corners) 105 | top_left = None 106 | for index, (x,y) in enumerate(corners): 107 | if sorted_x.index(x) < 2 and sorted_y.index(y) < 2: 108 | top_left = index 109 | if top_left is None: 110 | return None 111 | #return rotated list 112 | return corners[top_left:] + corners[:top_left] 113 | 114 | return None 115 | -------------------------------------------------------------------------------- /misc/magic_assistant_format/mapping: -------------------------------------------------------------------------------- 1 | '10': '10-th Edition', 2 | '4': '4-th Edition', 3 | '5': '5-th Edition', 4 | '6': '6-th Edition', 5 | '7': '7-th Edition', 6 | '8': '8-th Edition', 7 | '9': '9-th Edition', 8 | 'A': 'Alpha', 9 | 'AL': 'Alliances', 10 | 'ALA': 'Shards of Alara', 11 | 'AN': 'Arabian Nights', 12 | 'AP': 'Apocalypse', 13 | 'AQ': 'Antiquities', 14 | 'ARB': 'Alara Reborn', 15 | 'ARC': 'Archmage', 16 | 'AS': 'Astral', 17 | 'AT': 'Anthologies', 18 | 'AVG': 'Ajani VS Nicol Bolas', 19 | 'AVR': 'Avacyn Restored', 20 | 'B': 'Beta', 21 | 'BD': 'Beatdown', 22 | 'BOK': 'Betrayers of Kamigawa', 23 | 'BR': 'Battle Royale', 24 | 'BT': 'Box Topper', 25 | 'CEI': 'Collector's Edition - International', 26 | 'CON': 'Conflux', 27 | 'CH': 'Chronicles', 28 | 'CMA': 'Commander's Arsenal', 29 | 'CMD': 'Commander', 30 | 'CSP': 'Coldsnap', 31 | 'COK': 'Champions of Kamigawa', 32 | 'DDF': 'Elspeth VS Tezzeret', 33 | 'DDI': 'Venser VS Koth', 34 | 'DDJ': 'Izzet VS Golgari', 35 | 'DDK': 'Sorin VS Tibalt', 36 | 'DGM': 'Dragon's Maze', 37 | 'DK': 'The Dark', 38 | 'DKA': 'Dark Ascension', 39 | 'DM': 'Deckmasters', 40 | 'DPA': 'Duels of the Planeswalkers', 41 | 'DRB': 'From the Vault: Dragons', 42 | 'DS': 'Darksteel', 43 | 'DIS': 'Dissension', 44 | 'DVD': 'Divine VS Demonic', 45 | 'EVE': 'Eventide', 46 | 'EVG': 'Elves VS Goblins', 47 | 'EX': 'Exodus', 48 | 'FD': 'Fifth Dawn', 49 | 'FE': 'Fallen Empires', 50 | 'FUT': 'Future Sight', 51 | 'FVE': 'From the Vault: Exiled', 52 | 'FVR': 'From the Vault: Relics', 53 | 'GEA': 'Magic Gear', 54 | 'GPT': 'Guildpact', 55 | 'GTC': 'Gatecrash', 56 | 'GVL': 'Garruk VS Liliana', 57 | 'HL': 'Homelands', 58 | 'IA': 'Ice Age', 59 | 'IN': 'Invasion', 60 | 'INT': 'Introductory', 61 | 'ISD': 'Innistrad', 62 | 'JU': 'Judgment', 63 | 'JVC': 'Jace VS Chandra', 64 | 'LE': 'Legions', 65 | 'LG': 'Legends', 66 | 'LWN': 'Lorwyn', 67 | 'M10': 'Magic 2010', 68 | 'M11': 'Magic 2011', 69 | 'M12': 'Magic 2012', 70 | 'M13': 'Magic 2013', 71 | 'M14': 'Magic 2014', 72 | 'ME2': 'Masters Edition II', 73 | 'ME3': 'Masters Edition III', 74 | 'ME4': 'Masters Edition IV', 75 | 'MBS': 'Mirrodin Besieged', 76 | 'MED': 'Masters Edition', 77 | 'MI': 'Mirage', 78 | 'MM': 'Mercadian Masques', 79 | 'MMA': 'Modern Masters', 80 | 'MOR': 'Morningtide', 81 | 'MR': 'Mirrodin', 82 | 'NE': 'Nemesis', 83 | 'NPH': 'New Phyrexia', 84 | 'OD': 'Odyssey', 85 | 'ON': 'Onslaught', 86 | 'OS': '9x12 Cards aka Oversized', 87 | 'P2': 'Portal Second Age', 88 | 'P3': 'Portal Three Kingdoms', 89 | 'PAC': 'Packs & Boxes', 90 | 'PC2': 'Planechase (2012 Edition)', 91 | 'PCH': 'Planechase', 92 | 'PD2': 'Premium Deck Series: File and Lightning', 93 | 'PD3': 'Premium Deck Series: Graveborn', 94 | 'PDS': 'Premium Deck Series: Slivers', 95 | 'PSH': 'Shadowmoor', 96 | 'PS': 'Planeshift', 97 | 'PLC': 'Planar Chaos', 98 | 'PT': 'Portal', 99 | 'PY': 'Prophecy', 100 | 'PVC': 'Phyrexia VS The Coalition', 101 | 'R': 'Revised', 102 | 'R1': 'Renaissance (French)', 103 | 'R2': 'Renaissance (Italian)', 104 | 'R3': 'Renaissance (German)', 105 | 'RAV': 'Ravnica: City of Guilds', 106 | 'ROE': 'Rise of the Eldrazi', 107 | 'RTR': 'Return to Ravnica', 108 | 'S2': 'Starter 2000', 109 | 'SC': 'Scourge', 110 | 'SH': 'Stronghold', 111 | 'SM': 'Summer Magic', 112 | 'SОK': 'Saviors of Kamigawa', 113 | 'SОM': 'Scars of Mirrodin', 114 | 'ST': 'Starter 1999', 115 | 'TBA': 'Knights VS Dragons', 116 | 'TE': 'Tempest', 117 | 'TO': 'Torment', 118 | 'TSP': 'Time Spiral', 119 | 'U': 'Unlimited', 120 | 'UD': 'Urza's Destiny', 121 | 'UG': 'Unglued', 122 | 'UH': 'Unhinged', 123 | 'UL': 'Urza's Legacy', 124 | 'US': 'Urza's Saga', 125 | 'V11': 'From the Vault: Legends', 126 | 'V12': 'From the Vault: Realms', 127 | 'VG': '"Vanguard', 128 | 'VI': 'Visions', 129 | 'WL': 'Weatherlight', 130 | 'WWK': 'Worldwake', 131 | 'ZEN': 'Zendikar', 132 | -------------------------------------------------------------------------------- /cache.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/python 2 | import cv 3 | import scan_card 4 | from scan_card import ScanCard, overlay_text_on_image 5 | import match_card 6 | import os 7 | 8 | BASE_SET_DIR = "/home/meyers/Data/magic_sets" 9 | CACHE_DIR = BASE_SET_DIR 10 | CAPTURE_NUM = 1 11 | font = cv.InitFont(cv.CV_FONT_HERSHEY_COMPLEX, .75, .75, 0, 2) 12 | 13 | # Load the known sets 14 | SETS = [ 15 | "MM", "From the Vault: Exiled", "Unhinged", "M13", "New Phyrexia", "DDJ", "Starter 2000", "Premium Deck Series: Fire and Lightning", "CH", "R", 16 | "ON", "Future Sight", "Shards of Alara", "PT", "Ravnica: City of Guilds", "5E", "UD", "HL", "U", "B", 17 | "PC2", "Magic 2010", "Beatdown Box Set", "US", "Lorwyn", "JU", "Mirrodin Besieged", "Dissension", "From the Vault: Legends", "From the Vault: Relics", 18 | "9E", "Innistrad", "Premium Deck Series: Slivers", "From the Vault: Dragons", "BRB", "Planechase", "Premium Deck Series: Graveborn", "P3", "AQ", "A", 19 | "Duel Decks: Elves vs. Goblins", "Planar Chaos", "Worldwake", "Eventide", "4E", "SC", "Magic 2012", "IN", "Magic 2011", "VI", 20 | "CMD", "UG", "GP", "Duel Decks: Jace vs. Chandra", "DGM", "DS", "NE", "LE", "MR", "RTR", 21 | "Dark Ascension", "Time Spiral Timeshifted", "Alara Reborn", "Duel Decks: Venser vs. Koth", "MI", "Duel Decks: Elspeth vs. Tezzeret", "Rise of the Eldrazi", "AP", "CM1", "CFX", 22 | "6E", "DK", "Time Spiral", "Duel Decks: Knights vs. Dragons", "Champions of Kamigawa", "ST", "PS", "FD", "Duel Decks: Divine vs. Demonic", "SH", 23 | "CS", "Saviors of Kamigawa", "AL", "EX", "FE", "Morningtide", "Scars of Mirrodin", "LG", "7E", "GTC", 24 | "UL", "TE", "Duel Decks: Ajani vs. Nicol Bolas", "IA", "AN", "Duel Decks: Phyrexia vs. the Coalition", "OD", "V12", "P2", "Zendikar", 25 | "TO", "Shadowmoor", "Betrayers of Kamigawa", "WL", "Tenth Edition", "8E", "Duel Decks: Garruk vs. Liliana", "PY", "Archenemy", "DDK", 26 | "Avacyn Restored", "MMA" 27 | ] 28 | SETS = [ 29 | "Innistrad" 30 | ] 31 | SETS = [ 32 | "S00", "MM", "ROE", "M13", "DDJ", "ALA", "DDC", "M10", "CH", "DDI", 33 | "R", "DRB", "ON", "ISD", "PT", "5E", "UD", "HL", "U", "B", 34 | "PC2", "US", "JU", "V10", "DDE", "FUT", "WWK", "9E", "DDH", "BRB", 35 | "AVR", "P3", "EVG", "M12", "AQ", "A", "SHM", "M11", "V09", "4E", 36 | "ARC", "SC", "IN", "DIS", "ZEN", "VI", "SOK", "CMD", "RAV", "UNH", 37 | "UG", "GP", "PLC", "DGM", "DS", "V11", "NE", "LE", "MR", "RTR", 38 | "NPH", "H09", "TSP", "MI", "PD3", "AP", "CM1", "CFX", "6E", "DK", 39 | "HOP", "SOM", "ST", "PS", "DD2", "FD", "DKA", "DDG", "ARB", "SH", 40 | "CS", "PD2", "10E", "AL", "EX", "FE", "BOK", "BD", "MBS", "DDF", 41 | "EVE", "LG", "7E", "GTC", "UL", "TE", "DDD", "IA", "AN", "OD", 42 | "V12", "P2", "TO", "TSB", "WL", "LRW", "CHK", "8E", "MOR", "PY", 43 | "DDK", "MMA" 44 | ] 45 | known = match_card.load_sets(BASE_SET_DIR, SETS) 46 | 47 | # Cache for some reason 48 | cache = match_card.GradientCache(CACHE_DIR) 49 | 50 | # Open the camera stream 51 | #cam = cv.CreateCameraCapture(-1) 52 | cam = cv.CreateCameraCapture(1) 53 | 54 | scanCard = ScanCard(cam) 55 | 56 | # win, snapshot, match, background 57 | scan_card.setup_windows() 58 | 59 | match_pending = False 60 | 61 | while True: 62 | ''' 63 | key_code = cv.WaitKey(10) 64 | if key_code == 98: 65 | background = grab_background(cam) 66 | ''' 67 | 68 | capture = scanCard.check_for_card() 69 | if capture is not None: 70 | print "Card captured, proceeding to find a match" 71 | (card, set_name), is_sure = match_card.match_card(capture, known, cache) 72 | 73 | # Display matched information 74 | if is_sure == True: 75 | print "\tMatch Found!" 76 | #card = unicode(card.decode('UTF-8')) 77 | 78 | path = os.path.join(BASE_SET_DIR, set_name, card+".full.jpg") 79 | try: 80 | tmp = cv.LoadImage(path) 81 | overlay_text_on_image(tmp, "%s - %s" % (card, set_name), font) 82 | cv.ShowImage("match", tmp) 83 | cv.ResizeWindow("match", 800, 600) 84 | match_pending = True 85 | except IOError: 86 | print "test.py Could not load card %s" % (path) 87 | 88 | else: 89 | print "\tMatch not found" 90 | 91 | 92 | scanCard.display_snapshot() 93 | key_code = cv.WaitKey(10) 94 | if key_code == 114: 95 | scanCard.update_background() 96 | scanCard.display_background() 97 | print "Updated background image" 98 | 99 | -------------------------------------------------------------------------------- /README.mediawiki: -------------------------------------------------------------------------------- 1 | == Credit == 2 | Code mostly taken from card_scan by YenTheFirst. Chose not fork because of the amount of code change. 3 | == Overview == 4 |

Magic the Gathering card recognition for purposes of quickly digitizing your inventory.

5 | 6 | === Features === 7 | 8 | * Uses image recognition software opencv to quickly identify Magic the Gathering Cards 9 | * Outputs recognized cards in Magic Workstation csv format 10 | * Says the name of the card using Text-to-Speech festival 11 | * Runs in real-time 12 | 13 | == Screenshots == 14 | 15 | == Dependency == 16 | * a camera 17 | * python, opencv, numpy, SQLAlchemy, Flask, elixer 18 | 
sudo apt-get install python-opencv
19 | sudo pip install -r requirements.txt
20 |
21 | * festival 22 | 
sudo apt-get install festival
23 | === MTG Set Images === 24 | * Gatherer Downloader 25 | 
apt-get install wine
26 | unzip GathererDownloader*.zip
27 | 28 | == Setup == 29 | 30 | One variable is required to be set that denotes the location of the Magic the Gathering cards you wish to index against. 31 | ;BASE_SET_DIR/ 32 | :variable in test.py root directory of the images. 33 | 34 | === MTG Set Images === 35 | 36 |

The matching algorithm is designed to find a matching card of a taken image. Thus, we need a database of cards to match against.

37 | 38 | ==== File Structure ==== 39 | 40 | ;BASE_SET_DIR/ 41 | :variable in test.py root directory of the images. 42 | ;BASE_SET_DIR/ 43 | :where set_name_abbreviation is a unique identifier for the set comprised of letters and numbers. 44 | ;BASE_SET_DIR//.full.jpg 45 | :where card_name is unique within a given set. Note that all the cards end in full.jpg 46 | 47 | ==== Gatherer Downloader ==== 48 |

Automates downloading of full Magic the Gathering sets, both card listings and card images.

49 |
50 |

Start it

51 | 
wine ./GathererDownloader.exe
52 |

Download the card database for the sets you wish to recognize/inventory. Note the "And all Sets After" option box for easily downloading multiple sets.

53 | 54 |

Now we will get the images associated with the cards but first, because we have a particular file directory structure, we need to ensure the naming convention is correct.

55 |

Click on Options -> Image Formats. Select Magic Workstation from the dropdown box and click Load Defaults. Then click Ok to save.

56 | 57 |

Click Download Card Images and select the directory you have set BASE_SET_DIR.

58 | 59 | == Running == 60 | 
./test.py
61 | Note that matches cards are appended to the csv file configured via CSV_FILE in the file test.py 62 | === Controls === 63 | Note that the background should be a solid color. I used a piece of white printer paper. 64 | * r 65 | *; refresh the background 66 | * b 67 | *; save found match to csv database 68 | 69 | 70 | == Common Problems == 71 | test.py invalid camera. 72 | 
OpenCV Error: Bad argument (Array should be CvMat or IplImage) in cvGetSize, file /build/buildd/opencv-2.3.1/modules/core/src/array.cpp, line 1238
73 | Traceback (most recent call last):
74 |   File "./test.py", line 87, in 
75 |     capture = scanCard.check_for_card()
76 |   File "/home/meyers/Dropbox/Code/python_card_scan/scan_card.py", line 173, in check_for_card
77 |     self.grab_frame()
78 |   File "/home/meyers/Dropbox/Code/python_card_scan/scan_card.py", line 119, in grab_frame
79 |     frame_gray = to_gray_image(frame)
80 |   File "/home/meyers/Dropbox/Code/python_card_scan/cv_utils.py", line 73, in to_gray_image
81 |     gray = create_dummy_image(img)
82 |   File "/home/meyers/Dropbox/Code/python_card_scan/cv_utils.py", line 65, in create_dummy_image
83 |     return cv.CreateImage(cv.GetSize(img), 8,1)
84 | cv2.error: Array should be CvMat or IplImage
85 |
86 | 87 |

Adding new magic sets and cards to the database to match against may require deleting the analyzed cache SET_CACHE_FILE in test.py

88 | 89 |

90 | 91 | 92 | 93 | 94 | 95 | -------------------------------------------------------------------------------- /test.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/python 2 | import time 3 | import cv 4 | import scan_card 5 | from scan_card import ScanCard, overlay_text_on_image 6 | import match_card 7 | from match_card import MatchCard 8 | import os 9 | import sys 10 | from setcache import save_set_cache, load_set_cache 11 | from text2speech import TTS 12 | from magicassistantcsv import MagicAssistantCSV 13 | import pickle 14 | 15 | BASE_SET_DIR = "/home/meyers/Software/card_scan/data/win_cards/" 16 | SET_CACHE_FILE = "data/set_cache" 17 | CSV_FILE = "data/inventory.csv" 18 | 19 | 20 | # Load the known sets 21 | SETS = [ 22 | "MM", "From the Vault: Exiled", "Unhinged", "M13", "New Phyrexia", "DDJ", "Starter 2000", "Premium Deck Series: Fire and Lightning", "CH", "R", 23 | "ON", "Future Sight", "Shards of Alara", "PT", "Ravnica: City of Guilds", "5E", "UD", "HL", "U", "B", 24 | "PC2", "Magic 2010", "Beatdown Box Set", "US", "Lorwyn", "JU", "Mirrodin Besieged", "Dissension", "From the Vault: Legends", "From the Vault: Relics", 25 | "9E", "Innistrad", "Premium Deck Series: Slivers", "From the Vault: Dragons", "BRB", "Planechase", "Premium Deck Series: Graveborn", "P3", "AQ", "A", 26 | "Duel Decks: Elves vs. Goblins", "Planar Chaos", "Worldwake", "Eventide", "4E", "SC", "Magic 2012", "IN", "Magic 2011", "VI", 27 | "CMD", "UG", "GP", "Duel Decks: Jace vs. Chandra", "DGM", "DS", "NE", "LE", "MR", "RTR", 28 | "Dark Ascension", "Time Spiral Timeshifted", "Alara Reborn", "Duel Decks: Venser vs. Koth", "MI", "Duel Decks: Elspeth vs. Tezzeret", "Rise of the Eldrazi", "AP", "CM1", "CFX", 29 | "6E", "DK", "Time Spiral", "Duel Decks: Knights vs. Dragons", "Champions of Kamigawa", "ST", "PS", "FD", "Duel Decks: Divine vs. Demonic", "SH", 30 | "CS", "Saviors of Kamigawa", "AL", "EX", "FE", "Morningtide", "Scars of Mirrodin", "LG", "7E", "GTC", 31 | "UL", "TE", "Duel Decks: Ajani vs. Nicol Bolas", "IA", "AN", "Duel Decks: Phyrexia vs. the Coalition", "OD", "V12", "P2", "Zendikar", 32 | "TO", "Shadowmoor", "Betrayers of Kamigawa", "WL", "Tenth Edition", "8E", "Duel Decks: Garruk vs. Liliana", "PY", "Archenemy", "DDK", 33 | "Avacyn Restored", "MMA" 34 | ] 35 | SETS = [ 36 | "Innistrad" 37 | ] 38 | SETS = [ 39 | "S00", "MM", "ROE", "M13", "DDJ", "ALA", "DDC", "M10", "CH", "DDI", 40 | "R", "DRB", "ON", "ISD", "PT", "5E", "UD", "HL", "U", "B", 41 | "PC2", "US", "JU", "V10", "DDE", "FUT", "WWK", "9E", "DDH", "BRB", 42 | "AVR", "P3", "EVG", "M12", "AQ", "A", "SHM", "M11", "V09", "4E", 43 | "ARC", "SC", "IN", "DIS", "ZEN", "VI", "SOK", "CMD", "RAV", "UNH", 44 | "UG", "GP", "PLC", "DGM", "DS", "V11", "NE", "LE", "MR", "RTR", 45 | "NPH", "H09", "TSP", "MI", "PD3", "AP", "CM1", "CFX", "6E", "DK", 46 | "HOP", "SOM", "ST", "PS", "DD2", "FD", "DKA", "DDG", "ARB", "SH", 47 | "CS", "PD2", "10E", "AL", "EX", "FE", "BOK", "BD", "MBS", "DDF", 48 | "EVE", "LG", "7E", "GTC", "UL", "TE", "DDD", "IA", "AN", "OD", 49 | "V12", "P2", "TO", "TSB", "WL", "LRW", "CHK", "8E", "MOR", "PY", 50 | "DDK", "MMA" 51 | ] 52 | 53 | # Load the sets 54 | known = load_set_cache(SET_CACHE_FILE) 55 | if known is None: 56 | print "Processing magic sets" 57 | known = match_card.load_sets(BASE_SET_DIR, SETS) 58 | print "Saving sets to cache file %s" % (SET_CACHE_FILE) 59 | save_set_cache(SET_CACHE_FILE, known) 60 | print "Magic sets loaded and ready" 61 | 62 | cam = cv.CreateCameraCapture(-1) # Camera, -1 indicates autofind 63 | #cam = cv.CreateCameraCapture(1) 64 | # TODO: detect failed to load camera, CAN NOT simply check if cam is None 65 | 66 | scan_card.setup_windows() # win, snapshot, match, background 67 | tts = TTS() # Load test to speech festival 68 | cache = match_card.GradientCache(BASE_SET_DIR) # memory cache 69 | scanCard = ScanCard(cam) 70 | matchCard = MatchCard(BASE_SET_DIR) 71 | csv = MagicAssistantCSV(CSV_FILE, append=True) 72 | 73 | while True: 74 | capture = scanCard.check_for_card() 75 | if capture is not None: 76 | print "Card captured, proceeding to find a match" 77 | (card, set_name), is_sure = match_card.match_card(capture, known, cache) 78 | 79 | # Display matched information 80 | if is_sure == True: 81 | print "\tMatch Found!" 82 | res = matchCard.set(set_name, card) 83 | if res == True: 84 | matchCard.display() 85 | tts.say(card) 86 | else: 87 | tts.say("INVALID") 88 | else: 89 | print "\tMatch not found" 90 | tts.say("DINK") 91 | 92 | scanCard.display_snapshot() 93 | 94 | # Refresh background image ? 95 | key_code = cv.WaitKey(10) 96 | if key_code == 114: 97 | scanCard.update_background() 98 | scanCard.display_background() 99 | print "Updated background image" 100 | elif key_code == 98: #b 101 | csv.output_card(matchCard.get_set_name(), matchCard.get_card_name()) 102 | tts.say("ADDED") 103 | 104 | csv.close() 105 | -------------------------------------------------------------------------------- /magicassistantcsv.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/python 2 | import csv 3 | import os 4 | 5 | abbrev2full = { 6 | '10E': '10-th Edition', 7 | '4E': '4-th Edition', 8 | '5E': '5-th Edition', 9 | '6E': '6-th Edition', 10 | '7E': '7-th Edition', 11 | '8E': '8-th Edition', 12 | '9E': '9-th Edition', 13 | 'A': 'Alpha', 14 | 'AL': 'Alliances', 15 | 'ALA': 'Shards of Alara', 16 | 'AN': 'Arabian Nights', 17 | 'AP': 'Apocalypse', 18 | 'AQ': 'Antiquities', 19 | 'ARB': 'Alara Reborn', 20 | 'ARC': 'Archmage', 21 | 'AS': 'Astral', 22 | 'AT': 'Anthologies', 23 | 'AVG': 'Ajani VS Nicol Bolas', 24 | 'AVR': 'Avacyn Restored', 25 | 'B': 'Beta', 26 | 'BD': 'Beatdown', 27 | 'BOK': 'Betrayers of Kamigawa', 28 | 'BR': 'Battle Royale', 29 | 'BT': 'Box Topper', 30 | 'CEI': 'Collector\'s Edition - International', 31 | 'CON': 'Conflux', 32 | 'CH': 'Chronicles', 33 | 'CMA': 'Commander\'s Arsenal', 34 | 'CMD': 'Commander', 35 | 'CSP': 'Coldsnap', 36 | 'COK': 'Champions of Kamigawa', 37 | 'DDF': 'Elspeth VS Tezzeret', 38 | 'DDI': 'Venser VS Koth', 39 | 'DDJ': 'Izzet VS Golgari', 40 | 'DDK': 'Sorin VS Tibalt', 41 | 'DGM': 'Dragon\'s Maze', 42 | 'DK': 'The Dark', 43 | 'DKA': 'Dark Ascension', 44 | 'DM': 'Deckmasters', 45 | 'DPA': 'Duels of the Planeswalkers', 46 | 'DRB': 'From the Vault: Dragons', 47 | 'DS': 'Darksteel', 48 | 'DIS': 'Dissension', 49 | 'DVD': 'Divine VS Demonic', 50 | 'EVE': 'Eventide', 51 | 'EVG': 'Elves VS Goblins', 52 | 'EX': 'Exodus', 53 | 'FD': 'Fifth Dawn', 54 | 'FE': 'Fallen Empires', 55 | 'FUT': 'Future Sight', 56 | 'FVE': 'From the Vault: Exiled', 57 | 'FVR': 'From the Vault: Relics', 58 | 'GEA': 'Magic Gear', 59 | 'GPT': 'Guildpact', 60 | 'GTC': 'Gatecrash', 61 | 'GVL': 'Garruk VS Liliana', 62 | 'HL': 'Homelands', 63 | 'IA': 'Ice Age', 64 | 'IN': 'Invasion', 65 | 'INT': 'Introductory', 66 | 'ISD': 'Innistrad', 67 | 'JU': 'Judgment', 68 | 'JVC': 'Jace VS Chandra', 69 | 'LE': 'Legions', 70 | 'LG': 'Legends', 71 | 'LWN': 'Lorwyn', 72 | 'M10': 'Magic 2010', 73 | 'M11': 'Magic 2011', 74 | 'M12': 'Magic 2012', 75 | 'M13': 'Magic 2013', 76 | 'M14': 'Magic 2014', 77 | 'ME2': 'Masters Edition II', 78 | 'ME3': 'Masters Edition III', 79 | 'ME4': 'Masters Edition IV', 80 | 'MBS': 'Mirrodin Besieged', 81 | 'MED': 'Masters Edition', 82 | 'MI': 'Mirage', 83 | 'MM': 'Mercadian Masques', 84 | 'MMA': 'Modern Masters', 85 | 'MOR': 'Morningtide', 86 | 'MR': 'Mirrodin', 87 | 'NE': 'Nemesis', 88 | 'NPH': 'New Phyrexia', 89 | 'OD': 'Odyssey', 90 | 'ON': 'Onslaught', 91 | 'OS': '9x12 Cards aka Oversized', 92 | 'P2': 'Portal Second Age', 93 | 'P3': 'Portal Three Kingdoms', 94 | 'PAC': 'Packs & Boxes', 95 | 'PC2': 'Planechase (2012 Edition)', 96 | 'PCH': 'Planechase', 97 | 'PD2': 'Premium Deck Series: File and Lightning', 98 | 'PD3': 'Premium Deck Series: Graveborn', 99 | 'PDS': 'Premium Deck Series: Slivers', 100 | 'PSH': 'Shadowmoor', 101 | 'PS': 'Planeshift', 102 | 'PLC': 'Planar Chaos', 103 | 'PT': 'Portal', 104 | 'PY': 'Prophecy', 105 | 'PVC': 'Phyrexia VS The Coalition', 106 | 'R': 'Revised', 107 | 'R1': 'Renaissance (French)', 108 | 'R2': 'Renaissance (Italian)', 109 | 'R3': 'Renaissance (German)', 110 | 'RAV': 'Ravnica: City of Guilds', 111 | 'ROE': 'Rise of the Eldrazi', 112 | 'RTR': 'Return to Ravnica', 113 | 'S2': 'Starter 2000', 114 | 'SC': 'Scourge', 115 | 'SH': 'Stronghold', 116 | 'SM': 'Summer Magic', 117 | 'SOK': 'Saviors of Kamigawa', 118 | 'SOM': 'Scars of Mirrodin', 119 | 'ST': 'Starter 1999', 120 | 'TBA': 'Knights VS Dragons', 121 | 'TE': 'Tempest', 122 | 'TO': 'Torment', 123 | 'TSP': 'Time Spiral', 124 | 'U': 'Unlimited', 125 | 'UD': 'Urza\'s Destiny', 126 | 'UG': 'Unglued', 127 | 'UH': 'Unhinged', 128 | 'UL': 'Urza\'s Legacy', 129 | 'US': 'Urza\'s Saga', 130 | 'V11': 'From the Vault: Legends', 131 | 'V12': 'From the Vault: Realms', 132 | 'VG': 'Vanguard', 133 | 'VI': 'Visions', 134 | 'WL': 'Weatherlight', 135 | 'WWK': 'Worldwake', 136 | 'ZEN': 'Zendikar', 137 | } 138 | 139 | class MagicAssistantCSV: 140 | ''' 141 | TODO: we assume the header is already written if it's a resume. 142 | Instead, we should verify that assumption 143 | ''' 144 | def __init__(self, file, append=True): 145 | global abbrev2full 146 | self.csvfile = None 147 | self.filename = file 148 | self._header = [ 'NAME','ID','COST','TYPE','POWER','TOUGHNESS','ORACLE','SET','RARITY','CTYPE','COUNT','LOCATION','OWNERSHIP','COMMENT','PRICE','COST','DBPRICE','RATING','ARTIST','COLLNUM','SPECIAL','FORTRADECOUNT','LANG','TEXT','OWN_COUNT','OWN_UNIQUE','ERROR' ] 149 | 150 | exists = True 151 | if append == True: 152 | exists = os.path.isfile(self.filename) 153 | self.csvfile = open(self.filename, 'a+b') 154 | else: 155 | self.csvfile = open(self.filename, 'w+b') 156 | 157 | self.csv = csv.writer(self.csvfile, delimiter=',', quotechar='"', quoting=csv.QUOTE_MINIMAL) 158 | if append == False or exists == False: 159 | self.output_header() 160 | 161 | def output_header(self): 162 | self.csv.writerow(self._header) 163 | 164 | def output_card(self, set_name, card_name): 165 | set_name_full = set_name 166 | if set_name not in abbrev2full: 167 | print "Serious problem, set abbreviation not in full table name, going with the abbreviation" 168 | else: 169 | set_name_full = abbrev2full[set_name] 170 | self.csv.writerow([card_name,'','','','','','',set_name_full,'','','','','','','','','','','','','','','','','','','']) 171 | 172 | def close(self): 173 | self.csvfile.close() 174 | 175 | -------------------------------------------------------------------------------- /scan_card.py: -------------------------------------------------------------------------------- 1 | import math 2 | import cv 3 | import os 4 | import numpy 5 | import cv2 6 | from detect_card import detect_card 7 | from cv_utils import float_version, show_scaled, sum_squared, ccoeff_normed, clone_image, overlay_text_on_image, create_dummy_image, flip_image, to_gray_image 8 | 9 | def get_card(color_capture, corners): 10 | target = [(0,0), (223,0), (223,310), (0,310)] 11 | mat = cv.CreateMat(3,3, cv.CV_32FC1) 12 | cv.GetPerspectiveTransform(corners, target, mat) 13 | warped = cv.CloneImage(color_capture) 14 | cv.WarpPerspective(color_capture, warped, mat) 15 | cv.SetImageROI(warped, (0,0,223,310) ) 16 | return warped 17 | 18 | 19 | def setup_windows(): 20 | cv.NamedWindow('background') 21 | cv.NamedWindow('snapshot') 22 | cv.NamedWindow('main') 23 | cv.NamedWindow('match') 24 | 25 | cv.MoveWindow('snapshot', 750, 550) 26 | cv.MoveWindow('match', 1200, 550) 27 | cv.MoveWindow('background', 50, 500) 28 | cv.WaitKey(10) 29 | #cv.StartWindowThread() 30 | 31 | 32 | def save_captures(num, captures): 33 | dir = "data/capture_%02d" % num 34 | if not os.path.exists(dir): 35 | os.mkdir(dir) 36 | for i, img in enumerate(captures): 37 | path = os.path.join(dir, "card_%04d.png" % i) 38 | if os.path.exists(path): 39 | raise Exception("path %s already exists!" % path) 40 | cv.SaveImage(path, img) 41 | 42 | def cv2array(im): 43 | depth2dtype = { 44 | cv.IPL_DEPTH_8U: 'uint8', 45 | cv.IPL_DEPTH_8S: 'int8', 46 | cv.IPL_DEPTH_16U: 'uint16', 47 | cv.IPL_DEPTH_16S: 'int16', 48 | cv.IPL_DEPTH_32S: 'int32', 49 | cv.IPL_DEPTH_32F: 'float32', 50 | cv.IPL_DEPTH_64F: 'float64', 51 | } 52 | 53 | arrdtype=im.depth 54 | a = numpy.fromstring( 55 | im.tostring(), 56 | dtype=depth2dtype[im.depth], 57 | count=im.width*im.height*im.nChannels) 58 | a.shape = (im.height,im.width,im.nChannels) 59 | return a 60 | 61 | class ScanCard: 62 | def __init__(self, camera): 63 | self.recent_frames_max = 3 64 | self.camera = camera 65 | self.last_frame = None 66 | self.last_frame_flipped = None 67 | self.last_frame_gray = None 68 | self.recent_frames = [] 69 | self.recent_frames_gray = [] 70 | self.snapshot = None 71 | self.background = None 72 | self.background_flipped = None 73 | self.last_frame = None 74 | self.size = None 75 | self.num_pixels = None 76 | self.snapshot = None 77 | self.has_moved = None 78 | self.font = cv.InitFont(cv.CV_FONT_HERSHEY_SIMPLEX, .5, .5) 79 | 80 | def update_snapshot_window(img): 81 | tmp = cv.CloneImage(img) 82 | cv.PutText(tmp, "%s" % (snapshot), (1,24), self.font, (255,255,255)) 83 | cv.ShowImage("snapshot", tmp) 84 | 85 | def grab_frame(self): 86 | frame = cv.QueryFrame(self.camera) 87 | frame_gray = to_gray_image(frame) 88 | frame_flipped = flip_image(frame) 89 | 90 | # Set the size of things if this is the first image we have seen 91 | if self.last_frame is None: 92 | self.size = cv.GetSize(frame) 93 | self.num_pixels = self.size[0]*self.size[1] 94 | 95 | self.recent_frames_gray.append(frame_gray) 96 | self.recent_frames.append(frame) 97 | if len(self.recent_frames) > self.recent_frames_max: 98 | del self.recent_frames[0] 99 | del self.recent_frames_gray[0] 100 | 101 | self.last_frame = clone_image(frame) 102 | self.last_frame_flipped = frame_flipped 103 | self.last_frame_gray = frame_gray 104 | return frame 105 | 106 | 107 | def display_background(self, text=None): 108 | if text is not None: 109 | overlay_text_on_image(self.background_flipped, text, self.font) 110 | cv.ShowImage('background', self.background_flipped) 111 | 112 | def display_live(self, text=None): 113 | if text is not None: 114 | overlay_text_on_image(self.last_frame_flipped, text, self.font) 115 | cv.ShowImage('main', self.last_frame_flipped) 116 | 117 | def display_snapshot(self): 118 | if self.snapshot is not None: 119 | cv.ShowImage('snapshot', self.snapshot) 120 | 121 | def update_background(self, frame=None): 122 | if frame is None: 123 | frame = self.last_frame 124 | if frame is None: 125 | frame = self.grab_frame() 126 | self.background = clone_image(frame) 127 | 128 | self.background_gray = to_gray_image(self.background) 129 | self.background_flipped = flip_image(self.background) 130 | 131 | def calc_biggest_diff(self): 132 | return max(sum_squared(self.last_frame_gray, frame) / self.num_pixels for frame in self.recent_frames_gray) 133 | 134 | def calc_background_similarity(self): 135 | return min(ccoeff_normed(self.background_gray, frame) for frame in self.recent_frames_gray) 136 | 137 | def check_for_card(self): 138 | found = False 139 | base_corr = 0 140 | 141 | self.grab_frame() 142 | # if the user didn't set the background, get the first frame and consider it the background 143 | if self.background is None: 144 | print "Updating background on the account of it being NOne" 145 | self.update_background() 146 | 147 | history_diff = self.calc_biggest_diff() 148 | 149 | # Detect movement 150 | if history_diff > 10: 151 | self.has_moved = True 152 | 153 | # No movement now, but there was before 154 | elif self.has_moved == True: 155 | base_corr = self.calc_background_similarity() 156 | # Looking at the background, false alarm 157 | # set the frame as the new background, this helps with lightning change 158 | if base_corr >= 0.75: 159 | #self.update_background() 160 | self.has_moved = False 161 | else: 162 | # background and current frame are < 25% similar 163 | corners = detect_card(self.last_frame_gray, self.background_gray) 164 | if corners is not None: 165 | self.snapshot = get_card(self.last_frame_gray, corners) 166 | self.snapshot = flip_image(self.snapshot) 167 | found = True 168 | self.has_moved = False 169 | else: 170 | self.has_moved = False 171 | 172 | self.display_background() 173 | self.display_live("%.4f [0-10 stable, >10 unstable] | %.4f [>0.75 is background, <0.75 contains foreground]" % (history_diff, base_corr)) 174 | 175 | if found is True: 176 | return clone_image(self.snapshot) 177 | return None 178 | 179 | -------------------------------------------------------------------------------- /match_card.py: -------------------------------------------------------------------------------- 1 | import os 2 | from cv_utils import ccoeff_normed, img_from_buffer, float_version, clone_image, overlay_text_on_image 3 | import cv 4 | import math 5 | import sys 6 | 7 | # basedir is where the set images are 8 | class MatchCard: 9 | def __init__(self, basedir): 10 | self.basedir = basedir 11 | self.img = None 12 | self.card_name = None 13 | self.set_name = None 14 | 15 | def set(self, set_name, card_name): 16 | self.card_name = card_name 17 | self.set_name = set_name 18 | self.font = cv.InitFont(cv.CV_FONT_HERSHEY_SIMPLEX, .5, .5) 19 | 20 | path = os.path.join(self.basedir, set_name, card_name+".full.jpg") 21 | try: 22 | self.img = cv.LoadImage(path) 23 | except IOError: 24 | return False 25 | return True 26 | 27 | def get_set_name(self): 28 | return self.set_name 29 | def get_card_name(self): 30 | return self.card_name 31 | 32 | def display(self): 33 | tmp = clone_image(self.img) 34 | overlay_text_on_image(tmp, "%s - %s" % (self.card_name, self.set_name), self.font) 35 | cv.ShowImage("match", tmp) 36 | cv.ResizeWindow("match", 800, 600) 37 | 38 | 39 | PREV, NEXT, KEY, RESULT = 0, 1, 2, 3 40 | MAXSIZE = 7000 41 | class GradientCache: 42 | def __init__(self, base_dir): 43 | self.base_dir = base_dir 44 | self.cache = {} 45 | self.root = [] 46 | self.root[:] = [self.root, self.root, None, None] 47 | self.full = False 48 | self.currsize = 0 49 | 50 | ''' 51 | Returns card gotten from filesytem, based on set_name+name, and converted 52 | to a format that can easily be analyized (i.e. looks like just the outlines) 53 | Further, the image is placed in a cache with the key being the concatenation 54 | of set_name+'/'+name 55 | 56 | return None if card not found 57 | return card if found (image) 58 | ''' 59 | def getCard(self, set_name, name): 60 | key = "%s/%s" % (set_name, name) 61 | if key in self.cache: 62 | #bump entry to front of list, then return 63 | link = self.cache[key] 64 | #remove it from where it is 65 | link_prev, link_next, key, result = link 66 | link_prev[NEXT] = link_next 67 | link_next[PREV] = link_prev 68 | #put in right before root 69 | last = self.root[PREV] 70 | last[NEXT] = self.root[PREV] = link 71 | link[PREV] = last 72 | link[NEXT] = self.root 73 | return result 74 | 75 | # load the image 76 | path = os.path.join(self.base_dir, set_name, name+".full.jpg") 77 | try: 78 | img = cv.LoadImage(path, 0) 79 | except IOError: 80 | print >> sys.stderr, "getCard() Loading image %s failed" % (path) 81 | return None 82 | 83 | if cv.GetSize(img) != (223, 310): 84 | tmp = cv.CreateImage((223, 310), 8, 1) 85 | cv.Resize(img,tmp) 86 | img = tmp 87 | result = gradient(img)[1] 88 | 89 | if self.full: 90 | #add as the new root 91 | self.root[KEY] = key 92 | self.root[RESULT] = result 93 | self.cache[key] = self.root 94 | 95 | #make the oldelst link the new root 96 | self.root = self.root[NEXT] 97 | del self.cache[self.root[KEY]] 98 | self.root[KEY] = self.root[RESULT] = None 99 | else: 100 | # put result in a new link at the front of the queue 101 | last = self.root[PREV] 102 | link = [last, self.root, key, result] 103 | self.cache[key] = last[NEXT] = self.root[PREV] = link 104 | self.currsize += 1 105 | self.full = (self.currsize == MAXSIZE) 106 | 107 | return result 108 | 109 | 110 | def load_sets(base_dir, set_names): 111 | cards = [] 112 | for dir, subdirs, fnames in os.walk(base_dir): 113 | set = os.path.split(dir)[1] 114 | if set in set_names: 115 | print "Loading set %s" % (set) 116 | for fname in fnames: 117 | path = os.path.join(dir, fname) 118 | #img = cv.LoadImage(path.encode('utf-8'),0) 119 | try: 120 | img = cv.LoadImage(path,0) 121 | except IOError: 122 | print >> sys.stderr, "\tload_sets() Loading image %s failed" % (path) 123 | next 124 | if cv.GetSize(img) != (223, 310): 125 | tmp = cv.CreateImage((223, 310), 8, 1) 126 | cv.Resize(img,tmp) 127 | img = tmp 128 | phash = dct_hash(img) 129 | 130 | cards.append(( 131 | fname.replace('.full.jpg',''), 132 | set, 133 | phash 134 | )) 135 | print "\tDone loading set %s" % (set) 136 | 137 | return cards 138 | 139 | #********************* 140 | #card matching section 141 | def gradient(img): 142 | cols, rows = cv.GetSize(img) 143 | 144 | x_drv = cv.CreateMat(rows,cols,cv.CV_32FC1) 145 | y_drv = cv.CreateMat(rows,cols,cv.CV_32FC1) 146 | mag = cv.CreateMat(rows,cols,cv.CV_32FC1) 147 | ang = cv.CreateMat(rows,cols,cv.CV_32FC1) 148 | 149 | cv.Sobel(img, x_drv, 1, 0) 150 | cv.Sobel(img, y_drv, 0, 1) 151 | cv.CartToPolar(x_drv,y_drv,mag,ang) 152 | return (mag,ang) 153 | 154 | def angle_hist(mat): 155 | h = cv.CreateHist([9], cv.CV_HIST_ARRAY, [(0.001,math.pi*2)], True) 156 | cv.CalcHist([cv.GetImage(mat)], h) 157 | #cv.NormalizeHist(h,1.0) 158 | return h 159 | 160 | def score(card, known, method): 161 | r = cv.CreateMat(1, 1, cv.CV_32FC1) 162 | cv.MatchTemplate(card, known, r, method) 163 | return r[0,0] 164 | 165 | def match_card(card, known_set, cache): 166 | mag, grad = gradient(card) 167 | phash = dct_hash(card) 168 | 169 | #fetch the twenty candidates with the lowest hamming distance on the phash 170 | #there's a 99% chance that the matching card is one of the first 20 171 | candidate_matches = sorted([ 172 | (name, set_name, hamming_dist(h, phash)) 173 | for name, set_name, h in known_set 174 | ], key = lambda (n,s,dist): dist) 175 | 176 | # Not even a chance, return 177 | if len(candidate_matches) is 0: 178 | return (('',''),False) 179 | 180 | #we want the first 20 181 | candidate_matches = candidate_matches[:20] 182 | 183 | #calculate the correlation score, 184 | #and also find the 'place' of each phash score 185 | #(multiple candidates can tie a phash score, so we rank by count of 186 | #distances < our distance) 187 | candidate_scores= [ 188 | ( 189 | name, set_name, 190 | dist, len([d for _,_,d in candidate_matches if d < dist]), 191 | ccoeff_normed(grad, cache.getCard(set_name, name)) 192 | ) for name,set_name,dist in candidate_matches 193 | ] 194 | ''' 195 | print "candidate_scores" 196 | for name, set_name, dist, length, coef_norm in candidate_scores: 197 | print "\tname %s set_name %s dist %d length %d coef_nrom %d" % (name, set_name, dist, length, coef_norm) 198 | ''' 199 | 200 | #sort by score, and add a rank 201 | candidate_scores = sorted(candidate_scores, 202 | key = lambda (n,s,d,hr,ccoeff): ccoeff, 203 | reverse = True) 204 | norm_factor = 0 - candidate_scores[-1][4] 205 | total_score = sum([ccoeff + norm_factor for n,s,d,hr,ccoeff in candidate_scores]) 206 | 207 | #for each score, compute the normaized features (- mean, / std_median) 208 | #for correlation, we want the share of normalized score 209 | features = [ 210 | ( 211 | name, set_name, 212 | (corr_rank - 9.5) / 5.766, 213 | (h_rank - 6.759942) / 4.522550, 214 | (dist - 17.374153) / 3.014411, 215 | (((corr + norm_factor) / total_score)- 0.050000) / 0.040183, 216 | ) for corr_rank, (name, set_name, dist, h_rank, corr) 217 | in enumerate(candidate_scores) 218 | ] 219 | 220 | #compute the score (based on fancy machine learning.) 221 | #todo: make more automatic and configurable 222 | scores = [ 223 | ( 224 | name, set_name, 225 | 1.0 / (1 + math.e ** -(-6.48728 + 0.53659 * cr + -0.11304 * hr + -3.06121 * d + 2.94122 * corr)) 226 | ) for name, set_name, cr, hr, d, corr in features 227 | ] 228 | 229 | #consider the scores in order 230 | scores = sorted(scores, key=lambda (n,s,score): score, reverse=True) 231 | 232 | ''' 233 | print "score" 234 | for name, set_name, score in scores: 235 | print "\tname %s set_name %s score %d" % (name, set_name, score) 236 | ''' 237 | 238 | #each score is a probability 0.0-1.0 of how likely it is that 239 | #that name, set_name is the correct card. we'll consider <= 0.50 a no 240 | # >= 0.60 a yes, and 0.5..0.6 a maybe (todo: adjust?) 241 | 242 | yes_cards = [(n, s) for n, s, score in scores if score >= 0.6] 243 | maybe_cards = [(n, s) for n, s, score in scores if 0.6 > score > 0.5] 244 | 245 | ''' 246 | print "maybe cards" 247 | for name, set_name in maybe_cards: 248 | print "\tname %s set_name %s" % (name, set_name) 249 | print "Done maybe" 250 | 251 | print "yes cards" 252 | for name, set_name in yes_cards: 253 | print "\tname %s set_name %s" % (name, set_name) 254 | print "Done maybe" 255 | ''' 256 | 257 | #if we have one or more 'yes' cards 258 | if len(yes_cards) > 0: 259 | #if they're all the same card... 260 | if len(set([n for n,s in yes_cards])) == 1: 261 | #then we're sure it's that card (unsure on set, but it's the same art, so hard to tell 262 | return (yes_cards[0], True) 263 | elif len(maybe_cards) > 0: 264 | #we have no 'yes' cards at all. if we have any maybe cards... 265 | #if they're all the same card 266 | if len(set([n for n,s in maybe_cards])) == 1: 267 | #it *could* be this card, but we're not confidant 268 | return (maybe_cards[0], False) 269 | 270 | #we can't really say what it is with any sort of confidence 271 | return (('',''),False) 272 | 273 | 274 | def dct_hash(img): 275 | img = float_version(img) 276 | small_img = cv.CreateImage((32, 32), 32, 1) 277 | cv.Resize(img[20:190, 20:205], small_img) 278 | 279 | dct = cv.CreateMat(32, 32, cv.CV_32FC1) 280 | cv.DCT(small_img, dct, cv.CV_DXT_FORWARD) 281 | dct = dct[1:9, 1:9] 282 | 283 | avg = cv.Avg(dct)[0] 284 | dct_bit = cv.CreateImage((8,8),8,1) 285 | cv.CmpS(dct, avg, dct_bit, cv.CV_CMP_GT) 286 | 287 | return [dct_bit[y, x]==255.0 288 | for y in xrange(8) 289 | for x in xrange(8)] 290 | 291 | def hamming_dist(h1,h2): 292 | return sum(b1 != b2 for (b1,b2) in zip(h1,h2)) 293 | 294 | LIKELY_SETS = [ 295 | 'DKA', 'ISD', 296 | 'NPH', 'MBS', 'SOM', 297 | 'ROE', 'WWK', 'ZEN', 298 | 'ARB', 'CON', 'ALA', 299 | 'EVE', 'SHM', 'MOR', 'LRW', 300 | 'M12', 'M11', 'M10', '10E', 301 | 'HOP', 302 | ] 303 | 304 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. {http://fsf.org/} 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see {http://www.gnu.org/licenses/}. 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | python_card_scan Copyright (C) 2013 Chris Meyers 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | {http://www.gnu.org/licenses/}. 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | {http://www.gnu.org/philosophy/why-not-lgpl.html}. 675 | --------------------------------------------------------------------------------