Blog of the Vrroom
This post is part of a new foundation that we are trying to create – Longtail AI Foundation , that works towards increasing accessibility for the hearing impaired. It describes our first steps towards creating a large-scale dataset – isl-500 for training bi-directional translation models between English and Indian Sign Language (ISL). Introduction Our Hand-Signer detection model is able to detect…
This post is based on my project in my Computer Vision class last semester
--> --> Your browser does not support the video tag. Your browser does not support the video tag. A couple of cherry-picked examples that show how someone might use this model Introduction I trained a ControlNet for interactively coloring line drawings. I was inspired partly by a Twitter post by the Lvmin Zhang, the original author of ControlNet and Style2Paints project, and partly by my niece,…
Motivation I saw a talk where the speaker spoke about how modern computer vision systems should take more inspiration from biology. He described the mantis shrimp, a sea animal with two eyes that move independently of each other, and wondered whether its eyes enable better representations of the visual world. He was asking why evolution chose this design for the shrimp? And how did the design…
Here I’ll share some Codeforces problems I solved by visualizing what happens on a 2D plane. The tricks I discuss here rely on checking parity , the pigeonhole principle and Dilworth’s Lemma . Two Hundred Twenty One In this problem, we are given a sequence of $N$ numbers. Each number can be either $+1$ or $-1$. i : 0 1 2 3 4 5 6 7 8 9 10 11 12 a_i: +1 -1 +1 +1 +1 -1 +1 +1 -1 -1 +1 -1 +1 For a…
Binary Search applies to many problems on Codeforces. These problems can be framed as – find the largest $x \in [n]$ for which $f(x)$ is true. If $f$ has the monotonicity property: \[f(x) \Rightarrow f(x - 1)\] Then we can binary search for the largest $x$. This helps when evaluating $f$ on each $x$ is prohibitively expensive. When monotonicity holds, we can guess $O(lg n)$ $x$’s and evaluate $f$…
Recently, I spent a lot of time solving problems on Codeforces. These problems are similar to those I had encountered in undergraduate classes, such as Discrete Maths, Automata Theory and Algorithms; classes I didn’t do particularly well in.