artificial-intelligence

OCR Playing Cards [closed]

泪湿孤枕 提交于 2019-12-03 02:41:26
I decided to do a project for fun where I want to take as input the image of a playing card and return its rank and suit. I figure that I only need look at the upper-left corner, since that has all the information. It should be robust - if I have a large image of an Ace of Diamonds, I should be able to scale it anywhere from 20 to 200% and still get the right answer. First question - is there anything already written that does this? If so I'll find something else to OCR so I don't duplicate the efforts. Second - what's the best way to go about doing this? Neural network? Something hand-coded?

Representing Natural Language as RDF

落花浮王杯 提交于 2019-12-03 02:32:47
How much of the concepts conveyed in natural language is RDF/OWL able to represent? I'm still learning RDF and other semantic technologies, but as I currently understand it, information is typically represented as triples of the form (subject,predicate,object). So I can imagine how the sentence "Bob has a hat" might be represented. However, how would you represent a more complicated sentence like "Bob, over on 42nd street, will have a job at the Mall after the owner approves"? Are there conventions for tags representing nouns/verbs/ownership/causality/tense/etc? Note, I'm not asking how to

When to use a certain Reinforcement Learning algorithm?

笑着哭i 提交于 2019-12-03 02:22:23
问题 I'm studying Reinforcement Learning and reading Sutton's book for a university course. Beside the classic PD, MC, TD and Q-Learning algorithms, I'm reading about policy gradient methods and genetic algorithms for the resolution of decision problems. I have never had experience before in this topic and I'm having problems understanding when a technique should be preferred over another. I have a few ideas, but I'm not sure about them. Can someone briefly explain or tell me a source where I can

What is the difference between SOM (Self Organizing Maps) and K-Means?

|▌冷眼眸甩不掉的悲伤 提交于 2019-12-03 02:14:13
There is only one question related to this in stackoverflow, and it is more about which one is better. I just dont really understand the difference. I mean they both work with vectors, which are assigned randomly to clusters, they both work with the centroids of the different clusters in order to determine the winning output node. I mean, where exactly lies the difference? In K-means the nodes (centroids) are independent from each other. The winning node gets the chance to adapt each self and only that. In SOM the nodes (centroids) are placed onto a grid and so each node is consider to have

How to Find Documents That are in the same Cluster with KMeans

淺唱寂寞╮ 提交于 2019-12-03 02:09:49
I have clustered various articles together with the Scikit-learn framework. Below are the top 15 words in each cluster: Cluster 0: whales islands seaworld hurricane whale odile storm tropical kph mph pacific mexico orca coast cabos Cluster 1: ebola outbreak vaccine africa usaid foundation virus cdc gates disease health vaccines experimental centers obama Cluster 2: jones bobo sanford children carolina mississippi alabama lexington bodies crumpton mccarty county hyder tennessee sheriff Cluster 3: isis obama iraq syria president isil airstrikes islamic li strategy terror military war threat al

Chess Optimizations

荒凉一梦 提交于 2019-12-03 02:02:05
问题 ok, so i have been working on my chess program for a while and i am beginning to hit a wall. i have done all of the standard optimizations (negascout, iterative deepening, killer moves, history heuristic, quiescent search, pawn position evaluation, some search extensions) and i'm all out of ideas! i am looking to make it multi-threaded soon, and that should give me a good boost in performance, but aside from that are there any other nifty tricks you guys have come across? i have considered

Rush Hour - Solving the game

梦想与她 提交于 2019-12-03 01:41:34
问题 Rush Hour if you're not familiar with it, the game consists of a collection of cars of varying sizes, set either horizontally or vertically, on a NxM grid that has a single exit. Each car can move forward/backward in the directions it's set in, as long as another car is not blocking it. You can never change the direction of a car. There is one special car, usually it's the red one. It's set in the same row that the exit is in, and the objective of the game is to find a series of moves (a move

Pong: How does the paddle know where the ball will hit?

若如初见. 提交于 2019-12-03 01:18:39
After implementing Pacman and Snake I'm implementing the next very very classic game: Pong. The implementation is really simple, but I just have one little problem remaining. When one of the paddle (I'm not sure if it is called paddle) is controlled by the computer, I have trouble to position it at the correct position. The ball has a current position, a speed (which for now is constant) and a direction angle. So I could calculate the position where it will hit the side of the computer controlled paddle. And so Icould position the paddle right there. But however in the real game, there is a

How to identify ideas and concepts in a given text

拈花ヽ惹草 提交于 2019-12-03 01:17:55
I'm working on a project at the moment where it would be really useful to be able to detect when a certain topic/idea is mentioned in a body of text. For instance, if the text contained: Maybe if you tell me a little more about who Mr Jones is, that would help. It would also be useful if I could have a description of his appearance, or even better a photograph? It'd be great to be able to detect that the person has asked for a photograph of Mr Jones. I could take a really naïve approach and just look for the word "photo" or "photograph", but this would obviously be no good if they wrote

Difference between a linear problem and a non-linear problem? Essence of Dot-Product and Kernel trick

老子叫甜甜 提交于 2019-12-03 01:13:38
问题 The kernel trick maps a non-linear problem into a linear problem. My questions are: 1. What is the main difference between a linear and a non-linear problem? What is the intuition behind the difference of these two classes of problem? And How does kernel trick helps use the linear classifiers on a non-linear problem? 2. Why is the dot product so important in the two cases? Thanks. 回答1: Many classifiers, among them the linear Support Vector Machine (SVM), can only solve problems that are