No self-introduction
Loading
Profile
Follow
codes (6)
Android game 2048
no vote
HOW TO PLAY: Use your arrow keys to move the tiles. When two tiles with the same number touch 
mohsen2007 2016-08-23
mohsen2007 0 0
1
SVM in matlab
no vote
In machine learning, support vector machines are supervised learning models with associated learning algorithms that analyze data and recognize patterns, used for classification and regression analysis. SVM light is a collection of software tools for learning and classification using SVM.
mohsen2007 0 0
1
get SMS back up
no vote
This is a fork of the Android backup tool SMS Backup , where development has stopped a while ago. It uses Gmail to perform SMS, MMS and call log backups over the network. mohsen2007 2016-08-23
mohsen2007 0 0
1
object tracking
no vote
Use C++ with OpenCV and cvBlob to perform image processing and object tracking, using a webcam. Originally, built to test Raspberry Pi performance Refactored video blob tracking methods into a separate class. Refactored hard-coded color ranges. Now input parameters. All methods now accept common struct conta
mohsen2007 0 0
1
Mutli-target object tracking
no vote
We propose to formulate multi-target tracking as minimization of a continuous energy function. Other than a number of recent approaches we focus on designing an energy function that represents the problem as faithfully as possible, rather than one that is amenable to elegant optimization. We then go on to construct a suitable optimization scheme to find strong local minima of the proposed energy. The scheme extends the conjugate gradient method with periodic trans-dimensional jumps. These moves allow the search to escape weak minima and explore a much larger portion of the variable-dimensional search space, while still always reducing the energy. To demonstrate the validity of this approach we present an extensive quantitative evaluation both on synthetic data and on six different real video sequences. In both cases we achieve a signific
mohsen2007 0 0
1
PSO code for Knapsack problem
4.0
The knapsack problem or rucksack problem is a problem in combinatorial optimization : Given a set of items, each with a mass and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items. this file is about using PSO method which is a kind of swarm intelligence method for the Knapsack problem. we have two kind of Knapsack problem. one of them is for a real number and another for real Knapsack problem.
mohsen2007 0 0
1
No more~
Follows0
Fans0