2007
DOI: 10.1109/tifs.2007.902670
|View full text |Cite
|
Sign up to set email alerts
|

Robust and Secure Image Hashing via Non-Negative Matrix Factorizations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
152
0
2

Year Published

2008
2008
2021
2021

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 265 publications
(154 citation statements)
references
References 18 publications
0
152
0
2
Order By: Relevance
“…Hence, the feature extraction stage is significantly important in order to achieve robustness, discrimination and security. Some of the robust feature extraction methods exploited in literature include image histogram [10], feature points [11] or image edge information, significant DWT or DCT coefficients, Fourier transform [8], and dimensionality reduction with linear transforms [12].…”
Section: General Framework Of Image Hashingmentioning
confidence: 99%
See 2 more Smart Citations
“…Hence, the feature extraction stage is significantly important in order to achieve robustness, discrimination and security. Some of the robust feature extraction methods exploited in literature include image histogram [10], feature points [11] or image edge information, significant DWT or DCT coefficients, Fourier transform [8], and dimensionality reduction with linear transforms [12].…”
Section: General Framework Of Image Hashingmentioning
confidence: 99%
“…Therefore, keybased randomization should be incorporated into feature extraction to make the hash unpredictable and resist these threats. Another merit of randomization stated in [12] is in enhancing the scalability of the hash algorithm, i.e., the ability to work with large data sets while avoiding the collision for distinct inputs. This step also ensures source authentication of image data.…”
Section: General Framework Of Image Hashingmentioning
confidence: 99%
See 1 more Smart Citation
“…But the current research of image perceptual hashing algorithm is short of thinking about human visual properties. Most of the existing hashing algorithms [5,6] consider only the gray images. On the other hand, many hashing algorithms are sensitive to rotation.…”
Section: Introductionmentioning
confidence: 99%
“…The crypto- graphic hash functions cannot be used on digital multimedia because they are very sensitive to every bit of digital data. Many researchers have presented robust and secure hash functions for images [20], [21], videos [22], [23], and 3D models [24]- [26]. However, these functions cannot be used for vector data models because the data structure for the latter is different.…”
Section: Introductionmentioning
confidence: 99%