🎉 Welcome to RiazHub! High-Performance Digital Utilities Directory Explore Tools ➔
Back to Directory

The Universal Image Duplicate Finder & Visual Similarity Deduplication Studio by RiazHub is an advanced, 100% client-side digital utility designed to scan, detect, and eliminate redundant image files directly inside your browser with zero server uploads. Powered by a dual-tier matching engine, it pairs native cryptographic SHA-256 byte hashing (for instant detection of exact clones, redundant downloads, and byte-for-byte copies) with 64-bit perceptual fingerprinting algorithms—including dHash (difference gradient matching), aHash (luminance mean thresholding), and DCT-based pHash (discrete cosine transform frequency domain analysis) to identify near-duplicates, compressed copies, resized web variants, and rapid camera burst shots.

Features include an interactive similarity threshold slider (70% to 100% Hamming tolerance), automated disjoint-set cluster grouping, and an intelligent “Keep Best Shot” recommendation engine that evaluates candidates by pixel resolution ($W \times H$), file size, EXIF timestamps, or edge-contrast Laplacian sharpness. Users can verify candidates using an interactive side-by-side split-view diff slider, inspect pixel subtraction variations in a difference heatmap, and selectively download curated unique libraries or marked duplicates via an in-memory zero-dependency PKZIP generator alongside comprehensive CSV and JSON audit reports.

100% In-Browser Cryptographic & Perceptual Deduplication

Universal Image Duplicate Finder & Similarity Studio

Scan albums for exact clones and visually similar photos, compare differences side-by-side, auto-select low-res copies, and reclaim storage space in real time. Zero server uploads — completely private.

Photos Scanned 📁
0 Files
0.0 MB Total Ingested
Duplicate Clusters 👥
0 Sets
0 Redundant Copies
Recoverable Space 💾
0.0 MB
0% Wasted Storage
Engine & Fingerprint
SHA-256 + dHash
Web Crypto + Canvas 2D
🎯 Quick Presets:

Batch Ingestion Up to 200+ Photos

📷
Drop images or folders here
Supports JPG, PNG, WEBP, AVIF, GIF, BMP, SVG
Hashing images... 0%

Match Sensitivity & Engine

Similarity Threshold 90%
70% (Loose / Burst) 90% (Recommended) 100% (Strict)
Fingerprint Algorithm

Smart Recommendation Rules

🖼️
No Photos Ingested Yet
Drag and drop photos into the left panel or click "Load Sample Photos" to test duplicate detection and visual similarity grouping immediately.
VS
Right Compare
Left Compare
Photo A
Photo B
💡 Drag the split divider horizontally across the image to inspect pixel sharp edge alignment, compression artifacts, and color variances.
Identical (Black)
Max Variance (Green/Neon)
Pixel-by-pixel color subtraction visualizer highlighting subtle compression noise, color grade shifts, and resampling blur.
0 photos
Thumb File Name Dimensions File Size Sharpness Status Action
No photos scanned yet.
🔬 Why Cryptographic Hashes (SHA-256) Fail on Resized or Compressed Photos
Cryptographic hashing algorithms like SHA-256 and MD5 are intentionally engineered with the Avalanche Effect: modifying a single pixel or changing 1 byte in image headers generates a completely unpredictable, 100% divergent hash digest. While this is essential for verifying byte-level integrity, it renders cryptographic hashes useless when searching for near-duplicate photos, resized thumbnails, social media re-compressed images (such as from WhatsApp or Instagram), or burst photos. Perceptual Hashes (dHash, aHash, pHash) map visual features rather than raw bytes, producing fingerprints where visually similar images generate nearly identical binary codes.
📏 How Hamming Distance & Perceptual DCT Hashing Quantify Similarity
A perceptual fingerprint represents an image as a 64-bit binary string (e.g. 10110010...). Hamming distance measures the exact count of bit positions that differ between two fingerprints. If two photos have a Hamming distance of 0, their visual structure is identical (100% similarity). A distance of 6 out of 64 corresponds to $\approx 90.6\%$ similarity. In this studio:
  • dHash (Difference Hash): Tracks relative horizontal luminance gradients across a 9×8 downsampled matrix. Extremely fast and resilient to brightness shifts.
  • aHash (Average Hash): Computes the mean luminance across an 8×8 grid and thresholds every pixel against that mean.
  • pHash (Perceptual DCT Hash): Applies a 2D Discrete Cosine Transform (DCT) to downscaled 32×32 luminance data to extract the 8×8 lowest spatial frequency components, making it exceptionally resistant to rotation, blur, and aggressive lossy compression.
⭐ How the Smart Recommendation Engine Selects the "Keeper"
When redundant photos are clustered, our automated recommendation engine evaluates candidates against user-selected criteria:
  • Highest Pixel Resolution: Computes $W \times H$ megapixels. Preserves original full-sized master files while marking downscaled web variants for cleanup.
  • Largest File Size: Identifies uncompressed or minimally compressed versions with maximal pixel color fidelity.
  • Oldest Date / Origin: Favors the earliest timestamped or originally indexed file.
  • Sharpest / Least Blurry: Runs an edge-contrast Laplacian variance filter on a normalized 256×256 canvas to automatically isolate the crispest photo in rapid camera bursts.
🔒 Zero-Upload Client-Side Privacy Guarantee
Every operation—including raw binary decoding, canvas rasterization, SHA-256 computation via native browser crypto.subtle, 64-bit perceptual hashing, connected-components clustering, visual diff rendering, and in-memory ZIP package creation—occurs strictly within your device's browser memory. No photo data, thumbnails, filenames, or metadata are ever transmitted over the network to any server.
🌐 Visitor Statistics
0
Today
0
This Month
0
Previous Month
0
Total Visits