Search result for Geometric algorithms Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 22 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
C ++Image Processing From Ground Up™
by Israel Gbati- 0.0
-
![]()
![]()
![]()
![]()
![]()
7.5 hours on-demand video
Be able to develop Spatial Filtering Algorithms in C++ Be able to develop Gray Level Transformation Algorithms in C++ Be able to perform Geometric Operations on Images...
$12.99
Computer vision: OpenCV Basics Quick Starter in Python
by Abhilash Nelson- 3.9
-
![]()
![]()
![]()
![]()
![]()
4 hours on-demand video
In the next session, we will use opencv to create and draw simple geometric shapes like line, rectangle, circle, ellipse, polygon etc into an image canvas. At first we will use our own filter to do a custom smoothing of image and later built in filters using algorithms like Gaussian Smoothing, average smoothing, Median and finally the bilateral smoothing....
$9.99
Complete linear algebra: theory and implementation in code
by Mike X Cohen- 4.8
-
![]()
![]()
![]()
![]()
![]()
33.5 hours on-demand video
Visualization using graphs, numbers, and spaces that strengthens the geometric intuition of linear algebra....
$13.99
Master Discrete Mathematics-Set Theory, Relations & More
by Engineering Education Hub by Prateek Porwal- 3.7
-
![]()
![]()
![]()
![]()
![]()
7 hours on-demand video
This means that in order to learn the fundamental algorithms used by computer programmers, students must have a solid background in Discrete Math. Mathematical Induction for "Proving the Sum of a Geometric Progression"; (Mathematical Induction) Learn to apply Mathematical Induction for proving the sum of Geometric Progressions....
$11.99
Mathematics for Machine Learning: PCA
by Marc Peter Deisenroth- 4
-
![]()
![]()
![]()
![]()
![]()
Approx. 18 hours to complete
This intermediate-level course introduces the mathematical foundations to derive Principal Component Analysis (PCA), a fundamental dimensionality reduction technique. We'll cover some basic statistics of data sets, such as mean values and variances, we'll compute distances and angles between vectors using inner products and derive orthogonal projections of data onto lower-dimensional subspaces....
Algorithms, Part I
by Kevin Wayne , Robert Sedgewick- 4.9
-
![]()
![]()
![]()
![]()
![]()
Approx. 54 hours to complete
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Analysis of Algorithms Analysis of Algorithms Introduction Theory of Algorithms Geometric Applications of BSTs...
Master Discrete Math 2020: More Than 5 Complete Courses In 1
by Kody Amour- 4.4
-
![]()
![]()
![]()
![]()
![]()
16 hours on-demand video
Explain various relationships and properties involving arithmetic and geometric sequences Discover many various properties and algorithms involving trees in graph theory...
$12.99
Related searches
Remote Sensing Image Acquisition, Analysis and Applications
by John Richards- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 23 hours to complete
It also provides an in-depth treatment of the computational algorithms employed in image understanding, ranging from the earliest historically important techniques to more recent approaches based on deep learning. Module 1 Lecture 7 Geometric distortion in recorded images Module 3 Lecture 19: Geometric distortions in radar imagery Module 3 Lecture 20: Geometric distortions in radar imagery, cont....
機器學習技法 (Machine Learning Techniques)
by 林軒田- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 19 hours to complete
The course extends the fundamental tools in "Machine Learning Foundations" to powerful and practical models by three directions, which includes embedding numerous features, combining predictive features, and distilling hidden features. [這門課將先前「機器學習基石」課程中所學的基礎工具往三個方向延伸為強大而實用的工具。這三個方向包括嵌入大量的特徵、融合預測性的特徵、與萃取潛藏的特徵。] 第一講：Linear Support Vector Machine Course Introduction Large-Margin Separating Hyperplane Standard Large-Margin Problem Support Vector Machine Reasons behind Large-Margin Hyperplane NTU MOOC 課程問題詢問與回報機制...
Discrete Optimization
by Professor Pascal Van Hentenryck , Dr. Carleton Coffrin- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 65 hours to complete
This class is an introduction to discrete optimization and exposes students to some of the most fundamental concepts and algorithms in the field. Knapsack 2 - greedy algorithms LP 1 - intuition, convexity, geometric view...
Previous
