CN115529466B - High-efficiency fundus image communication method for handheld equipment - Google Patents
High-efficiency fundus image communication method for handheld equipment Download PDFInfo
- Publication number
- CN115529466B CN115529466B CN202211487895.7A CN202211487895A CN115529466B CN 115529466 B CN115529466 B CN 115529466B CN 202211487895 A CN202211487895 A CN 202211487895A CN 115529466 B CN115529466 B CN 115529466B
- Authority
- CN
- China
- Prior art keywords
- bit
- image
- layer image
- conversion
- elements
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/85—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16H—HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
- G16H30/00—ICT specially adapted for the handling or processing of medical images
- G16H30/40—ICT specially adapted for the handling or processing of medical images for processing medical images, e.g. editing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/04—Protocols for data compression, e.g. ROHC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/184—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being bits, e.g. of the compressed video stream
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
- H04N19/93—Run-length coding
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Health & Medical Sciences (AREA)
- Epidemiology (AREA)
- Radiology & Medical Imaging (AREA)
- Nuclear Medicine, Radiotherapy & Molecular Imaging (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Primary Health Care (AREA)
- Public Health (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
Abstract
The invention relates to the field of image communication, in particular to a high-efficiency fundus image communication method for handheld equipment, which comprises the following steps: obtaining all bit layer images of the fundus digital image; acquiring an optimal element, a secondary multi-element, a minimum frequency two-class element and an optimal operation element of each bit layer image; obtaining the necessary degree of carrying out XOR operation conversion on two types of elements with minimum frequency; replacing the secondary multiple elements by using the XOR operation result of the secondary multiple elements and the optimal operation element, performing XOR operation on the optimal operation element according to the necessary degree, and replacing the minimum two types of elements to obtain an element conversion bit layer image and an identifier layer image; obtaining a fundus compression image according to the element conversion bit layer image and the identifier layer image, and performing image communication; compared with the prior art, the invention greatly improves the image communication efficiency and achieves the effect of high-efficiency image communication.
Description
Technical Field
The invention relates to the technical field of image communication, in particular to a high-efficiency fundus image communication method for handheld equipment.
Background
The fundus is the only part of the whole body which can directly and intensively observe arteries, veins and capillaries by naked eyes, the blood vessels can reflect the dynamic and healthy conditions of the whole body blood circulation of the human body, and a plurality of whole body diseases can be reflected from the fundus, for example, fundus hemorrhage is serious diabetic complication, and the fundus hemorrhage, hypertension, coronary heart disease, nephropathy and the like can leave 'spider silk marks' on the fundus. Fundus photography is a way to examine the fundus of the eye, allowing us to see the tissue structure of the fundus, analyze whether an abnormality exists, and finally screen and diagnose in detail and give specific treatment. In order to facilitate better analysis and diagnosis, a simple and convenient handheld device is needed to collect fundus images more flexibly, and then the fundus images are compressed to carry out image communication between the handheld device and a computer terminal.
In order to improve the efficiency of image communication and reduce the requirements on hardware devices, the communicated images need to be compressed, so that efficient transmission is realized. The conventional image compression method usually adopts run-length coding for compression, but when the run-length coding is adopted for image data compression, the image data with high redundancy degree is often processed with a better effect, but the image data with low redundancy degree is processed with a poorer effect, and even data expansion can occur. The image is usually smoothed to increase the redundancy degree of the image data, and the definition of part of the image is sacrificed to achieve the purpose of increasing the compression rate, such as a common image and a high-definition image, but for the image data with higher requirement on definition, lossless compression is often required during compression and storage, the gray values of the pixels in the image data often have different degrees of difference, and the compression effect of the run-length coding is poor at this time.
Disclosure of Invention
In order to solve the above problems, the present invention provides an efficient fundus image communication method for a handheld device, the method comprising:
s1: carrying out bit layering on the digital image of the fundus image to obtain each bit layer image;
s2: acquiring an optimal element, a secondary multi-element and a minimum frequency element of each bit layer image according to the occurrence frequency of the elements in each bit image; recording binary numbers with the result equal to the optimal elements after the exclusive or operation can be carried out on the binary numbers and the secondary multiple elements as the optimal operation elements of the corresponding bit layer images;
s3: obtaining the necessary degree of the two types of primitives with the minimum frequency for carrying out XOR operation conversion according to the occurrence times of the optimal primitive, the secondary multiple primitives and the two types of primitives with the minimum frequency in the bit layer image;
s4: replacing the secondary multiple elements by using the XOR operation result of the secondary multiple elements and the optimal operation element, performing XOR operation on the optimal operation element according to the necessary degree, and replacing two types of elements with minimum frequency to obtain an element conversion bit layer image and an identifier layer image;
s5: obtaining a compressed image of the fundus image from the primitive conversion bit layer image and the identifier layer image, and performing image communication using the compressed image; decompressing according to the identifier layer image and the optimal operation element to obtain an original fundus image;
the acquiring step of the primitive conversion bit layer image and the identifier layer image comprises the following steps:
performing exclusive-or operation on all secondary multiple elements in each bit layer image and the optimal operation element of the same bit layer image, replacing the original values of the secondary multiple elements with the result of the exclusive-or operation, performing exclusive-or operation on all the two types of elements with the minimum frequency in each bit layer image and the optimal operation element of the same bit layer image according to the necessary degree, replacing the original values of the two types of elements with the minimum frequency with the result of the exclusive-or operation, and comprehensively obtaining a conversion bit layer image of each element;
marking the position identifiers corresponding to the secondary multi-element to be replaced as 1, marking the position identifiers corresponding to the two types of elements with minimum replaced frequency as 1 according to the necessary degree, and comprehensively obtaining the identifier layer image corresponding to the bit layer image.
Further, the step of bit-layering the digital image of the fundus image to obtain each bit-layer image includes:
converting the decimal gray value into binary number, and converting the decimal gray value into 8-bit binary code; extracting binary codes from left to right, namely first binary codes and second binary codes from left to right, from eight-bit binary codes of each pixel point in a coded and converted gray scale image, placing the binary codes in the first bit layer at the position of the pixel point corresponding to each pixel point to form a first bit layer image, extracting binary codes from left to right, namely third binary codes and fourth binary codes from left to right, from the eight-bit binary codes of each pixel point in the coded and converted gray scale image, placing the binary codes in the second bit layer at the position of the pixel point corresponding to each pixel point in the coded and converted gray scale image to form a second bit layer image, placing the binary codes from left to right, namely fifth binary codes and sixth binary codes in the eight-bit binary codes of each pixel point in the coded and converted gray scale image at the position of the pixel point in the fourth bit layer to form a third bit layer image, extracting the binary codes from left to right, seventh binary codes and eighth binary codes of each pixel point in the eight-bit layer after coded and converted gray scale image is separated into 4 equal-bit layer images.
Further, the step of obtaining the optimal primitive, the secondary multiple primitives and the primitive with the minimum frequency of each bit layer image according to the occurrence frequency of the primitives in each bit image includes:
establishing a statistical histogram of each bit layer image, acquiring the occurrence frequency of each bit element, recording the bit element with the highest frequency in the statistical histogram of each bit layer image as the optimal element of the corresponding bit layer image, recording the bit element with the second highest frequency as the secondary multi-element of the corresponding bit layer image, recording all the elements except the optimal element and the secondary multi-element as the two types of elements with the lowest frequency, and recording the binary number which can be subjected to exclusive-or operation with the secondary multi-element and has the result equal to the optimal element as the optimal operation element of the corresponding bit layer image.
Further, the step of obtaining the necessary degree of the xor operation conversion of the two types of primitives with minimum frequency comprises:
the formula of the necessary degree for calculating the minimum frequency two types of primitives to carry out XOR operation conversion is as follows:
wherein p represents the necessary degree of XOR operation conversion of two types of minimum frequency primitives in the bit layer image,
respectively representing the occurrence times of optimal elements, secondary multiple elements and minimum-frequency elements in a bit layer imageAnd (4) counting.
Further, the step of obtaining a compressed image of the fundus image from the primitive conversion bit layer image and the identifier layer image, and performing image communication using the compressed image includes:
the method comprises the steps of obtaining four primitive conversion bit layer images and four identifier layer images, compressing the four primitive conversion bit layer images and the four identifier layer images through run length coding, recording corresponding compression serial numbers, obtaining compressed image data, and exporting the compressed fundus images to a computer end by utilizing special program software of the handheld device.
Further, the step of obtaining the original fundus image by decompression according to the identifier layer image and the optimal operation element includes:
and restoring the element conversion bit layer image received by the computer terminal according to the four identifier layer images and the four optimal operation elements to obtain a corresponding original bit layer image, splicing and restoring the bit layer image according to the compressed sequence number to obtain eight-bit binary codes, and performing decimal conversion on the eight-bit binary codes to obtain an original eye fundus image, thereby completing the image communication between the handheld device and the computer terminal.
The embodiment of the invention has the following beneficial effects:
1. the conversion of the elements is realized by carrying out XOR operation on the elements in the bit layer image, the redundancy degree of the corresponding bit layer is increased, the image data which cannot be efficiently compressed can be efficiently compressed, the image communication efficiency between the handheld device and the computer end is greatly improved, and the effect of efficient image communication is achieved.
2. The corresponding identifier type is obtained by calculating the conversion necessary degree of the bit elements of the corresponding pixel point positions, the redundancy degree of the identifier is further increased, the compression rate of the bit layer image converted by the elements is ensured, the memory occupied by the identification layer image is ensured to be as small as possible, the compression rate and the image communication efficiency are greatly improved, and the effect of high-efficiency image communication is achieved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions and advantages of the prior art, the drawings used in the embodiments or the description of the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a flow chart of steps of a method for efficient fundus image communication for a handheld device according to one embodiment of the present invention;
FIG. 2 is a decimal to binary diagram of an efficient fundus image communication method for a handheld device provided by one embodiment of the present invention;
FIG. 3 is a bit-level diagram of an efficient fundus image communication method for a handheld device according to one embodiment of the present invention;
FIG. 4 is a schematic diagram illustrating an XOR operation of the high-efficiency fundus image communication method for a handheld device according to an embodiment of the present invention;
FIG. 5 is a diagram illustrating primitive translation sequences and labeling sequences for an efficient fundus image communication method for a handheld device according to an embodiment of the present invention;
fig. 6 is a schematic diagram of a primitive conversion bit layer and an identifier layer of an efficient fundus image communication method for a handheld device according to an embodiment of the present invention.
Detailed Description
To further illustrate the technical means and effects of the present invention adopted to achieve the predetermined objects, the following detailed description will be given of the embodiments, structures, features and effects of the method for high-efficiency fundus image communication for handheld devices according to the present invention with reference to the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" refers to not necessarily the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The following describes a specific scheme of the high-efficiency fundus image communication method for the handheld device in detail by combining the accompanying drawings.
Referring to fig. 1, a flow chart of steps of a method for efficient fundus image communication for a handheld device according to an embodiment of the present invention is shown, the method comprising the steps of:
and S001, acquiring digital images of three channels of RGB of the fundus image, and carrying out scale conversion on the gray value.
The equipment for acquiring the fundus images is handheld equipment provided with a mobile phone, a mobile phone camera on the handheld equipment is used for acquiring the fundus images, and the mobile phone is provided with a software program special for carrying out image communication with a computer terminal. The collected image is a three-channel RGB image, if color difference information of the image does not need to be retained, graying the image is performed to obtain a single-channel grayscale image, if color information of the image needs to be retained, the three-channel image is compressed respectively, and subsequent compression processes are performed to process the digital image of each channel.
The decimal gray value is converted into binary number, and the value interval of the gray value is
The decimal gray value is converted into an 8-bit binary code, for example: the gray values are 132, 163, 164, 169, and the corresponding binary codes are: 10000100, 10100011, 10100100, 10101001. The gray values of all the pixels in the gray image are converted, as shown in fig. 2.
And S002, performing bit layering on the digital image of the fundus image to obtain each bit layer image.
And carrying out bit layering on the converted eight-bit binary codes, namely extracting the binary codes of the first and second bits from left to right in the eight-bit binary codes of the first pixel points in the gray-scale image after code conversion, placing the binary codes at the position of the first pixel point of the first bit layer, and similarly, extracting the binary codes of the first and second bits from left to right in the eight-bit binary codes of each pixel point in the gray-scale image after code conversion, placing the binary codes at the position of the corresponding pixel point of the first bit layer, thereby forming a first bit layer image. And in the same way, extracting binary codes of the third and fourth bits from left to right in the gray-scale image after code conversion to form a second bit layer image, and obtaining the third and fourth bit layer images in the same way. Thus, an eight-bit binary-coded gray scale image is split into 4 equal-sized bit layer images after bit layering, and the form is shown in a schematic diagram 3.
And S003, acquiring an optimal element, a secondary multi-element, two types of elements with minimum frequency and an optimal operation element of each bit layer image.
After bit layering, it can be found that the primitive in the first bit layer image is the high order of binary coding, because the image has a rule of local similarity, the gray value difference of local pixel points is not large, the high order similarity of the corresponding binary coding is very high, taking the first bit layer image in the schematic diagram 3 as an example, the bit primitive of each pixel point in the first bit layer image is 10, when the first bit layer is compressed, the compression rate is very large, taking the first bit layer image in the schematic diagram 3 as an example, 18 bits are available before compression, and after run-length coding compression is performed based on the bit primitive: (10, 9) 3 bits after compression. For the low bits of binary coding, a smaller transform can cause the coding to have a transform, and taking the fourth bit layer in fig. 3 as an example, note that: the invention converts two-dimensional image elements into one-dimensional sequence for element conversion and other processing, so the sequence formed by arranging bit elements is as follows: 11. 00, 01, 00, 01, 10, at this time, the similarity between bit elements is low and there is no corresponding transformation rule, at this time, it is desired to perform better compression on the fourth bit layer, it is necessary to process the bit elements, it is found through analysis that the number of occurrences of the bit element 00 in the fourth bit layer is the largest, 01 times, if the bit elements are converted into the bit elements with the largest number of occurrences as much as possible, the redundancy degree of the fourth bit layer will be greatly improved, at the same time, the compression rate of the image will be greatly improved, and finally, the efficiency of the compressed image when performing image communication between the handheld device and the computer end is greatly improved. Therefore, a statistical histogram is established for each bit layer image, the occurrence frequency of each bit element is obtained, the bit element with the highest occurrence frequency of each bit element is the optimal element of the corresponding bit layer, and taking the fourth bit layer in fig. 3 as an example, the optimal element is 00.
If the redundancy degree of the corresponding bit layer is as large as possible, the second most bit elements are all converted into the optimal bit elements, and the second most bit elements are the elements with the second largest occurrence frequency in the statistical histogram, so that the redundancy degree of the corresponding bit layer is greatly increased. Therefore, the optimal operation element is obtained according to the second most bit element type and the optimal element type in a self-adaptive mode.
As shown in fig. 3 and fig. 4: the optimal primitive of the fourth bit layer is 00, the most significant primitives are 01, that is, 01 is converted into 00, exclusive or operation needs to be performed on 01 and 01, and the operation result is 00, so that the optimal operation primitive is obtained according to the optimal primitive 00 of the four bit layer and the most significant primitive 01 of the four bit layer in a self-adaptive manner and is 01, and the optimal operation primitive is the primitive which can be subjected to exclusive or operation with the most significant primitives after the result is equal to the most significant primitive.
However, if only the secondary elements are converted, and the optimal elements are not changed with other frequency-appearing type elements, although the redundancy degree of the bit elements of the corresponding element conversion bit layer is greatly increased, so that the compression efficiency is improved, but in general, the efficiency is not improved as much as possible for the image communication between the handheld device and the computer end, because on the other hand, the storage amount of partial identifiers is increased, in order to further improve the storage amount of the identifiers and improve the efficiency of the image communication as much as possible, we need to improve the redundancy of the identifiers, and we need to convert the two types of elements except the optimal elements and the secondary elements, so that the two types of elements except the optimal elements and the secondary elements are recorded as the two types of elements with the minimum frequency.
And S004, acquiring the necessary degree of performing XOR operation conversion on the two types of primitives with the minimum frequency.
In order to make the compression rate of the identifier layer as large as possible and improve the efficiency of image communication as large as possible, the identifier types of two types of primitives with minimum frequency need to be adaptively changed, taking bit primitives as: 11. 00, 01, 00, 01, 10, for example, only the next most primitive types 01 are all converted into the optimal primitive 00, and the converted bit primitive sequences are: 11. 00, 0000, 10, the added identifiers are: 0. 0, 1, 0, 1, 0, the run length coding after the increased identifier compression at this time is: (0, 2), 1, (0, 3), (1, 2), 0; if all the primitives except the optimal primitive are subjected to exclusive-or operation, the converted bit primitive sequence is as follows: 10. 00, 0000, 11, the added identifiers are: 1. 0, 1, 0, 1, the run length coding after the increased identifier compression is as follows: 1. 0, 1, (0, 3), (1, 3), when the compression rate of the identifier layer after exclusive-or conversion of all the primitives except the optimal primitive is greater than that after exclusive-or conversion of only the next most primitive types. Therefore, a window with a self-adaptive size is established (the window with the self-adaptive size must include three types of primitives), and the necessary degree of xor conversion of two types of primitives with the minimum frequency in the window is calculated, where the window includes three types of primitives, and the three types of primitives are respectively an optimal primitive, a secondary multiple primitive and a frequency-minimum two types of primitives (where the two types of primitives with the minimum frequency of occurrence are denoted as one type here and are both types of primitives other than the optimal primitive and the frequency-occurrence multiple types of primitives), for example, the bit primitive sequence is: 11. 00, 01, 00, 01, 10, wherein 00 is the first class, 01 is the second class, 11 and 10 are the third class, the window size is 3, 6, respectively, and the degree of the need for exclusive-or conversion of the two least frequent classes of primitives in the window is (provided that the third class is adjacent to both the first and second classes, and if only one class is adjacent, the identifier is the same as the identifier of the adjacent class):
wherein p represents the necessary degree of XOR operation conversion for the two types of primitives with the minimum occurrence frequency in the window,
respectively representing the occurrence times of the optimal primitive, the secondary multiple primitives and the primitive with the minimum frequency in the window. The degree of necessity is calculated for each bit layer image.
When the necessary degree of carrying out XOR operation conversion on the two types of primitives with the minimum frequency in the window is 1, carrying out XOR operation on the two types of primitives with the minimum frequency in the bit layer image and the corresponding optimal operation primitive, and replacing the values of the two types of primitives with the minimum frequency by using the result of the XOR operation; on the contrary, when the necessary degree of the two types of minimum-frequency primitives in the window for the XOR operation conversion is 0, the XOR operation is not performed, and the original value is retained. Therefore, the image compression efficiency is further improved, and the image communication efficiency is improved.
S005, obtaining the primitive conversion bit layer image and the identifier layer image.
The gray values of the pixels in the gray image often have a certain difference, so that the effect is poor when the gray image is directly compressed by adopting run-length coding. Analysis shows that the images have local similarity, for example, in the last row of the G channel in the three-channel schematic diagram 3, the gray values are: 132 163, 164, 169, the corresponding binary encoding is: 10000100, 10100011, 10100100, 10101001, observe and discover that the first 2 bits of binary coding of 4 pixel points are 10, turn right from a left side the third and fourth bit be a 00, three 10, discover after converting decimal number into binary number, the similarity between data is very high, if convert 00 into 10, then turn right the third and fourth bit from a left side the binary coding is also the same, the redundancy degree of data is very high this moment, when adopting run length coding to compress this moment, the compression ratio will greatly increased, meanwhile the image communication efficiency of handheld device and computer end also can greatly promote. Therefore, by splitting and combining eight-bit binary numbers and acquiring optimal XOR operation elements in a self-adaptive manner according to the distribution rule, the redundancy degree of data is greatly increased, the compression rate is increased, and the purposes of optimal compression and most efficient image communication are achieved.
After acquiring the optimal primitive, the secondary multiple primitives, the two types of primitives with the minimum frequency and the optimal operation primitive in each window, performing exclusive or operation on all the secondary multiple primitives and all the two types of primitives with the minimum frequency in the window with the necessity degree of 1 and the optimal operation primitive, replacing the original value of each primitive by using the operation result, and performing primitive conversion in the same way on each bit layer image to obtain all primitive conversion bit layer images as shown in a schematic diagram 6.
The redundancy of the corresponding bit layer can be increased by performing primitive conversion, but after conversion, the primitive is converted, and if restoration is performed according to the converted primitive, the original data is converted, so an identifier needs to be added in the process of performing primitive conversion, as shown in fig. 5: adding an identifier to each pixel point, if the primitive corresponding to the pixel point position and the optimal operation primitive are subjected to exclusive-or operation, recording the corresponding identifier as 1, otherwise recording the identifier as 0, taking the fourth bit layer in the schematic diagram 3 as an example, the bit primitive sequence is as follows: 11. 00, 01, 00, 01, 10, calculating the obtained optimal operation primitive to be 01, the most significant primitive types in the bit primitive sequence to be 01, if the most significant primitive types 01 are all converted into the optimal primitive 00, the converted bit primitive sequence is as follows: 11. 00, 0000, 10, the added identifiers are: 0. identifiers of 0, 1, 0, 1 and 0, the two types of primitives with the minimum frequency are marked in the same way, and finally an identifier layer image is obtained as shown in a schematic diagram 6.
S006, obtaining the compressed image of the fundus image and starting image communication, decompressing the compressed image to obtain the original fundus image and completing image communication.
The converted digital image is split into a plurality of parts, one fundus digital image to be compressed is split into four primitive conversion bit layers, four identifier layers and four optimal operation primitives, wherein the four optimal operation primitives are used for converting the original data of each bit layer to obtain four primitive conversion bit layer images with large redundancy degree and four identifier layer images, the four primitive conversion bit layer images with large redundancy degree and the four identifier layer images are compressed through run length coding, the corresponding layer number is recorded to obtain compressed image data, the compressed fundus image starts to carry out image communication with a computer end by utilizing the special software degree of a mobile phone equipped for a handheld device, and the high-efficiency compressed fundus image can improve the efficiency of image communication.
When fundus image data exported by the handheld device is decompressed, only four element conversion bit layer images and four identifier layer images need to be decompressed, the element conversion bit layers are restored according to the identifiers and four optimal operation elements to obtain corresponding original bit layers, the bit layers are spliced and restored according to the sequence to obtain eight-bit binary codes, the eight-bit binary codes are subjected to decimal conversion to obtain the original fundus images, efficient fundus image communication between the handheld device and a computer end is further completed, and communication efficiency is improved.
In summary, the invention implements primitive conversion by performing xor operation on the primitives in the bit layer image, increases the redundancy degree of the corresponding bit layer, enables the image data which cannot be efficiently compressed to be efficiently compressed, and simultaneously greatly improves the image communication efficiency between the handheld device and the computer end, thereby achieving the effect of efficient image communication. And the corresponding identifier type is obtained by calculating the conversion necessary degree of the bit element of the corresponding pixel point position, the redundancy degree of the identifier is further increased, the compression ratio of the bit layer image converted by the element is ensured, the memory occupied by the identification layer image is ensured to be as small as possible, the compression ratio and the image communication efficiency are greatly improved, and the effect of high-efficiency image communication is achieved.
It should be noted that: the precedence order of the above embodiments of the present invention is only for description, and does not represent the merits of the embodiments. And that specific embodiments have been described above. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments.
The above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications or substitutions do not cause the essential features of the corresponding technical solutions to depart from the scope of the technical solutions of the embodiments of the present application, and are intended to be included within the scope of the present application.
Claims (6)
1. A method for efficient fundus image communication for a handheld device, the method comprising:
s1: carrying out bit layering on the digital image of the fundus image to obtain each bit layer image;
s2: acquiring an optimal element, a secondary multi-element and a minimum frequency element of each bit layer image according to the occurrence frequency of the elements in each bit image; recording binary numbers with the result equal to the optimal elements after the exclusive or operation can be carried out on the binary numbers and the secondary multiple elements as the optimal operation elements of the corresponding bit layer images;
s3: obtaining the necessary degree of the two types of primitives with the minimum frequency for carrying out XOR operation conversion according to the occurrence times of the optimal primitive, the secondary multiple primitives and the two types of primitives with the minimum frequency in the bit layer image;
s4: replacing the secondary multiple elements by utilizing the XOR operation result of the secondary multiple elements and the optimal operation elements, performing XOR operation on the optimal operation elements according to the necessary degree, and replacing two types of elements with minimum frequency to obtain an element conversion bit layer image and an identifier layer image;
s5: obtaining a compressed image of the fundus image from the primitive conversion bit layer image and the identifier layer image, and performing image communication using the compressed image; decompressing according to the identifier layer image and the optimal operation element to obtain an original fundus image;
the acquiring step of the primitive conversion bit layer image and the identifier layer image comprises the following steps:
performing exclusive-or operation on all secondary multiple elements in each bit layer image and the optimal operation element of the same bit layer image, replacing the original values of the secondary multiple elements with the result of the exclusive-or operation, performing exclusive-or operation on all the two types of elements with the minimum frequency in each bit layer image and the optimal operation element of the same bit layer image according to the necessary degree, replacing the original values of the two types of elements with the minimum frequency with the result of the exclusive-or operation, and comprehensively obtaining each element conversion bit layer image;
and marking the position identifier corresponding to the replaced secondary multi-element as 1, marking the position identifier corresponding to the replaced two types of elements with the minimum frequency as 1 according to the necessary degree, and comprehensively obtaining the identifier layer image corresponding to the bit layer image.
2. The method for efficient fundus image communication according to claim 1 wherein said step of bit layering the digital image of the fundus image to obtain each bit layer image comprises:
converting the decimal gray value into binary number, and converting the decimal gray value into 8-bit binary code; extracting binary codes of a first bit and a second bit from left to right in eight-bit binary codes of each pixel point in a gray-scale image after code conversion, placing the binary codes of a third bit and a fourth bit from left to right in the eight-bit binary codes of each pixel point in the gray-scale image after code conversion at the position of the corresponding pixel point in a first bit layer to form a first bit layer image, extracting binary codes of a fifth bit and a sixth bit from left to right in the eight-bit binary codes of each pixel point in the gray-scale image after code conversion, placing the binary codes of a fifth bit and a sixth bit from left to right in the eight-bit binary codes of each pixel point in the gray-scale image after code conversion at the position of the corresponding pixel point in a third bit layer to form a third bit layer image, extracting the binary codes of a seventh bit and a eighth bit from right in the eight-bit binary codes of each pixel point in the gray-scale image after code conversion, placing the corresponding pixel points in a fourth bit layer to form a fourth bit layer image, and splitting the gray-scale image of one eight bit binary code after bit layer into 4 equal-scale image.
3. An efficient fundus image communication method for a handheld device according to claim 1, wherein said step of obtaining the optimal primitive, the second most primitive and the least frequent primitive of each bit layer image according to the number of occurrences of primitives in each bit image comprises:
establishing a statistical histogram of each bit layer image, acquiring the occurrence frequency of each bit element, recording the bit element with the highest frequency in the statistical histogram of each bit layer image as the optimal element of the corresponding bit layer image, recording the bit element with the second highest frequency as the secondary multi-element of the corresponding bit layer image, and recording all the elements except the optimal element and the secondary multi-element as the two types of elements with the minimum frequency.
4. An efficient fundus image communication method for a handheld device according to claim 1, wherein said step of obtaining a necessary degree of frequency minimum two-kind element exclusive or conversion comprises:
the formula of the necessary degree for calculating the two types of primitives with the minimum frequency to carry out XOR operation conversion is as follows:
wherein p represents the necessary degree of XOR operation conversion of two types of minimum frequency primitives in the bit layer image,
respectively representing the occurrence times of the optimal element, the secondary multiple element and the minimum frequency element in the bit layer image.
5. A high-efficiency fundus image communication method for a hand-held device according to claim 1, wherein said step of obtaining a compressed image of a fundus image from a primitive conversion bit layer image and an identifier layer image and performing image communication using the compressed image comprises:
the method comprises the steps of obtaining four primitive conversion bit layer images and four identifier layer images, compressing the four primitive conversion bit layer images and the four identifier layer images through run length coding, recording corresponding compression serial numbers, obtaining compressed image data, and exporting the compressed fundus images to a computer end by utilizing special program software of the handheld device.
6. The method for high-efficiency fundus image communication for a handheld device according to claim 1, wherein said step of obtaining an original fundus image by decompression from an identifier layer image and an optimization operation primitive comprises:
and restoring the element conversion bit layer image received by the computer terminal according to the four identifier layer images and the four optimal operation elements to obtain a corresponding original bit layer image, splicing and restoring the bit layer image according to the compression sequence number to obtain eight-bit binary codes, and performing decimal conversion on the eight-bit binary codes to obtain an original eye fundus image, thereby completing image communication between the handheld device and the computer terminal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211487895.7A CN115529466B (en) | 2022-11-25 | 2022-11-25 | High-efficiency fundus image communication method for handheld equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211487895.7A CN115529466B (en) | 2022-11-25 | 2022-11-25 | High-efficiency fundus image communication method for handheld equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115529466A CN115529466A (en) | 2022-12-27 |
| CN115529466B true CN115529466B (en) | 2023-01-31 |
Family
ID=84705428
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211487895.7A Active CN115529466B (en) | 2022-11-25 | 2022-11-25 | High-efficiency fundus image communication method for handheld equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115529466B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116320499B (en) * | 2023-04-17 | 2024-01-09 | 深圳市嘉立方科技有限公司 | Communication method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101488225A (en) * | 2009-03-05 | 2009-07-22 | 山东大学 | VLSI system structure of bit plane encoder |
| CN103428495A (en) * | 2013-08-02 | 2013-12-04 | 中国联合网络通信集团有限公司 | Image encryption method and device and image decryption method and device |
| CN114745553A (en) * | 2022-04-06 | 2022-07-12 | 郑州美初电子科技有限公司 | Image data storage method based on big data |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9819969B2 (en) * | 2013-11-26 | 2017-11-14 | Nvidia Corporation | Generalization of methods and systems for image compression while encoding at least one extra bit |
| US11265544B2 (en) * | 2018-09-18 | 2022-03-01 | Sony Corporation | Apparatus and method for image compression based on optimal sequential encoding scheme |
-
2022
- 2022-11-25 CN CN202211487895.7A patent/CN115529466B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101488225A (en) * | 2009-03-05 | 2009-07-22 | 山东大学 | VLSI system structure of bit plane encoder |
| CN103428495A (en) * | 2013-08-02 | 2013-12-04 | 中国联合网络通信集团有限公司 | Image encryption method and device and image decryption method and device |
| CN114745553A (en) * | 2022-04-06 | 2022-07-12 | 郑州美初电子科技有限公司 | Image data storage method based on big data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115529466A (en) | 2022-12-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109472270B (en) | Image style conversion method, device and equipment | |
| CN116723337B (en) | HDMI high definition data optimized transmission method and system | |
| CN115529466B (en) | High-efficiency fundus image communication method for handheld equipment | |
| CN115955513B (en) | Data optimization transmission method for Internet of things | |
| CN116405574B (en) | Remote medical image optimization communication method and system | |
| US6130630A (en) | Apparatus and method for compressing Huffman encoded data | |
| JP2006526357A (en) | Color image compression using spectral decorrelation and removal of spatial redundancy | |
| US20220201339A1 (en) | System and method for rgbg conversion | |
| EP0875858B1 (en) | Method and apparatus for compressing and decompressing image data | |
| CN116760994A (en) | Medical image coding communication method for neurology | |
| CN111881920A (en) | Network adaptation method of large-resolution image and neural network training device | |
| KR20100079121A (en) | Image encoder and image encoding method | |
| JP4293912B2 (en) | Data compression of color images using wavelet transform | |
| EP0969675A2 (en) | Image signal processing method, image signal processing system, storage medium, and image sensing apparatus | |
| US20080310746A1 (en) | Apparatus and method for generating chain code | |
| CN101919248A (en) | Byte representation for enhanced image compression | |
| CN116168790B (en) | Big data recruitment system for clinical trial | |
| US20020001414A1 (en) | System for building a data compression encoder | |
| CN110855990B (en) | Image encoding method, image decoding method, computer device, and image processing system | |
| CN114463450A (en) | Computer image compression method and system based on artificial intelligence | |
| CN114693818A (en) | Compression method suitable for digital ortho image data | |
| KR102120681B1 (en) | Apparatus and method for reducing number of channels in input images to compress deep neural networks | |
| Otair et al. | Research article lossy image compression by Rounding the Intensity Followed by Dividing (RIFD) | |
| WO2023082955A1 (en) | Encoding method, decoding method and electronic device | |
| JP2002527011A (en) | Data compression coding system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |