Products
Features
YouTube Video Summarizer
Summarize YouTube videos
Web & PDF Highlighter
Highlight web pages & PDFs
Chat with PDF
Ask any PDF questions with AI
Ask AI Clone
Chat with your highlights & memories
Audio Transcriber
Transcribe audio files to text
Glasp Reader
Read and highlight articles
Kindle Highlight Export
Export your Kindle highlights
Idea Hatch
Hatch ideas from your highlights
Integrations
Obsidian Plugin
Notion Integration
Pocket Integration
Instapaper Integration
Medium Integration
Readwise Integration
Snipd Integration
Hypothesis Integration
Apps & Extensions
Chrome Extension
Safari Extension
Edge Add-ons
Firefox Add-ons
iOS App
Android App
Discover
Discover
Ideas
Discover new ideas and insights
Articles
Curated articles and insights
Books
Book recommendations by great minds
Posts
Essays and notes from readers
Quotes
Inspiring quotes collection
Videos
Curated videos and summaries
Explore Glasp
Glasp Newsletter
Weekly insights and updates
Glasp Talk
Interview series with great minds
Glasp Blog
Latest news and articles
Glasp Use Cases
Learn how others use Glasp
Build & Support
Glasp API
Access Glasp's API for developers
MCP Connector
Connect Glasp to Claude & ChatGPT
Community
Glasp Reddit Community
Students
Student discount and benefits
FAQs
Frequently Asked Questions
AboutPricing
DashboardLog inSign up

12.5: Closest or Highest Point Tracking - Kinect and Processing Tutorial

42.0K views
•
November 25, 2015
by
The Coding Train
YouTube video player
12.5: Closest or Highest Point Tracking - Kinect and Processing Tutorial

TL;DR

Analyzing algorithms for finding closest, highest, and brightest objects in depth data.

Transcript

hi in this video I want to look at an algorithm that lets you do the kinds of things like find the closest thing in the room or find I'm doing all sorts of like vogue poses find the highest thing in the room I don't know why I need to do that for the highest thing but whatever or and this is a similar type of algorithm if you've ever looked at like... Read More

Key Insights

  • 📪 Depth data analysis algorithms can be used to find closest, highest, and most red objects in a room.
  • 💯 The core algorithm involves iterating through pixels to update record holders based on specific criteria.
  • 😫 Setting a threshold helps filter unwanted data and focus on relevant objects for analysis.
  • 🕵️ Fine-tuning the algorithm by skipping pixels or adjusting parameters can improve accuracy in detecting objects.
  • 👻 The algorithm's simplicity allows for efficient tracking of objects using depth data from a Kinect.
  • 🥺 Visualizing 3D data through depth analysis can lead to accurate tracking of objects such as fingers or elbows.
  • 👣 Depth data analysis can be utilized for various applications, including tracking movement based on object height.

Install to Summarize YouTube Videos and Get Transcripts

Explore YouTube Video Summarizer or Get YouTube Transcript Extractor

Questions & Answers

Q: What is the core algorithm for finding the closest or highest object in the room using depth data?

The core algorithm involves iterating through each pixel, comparing depth values to find the record holder by updating the record value and XY coordinates as needed.

Q: How does setting a threshold help improve accuracy in finding objects within the depth data?

Setting a threshold filters out unwanted noise or irrelevant pixels, allowing the algorithm to focus on specific objects within the depth image for more accurate results.

Q: What are the key steps involved in determining the highest object using the depth data algorithm?

The algorithm starts with an initial record set at the height of the screen, then iterates through pixels to find the highest point, updating the record and XY coordinates accordingly.

Q: How can the algorithm for finding the highest object be fine-tuned to improve accuracy?

By skipping a certain number of pixels at the top to reduce noise and focusing on specific high points, the algorithm can provide more accurate results in determining the highest object.

Summary & Key Takeaways

  • Explore an algorithm for finding the closest, highest, and most red objects using depth data from a Kinect.

  • Understand the process of tracking record holders within the depth data grid for various scenarios.

  • Demonstrate examples of finding the closest and highest objects within a threshold using pixel analysis.


Read in Other Languages (beta)

English

Share This Summary 📚

Summarize YouTube Videos and Get Video Transcripts with 1-Click

Download browser extensions on:

Try YouTube Summary with ChatGPT & Claude or YouTube Transcript Generator

Explore More Summaries from The Coding Train 📚

Classifying Poses with ml5.js Part 2 thumbnail
Classifying Poses with ml5.js Part 2
The Coding Train
Coding Challenge #126: Toothpicks thumbnail
Coding Challenge #126: Toothpicks
The Coding Train
Coding Challenge #116: Lissajous Curve Table thumbnail
Coding Challenge #116: Lissajous Curve Table
The Coding Train
ITP/IMA Winter Show 2018 thumbnail
ITP/IMA Winter Show 2018
The Coding Train
8.1: Fractals - The Nature of Code thumbnail
8.1: Fractals - The Nature of Code
The Coding Train
ITP/IMA Winter Show 2019 thumbnail
ITP/IMA Winter Show 2019
The Coding Train

Summarize YouTube Videos and Get Video Transcripts with 1-Click

Download browser extensions on:

Try YouTube Summary with ChatGPT & Claude or YouTube Transcript Generator

Apps & Extensions

  • Chrome Extension
  • Safari Extension
  • Edge Add-ons
  • Firefox Add-ons
  • iOS App
  • Android App

Key Features

  • YouTube Video Summarizer
  • Web & PDF Summarizer
  • Web & PDF Highlighter
  • Chat with PDF
  • Ask AI Clone
  • Audio Transcriber
  • Glasp Reader
  • Kindle Highlight Export
  • Idea Hatch

Integrations

  • Obsidian Plugin
  • Notion Integration
  • Pocket Integration
  • Instapaper Integration
  • Medium Integration
  • Readwise Integration
  • Snipd Integration
  • Hypothesis Integration

More Features

  • APIs
  • MCP Connector
  • Blog & Post
  • Embed Links
  • Image Highlight
  • Personality Test
  • Quote Shots

Company

  • About us
  • Blog
  • Community
  • FAQs
  • Job Board
  • Newsletter
  • Pricing
Terms

•

Privacy

•

Guidelines

© 2026 Glasp Inc. All rights reserved.