With this Python code it's possible to find the centroid of a regular or irregular geometric figures wich are solid or have holes, using Open CV library
-
Updated
Dec 16, 2022 - Python
With this Python code it's possible to find the centroid of a regular or irregular geometric figures wich are solid or have holes, using Open CV library
Analyse d'un groupement de pays cible pour l'exportation de poulet (clustering, CAH, k-means, ACP)
This project consists in the implementation of the K-Means and Mini-Batch K-Means clustering algorithms. This is not to be considered as the final and most efficient algorithm implementation as the objective here is to make a clear comparison between the sequential and parallel execution of the clustering steps.
Simple object tracking by using the centroid tracking algorithm
AI - Project 3 - This project implements Aglomerative Clustering to cluster all generated points in 2D space using: Centroid & Medoid
This project aims to build a complete pattern recognition system to solve classification problems using the k-Nearest Neighbors (KNN) algorithm. To classify chest X-ray images into three categories: COVID-19 positive, pneumonia positive, and normal. To achieve this, we utilize the COVID-19 Chest X-ray dataset available on Kaggle.
Classical Computer Vision
We'll use Python to build and evaluate several machine learning models to predict credit risk. Being able to predict credit risk with machine learning algorithms can help banks and financial institutions predict anomalies, reduce risk cases, monitor portfolios, and provide recommendations on what to do in cases of fraud.
Unsupervised Machine Learning and Cryptocurrencies
From the given ‘Iris’ dataset, predict the optimum number of clusters and represent it visually. Use R or Python to perform this task
Creates a new feature class with the centroid of all polygons for each category provided by a field.
Clustering algorithm with other functions (Laplacian Norm, Jacobi algorithm - Eigenvalues and Eigenvectors extractor, etc)
Implementaion of K-Means & Page Rank algorithms. (extend of "IR-CosineSimilarity-vs-Freq" repository)
Most of the problems I solved and algorithms I grinded while prepairing for the Russian Olympiad in Informatics.
Doing algorithms on next sets of data
The Similarity Search Tree is an efficient method for indexing high dimensional feature vectors. The main objective of this data structure is to obtain the nearest neighbors given a certain query vector in a reasonable amount of time. In this project, the k-NN algorithm was adapted for supporting image retrieval.
Code for the paper "DUCK: Distance-based Unlearning via Centroid Kinematics"
Country centroids based on data from geoBoundaries.org. Useful for bubble maps and arc maps.
Add a description, image, and links to the centroids topic page so that developers can more easily learn about it.
To associate your repository with the centroids topic, visit your repo's landing page and select "manage topics."