Spam Detection via Perceptual Hashing and Counter Thresholds

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional spam detection methods, relying on machine learning classifiers and duplicate detection, are inadequate in identifying varied spam content and fail to scale efficiently with increasing volumes of content, leading to overlooked spam and user dissatisfaction.

Innovation Solution

The approach involves generating hash values for content and comparing them to detect duplicate or near-duplicate content, using hashing algorithms to determine similarity and flag spam, with counter values tracking frequency to exceed thresholds, thereby efficiently identifying spam across large volumes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If machine learning classifiers are used for spam detection, then classification capability is improved, but the system cannot detect new content patterns that were not used during training

Engineering Contradiction:
Improvespam detection accuracyVSAvoiddetection of new content patterns
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The system performs preliminary hashing and fingerprinting of content before classification, creating a baseline reference that enables detection of both known and new spam patterns without requiring retraining of machine learning models for each new pattern

Inventive Principle:
Principle #10Preliminary action

2Reliability

If duplicate detection is used for spam identification, then exact duplicate spam is detected, but varied or modified spam content is overlooked

Engineering Contradiction:
Improveduplicate spam detectionVSAvoidvaried content detection
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The system applies different detection qualities to different aspects of content: exact hashing for identical content and perceptual fingerprinting for varied content, allowing the system to detect both exact duplicates and modified versions of spam

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The system changes the detection parameters by using perceptual hashing with similarity thresholds, allowing detection of content that falls within a certain similarity range rather than requiring exact matches, thereby capturing varied spam content

Inventive Principle:
Principle #35Parameter changes

3Reliability

If conventional spam detection methods are used, then spam identification is attempted, but the system does not scale efficiently as content volume increases

Engineering Contradiction:
Improvespam identification capabilityVSAvoidsystem scalability
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The system creates compact hash representations and perceptual fingerprints as copies of the original content, which are much smaller and faster to process and compare, enabling efficient scaling to large content volumes while maintaining detection capability

Inventive Principle:
Principle #26Copying

Solution Approach 2:

The system replaces computationally intensive machine learning classification with faster hashing and fingerprinting operations for initial spam detection, reserving machine learning for cases where hashing alone is insufficient, thereby improving overall system scalability

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

Data Source

PatentUS11363064B2Identifying spam using near-duplicate detection for text and images
Publication Date: 2022.06.14 ADOBE INC
  • US11363064B2 patent drawing
  • US11363064B2 patent drawing
  • US11363064B2 patent drawing

AI summary

Embodiments described herein provide systems, methods, and computer storage media for detecting spam using by comparing hash values of content. In embodiments, hash values are generated based on the type of content and compared to other hash values in storage buckets. The similarity of content is determined by calculating the distance between two hash values and determining whether the distance exceeds a distance index. Counter values associated with hash values in storage are incremented when the distances between hash values exceed the distance index. Spam indications are communicated when the counter values for associated with hash values exceed a count threshold.