Search Results for "image genetic algorithm" - Page 5
Sort By:
Showing 238 open source projects for "image genetic algorithm"
View related business solutions-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
Paessler: Easy to Use With Enterprise Power. Free TrialYou shouldn't have to choose between a monitoring tool that's easy to use and one that's powerful enough for a complex environment. PRTG's low-code interface lets any admin build dashboards, set alerts and monitor devices without scripting, while custom sensors and full API access are there when your team needs deeper control. One platform, no compromise. Download a free 30-day trial now.
-
1
Evolutionary Nursery
A simple genetic algorithm for numerical optimization
Evolutionary nursery is a result for my passion for developing genetic algorithms. I implemented this simple GA in 2008. This is especially intended for numerical optimization problems. -
2
...Intended for whole-genome views of data but can be used to create images of single chromosomes/linkage groups, contigs, or BACs, or even proteins -- any feature that has a location on a backbone. Handles most standard genetic/genomic coordinate systems. Reads GFF3 data and produces a PNG or SVG image.
-
3
Automatic 3D Coordinate Points Generator
The project aims at generating 3D coordinates from a set of 2D images
...The entire project is based on the principles of Photogrammetry. The subject of interest is embedded with patterns of retro-reflective dots. The reason that these dots were attached is that they appear very bright in the image if it is captured using flash. An auto-bar is used to define the coordinate system reference. The algorithm which performs this transformation is broken down to several steps. First step is converting the images to grayscale. Then detecting the retro-reflective dots by the “Polygon” approach. Same dots in different images were matched by Pattern Matching algorithm. ... -
4
FTF Library - C# / WPF
Flexible Tagged Format Library - C# / WPF version
Flexible Tagged Format (FTF) is a completely flexible storage format using human readable tags, and potentially support storing any type of data. This is the C# / WPF version. -
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
5
Flexible Tagged Format (FTF) Library
Flexible Tagged Format (FTF) Library
Flexible Tagged Format (FTF) is a completely flexible storage format using human readable tags, and potentially support storing any type of data. -
6
Ezys
Ezys 3D medical image registration program
Ezys is a non-linear 3D medical image registration program. Ezys fully exploits the parallel computing power of inexpensive commercial graphics processing units (GPU), resulting in a very fast and accurate program capable of running on desktop PCs and even some laptops. On these systems, non-linear image registrations take less than a minute to complete. Ezys implements a diffeomorphic inverse consistent image registration algorithm with a demons-style regularization based on a non-parametric free form deformation model. ... -
7
FamSeq
Variant calling on the basis of pedigree information
...FamSeq accommodates de novo mutations and can perform variant calling at chromosome X. To accommodate variations in data complexity, FamSeq consists of three distinct implementations of the Mendelian genetic model: the Bayesian network algorithm, Elston-Stewart algorithm and Markov chain Monte Carlo algorithm. To make the software efficient and applicable to large families, we parallelized the Bayesian network algorithm that copes with pedigrees with inbreeding loops without losing calculation precision on an NVIDIA® graphics processing unit. -
8
...Usually in an SMC framework there is a natural ordering of the states of the samples. The order typically depends on observations about the states or on the annealing setup used. In many applications (e.g., image jigsaw puzzle problems), all observations (e.g., puzzle pieces) are given at once and it is hard to define a natural ordering. Therefore, we relax the assumption of having ordered observations about states and propose a novel SMC algorithm for obtaining maximum a posteriori (MAP) estimate of a high-dimensional posterior distribution.
-
9
Extract Objects from Image
Connected Component Labeling Algorithm - Extracting Objects From image
fast Connected Component Labeling Algorithm - java application - Extracting Objects From image -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
NEAT Visualizer SFML
A NEAT Implementation and Visualization System
Evolves neural networks using the Neuro-Evolution of Augmenting Topologies (NEAT) technique. A separate visualization system uses another genetic algorithm to evolve images of the otherwise dimensionless networks so their structure can be observed. -
11
Octree Method For Particles
simulation of particles using an oct-tree
...the low-level "octets" can be distributed among a cluster of computers, organized in a grid. they don't have to send each other their whole dataset - only a zoomed out image of it. the further away, the more zoomed out. thus, i/o traffic is greatly reduced. combine this with the fact that it's an O(N) algorithm, and what you get is an accurate particle-based physics simulator whose simulation speed scales with the number of particles per compute unit even for VERY large particle counts and VERY large computing arrays. ... -
12
VariantMaster
Extract causative variants for monogenic and sporadic genetic diseases
...To improve the identification of the variants from HTS, we developed VariantMaster, an original program that accurately and efficiently extracts causative variants in familial and sporadic genetic diseases. The algorithm takes into account predicted variants (SNPs and indels) in affected individuals or tumor samples and utilizes the row (BAM) data to robustly estimate the conditional probability of segregation in a family, as well as the probability of it being de novo or somatic. In familial cases, various modes of inheritance are considered: X-linked, autosomal dominant, and recessive (homozygosity or compound heterozygosity). ... -
13
CLAW is a C++ Library providing various tools in different domains, like a Tweener framework, Bézier curves manipulation, a map with multiple value types, a binary search tree container implemented as an AVL and an implementation of the sockets as std::stream. The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats. Finally, a part of the library is devoted to artificial intelligence in games and includes a generic alpha-beta algorithm. Each module is provided with an example program.
-
14
niGA
Heterogenous Multiprocessor Scheduling Using Genetic Algorithms
Implementation of task scheduling using Genetics algorithm for heterogeneous parallel programming -
15
PyGAO
Genetic Algorithm Optimization for Python
A simple interface for performing genetic algorithm optimization for numerical problems. I am starting with a stripped-down version, where a solution can be described using a single vector of float numbers. Eventually, I will expand to more generic data structures and add multiple-species search options. For the time being, I have no plans of developing a GUI. For now, this is strictly a computational module. -
16
Evochumps
Evolving recursive artificial neural networks in a simulation.
...It has a built-in evolutionary algorith to let the brains evolve conditoned to selective pressure. The program's interface allows you to manipulate all kinds of parameters of both the simulation, the genetic algorithm, and each particular RNN in real time. -
17
PanGP
PanGP is a tool for quickly analyzing bacterial pan-genome profile.
PanGP is a tool for quickly analyzing bacterial pan-genome profile. It has integrated two kinds of sample algorithm, so that it could calculate the pan-genome profile of a population with dozens of or hundreds of strains at extremely low time-cost. At the same time, a user-friendly graphical interface was designed and the image about pan-genome profile could be drawn by PanGP directly. -
18
ALCHEMY is a genotype calling algorithm for Affymetrix and Illumina products which is not based on clustering methods. Features include explicit handling of reduced heterozygosity due to inbreeding and accurate results with small sample sizes
-
19
HIPAcc
Heterogeneous Image Processing Acceleration (HIPACC) Framework
HIPAcc development has moved to github: https://github.com/hipacc HIPAcc allows to design image processing kernels and algorithms in a domain-specific language (DSL). From this high-level description, low-level target code for GPU accelerators is generated using source-to-source translation. As back ends, the framework supports CUDA, OpenCL, and Renderscript. HIPAcc allows programmers to develop imaging applications while providing high productivity, flexibility and portability as well as competitive performance: the same algorithm description serves as basis for targeting different GPU accelerators and low-level languages. -
20
ABM-Calibration-SensitivityAnalysis
Codes and Data for Calibration and Sensitivity Analysis of ABM
...<http://jasss.soc.surrey.ac.uk/xx/x/x.html> Methods/Techniques used are: a. Parameter fitting: 1. Full Factorial Design 2. Simple Random Sampling 3. Latin Hypercube Sampling 4. Quasi-Newton Method 5. Simulated Annealing 6. Genetic Algorithm 7. Approximate Bayesian Computation b. Sensitivity Analysis: 1. Local SA 2. Morris Screening 3. DoE 4. Partial (Rank) Correlation Coefficient 5. Standardised (Rank) Regression Coefficient 6. Sobol' 7. eFAST 8. FANOVA Decomposition Have also a look on our other projects: http://www.uni-goettingen.de/de/315075.html -
21
NNBrain
A free, open source collection of neural network based AI agents.
NNBrain is a free and open source collection of artificial intelligence agents. These agents have applications in video games, research, business, and more. The included agents function in both discrete and continuous action and state spaces. -
22
The IJBlob library indentifying connected components in binary images. The algorithm used for connected component labeling is: Chang, F. (2004). A linear-time component-labeling algorithm using contour tracing technique. Computer Vision and Image Understanding, 93(2), 206–220. doi:10.1016/j.cviu.2003.09.002 The ImageJ *Shape Filter Plugin* (see downloads) uses this library for flitering the blobs by its shape.
-
23
AlgART Java Libraries
Open source library for processing arrays and matrices
AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over... -
24
AEvolution
Artificial life game
Artificial life game using a genetic algorithm in a simple 2D world. -
25
LAVA for AFM
Lloyd's Algorithm-based Volumetric Analysis for AFM Images
This MATLAB-based program enables analysis of AFM images. In particular, it allows the user to measure the volume of all distinguishable features in an image and to isolate and sort those particles. As the name implies, LAVA uses Lloyd's Algorithm, also known as k-means sorting, to identify a small set of volumes representative of the actual distribution of particle in the image. Although developed for determining feature volume, LAVA is also completely compatible with other types of image analysis, such as fluorescence intensity. ...
