Tutte le sfide
Difficile 0 risolte 0% di accettazione

Edge Detection (Sobel Filter)

Run the Sobel filter over a grayscale pixel grid and return the edge strength of every pixel.

Cosa imparerai

  • Visit the 3 × 3 neighborhood of every cell
  • Handle border pixels by clamping coordinates
  • Write results to a new grid so inputs are not overwritten

Problema

Mostra traduzione

A photo editing lab asks you to highlight edges in a grayscale picture. Each pixel is a brightness from 0 (black) to 255 (white). For every pixel, look at its 3 × 3 neighborhood and compute two weighted sums with the Sobel kernels:

Gx = -1  0  1      Gy = -1 -2 -1
     -2  0  2            0  0  0
     -1  0  1            1  2  1

The kernel's center sits on the pixel, its top row on the row above and its left column on the column to the left. Multiply each neighbor by the matching weight and add them up to get gx and gy. When a neighbor falls outside the picture, use the nearest pixel on the border instead (clamp the row to 0 … rows − 1 and the column to 0 … cols − 1). The edge strength is min(255, |gx| + |gy|), so it stays a whole number between 0 and 255. Always read from the original picture, never from pixels you already changed.

Implement edge_detection(image).

Input

image: The picture as a list of rows; every row has the same length.

Output

Return a new grid of the same size where each value is the edge strength of that pixel.

Vincoli

1 ≤ rows, cols ≤ 50

0 ≤ pixel ≤ 255

Esempi

Esempio 1
Input:
image = [
    [10, 10, 10],
    [10, 10, 10],
    [10, 10, 10]
]

Output atteso:
expected = [
    [0, 0, 0],
    [0, 0, 0],
    [0, 0, 0]
]
Input:
std::vector<std::vector<long long>> image = {
    {10, 10, 10},
    {10, 10, 10},
    {10, 10, 10}
};

Output atteso:
std::vector<std::vector<long long>> expected = {
    {0, 0, 0},
    {0, 0, 0},
    {0, 0, 0}
};
Input:
long[][] image = new long[][] {
    new long[] {10, 10, 10},
    new long[] {10, 10, 10},
    new long[] {10, 10, 10}
};

Output atteso:
long[][] expected = new long[][] {
    new long[] {0, 0, 0},
    new long[] {0, 0, 0},
    new long[] {0, 0, 0}
};

Spiegazione

Every neighborhood is flat, so both sums are 0 everywhere and the result is all zeros.

Esempio 2
Input:
image = [
    [0, 0, 100],
    [0, 0, 100],
    [0, 0, 100]
]

Output atteso:
expected = [
    [0, 255, 255],
    [0, 255, 255],
    [0, 255, 255]
]
Input:
std::vector<std::vector<long long>> image = {
    {0, 0, 100},
    {0, 0, 100},
    {0, 0, 100}
};

Output atteso:
std::vector<std::vector<long long>> expected = {
    {0, 255, 255},
    {0, 255, 255},
    {0, 255, 255}
};
Input:
long[][] image = new long[][] {
    new long[] {0, 0, 100},
    new long[] {0, 0, 100},
    new long[] {0, 0, 100}
};

Output atteso:
long[][] expected = new long[][] {
    new long[] {0, 255, 255},
    new long[] {0, 255, 255},
    new long[] {0, 255, 255}
};

Spiegazione

For the middle pixel the right column adds 100 + 200 + 100 = 400 and the left column adds 0, so gx = 400, gy = 0 and the strength is capped at 255. The right column pixels also get 255 because their missing right neighbors copy the border value 100. The left column pixels only see 0 on both sides, so they stay 0.

Come affrontarlo

Prova prima da solo, poi apri un suggerimento alla volta.

Suggerimento 1

Write a helper that returns the pixel at (r, c) after clamping r and c into the grid.

Suggerimento 2

gx only uses the left and right columns of the neighborhood; gy only the top and bottom rows.

Suggerimento 3

Build the output in a separate grid; changing the input as you go breaks later pixels.

Complessità attesa

O(rows × cols) time, O(rows × cols) extra space

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

La migliore soluzione superata di ogni programmatore. Le più veloci, leggere e meglio valutate stanno in alto.

Ancora nessuna soluzione superata. Risolvila e prendi il primo posto.

Impara dagli altri

Soluzioni della community

Nessuna soluzione pubblicata. Risolvi questa sfida per condividere la prima.