NumPy Broadcasting for Negative Image Effect

 Controlling the Light: Brightness Adjustment with NumPy! 💡🌓 Day 87/100 In Computer Vision, light isn't a feeling it's an addition. For Day 87 of my #100DaysOfCode journey, I explored the mathematics of Exposure and Brightness. I learned that making a photo 'pop' is actually a simple matter of scalar addition across a 3D matrix. But the real skill lies in Clipping ensuring the math doesn't break the boundaries of 8-bit color depth. Technical Highlights: 💡 Scalar Offsetting: Using NumPy broadcasting to shift the global intensity of an image by adding or subtracting constant values. 🛡️ Value Clipping: Implementing np.clip to prevent numerical overflows, ensuring pixels never exceed 255 or drop below 0. ⚡ Performance Vectorization: Avoiding slow Python loops and using direct array operations for real-time image manipulation. 🤖 Preprocessing for AI: Understanding how brightness normalization helps ML models recognize objects in varying lighting conditions. Do check my GitHub repository here : https://lnkd.in/d9Yi9ZsC #100DaysOfCode #ComputerVision #NumPy #Python #BTech #IILM #AIML #ImageProcessing #DataScience #SoftwareEngineering #LearningInPublic #WomenInTech

The Magic of the Mirror: Image Flipping with NumPy! 🤳🔄 Day 85/100 Ever wondered how your phone 'mirrors' your selfies instantly? It’s just one line of array slicing! For Day 85 of my #100DaysOfCode, I explored Image Flipping and Mirroring. In the world of Computer Vision, an image is just a matrix, and to flip it, we simply reverse the order in which we read the rows or columns. Technical Highlights: 🔄 Axis Reversal: Mastering the [::-1] slicing syntax to reverse array indices without complex loops. 🤳 Mirror Logic: Implementing horizontal flips to simulate the front-camera 'selfie' experience. 🌊 Vertical Reflection: Creating water surface reflection effects by reversing the row order of 2D matrices. 🤖 AI Data Augmentation: Learning how flipping images is used in Machine Learning to double the size of training datasets and prevent model bias. Do check my GitHub repository here : https://lnkd.in/d9Yi9ZsC #100DaysOfCode #ComputerVision #NumPy #Python #BTech #IILM #AIML #ImageProcessing #DataAugmentation #SoftwareEngineering #LearningInPublic #WomenInTech

🚀 Stop iterating through rows like it’s 2010. In a recent pipeline, we were processing 5 million records to calculate a rolling score. Using a standard loop took forever and pegged the CPU at 100%. Before optimisation: for i in range(len(df)): df.at[i, 'score'] = df.at[i, 'val'] * 1.05 if df.at[i, 'flag'] else df.at[i, 'val'] After optimisation: import numpy as np df['score'] = np.where(df['flag'], df['val'] * 1.05, df['val']) Performance gain: 85x faster execution. Vectorisation isn’t just a "nice to have"—it’s the difference between a pipeline that crashes at 2 AM and one that finishes in seconds. By letting NumPy handle the heavy lifting in C, we eliminated the Python overhead entirely. If you're still using `.iterrows()` or manual loops for column transformations, it’s time to refactor. The performance delta on large datasets is simply too massive to ignore. What is the biggest "bottleneck" function you’ve refactored recently that gave you a massive speedup? #DataEngineering #Python #PerformanceTuning #Vectorization #DataScience

Why the Stiffness Matrix in Finite Differences is Symmetric Positive Definite (SPD) 🔢 The 1D Poisson equation is a classic example where the finite difference method leads to a symmetric positive definite (SPD) linear system. Here’s why: Symmetric: The stiffness matrix K is symmetric because the discretization of the second derivative (Laplacian) is symmetric. Positive Definite: For any non-zero vector v , v^T K v > 0 , which ensures the system has a unique solution. Here’s the Python code to solve it: import numpy as np n = 10 x = np.linspace(0, 1, n+1) h = x[1] - x[0] # Construct the SPD stiffness matrix K and load vector f K = np.zeros((n-1, n-1)) f = np.zeros(n-1) def rhs(x): return np.sin(x) for i in range(n-1): K[i, i] = 2 / h if i > 0: K[i, i-1] = -1 / h if i < n-2: K[i, i+1] = -1 / h f[i] = rhs(x[i+1]) * h # Solve the SPD system u = np.linalg.solve(K, f) # Extend solution to full grid u_full = np.zeros(n+1) u_full[1:-1] = u # Exact solution for comparison y_exact = np.sin(x) - x * np.sin(1) # Compute error error = np.linalg.norm(u_full - y_exact) print("Error:", error) Why SPD Matters: ✅ Stability: SPD matrices guarantee stable and efficient numerical solutions. ✅ Conjugate Gradient: Methods like Conjugate Gradient can be used for fast iterative solving. ✅ Theoretical Guarantees: Ensures existence and uniqueness of the solution. Question for the Community: How do you leverage SPD properties in your numerical simulations or machine learning applications? #NumericalMethods #LinearAlgebra #FiniteDifferences #ScientificComputing #DataScience

🚀 Day 48 of My Learning Journey Today, I explored two important NumPy functions: identity() and eye() 📊 🔹 identity() Creates a square matrix Main diagonal elements are 1, rest are 0 Useful for mathematical and matrix operations 🔹 eye() More flexible than identity() Can create rectangular matrices Allows shifting the diagonal using parameter k k = 0 → main diagonal k > 0 → upper diagonal k < 0 → lower diagonal 💻 Example: np.identity(3) → 3×3 identity matrix np.eye(3, 4) → 3×4 matrix with diagonal 1s ✨ Key Learning: Understanding these functions helps in working with matrices efficiently, especially in linear algebra and data science applications. 📌 Consistency is the key—small steps every day lead to big results! #Day48#Python #NumPy #LearningJourney #DataScience #Coding #StudentLife

Every new pattern in DSA changes the way you look at problems. Day 41/100 — Data Structures & Algorithms Journey Today I worked on Longest Substring Without Repeating Characters, and it helped me understand the Sliding Window technique in a deeper way. Instead of checking all substrings, I learned how to dynamically adjust a window and maintain unique characters efficiently. Today’s Focus: Applying Sliding Window on strings Learning when to expand and shrink the window Managing duplicates using a set Improving time complexity from brute force to O(n) Why this matters? Because many real-world problems involve substrings and efficient traversal. Key Takeaways: Sliding Window avoids unnecessary re-computation Tracking elements efficiently is key Understanding window movement is crucial Optimized thinking leads to better solutions From brute force → to optimized thinking #Day41 #DSA #LeetCode #ProblemSolving #SoftwareEngineering #CodingJourney #100DaysOfCode #TechLearning #DeveloperJourney #Programming #Python #InterviewPreparation #CodingSkills #ComputerScience #FutureEngineer #TechCareers #SoftwareDeveloper #LearnInPublic #Consistency

Back in 1854 Soho to look at John Snow’s cholera data through a new lens. I’ve swapped last week’s static K-Means clustering for a generative Monte Carlo simulation. By letting 500+ "agents" take random walks, occasionally described as 'drunken' because of the wayward pattern, from each victim’s location, the underlying attractor reveals itself. Individually they’re chaotic, but collectively the Broad Street pump becomes statistically inevitable. It’s a simple demo, but this logic scales to everything from AlphaGo to protein folding. We’re using computation and simple rules to find clarity where traditional math reaches its limits. Turns out that embracing the randomness is the fastest way to the signal. https://mcsnow.vercel.app/ #DataScience #MonteCarlo #Simulation #JohnSnow #MCMC #Python #SvelteKit

Inspired by Ron Kohavi and Evan Miller practical experimentation principles and tooling, I built a simple A/B Test Sample Size Calculator with Plotly Dash + statsmodels. Repo: https://lnkd.in/gkNvnkin Built quickly through vibe coding, but grounded in solid stats: fixed-horizon two-sample z-test for proportions, alpha/power controls, effect-size views, and runtime estimation. After years in experimentation, this automates a planning task I’ve repeated across various products/domains. An example of what experience + fast execution with AI assistance can produce. #ABTesting #Experimentation #ProductAnalytics #Growth #DataScience #OpenSource #Python #Plotly #Dash #Statsmodels #VibeCoding

I built a Titanic Survival Prediction model using Logistic Regression to predict whether a passenger survived or not. In this project, I performed: Data cleaning and preprocessing Feature engineering Categorical encoding Logistic Regression model training Model evaluation using confusion matrix and classification report - Model Accuracy Achieved: ~80% Tools Used: Python Pandas Scikit-learn Matplotlib / Seaborn This project helped me strengthen my understanding of: Classification models Logistic Regression Machine Learning workflow Model evaluation metrics GitHub Repository: https://lnkd.in/gq8YCqsT