Today I want to finish up my long-running discussion of Feret diameters. (Previous posts: 29-Sep-2017, 24-Oct-2017, 20-Feb-2018, and 16-Mar-2018.) Recall that the Feret diameter measures the... 더 읽어보기 >>

Last time (if you can remember that long ago), I talked about how to find the maximum Feret diameter of a shape. The Feret diameter, sometimes called the caliper diameter, is illustrated by the diagram below. In a virtual sense, place the object to be measured inside the jaws of a caliper, with the caliper oriented at a specified angle. Close the jaws tightly on the object while maintaining that angle. The distance between the jaws is the Feret diameter at that angle.... 더 읽어보기 >>

This is the first of a few blog posts about object measurements based on a concept called the Feret diameter, sometimes called the caliper diameter. The diagram below illustrates the concept. Place... 더 읽어보기 >>

Reader Uri Pe'er found an old post from 2011 about shortest paths in binary images, and he asked this follow-up question (paraphrased):How can I determine if there is a path from one row to another... 더 읽어보기 >>

As I promised last time, I'm writing a series about functional designs for image binarization in the Image Processing Toolbox. Today I'll start by talking about im2bw and graythresh, two functions... 더 읽어보기 >>

I'm going to play a small trick on you today. Try reading in this JPEG file using imread:url = 'https://blogs.mathworks.com/images/steve/2014/peppers.jpg'; rgb = imread(url); imshow(rgb) So... 더 읽어보기 >>

Here's an image of a chess position: And that's about as close to image processing as today's blog post will come. Because this post is really about text processing.It seems like a lot of... 더 읽어보기 >>

Earlier this year I wrote about logical indexing and linear indexing. Now I want to finish this little indexing series with an example of a technique I call neighbor indexing. I've... 더 읽어보기 >>