Nothing Special   »   [go: up one dir, main page]

CN117119119B - Compression transmission method, device and system for image data - Google Patents

Compression transmission method, device and system for image data Download PDF

Info

Publication number
CN117119119B
CN117119119B CN202311087018.5A CN202311087018A CN117119119B CN 117119119 B CN117119119 B CN 117119119B CN 202311087018 A CN202311087018 A CN 202311087018A CN 117119119 B CN117119119 B CN 117119119B
Authority
CN
China
Prior art keywords
partitions
image
layering
partition
transmitted
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
Application number
CN202311087018.5A
Other languages
Chinese (zh)
Other versions
CN117119119A (en
Inventor
黄泽锋
黄丕润
赵少宏
徐幸子
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Piwei Science & Technology Enterprise Co ltd Shenzhen
Original Assignee
Piwei Science & Technology Enterprise Co ltd Shenzhen
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Piwei Science & Technology Enterprise Co ltd Shenzhen filed Critical Piwei Science & Technology Enterprise Co ltd Shenzhen
Priority to CN202311087018.5A priority Critical patent/CN117119119B/en
Publication of CN117119119A publication Critical patent/CN117119119A/en
Application granted granted Critical
Publication of CN117119119B publication Critical patent/CN117119119B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/002D [Two Dimensional] image generation
    • G06T11/40Filling a planar surface by adding surface attributes, e.g. colour or texture
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/41Bandwidth or redundancy reduction

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

The application belongs to the technical field of image compression, and particularly relates to a compression transmission method, device and system of image data, comprising the following steps: acquiring an image to be transmitted; generating a plurality of first partitions on the image to be transmitted, and calculating the mean value of RGBA components of each first partition; determining a plurality of second partitions by means of the mean value of the RGB components of each partition; layering the images to be transmitted according to the number of the second partitions; blank filling is carried out on each layering; compressing each filled layering respectively; sequentially transmitting the result of each layering compression treatment to a communication opposite terminal according to the layering sequence; wherein two adjacent first partitions have overlapping areas. According to the method provided by the application, the image is segmented, layering processing is carried out on the image based on the segmentation result, each layering is independently compressed, and the similarity of each regional image obtained by layering can be utilized, so that the layering is finer, and the compression ratio is improved.

Description

Compression transmission method, device and system for image data
Technical Field
The present application belongs to the field of image compression technology, and in particular, to a method, an apparatus, and a system for compressing and transmitting image data.
Background
The image on the screen is displayed by pixels whose color display is controlled by the RGBA value of each pixel, where the A value is an Alpha channel value appended to the RGB model, typically used as an opacity parameter, for controlling rendering and composition.
The image display is stored in the form of data before the screen, and even if the Alpha channel is not considered, a 1920 x 1080 image data volume exceeds 8m, and 1g is easy to store more than 100 images, which is hardly acceptable. For this reason, compression processing for an image is necessary.
The traditional data compression algorithm is based on the principle of carrying out reduced recording on pixel values, the mode starts from the relevance of adjacent pixel values, the final aim is to simplify the whole image into a total result, and the image is restored from the total simplified result, so that the mode is limited by the color distribution of the image, and the compression rate is not high.
Disclosure of Invention
In view of the above, embodiments of the present application provide a method, an apparatus, and a system for compressing and transmitting image data, which can solve the problem that the compression rate is not high in the conventional compression method.
A first aspect of an embodiment of the present application provides a compression transmission method of image data, including:
acquiring an image to be transmitted;
generating a plurality of first partitions on the image to be transmitted, and calculating the mean value of RGBA components of each first partition;
determining a plurality of second partitions by means of the mean value of the RGB components of each partition;
layering the images to be transmitted according to the number of the second partitions;
blank filling is carried out on each layering;
Compressing each filled layering respectively;
sequentially transmitting the result of each layering compression treatment to a communication opposite terminal according to the layering sequence;
Wherein two adjacent first partitions have overlapping areas.
A second aspect of an embodiment of the present application provides a compression transmission apparatus for image data, including:
The acquisition module is used for acquiring an image to be transmitted;
the mean value calculation module is used for generating a plurality of first subareas on the image to be transmitted and calculating the mean value of RGBA components of each first subarea;
The dividing module is used for determining a plurality of second partitions by the average value of RGB components of each partition;
the layering module is used for layering the images to be transmitted according to the number of the second partitions;
The filling module is used for blank filling of each layering;
The compression module is used for respectively carrying out compression treatment on each filled layering;
The transmission module is used for sequentially transmitting the result of each layering compression treatment to the communication opposite terminal according to the layering sequence;
Wherein two adjacent first partitions have overlapping areas.
A third aspect of the embodiment of the present application provides a compression transmission system for image data, wherein the compression transmission system for image data includes an image acquisition device and a computer device;
the image acquisition equipment is used for acquiring images and transmitting the acquired images to the computer equipment;
The computer equipment is used for executing the compressed image layer obtained by the compression transmission method of the image data and transmitting the compressed image layer to the communication opposite terminal.
Compared with the prior art, the embodiment of the application has the beneficial effects that: according to the method provided by the application, the image is segmented, layering processing is carried out on the image based on the segmentation result, so that each layering only comprises one second partition, the color complexity in each layering is reduced, the existing mature compression algorithm is adopted for each layering to compress the image based on the layering result, the similarity of each regional image obtained by layering can be utilized, the layering is finer, and the total compression ratio of the image is improved; and the compressed image acquisition layered transmission mode reduces the data volume of single transmission, can realize transmission while processing, and is suitable for scenes with image transmission requirements in a communication state.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flow chart of a compression transmission method of image data provided by an embodiment of the present application;
fig. 2 is a block diagram of a compression transmission apparatus for image data according to an embodiment of the present application;
fig. 3 is a schematic diagram of a terminal device according to an embodiment of the present application.
Detailed Description
In the following description, for purposes of explanation and not limitation, specific details are set forth such as the particular system architecture, techniques, etc., in order to provide a thorough understanding of the embodiments of the present application. It will be apparent, however, to one skilled in the art that the present application may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present application with unnecessary detail.
In order to illustrate the technical scheme of the application, the following description is made by specific examples.
Fig. 1 shows a compression transmission method of image data according to a first embodiment of the present application, which is described in detail below: a compression transmission method of image data, the compression transmission method of image data comprising:
acquiring an image to be transmitted;
generating a plurality of first partitions on the image to be transmitted, and calculating the mean value of RGBA components of each first partition;
determining a plurality of second partitions by means of the mean value of the RGB components of each partition;
layering the images to be transmitted according to the number of the second partitions;
blank filling is carried out on each layering;
Compressing each filled layering respectively;
sequentially transmitting the result of each layering compression treatment to a communication opposite terminal according to the layering sequence;
Wherein two adjacent first partitions have overlapping areas.
In the present application, the image to be transmitted refers to an image to be transmitted to a communication opposite end, where the communication opposite end refers to another device that communicates with a terminal or a computer device that performs the method of the present application, and the communication opposite end may specifically be a mobile device or a computer device that is fixedly disposed, where the communication opposite end and the terminal or the computer device that performs the method provided by the present application adopt a wired connection or a wireless connection manner.
In the present application, the size and position of the first partitions are preset, and the process of partitioning the image is actually performed, unlike the general partitioning method, each first partition in the present application has a common overlapping area with the adjacent first partitions, and these overlapping areas participate in the calculation of RGBA components when the corresponding two first partitions perform. It will be understood that RGBA herein refers to R, G, B and a components of a pixel, respectively, wherein the a component is used to control the display transparency, and its value is set between 0-255 or 0-1, preferably 0-255, so as to have the same weight as the RGB component; of course, the specific gravity of the material may be reduced to a value within the range of 0 to 1.
In the application, the second partition is determined by the average value of RBGA components of each first partition, and different color blocks are obtained after the second partition is divided, so that each block is conveniently and independently compressed, the compression effectiveness in the block is improved, and the influence on the continuity of a compression algorithm between different blocks is reduced.
In the application, after the second subarea is obtained, the image is layered, so that each subarea only comprises one subarea, each subarea is convenient to compress independently, and different subareas can also adopt different compression algorithms, thereby improving the compression rate.
Compared with the prior art, the embodiment of the application has the beneficial effects that: according to the method provided by the application, the image is segmented, layering processing is carried out on the image based on the segmentation result, so that each layering only comprises one second partition, the color complexity in each layering is reduced, the existing mature compression algorithm is adopted for each layering to compress the image based on the layering result, the similarity of each regional image obtained by layering can be utilized, the layering is finer, and the total compression ratio of the image is improved; and the compressed image acquisition layered transmission mode reduces the data volume of single transmission, can realize transmission while processing, and is suitable for scenes with image transmission requirements in a communication state.
In one embodiment of the present application, the generating a plurality of first partitions on the image to be transmitted includes:
Equally dividing an image to be transmitted into n rows and m columns;
obtaining (n-1) base points from the intersection points of the bisectors;
Taking each base point as a center to form rectangular frames, and enabling a side distance bisector of each rectangular frame or an image edge to be a set distance to obtain (n-1) ×m-1 rectangular frames, wherein each rectangular frame forms a first partition;
Wherein n and m are positive integers, the height of the image to be transmitted is an integer multiple of n, and the width of the image to be transmitted is an integer multiple of m.
In the application, n and m view images are set according to the number of pixels in the rows and the columns, and each row/column can comprise 5, 10 and 20 pixel rows/columns, so that n and m can be obtained according to the pixel height or the pixel width of the image. It is to be understood that the height or width of the image to be transmitted herein does not refer to an absolute height or an absolute width, but to a height and a width of a pixel unit, for example 1920×1080 refers to an image having a length of 1920 pixels and a height of 1080 pixels.
In the present application, the set distance here is about 1 to 3 pixels in height or pixel width, alternatively, when the number of pixels per row/column is less than 10, the set distance is 1; taking 2 when the weight is between 10 and 20, and taking 3 when the weight is greater than 20. In the application, rectangular frames made by two adjacent base points have overlapping areas, and the overlapping areas are rectangular.
In one embodiment of the present application, the calculating the mean value of RGBA components of each first partition includes:
For each rectangular box, the mean of the R, G, B and a components is calculated separately.
In the present application, the R component, G component, B component, and a component of each pixel can be directly read from the image data. The average value of each component in each rectangular region is equal to the ratio of the sum of the components of all pixels in the region to the number of pixels in the region.
In one embodiment of the present application, the determining a number of second partitions from the average value of RGB components of each partition includes:
For any two adjacent first partitions, calculating Euclidean distances of the two first partitions according to the values of components of the two first partitions;
Judging whether the calculated Euclidean distance is larger than a first set threshold value, if so, dividing the overlapping area of two adjacent first partitions into isolation areas;
Repeating the previous step, determining all isolation areas, and integrating the obtained isolation areas;
Dividing the non-isolated area based on the integrated result to obtain a plurality of second partitions;
And calculating whether the distance between the boundary point of each second partition and the opposite boundary point is smaller than a second set threshold value, and if so, dividing the second partition into two second partitions through the distance smaller than the second set threshold value.
In the present application, the partition adjacency may be basically determined by adjacency, and for a base point, adjacency refers to a nearest base point of which one base point is left, right, upper or lower of another base point, and may also be a nearest base point located in each diagonal direction of a row or a line, and an adjacency first partition is formed between a rectangular frame made with the base point as a center and a rectangular frame formed with a current base point.
In the present application, the Euclidean distance of the two first partitions is calculated by the following formula/>Respectively the average of R, G, B, A of the first partition, correspondingly,/>/>The mean of R, G, B, A for the second partition, respectively.
To be used forFor example,/>Where N1 is the number of pixels in the first partition and R i is the R component of the i-th pixel.
In the application, the maximum value of the Euclidean distance is 2×256, the first set value can be 0.3-0.5 times of the maximum value, the pictures of different scenes can be set by self, and the dividing accuracy can be adjusted by adjusting the size of the first set value.
In the application, for each boundary point, a tangent line passing through the boundary point is taken as a boundary, a straight line segment perpendicular to the tangent line is taken in the direction from the boundary point to the inside of the second partition, and the length obtained when the straight line segment crosses another boundary point of the same second partition is the distance between the boundary and the opposite boundary point. When the distances between a plurality of continuous boundary pixels at a certain boundary are smaller than a set second threshold value, the minimum distance line segment is taken as a cutting line, and the second division is divided into two parts. It will be appreciated that there may be multiple partitions of the same second partition; the purpose of segmentation is to solve the problem of division between regions that cannot be distinguished by region identification, and to be able to accommodate more complex image processing.
In one embodiment of the present application, the integrating the resulting isolation region includes:
For any one first partition, determining the number of isolation areas of the first partition; if the number of the isolation areas is more than or equal to 3, taking the whole first partition as the isolation area; if the number of the isolation areas is equal to 2 and the two isolation areas are positioned at two sides of the first partition, taking the whole first partition at the two sides of the isolation area as the isolation area; if the number of the isolation areas is equal to 2 and the two isolation areas partially overlap, the whole first partition is taken as the isolation area.
In the present application, the above-mentioned provision of specific division of the first partitions having different numbers of overlapping regions makes it possible to distinguish more accurately between the isolation regions.
In one embodiment of the present application, layering the image to be transmitted according to the number of second partitions includes:
Dividing an image to be transmitted into k+1 layers according to the number k of second partitions, wherein each layer of the first k layers only comprises one second partition, the second partitions contained in different layers are different, and the k+1 layer only comprises an isolation region.
In the application, each layering can only have one second partition or isolation area through the layering, so that each layering is convenient to carry out independent compression treatment.
In one embodiment of the present application, the blank filling for each layer includes:
And (3) according to the size of the original image to be transmitted, transparent filling is carried out on the blank area of each layered non-image.
In the application, it can be understood that the size of each layering is consistent with the image to be transmitted, so that the transparent layer needs to be filled in the blank area of each layering, and the filling of the transparent layer can position the position information of each pixel in the layer during encoding, and meanwhile, new information cannot be introduced, so that the compression encoding of the image area is influenced. The original image to be transmitted here refers to the image to be transmitted before processing.
In one embodiment of the present application, the compression process uses any one or more of run-length encoding, discrete cosine transform encoding, and huffman encoding.
In the application, for each layering, the three compression processing algorithms can be respectively selected for processing, and one compression mode with large compression ratio is selected, so that the compression algorithm can be adapted to different layers.
Corresponding to the method of the above embodiment, fig. 2 shows a block diagram of a compression transmission device for image data according to an embodiment of the present application, and for convenience of explanation, only a portion related to the embodiment of the present application is shown. A compression transmission apparatus of image data illustrated in fig. 2 may be an execution subject of a compression transmission method of image data provided by the foregoing embodiment.
Referring to fig. 2, a compression transmission apparatus of image data, the compression transmission apparatus of image data includes:
The acquisition module is used for acquiring an image to be transmitted;
the mean value calculation module is used for generating a plurality of first subareas on the image to be transmitted and calculating the mean value of RGBA components of each first subarea;
The dividing module is used for determining a plurality of second partitions by the average value of RGB components of each partition;
the layering module is used for layering the images to be transmitted according to the number of the second partitions;
The filling module is used for blank filling of each layering;
The compression module is used for respectively carrying out compression treatment on each filled layering;
The transmission module is used for sequentially transmitting the result of each layering compression treatment to the communication opposite terminal according to the layering sequence;
Wherein two adjacent first partitions have overlapping areas.
The process of implementing respective functions by each module in the compression transmission device for image data provided in the embodiment of the present application may refer to the description of the embodiment shown in fig. 1, and will not be repeated here.
The embodiment of the application also provides a compression transmission system of the image data, which comprises an image acquisition device and a computer device;
the image acquisition equipment is used for acquiring images and transmitting the acquired images to the computer equipment;
The computer device is configured to execute the compressed layer obtained by the method for transmitting image data according to any one of the embodiments and transmit the compressed layer to the opposite communication terminal.
In the present application, the image capturing device may be a camera provided in a monitoring section or a store, and the computer device is a processing device wired to the camera or connected through a network, and the terminal communicates as a mobile device for remote monitoring.
It should be understood that the sequence number of each step in the foregoing embodiment does not mean that the execution sequence of each process should be determined by the function and the internal logic, and should not limit the implementation process of the embodiment of the present application.
It should be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It should also be understood that the term "and/or" as used in the present specification and the appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes such combinations.
As used in the present description and the appended claims, the term "if" may be interpreted as "when..once" or "in response to a determination" or "in response to detection" depending on the context. Similarly, the phrase "if a determination" or "if a [ described condition or event ] is detected" may be interpreted in the context of meaning "upon determination" or "in response to determination" or "upon detection of a [ described condition or event ]" or "in response to detection of a [ described condition or event ]".
Furthermore, the terms "first," "second," "third," and the like in the description of the present specification and in the appended claims, are used for distinguishing between descriptions and not necessarily for indicating or implying a relative importance. It will also be understood that, although the terms "first," "second," etc. may be used herein in some embodiments of the application to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another element. For example, a first table may be named a second table, and similarly, a second table may be named a first table without departing from the scope of the various described embodiments. The first table and the second table are both tables, but they are not the same table.
Reference in the specification to "one embodiment" or "some embodiments" or the like means that a particular feature, structure, or characteristic described in connection with the embodiment is included in one or more embodiments of the application. Thus, appearances of the phrases "in one embodiment," "in some embodiments," "in other embodiments," and the like in the specification are not necessarily all referring to the same embodiment, but mean "one or more but not all embodiments" unless expressly specified otherwise. The terms "comprising," "including," "having," and variations thereof mean "including but not limited to," unless expressly specified otherwise.
The compression transmission method of the image data provided by the embodiment of the application can be applied to terminal equipment such as mobile phones, tablet computers, wearable equipment, vehicle-mounted equipment, augmented reality (augmented reality, AR)/Virtual Reality (VR) equipment, notebook computers, ultra-mobile personal computer (UMPC), netbooks, personal digital assistants (personal DIGITAL ASSISTANT, PDA) and the like, and the embodiment of the application does not limit the specific types of the terminal equipment.
For example, the terminal device may be a Station (ST) in a WLAN, a cellular telephone, a cordless telephone, a Session initiation protocol (Session InitiationProtocol, SIP) telephone, a wireless local loop (Wireless Local Loop, WLL) station, a Personal digital assistant (Personal DIGITAL ASSISTANT, PDA) device, a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a car networking terminal, a computer, a laptop computer, a handheld communication device, a handheld computing device, a satellite radio, a wireless modem card, a television Set Top Box (STB), a customer premise equipment (customer premise equipment, CPE) and/or other devices for communicating over a wireless system as well as next generation communication systems, such as a mobile terminal in a 5G network or a mobile terminal in a future evolved public land mobile network (Public Land Mobile Network, PLMN) network, etc.
By way of example, but not limitation, when the terminal device is a wearable device, the wearable device may also be a generic name for applying wearable technology to intelligently design daily wear, developing wearable devices, such as glasses, gloves, watches, apparel, shoes, and the like. The wearable device is a portable device that is worn directly on the body or integrated into the clothing or accessories of the user. The wearable device is not only a hardware device, but also can realize a powerful function through software support, data interaction and cloud interaction. The generalized wearable intelligent device comprises full functions, large size, and complete or partial functions which can be realized independent of a smart phone, such as a smart watch or a smart glasses, and is only focused on certain application functions, and needs to be matched with other devices such as the smart phone for use, such as various smart bracelets, smart jewelry and the like for physical sign monitoring.
Fig. 3 is a schematic structural diagram of a terminal device according to an embodiment of the present application. As shown in fig. 3, the terminal device 3 of this embodiment may be the above-described computer device including: at least one processor 30 (only one is shown in fig. 3), a memory 31, said memory 31 having stored therein a computer program 32 executable on said processor 30. The processor 30, when executing the computer program 32, implements the steps of the above-described embodiments of the method for identifying potential customers, such as steps S100 to S700 shown in fig. 1. Or the processor 30, when executing the computer program 32, performs the functions of the modules/units of the apparatus embodiments described above, e.g., the functions of the modules shown in fig. 2.
The terminal device 3 may be a computing device such as a desktop computer, a notebook computer, a palm computer, a cloud server, etc. The terminal device may include, but is not limited to, a processor 30, a memory 31. It will be appreciated by those skilled in the art that fig. 3 is merely an example of the terminal device 3 and does not constitute a limitation of the terminal device 3, and may comprise more or less components than shown, or may combine certain components, or different components, e.g. the terminal device may further comprise an input transmitting device, a network access device, a bus, etc.
The Processor 30 may be a central processing unit (Central Processing Unit, CPU), other general purpose Processor, digital signal Processor (DIGITAL SIGNAL Processor, DSP), application SPECIFIC INTEGRATED Circuit (ASIC), off-the-shelf Programmable gate array (Field-Programmable GATE ARRAY, FPGA) or other Programmable logic device, discrete gate or transistor logic device, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 31 may in some embodiments be an internal storage unit of the terminal device 3, such as a hard disk or a memory of the terminal device 3. The memory 31 may also be an external storage device of the terminal device 3, such as a plug-in hard disk, a smart memory card (SMART MEDIA CARD, SMC), a Secure Digital (SD) card, a flash memory card (FLASH CARD) or the like, which are provided on the terminal device 3. Further, the memory 31 may also include both an internal storage unit and an external storage device of the terminal device 3. The memory 31 is used for storing an operating system, application programs, boot loader (BootLoader), data, other programs etc., such as program codes of the computer program etc. The memory 31 may also be used for temporarily storing data that has been transmitted or is to be transmitted.
In addition, each functional unit in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The embodiment of the application also provides a terminal device, which comprises at least one memory, at least one processor and a computer program stored in the at least one memory and capable of running on the at least one processor, wherein the processor executes the computer program to enable the terminal device to realize the steps in any of the method embodiments.
Embodiments of the present application also provide a computer readable storage medium storing a computer program which, when executed by a processor, implements steps for implementing the various method embodiments described above.
Embodiments of the present application provide a computer program product enabling a terminal device to carry out the steps of the method embodiments described above when the computer program product is run on the terminal device.
The integrated modules/units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the present application may implement all or part of the flow of the method of the above embodiment, or may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and when the computer program is executed by a processor, the computer program may implement the steps of each of the method embodiments described above. Wherein the computer program comprises computer program code which may be in source code form, object code form, executable file or some intermediate form etc. The computer readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), an electrical carrier signal, a telecommunications signal, a software distribution medium, and so forth.
In the foregoing embodiments, the descriptions of the embodiments are emphasized, and in part, not described or illustrated in any particular embodiment, reference is made to the related descriptions of other embodiments.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
The above embodiments are only for illustrating the technical solution of the present application, and not for limiting the same; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application, and are intended to be included in the scope of the present application.

Claims (8)

1. A compression transmission method of image data, characterized in that the compression transmission method of image data comprises:
acquiring an image to be transmitted;
generating a plurality of first partitions on the image to be transmitted, and calculating the mean value of RGBA components of each first partition;
determining a plurality of second partitions by means of the mean value of the RGB components of each partition;
layering the images to be transmitted according to the number of the second partitions;
blank filling is carried out on each layering;
Compressing each filled layering respectively;
sequentially transmitting the result of each layering compression treatment to a communication opposite terminal according to the layering sequence;
wherein two adjacent first partitions have overlapping areas;
the calculating the mean value of RGBA components of each first partition includes:
For each rectangular box, calculating the average value of the R component, the G component, the B component and the A component respectively;
the determining a plurality of second partitions by the average value of each partition RGB component includes:
For any two adjacent first partitions, calculating Euclidean distances of the two first partitions according to the values of components of the two first partitions;
Judging whether the calculated Euclidean distance is larger than a first set threshold value, if so, dividing the overlapping area of two adjacent first partitions into isolation areas;
Repeating the previous step, determining all isolation areas, and integrating the obtained isolation areas;
Dividing the non-isolated area based on the integrated result to obtain a plurality of second partitions;
And calculating whether the distance between the boundary point of each second partition and the opposite boundary point is smaller than a second set threshold value, and if so, dividing the second partition into two second partitions through the distance smaller than the second set threshold value.
2. The method for compressed transmission of image data according to claim 1, wherein said generating a plurality of first partitions on the image to be transmitted includes:
Equally dividing an image to be transmitted into n rows and m columns;
obtaining (n-1) base points from the intersection points of the bisectors;
Taking each base point as a center to form rectangular frames, and enabling a side distance bisector of each rectangular frame or an image edge to be a set distance to obtain (n-1) ×m-1 rectangular frames, wherein each rectangular frame forms a first partition;
Wherein n and m are positive integers, the height of the image to be transmitted is an integer multiple of n, and the width of the image to be transmitted is an integer multiple of m.
3. The method for compressed transmission of image data according to claim 1, wherein said integrating the resulting isolation area comprises:
For any one first partition, determining the number of isolation areas of the first partition; if the number of the isolation areas is more than or equal to 3, taking the whole first partition as the isolation area; if the number of the isolation areas is equal to 2 and the two isolation areas are positioned at two sides of the first partition, taking the whole first partition at the two sides of the isolation area as the isolation area; if the number of the isolation areas is equal to 2 and the two isolation areas partially overlap, the whole first partition is taken as the isolation area.
4. The compression transmission method of image data according to claim 1, wherein the layering the image to be transmitted according to the number of the second partitions includes:
Dividing an image to be transmitted into k+1 layers according to the number k of second partitions, wherein each layer of the first k layers only comprises one second partition, the second partitions contained in different layers are different, and the k+1 layer only comprises an isolation region.
5. The method for compressed transmission of image data according to claim 4, wherein said blank-filling each layer includes:
And (3) according to the size of the original image to be transmitted, transparent filling is carried out on the blank area of each layered non-image.
6. The method for compressed transmission of image data according to claim 1, wherein the compression process uses any one or more of run-length encoding, discrete cosine transform encoding, and huffman encoding.
7. A compression transmission apparatus of image data, characterized in that the compression transmission apparatus of image data comprises:
The acquisition module is used for acquiring an image to be transmitted;
the mean value calculation module is used for generating a plurality of first subareas on the image to be transmitted and calculating the mean value of RGBA components of each first subarea;
The dividing module is used for determining a plurality of second partitions by the average value of RGB components of each partition;
the layering module is used for layering the images to be transmitted according to the number of the second partitions;
The filling module is used for blank filling of each layering;
The compression module is used for respectively carrying out compression treatment on each filled layering;
The transmission module is used for sequentially transmitting the result of each layering compression treatment to the communication opposite terminal according to the layering sequence;
wherein two adjacent first partitions have overlapping areas;
the calculating the mean value of RGBA components of each first partition includes:
For each rectangular box, calculating the average value of the R component, the G component, the B component and the A component respectively;
the determining a plurality of second partitions by the average value of each partition RGB component includes:
For any two adjacent first partitions, calculating Euclidean distances of the two first partitions according to the values of components of the two first partitions;
Judging whether the calculated Euclidean distance is larger than a first set threshold value, if so, dividing the overlapping area of two adjacent first partitions into isolation areas;
Repeating the previous step, determining all isolation areas, and integrating the obtained isolation areas;
Dividing the non-isolated area based on the integrated result to obtain a plurality of second partitions;
And calculating whether the distance between the boundary point of each second partition and the opposite boundary point is smaller than a second set threshold value, and if so, dividing the second partition into two second partitions through the distance smaller than the second set threshold value.
8. A compression transmission system of image data, characterized in that the compression transmission system of image data comprises an image acquisition device and a computer device;
the image acquisition equipment is used for acquiring images and transmitting the acquired images to the computer equipment;
The computer device is configured to execute the compressed layer obtained by the compression transmission method of image data according to any one of claims 1 to 6 and transmit the compressed layer to the opposite communication terminal.
CN202311087018.5A 2023-08-24 2023-08-24 Compression transmission method, device and system for image data Active CN117119119B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311087018.5A CN117119119B (en) 2023-08-24 2023-08-24 Compression transmission method, device and system for image data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311087018.5A CN117119119B (en) 2023-08-24 2023-08-24 Compression transmission method, device and system for image data

Publications (2)

Publication Number Publication Date
CN117119119A CN117119119A (en) 2023-11-24
CN117119119B true CN117119119B (en) 2024-06-11

Family

ID=88805224

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311087018.5A Active CN117119119B (en) 2023-08-24 2023-08-24 Compression transmission method, device and system for image data

Country Status (1)

Country Link
CN (1) CN117119119B (en)

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1458791A (en) * 2002-04-25 2003-11-26 微软公司 Sectioned layered image system
JP2004201047A (en) * 2002-12-19 2004-07-15 Ricoh Co Ltd Image processing apparatus, program, and storage medium
JP2004236217A (en) * 2003-01-31 2004-08-19 Ricoh Co Ltd Device for removing unwanted portion, image processor, program, storage medium and method for removing unwanted portion
CN1965582A (en) * 2003-02-03 2007-05-16 爱迪美憬公司 Process and device for the compression of portions of images
CN102098507A (en) * 2010-06-08 2011-06-15 同济大学 Integrative compressing method and device of image
CN104331883A (en) * 2014-10-28 2015-02-04 华南理工大学 Image boundary extraction method based on non-symmetry and anti-packing model
CN112929705A (en) * 2021-02-02 2021-06-08 腾讯科技(深圳)有限公司 Texture compression and decompression method and device, computer equipment and storage medium
CN114494036A (en) * 2021-12-28 2022-05-13 东莞市金锐显数码科技有限公司 Image saturation adjusting method and device, computer equipment and storage medium
CN114584773A (en) * 2022-02-08 2022-06-03 海宁奕斯伟集成电路设计有限公司 Image compression device, method, electronic device, and computer-readable storage medium
CN115775283A (en) * 2022-11-15 2023-03-10 网易(杭州)网络有限公司 Image compression method, device, storage medium and computer equipment
CN116188603A (en) * 2021-11-27 2023-05-30 华为技术有限公司 Image processing method and device

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1458791A (en) * 2002-04-25 2003-11-26 微软公司 Sectioned layered image system
JP2004201047A (en) * 2002-12-19 2004-07-15 Ricoh Co Ltd Image processing apparatus, program, and storage medium
JP2004236217A (en) * 2003-01-31 2004-08-19 Ricoh Co Ltd Device for removing unwanted portion, image processor, program, storage medium and method for removing unwanted portion
CN1965582A (en) * 2003-02-03 2007-05-16 爱迪美憬公司 Process and device for the compression of portions of images
CN102098507A (en) * 2010-06-08 2011-06-15 同济大学 Integrative compressing method and device of image
CN104331883A (en) * 2014-10-28 2015-02-04 华南理工大学 Image boundary extraction method based on non-symmetry and anti-packing model
CN112929705A (en) * 2021-02-02 2021-06-08 腾讯科技(深圳)有限公司 Texture compression and decompression method and device, computer equipment and storage medium
CN116188603A (en) * 2021-11-27 2023-05-30 华为技术有限公司 Image processing method and device
CN114494036A (en) * 2021-12-28 2022-05-13 东莞市金锐显数码科技有限公司 Image saturation adjusting method and device, computer equipment and storage medium
CN114584773A (en) * 2022-02-08 2022-06-03 海宁奕斯伟集成电路设计有限公司 Image compression device, method, electronic device, and computer-readable storage medium
CN115775283A (en) * 2022-11-15 2023-03-10 网易(杭州)网络有限公司 Image compression method, device, storage medium and computer equipment

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
TPG图像压缩技术;王诗涛;丁飘;黄晓政;刘海军;罗斌姬;陈新星;吴友宝;王荣刚;;电信科学;20170820(第08期);全文 *

Also Published As

Publication number Publication date
CN117119119A (en) 2023-11-24

Similar Documents

Publication Publication Date Title
CN113034358B (en) Super-resolution image processing method and related device
CN108288251A (en) Image super-resolution method, device and computer readable storage medium
CN112102164B (en) Image processing method, device, terminal and storage medium
US12062116B2 (en) Image processing method and apparatus, readable medium and electronic device
CN109166159A (en) Obtain the method, apparatus and terminal of the dominant hue of image
CN111259841B (en) Image processing method and related equipment
CN111681177B (en) Video processing method and device, computer readable storage medium and electronic equipment
CN111932463B (en) Image processing method, device, equipment and storage medium
CN112991274B (en) Crowd counting method and device, computer equipment and storage medium
CN112686314B (en) Target detection method and device based on long-distance shooting scene and storage medium
CN114096994A (en) Image alignment method and device, electronic equipment and storage medium
CN110599554A (en) Method and device for identifying face skin color, storage medium and electronic device
CN112950640A (en) Video portrait segmentation method and device, electronic equipment and storage medium
CN110503083A (en) A kind of critical point detection method, apparatus and electronic equipment
CN112565887A (en) Video processing method, device, terminal and storage medium
CN115209150A (en) Video coding parameter acquisition method and device, network model and electronic equipment
CN111383289A (en) Image processing method, image processing device, terminal equipment and computer readable storage medium
CN117119119B (en) Compression transmission method, device and system for image data
CN111667553A (en) Head-pixelized face color filling method and device and electronic equipment
CN113453017B (en) Video processing method, device, equipment and computer program product
CN110880160A (en) Picture frame super-division method and device, terminal equipment and computer readable storage medium
CN114598876B (en) Motion compensation method and device for dynamic image, terminal equipment and storage medium
CN109451318A (en) Convenient for the method, apparatus of VR Video coding, electronic equipment and storage medium
CN114399622A (en) Image processing method and related device
CN116777739A (en) Image processing method, game rendering method, device, equipment and storage medium

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