Mass image storing method based on HBase and achieving system thereof
A picture and mass technology, applied in the field of big data storage, can solve the problem of not solving the security problem of picture storage, and achieve the effect of preventing reading, efficient and safe storage
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0038] A method for storing massive images based on HBase, the specific steps comprising:
[0039] (1) Determine whether each picture to be uploaded exceeds the size of the HBase database storage data block HFile, if not, then enter step (2); if it exceeds, then divide the picture until it does not exceed the HBase database storage data block HFile size;
[0040] (2) Extract picture feature value, described picture feature value comprises color, saturation, value, calculates the color histogram of picture;
[0041] (3) Encrypt the eigenvector of the color histogram that step (2) obtains, utilize homomorphic encryption algorithm to encrypt picture eigenvalue;
[0042] (4) Generate the HFile file from the encrypted data and store it in the HBase database.
[0043] Extract the feature value of the image, calculate the color histogram of the image, and compare the similarity between the uploaded image and the image in the HBase database when the user retrieves the image in the f...
Embodiment 2
[0045] According to the picture storage method described in Embodiment 1, the difference is that the calculation of the color histogram of the picture specifically refers to: color quantization, that is, the color space of the picture is divided into several small color intervals, and each small color interval becomes a color A bin of the histogram; calculate the number of pixels whose color falls in each small color interval to obtain a color histogram.
Embodiment 3
[0047] According to the picture storage method described in embodiment 1, the difference is that the feature value of the picture is encrypted using a homomorphic encryption algorithm, and the homomorphic encryption algorithm refers to the Paillier algorithm, and the specific steps include:
[0048] a. Randomly select two prime numbers p and q, and satisfy that the greatest common divisor of pq and (p-1)(q-1) is 1;
[0049] b. Set n=pq, calculate n, λ=lcm(p-1,q-1), λ is the least common multiple of (p-1) and (q-1), the function lcm is used to find the minimum of two numbers common multiple;
[0050] c. Select a random number means all with n 2 Integers that are mutually prime numbers, calculate a parameter μ in the private key, the calculation formula is as follows;
[0051] μ=(L(g λ mod n 2 )) -1 mod n
[0052] In the formula, t mod t' means that t calculates the remainder of t', and the function L is defined as L(s)=(s-1) / n,
[0053] At this time, the public key is (n...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 