Connected Components

An algorithm that implements find and union operations on a disjoint set data structure. It finds the root parent of an element and determines whether if two elements are in the same set or not. If two elements are at different sets, merge the smaller set to the larger set…

Computer Vision allows us to achieve unbelievable: from simple face recognition to self-driving cars. However, people who enter the Computer Vision field often fail to understand in detail the fundamental operations based on which major applications for object detection, tracking, and segmentation are used. In the following article, I will…

The mature workhorse of object identification using image processing is the connected components algorithm. The algorithm was described in the venerable but still useful two-volume classic from 1982, Digital Picture Processing by Kak and Rosenfeld, and in the decades since by numerous books, presentations, and web pages about image processing. …

Problem : You are given N cities represented as integers and a list of one-way roads that connects one city to another. Return whether you can reach one city from any city. Let us consider an example to understand the problem better,

Point clouds are sets of 3-dimensional points which represent X, Y, Z geometric coordinates in any surface and generated using 3-D scanners such as LiDAR (light detection and ranging) devices, laser scanners and sonars. …

Images always tell story. Combining and complementing each individual component found in the image, a desired narrative can be drawn. And this is what people are after for — the big picture. However, what if you just wanted to examine each individual component independently on its own? Detaching it from…