euclidean distance calculation in for image forgery detection

1 次查看（过去 30 天）
TUSHAR MURATKAR
TUSHAR MURATKAR 2017-10-3
回答： KSSV 2017-10-3
i am working on a project and it involves following steps.
1. RGB to gray conversion of image.
2. Applying SWT to gray image.
3. Dividing LL1 subband into overlapping blocks and applying SVD to each block and forming feature matrix.
4. Lexicographical sorting of this feature matrix.
5. to find the Euclidean distance of not all the block pairs, but only the very similar blocks that are close to each other (as specified by offset threshold), in the lexicographically sorted feature matrix. condition for offset threshold: abs [index (u) − index (v)] ≤ offset threshold.
I am stuck with this 5th step. Any help in this regard will be highly appreciated.

请先登录，再回答此问题。

回答（1 个）

KSSV
KSSV 2017-10-3
doc knnsearch and rangesearch

类别

在 Help Center 和 File Exchange 中查找有关 Neighborhood and Block Processing 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by