Design data interaction method and system for soft decoration engineering
By analyzing the characteristics of the design drawings and combining with the hyperchaotic mapping encryption algorithm, the problem of lack of personalized adjustment of the design drawing encryption in the existing technology is solved, and higher data security and feature distinction are achieved, reducing the risk of data leakage.
Patent Information
- Application Number
- CN202411058664.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-02
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2044-08-02
AI Technical Summary
The existing technology lacks personalized adjustments in the encryption methods of design drawings, which leads to design drawings being vulnerable to the risks of computing power attacks and data leakage, and cannot effectively protect the security of design data.
By analyzing the foreground information richness, component area characteristics and texture characteristics of the design drawings, combined with the color image encryption algorithm of superchaotic mapping, the design drawings are analyzed and encrypted, and the encryption algorithm based on feature distinction is used for optimization. Parameters are updated for increased security.
It improves the reliability and encryption security of the feature analysis of the design drawings, enhances the protection ability of data interaction, and reduces the risk of data leakage.
Smart Images

Figure CN118965393A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of data processing technology, and in particular to a design data interaction method and system for soft decoration engineering. Background Art
[0002] Soft decoration is an important part of beautifying and personalizing interior space. It satisfies people's pursuit of aesthetics and functionality through the careful matching of furniture, curtains, carpets and other elements. In the early stages of design or when the design plan is submitted to the client or for internal approval, the designer will create soft decoration drawings that include customer preferences and design concepts. These drawings need to be encrypted during storage and transmission to protect the design from unauthorized access and achieve secure data interaction.
[0003] Among existing secure interaction methods, design drawing encryption methods are standardized and lack the ability to make personalized adjustments based on the specific content of design drawings. General encryption algorithms often fail to take into account the unique characteristics of design drawings, making design drawings vulnerable to attacks and cracking by modern computing power, leading to risks such as data leakage when customers communicate with designers to modify design data. Summary of the invention
[0004] In order to solve the above technical problems, the purpose of this application is to provide a design data interaction method and system for soft decoration engineering. The technical solutions adopted are as follows:
[0005] In a first aspect, an embodiment of the present application provides a design data interaction method for a soft decoration project, the method comprising the following steps:
[0006] Analyze the complexity of the edge contour of the foreground area in the design drawing to obtain the richness of the foreground information of the design drawing;
[0007] Analyze the distribution of corner points of the regions where each component is located in the design drawing to obtain the first relative features of the regions where each component is located; analyze the texture features of the corner points of the regions where each component is located to obtain the second relative features of the regions where each component is located; and combine the first relative features and the second relative features to obtain the regional feature significance of the regions where each component is located;
[0008] The feature discrimination of the design drawing is obtained by combining the foreground information richness and the regional feature significance, and the design drawing is encrypted by combining the color image encryption algorithm based on hyperchaotic mapping; the encrypted design drawing is used for data interaction.
[0009] In one embodiment, the construction of the foreground information richness includes:
[0010] Obtain a binary image of the design drawing, construct a neighborhood window of a preset size with each pixel in the binary image as the center, calculate the proportion of foreground pixels in the neighborhood window, record it as the first ratio, record the pixels with the first ratio greater than 0 and less than 1 as shallow pixels, take the shallow pixel with only one shallow pixel in the neighborhood as the starting pixel, obtain each path in the binary image according to the preset rules, and use the normalized chain code method to obtain the direction symbol sequence of each path;
[0011] Determine the chain code direction complexity of the binary image based on the direction symbol sequence of all paths;
[0012] Based on the number of the paths and the length of all the directional symbol sequences, the foreground distribution chaos of the binary image is determined; and the fusion result of the chain code direction complexity and the foreground distribution chaos is used as the foreground information richness.
[0013] In one embodiment, the determination of the chain code direction complexity includes:
[0014] The direction symbol sequence of each path is converted into the radian system of angles, the difference of adjacent elements in the direction symbol sequence corresponding to the radian system is calculated, and the fusion results of all the differences of all paths are normalized as the chain code direction complexity.
[0015] In one embodiment, the foreground distribution disorder is the product of the sum of the lengths of all the direction symbol sequences and the number of the paths.
[0016] In one embodiment, the process of determining the first relative feature is:
[0017] Calculate the ratio of the number of pixels in the area where each component is located to the number of all pixels in the binary image, record it as the second ratio, calculate the LBP eigenvalue of each corner point in the area where each component is located, and take the corner point with the largest LBP eigenvalue as the main corner point of the area where the corresponding component is located;
[0018] The metric distance between the main corner point of the area where any component is located and the main corner point of the area where other components are located is calculated, and the fusion value of the mean of all the metric distances of the area where any component is located and the second ratio is used as the first relative feature of the area where any component is located.
[0019] In one embodiment, the second relative feature is the average of the LBP feature values of all corner points in the area where each component is located.
[0020] In one embodiment, the regional feature significance is the product of the first relative feature and the second relative feature.
[0021] In one embodiment, the feature discrimination is the product of the sum of the feature prominences of all the regions in the design drawing and the foreground information richness.
[0022] In one embodiment, the encryption operation on the design drawing includes:
[0023] Four normalized mapping algorithms are randomly selected from a variety of normalized mapping algorithms, the feature discrimination is normalized and mapped, the obtained mapping results are randomly sorted as system parameters of Chen hyperchaotic system in the color image encryption algorithm based on hyperchaotic mapping, and the design drawings are encrypted using the color image encryption algorithm based on hyperchaotic mapping.
[0024] In the second aspect, an embodiment of the present application also provides a design data interaction system for soft decoration engineering, including a memory, a processor, and a computer program stored in the memory and running on the processor, and when the processor executes the computer program, the steps of any one of the above methods are implemented.
[0025] This application has at least the following beneficial effects:
[0026] The present application obtains a binary image of a design drawing of a soft decoration project, analyzes the complexity of the edge contour of the foreground area in the binary image, and obtains the foreground information richness of the design drawing, which reflects the detail complexity and texture characteristics of the foreground area in the binary image, as well as the complexity and richness of the edges and contours of the foreground. This measure of the foreground information of the design drawing improves the reliability of the feature analysis of the design drawing. Further, the corner point distribution of the area where each component is located in the design drawing is analyzed to obtain the first relative feature of the area where each component is located, which characterizes the size and position characteristics of the area where the component is located in the design drawing, and reflects the prominence of the area where the component is located in the design drawing. Then, the texture characteristics of the corner points of the area where each component is located are analyzed to obtain the second relative feature of the area where each component is located, which reflects the characteristics of the corner points in the area where the component is located. The feature intensity, as a measure of the main texture features in the component area, characterizes the degree of distinction between the component area and other areas; then, combining the first relative feature and the second relative feature, the regional feature significance of the regions where the components are located is obtained, which improves the accuracy of feature extraction of the component regions in the design drawings; combining the foreground information richness and the regional feature significance, the feature discrimination of the design drawings is obtained, which reflects the uniqueness and complexity of the features of the design drawings and improves the degree of difference in feature description between different design drawings; finally, combined with the color image encryption algorithm based on hyperchaotic mapping, the design drawings are encrypted; the encrypted design drawings are used for data interaction, and the color image encryption algorithm based on hyperchaotic mapping is optimized for parameter update based on different design drawings, which improves the security of the encryption algorithm. BRIEF DESCRIPTION OF THE DRAWINGS
[0027] In order to more clearly illustrate the technical solutions and advantages in the embodiments of the present application or the prior art, the drawings required for use in the embodiments or the prior art descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0028] Figure 1 A flowchart of a design data interaction method for soft decoration engineering provided by an embodiment of the present application;
[0029] Figure 2 Construct a flow chart for design drawing feature discrimination. DETAILED DESCRIPTION
[0030] In order to further explain the technical means and effects adopted by the present application to achieve the predetermined invention purpose, the following is a detailed description of a design data interaction method and system for soft decoration engineering proposed in accordance with the present application, its specific implementation method, structure, features and effects, in combination with the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" does not necessarily refer to the same embodiment. In addition, specific features, structures or characteristics in one or more embodiments may be combined in any suitable form.
[0031] 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 application belongs.
[0032] The following is a detailed description of a specific solution of a design data interaction method and system for soft decoration engineering provided by the present application in conjunction with the accompanying drawings.
[0033] See also Figure 1 , which shows a flowchart of a design data interaction method for soft decoration engineering provided by an embodiment of the present application, the method comprising the following steps:
[0034] S1, obtaining a binary image of a design drawing of a soft decoration project, analyzing the complexity of the edge contour of the foreground area in the binary image, and obtaining the richness of the foreground information of the design drawing.
[0035] For the design data interaction of soft decoration projects, first, a design data interaction platform is created. Designers or production teams create and upload design drawings based on customer preferences and design concepts. The platform allows users to upload design data, including but not limited to customer preferences, design concepts, etc.
[0036] Secondly, in order to ensure the security and confidentiality of design drawings, the platform performs image encryption on the uploaded design drawings to ensure the security of the design drawings during transmission and storage, and prevent unauthorized access and data leakage.
[0037] Finally, after the design drawings are encrypted, the platform allows authorized users, such as customers, designers, project team members, etc., to interact with data securely. Users can download the encrypted design drawings and decrypt them locally for viewing or further editing.
[0038] Among them, when performing security encryption of design drawings, first obtain the design drawings designed by the designer or production team according to the customer's preferences and design concepts. In one embodiment of the present application, the design drawings are used as input, and the automatic color balancing algorithm is used to enhance the image of the design drawings. Then, the enhanced image is grayed and converted into a grayscale image, and the grayscale image is recorded as the target image. The automatic color balancing algorithm is an existing well-known technology, and this application will not elaborate on it in detail.
[0039] It should be noted that the implementer may choose other existing feasible image enhancement algorithms to perform image enhancement on the design drawings, such as histogram equalization algorithm, Retinex algorithm, etc., and this application does not impose any restrictions on this.
[0040] If a general image encryption algorithm is used directly to encrypt design drawings, the general algorithm lacks optimization for specific image features, resulting in exploitable vulnerabilities in the encryption process. Therefore, the encryption process of design drawings needs to be optimized.
[0041] In one embodiment of the present application, the target image is used as input, and the image is output as a binary image using the Otsu threshold segmentation method. The binary image divides all pixels in the target image into foreground and background. The foreground is usually represented by black, indicating the area where components such as furniture or decorations in the design drawings are located, while the background is represented by white. With each pixel in the binary image as the center, a neighborhood window of size 5×5 is constructed. The size of the neighborhood window can be set by the implementer according to the actual situation, and this application does not impose any restrictions on this. Calculate the proportion of black pixels in the neighborhood window of each pixel in the binary image, which is recorded as the first ratio, and record all pixels whose first ratio is greater than 0 and less than 1 as light pixels.
[0042] In one embodiment of the present application, a shallow pixel point with only one shallow pixel point within its eight neighborhoods is selected as the starting pixel point A, and then the starting pixel point is connected with the shallow pixel point B within its eight neighborhoods, and the distribution of shallow pixels within the eight neighborhoods of the shallow pixel point B is analyzed. If there is only one shallow pixel point C, they are connected in sequence. If there are multiple shallow pixel points D, E, H, etc., a shallow pixel point is selected from the multiple shallow pixel points in sequence, such as D, for connection, and the distribution of shallow pixels within the eight neighborhoods of the shallow pixel point D is continued to be analyzed. That is, starting from the node of shallow pixel point B, branching, multiple paths are obtained. If there is no shallow pixel point in the eight neighborhoods of shallow pixel point B, shallow pixel point B is used as the terminal pixel point to obtain the path A→B. Otherwise, shallow pixel points are traversed in sequence until a shallow pixel point G is traversed that has no shallow pixel point in the eight neighborhoods or has shallow pixel points, but the shallow pixel points have all been traversed by the path belonging to the starting pixel point A. Then, shallow pixel point G is used as the terminal pixel point. Thus, one or more paths from the starting pixel point A to the terminal pixel point G can be obtained. The same acquisition method as that from the starting pixel point A to the terminal pixel point G is adopted to obtain all paths that meet the conditions for all shallow pixel points in the binary image that have only one shallow pixel point in the eight neighborhoods.
[0043] In another embodiment of the present application, the design drawing is subjected to edge detection using the Canny edge detection algorithm, and all the obtained edge pixels are marked in the binary image, wherein the Canny edge detection algorithm is an existing well-known technology, and the present application will not elaborate on it in detail, and the implementer may select other existing feasible edge detection algorithms according to the actual situation, and the present application will not limit it here. Select any shallow pixel point with only one shallow pixel point within the eight-neighborhood range as the starting pixel point A, then connect the starting pixel point with the shallow pixel point B within its eight-neighborhood range, and then analyze the distribution of shallow pixels within the eight-neighborhood of shallow pixel point B. If there is only one shallow pixel point C, connect them in sequence. If there are multiple shallow pixel points D, E, H, etc., select shallow pixels that are both shallow pixels and edge pixels from the multiple shallow pixels. If there are shallow pixels that meet the conditions, they are connected to the shallow pixel point B respectively, and continue to analyze the eight neighborhoods of the shallow pixels after connection. The distribution of shallow pixels within the range is traversed in sequence until a shallow pixel point G is found where there is no shallow pixel within the eight-neighborhood range or there is a shallow pixel point but all shallow pixels have been traversed by the path belonging to the starting pixel point A. Then the shallow pixel point G is used as the termination pixel point. Otherwise, if there is no shallow pixel point that meets the conditions, one shallow pixel point is selected from multiple shallow pixels D, E, H, etc. as the termination pixel point. For all shallow pixels in the binary image that have only one shallow pixel within the eight-neighborhood range, the same method is used to obtain each path that meets the conditions.
[0044] The normalized chain code method of eight-neighborhood angles is used to obtain the direction symbol series of each path. The normalized chain code method is an existing public technology and is not described in detail in this application. For the direction symbol series of all paths in the binary image, the chain code directional complexity of the binary image is determined. Specifically, the direction symbol series of each path is converted into radians of angles, and then the radian values of the angles are converted to the interval [-π,π]. The differences between the adjacent angles of the direction symbol series of each path are calculated, and the fusion results of all the differences of all the paths are normalized as the chain code directional complexity of the binary image.
[0045] It should be noted that fusion means combining multiple variables in a way that enhances the overall effect, which can be specifically multiplication, addition, etc.; difference means the degree of difference between two variables, which can be calculated by difference, absolute value of difference, ratio, etc.
[0046] In one embodiment of the present application, the elements in the direction symbol sequence of each path in the binary image are converted into angles. Since the direction symbol sequence consists of numbers 0-7, representing 8 directions, the specific method of angle conversion is to convert 0-7 in the direction symbol sequence into 0°, 45°, 90°, ..., 315° in sequence, and then convert these angle values into the interval [-π, π] and express them in radians, that is, 45° corresponds to 315° corresponds And so on, the conversion is completed. Calculate the absolute value of the difference in radians between each element and the next element in the direction symbol series of each path, and do not calculate the last element in the direction symbol series. Calculate the cumulative sum of all the absolute values of the differences of all paths in the binary image, and normalize and map the cumulative sum to the range of [0,1] to determine it as the chain code direction complexity of the binary image. In this embodiment, the normalized mapping method is to divide the cumulative sum by the smallest integer multiple of 2π. The implementer can choose the normalized mapping method according to the actual situation, and this application does not limit it here.
[0047] The chain code directional complexity characterizes the directional characteristics of the path obtained in the binary image, eliminating the influence of the length of the directional symbol sequence. The chain code directional complexity is obtained by normalizing the sum of the directional encoding angle values of the path, and quantifies the distribution characteristics of the foreground and background in the image. Since the shallow pixel points themselves present an edge transition state, the directional encoding of the path reflects the direction of the edge or contour of different areas in the image, and measures the diversity of the foreground edge direction in the image. The larger the value of the chain code directional complexity, the more complex the foreground edge and contour, the richer the direction changes, and the more edge and contour information there is.
[0048] Furthermore, based on the number of acquisition paths of the binary image and the length of each direction symbol sequence, the foreground distribution chaos of the binary image is determined, specifically: the fusion result of the number of paths in the binary image and the length of all the direction symbol sequences is used as the foreground distribution chaos of the binary image.
[0049] In one embodiment of the present application, the sum of the lengths of the direction symbol series of all paths obtained in the binary image is calculated, and the product of the sum and the number of paths obtained in the binary image is used as the foreground distribution chaos of the binary image.
[0050] The foreground distribution chaos reflects the distribution of each path in the entire binary image and expresses the complexity of the details of the foreground area. The greater the foreground distribution chaos, the more details, more complex textures, and more dispersed or discontinuous distribution of the foreground area of the image.
[0051] The fusion result of the chain code direction complexity and the foreground distribution chaos is used as the foreground information richness of the binary image.
[0052] In one embodiment of the present application, the foreground information richness of the binary image is the product of the chain code direction complexity of the binary image and the foreground distribution disorder.
[0053] S2, analyzing the distribution of corner points of the areas where each component is located in the design drawings to obtain the first relative features of the areas where each component is located; analyzing the texture features of the corner points of the areas where each component is located to obtain the second relative features of the areas where each component is located; combining the first relative features and the second relative features to obtain the regional feature significance of the areas where each component is located.
[0054] In addition to the complexity of the foreground area, the distinction between the foreground and the background is also a key feature of the design drawing. High distinction means that the boundary between the foreground and the background is clear. Introducing the distinction between the foreground and the background during the encryption process can more accurately characterize the feature information of the design drawing.
[0055] Taking the target image as input, randomly generate N pixels as the starting point of growth, and use the regional growing algorithm to output each growth area, wherein the growth criterion is to determine whether the seed point and the pixels in its neighborhood meet the similarity criterion. The similarity criterion is an existing well-known technology, and this application will not be described in detail here. Each growth area is regarded as each component of the design elements such as furniture or decorations in the design drawings, and the ratio of the number of pixels in each growth area to the total number of pixels in the target image is calculated, which is recorded as the second ratio. Then, the pixels in each growth area are taken as input, and the Harris corner detection algorithm is used to detect all the corner points in each growth area. The corner points represent the shape and structure of the components, which can be used as the key features for identifying furniture or decoration components. The Harris corner detection algorithm is an existing well-known technology, and this application will not be described in detail here, and the implementer can choose other existing feasible corner detection algorithms according to the actual situation, and this application will not be limited here. In one embodiment of the present application, N=20, and the implementer can set it according to the actual situation, and this application will not be limited here.
[0056] It should be noted that this embodiment only proposes a method for obtaining the areas where the components in the design drawings are located, that is, using the region growing method. The implementer can choose other existing feasible algorithms according to actual conditions on the premise that the purpose of obtaining the areas where the components in the design drawings can be achieved. This application does not make any restrictions here.
[0057] In one embodiment of the present application, a window of size 7×7 is constructed with each corner point in the target image as the center, the LBP eigenvalue in the window is calculated, the corner point with the largest LBP eigenvalue in each growth region is recorded as the main corner point, and the metric distance between the main corner points in different growth regions is calculated. The implementer can set the size of the window according to the actual situation, and this application does not limit this. The region growing algorithm and the calculation of the LBP eigenvalue are existing well-known technologies, and this application will not be described in detail here.
[0058] It should be noted that the metric distance can be specifically calculated using Euclidean distance, Manhattan distance, etc., and the present application does not limit this. In an embodiment of the present application, the Euclidean distance between the main corner points on any growth area and the main corner points of the remaining other growth areas is calculated.
[0059] The region where each component in the design drawing is located, that is, the fusion result of the mean of all the Euclidean distances of each growth region and the second ratio is calculated as the first relative feature of the region where each component is located.
[0060] In one embodiment of the present application, the product of the average of all the Euclidean distances of each growth area and the second ratio is used as the first relative feature of the area where each component is located.
[0061] The first relative feature takes into account the size and position characteristics of the component area, and reflects the prominence of the component area in the design drawing. The larger the first relative feature, the more prominent or easier to identify the component area is in the design drawing.
[0062] The mean of the LBP feature values of all corner points in the area where each component is located in the design drawing is used as the second relative feature of the area where each component is located.
[0063] The second relative feature reflects the feature strength of the corner points in the area where the component is located. As a measure of the main texture features in the area where the component is located, it characterizes the degree of distinction between the area where the component is located and other areas. The larger the second relative feature, the richer the texture features in the area where the component is located and the higher the degree of distinction.
[0064] A fusion result of the first relative feature and the second relative feature is used as the regional feature significance of the region where each component is located.
[0065] In one embodiment of the present application, the product of the first relative feature and the second relative feature of the region where each component is located is used as the regional feature significance of the region where each component is located.
[0066] The greater the regional feature significance, the more distinctive the texture of the furniture or decorative component in the area where the corresponding component is located is, and the easier it is to be identified.
[0067] S3, combining the foreground information richness and the regional feature prominence to obtain feature discrimination of the design drawing.
[0068] The fusion result of the regional feature saliency of the regions where all components in the design drawings are located and the foreground information richness is used as the feature discrimination of the design drawings. The flowchart of constructing the feature discrimination of the design drawings is as follows: Figure 2 shown.
[0069] In one embodiment of the present application, the sum of the regional feature prominences of all the components in the design drawing is calculated and recorded as the first sum, and the product of the first sum and the foreground information richness is used as the feature discrimination of the design drawing.
[0070] The first sum value reflects the sum of the regional feature saliency of the corresponding areas of all furniture or decorations in the target image, and evaluates the saliency and discrimination of all furniture or decorations. The larger the first sum value, the higher the saliency and discrimination of the furniture or decorations in the design drawing, and the greater the feature discrimination of the design drawing; the foreground information richness quantifies the complexity of the distribution between the foreground and the background in the target image and the degree of confusion of the foreground distribution, reflecting the directional diversity of the foreground edge and the detail complexity of the foreground area in the target image. The greater the foreground information richness, the more complex the foreground edge and contour of the target image, the more details and textures the foreground area has, the higher the discrimination of the furniture or decorations, and the greater the feature discrimination of the design drawing. The greater the feature discrimination, the more complex and unique the design drawing is.
[0071] S4, combining the feature discrimination of the design drawings with the color image encryption algorithm based on hyperchaotic mapping, performs encryption operation on the design drawings; and uses the encrypted design drawings for data interaction.
[0072] The design drawings are encrypted using a color image encryption algorithm based on hyperchaotic mapping. The color image encryption algorithm based on hyperchaotic mapping first decomposes the color image into three color channels: red (R), green (G), and blue (B). Four chaotic sequences are generated using the Chen hyperchaotic system. The pixel positions of each channel are scrambled, and the chaotic sequence is used to perform bit plane permutation and bitwise inversion operations to achieve pixel value perturbation. The encrypted image is obtained by reorganizing the bit plane and color channel. The color image encryption algorithm based on hyperchaotic mapping is an existing well-known technology, and this application will not be described in detail here.
[0073] When the algorithm is running, the values of the system parameters a0, b0, c0, and d0 of the Chen hyperchaotic system will affect the generation of the chaotic sequence. In the original algorithm, the generation of parameters is random, and the chaotic system is more sensitive to the initial conditions. The randomly generated parameters will reduce the unpredictability of the chaotic system.
[0074] This application optimizes and updates the values of the system parameters a0, b0, c0, and d0 of the Chen hyperchaotic system by calculating the characteristic discrimination of the design drawings. Specifically, a variety of normalized mapping methods are set, and the optional mapping methods include negative exponential function, sigmoid function, softmax function, ReLU function, ELU function, hyperbolic tangent function, etc. Four of the multiple normalized mapping methods are randomly selected to perform normalized mapping on the characteristic discrimination of the design drawings, and the mapping results are randomly sorted as the system parameters a0, b0, c0, and d0 of the Chen hyperchaotic system, providing a variety of initial conditions for the Chen chaotic mapping, thereby increasing the security of the algorithm. It should be noted that the type, number, and normalized sorting rules of the normalized mapping methods can be set by the implementer according to the actual situation, and this application does not limit this.
[0075] Finally, the design drawings for soft decoration projects are encrypted using the Chen hyperchaotic system updated with system parameter optimization, so that the encryption process of each design drawing is unique. Compared with the original algorithm that directly uses the four system parameters as the key, this application uses the normalization method used in the encryption process as part of the key, which enhances the confidentiality of the key. This allows the algorithm to adjust encryption parameters and methods according to different needs and security levels, greatly improving flexibility and scalability.
[0076] The image encryption algorithm based on hyperchaotic mapping with improved system parameters is integrated into the data interaction platform to encrypt the design drawings, protect the design from unauthorized access, and realize the safe interaction of the design drawings. Subsequently, real-time communication tools such as instant messaging, video conferencing or voice call functions are integrated into the data interaction platform so that users and designers can communicate instantly, and a user interaction interface is added to the data interaction platform to allow users to directly mark, comment or make amendments on the design drawings, and record each modification and feedback of the user to ensure that all participants can see the latest design status and historical changes.
[0077] Based on the same inventive concept as the above method, an embodiment of the present application also provides a design data interaction system for soft decoration engineering, including a memory, a processor, and a computer program stored in the memory and running on the processor, and when the processor executes the computer program, the steps of any one of the above-mentioned design data interaction methods for soft decoration engineering are implemented.
[0078] In summary, the present application obtains a binary image of a design drawing of a soft decoration project, analyzes the complexity of the edge contour of the foreground area in the binary image, and obtains the richness of the foreground information of the design drawing, which reflects the detail complexity and texture characteristics of the foreground area in the binary image, as well as the complexity and richness of the edges and contours of the foreground. This measure of the foreground information of the design drawing improves the reliability of the feature analysis of the design drawing. Further, the corner point distribution of the area where each component is located in the design drawing is analyzed to obtain the first relative feature of the area where each component is located, which characterizes the size and position characteristics of the area where the component is located in the design drawing, and reflects the prominence of the area where the component is located in the design drawing. Then, the texture characteristics of the corner points of the area where each component is located are analyzed to obtain the second relative feature of the area where each component is located, which reflects the corner points in the area where the component is located. The feature intensity of is used as a measure of the main texture features in the component area, which characterizes the degree of distinction between the component area and other areas; then, the first relative feature and the second relative feature are combined to obtain the regional feature significance of the regions where the components are located, thereby improving the accuracy of feature extraction of the regions where the components are located in the design drawings; the feature discrimination of the design drawings is obtained by combining the foreground information richness with the regional feature significance, which reflects the uniqueness and complexity of the features of the design drawings and improves the degree of difference in feature description between different design drawings; finally, the design drawings are encrypted in combination with the color image encryption algorithm based on hyperchaotic mapping; the encrypted design drawings are used for data interaction, and the color image encryption algorithm based on hyperchaotic mapping is optimized for parameter update based on different design drawings, thereby improving the security of the encryption algorithm.
[0079] It should be noted that the above sequence of the embodiments of the present application is for description only and does not represent the advantages and disadvantages of the embodiments. The above is a description of a specific embodiment of this specification. In addition, the processes depicted in the accompanying drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
[0080] The various embodiments in this specification are described in a progressive manner, and the same or similar parts between the various embodiments can be referenced to each other, and each embodiment focuses on the differences from other embodiments.
[0081] The above description is only a preferred embodiment of the present application and is not intended to limit the present application. Any modifications, equivalent substitutions, improvements, etc. made within the principles of the present application should be included in the protection scope of the present application.
Claims
1. A design data interaction method for soft decoration engineering, characterized in that: The method comprises the following steps: Analyze the complexity of the edge contour of the foreground area in the design drawing to obtain the richness of the foreground information of the design drawing; Analyze the distribution of corner points of the regions where each component is located in the design drawing to obtain the first relative features of the regions where each component is located; analyze the texture features of the corner points of the regions where each component is located to obtain the second relative features of the regions where each component is located; and combine the first relative features and the second relative features to obtain the regional feature significance of the regions where each component is located; The feature discrimination of the design drawing is obtained by combining the foreground information richness and the regional feature significance, and the design drawing is encrypted by combining the color image encryption algorithm based on hyperchaotic mapping; the encrypted design drawing is used for data interaction.
2. A design data interaction method for soft decoration engineering as claimed in claim 1, characterized in that: The construction of the foreground information richness includes: Obtain a binary image of the design drawing, construct a neighborhood window of a preset size with each pixel in the binary image as the center, calculate the proportion of foreground pixels in the neighborhood window, record it as the first ratio, record the pixels with the first ratio greater than 0 and less than 1 as shallow pixels, take the shallow pixel with only one shallow pixel in the neighborhood as the starting pixel, obtain each path in the binary image according to the preset rules, and use the normalized chain code method to obtain the direction symbol sequence of each path; Determine the chain code direction complexity of the binary image based on the direction symbol sequence of all paths; Based on the number of the paths and the length of all the directional symbol sequences, the foreground distribution chaos of the binary image is determined; and the fusion result of the chain code direction complexity and the foreground distribution chaos is used as the foreground information richness.
3. A design data interaction method for soft decoration engineering as claimed in claim 2, characterized in that: The determination of the chain code direction complexity includes: The direction symbol sequence of each path is converted into the radian system of angles, the difference of adjacent elements in the direction symbol sequence corresponding to the radian system is calculated, and the fusion results of all the differences of all paths are normalized as the chain code direction complexity.
4. A design data interaction method for soft decoration engineering as claimed in claim 2, characterized in that: The foreground distribution disorder is the product of the sum of the lengths of all the direction symbol sequences and the number of the paths.
5. A design data interaction method for soft decoration engineering as claimed in claim 2, characterized in that: The process of determining the first relative feature is as follows: Calculate the ratio of the number of pixels in the area where each component is located to the number of all pixels in the binary image, record it as the second ratio, calculate the LBP eigenvalue of each corner point in the area where each component is located, and take the corner point with the largest LBP eigenvalue as the main corner point of the area where the corresponding component is located; The metric distance between the main corner point of the area where any component is located and the main corner point of the area where other components are located is calculated, and the fusion value of the mean of all the metric distances of the area where any component is located and the second ratio is used as the first relative feature of the area where any component is located.
6. A design data interaction method for soft decoration engineering as claimed in claim 5, characterized in that: The second relative feature is the average of the LBP feature values of all corner points in the area where each component is located.
7. A design data interaction method for soft decoration engineering as claimed in claim 1, characterized in that: The regional feature significance is the product of the first relative feature and the second relative feature.
8. The design data interaction method for soft decoration engineering according to claim 1, characterized in that: The feature discrimination is the product of the sum of the feature prominences of all the regions in the design drawing and the foreground information richness.
9. A design data interaction method for soft decoration engineering as claimed in claim 1, characterized in that: The encryption operation of the design drawing comprises: Four normalized mapping algorithms are randomly selected from a variety of normalized mapping algorithms, the feature discrimination is normalized and mapped, the obtained mapping results are randomly sorted as system parameters of Chen hyperchaotic system in the color image encryption algorithm based on hyperchaotic mapping, and the design drawings are encrypted using the color image encryption algorithm based on hyperchaotic mapping.
10. A design data interaction system for soft decoration engineering, comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 9 are implemented.
Citation Information
Patent Citations
RGB color image encryption method based on inverse difference chaotic mapping
CN110430036A
Lightweight dynamic image data encryption method and system
CN115378574A
Image encryption method and device, terminal and storage medium
CN117527182A
Security system of collaboration draft design
KR1020100119125A
