Code scanning group entering method and device and electronic equipment
Real-time member monitoring and deep learning-based QR code mapping enable seamless group transitions, addressing the limitations of traditional QR code-based group joining.
Patent Information
- Application Number
- CN202411105709.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-13
- Publication Date
- 2024-12-06
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
Existing methods for joining groups via QR codes face challenges when the group member limit is reached, leading to user exclusion and management inefficiencies.
A method and device that utilize real-time member monitoring, generating a new QR code when the limit is reached, and establishing a mapping relationship between old and new codes using deep learning to ensure seamless transitions.
Ensures continuous group access by automatically redirecting users to the new group, enhancing user satisfaction and management efficiency.
Smart Images

Figure CN119094486A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the technical field of scanning a code to join a group, and specifically, to a method, device and electronic device for scanning a code to join a group. Background Art
[0002] In today's digital society, the technology of scanning QR codes to join groups is widely used in daily life, especially in social networks, work team management, and online event organization. The basic process of traditional scanning QR codes to join groups includes creating a group, generating the corresponding group chat QR code, and then setting the upper limit of group members to ensure the stability and management efficiency of the group chat.
[0003] However, as the number of group users grows, when the group member limit is reached, new users will not be able to join the original group by scanning the QR code, which may lead to user loss and inconvenience in management. Therefore, an optimized method of scanning the QR code to join the group is expected. Summary of the invention
[0004] This summary is provided to introduce concepts in a brief form that will be described in detail in the detailed description below. This summary is not intended to identify key features or essential features of the claimed technical solution, nor is it intended to limit the scope of the claimed technical solution.
[0005] In a first aspect, the present application provides a method for scanning a code to join a group, the method comprising:
[0006] Generate a first group chat QR code corresponding to the first group;
[0007] and setting an upper limit of group members of the first group;
[0008] Obtaining the real-time total number of group members of the first group through the robot;
[0009] In response to the real-time total number of group members of the first group being equal to the upper limit of group members, generating a second group chat QR code corresponding to the second group;
[0010] Constructing a mapping relationship between the first group chat QR code and the second group chat QR code, so that when a user scans the first group chat QR code, the user can automatically jump to the second group chat QR code;
[0011] In response to the generation time of the first group chat QR code exceeding a preset threshold, canceling the mapping relationship between the first group chat QR code and the second group chat QR code.
[0012] Optionally, a mapping relationship between the first group chat QR code and the second group chat QR code is constructed so that when a user scans the first group chat QR code, the user can automatically jump to the second group chat QR code, including: obtaining a scanned image of the first group chat QR code; rotating the scanned image at multiple angles to obtain a set of enhanced scanned images; performing image feature extraction on each enhanced scanned image in the set of enhanced scanned images to obtain a set of scanned image feature maps; performing autocorrelation attention enhancement on each scanned image feature map in the set of scanned image feature maps to obtain a set of enhanced scanned image feature maps; based on the aggregated features of the set of enhanced scanned image feature maps, generating a jump link to jump to the second group chat QR code.
[0013] Optionally, image features are extracted for each enhanced scan image in the set of enhanced scan images to obtain a set of scanned code image feature maps, including: inputting each enhanced scan image in the set of enhanced scan images into a scanned code image feature extractor based on a void convolutional neural network model to obtain the set of scanned code image feature maps.
[0014] Optionally, each scanned image feature map in the set of scanned image feature maps is subjected to autocorrelation attention enhancement to obtain a set of enhanced scanned image feature maps, including: inputting each scanned image feature map in the set of scanned image feature maps into a self-attention enhancement module based on a feature space structure maintained across channels to obtain the set of enhanced scanned image feature maps.
[0015] Optionally, each of the scanned image feature maps in the set of the scanned image feature maps is input into a self-attention enhancement module based on a feature space structure maintained across channels to obtain the set of enhanced scanned image feature maps, including: performing layer normalization on the scanned image feature map to obtain a normalized scanned image feature map; performing point convolution processing on the normalized scanned image feature map to obtain a scanned image channel context association representation feature map; performing convolution encoding on the scanned image channel context association representation feature map to obtain a scanned image space context association representation feature map; copying the scanned image space context association representation feature map to obtain a backup scanned image space context association representation feature map; performing upper and lower convolution operations on the scanned image channel context association representation feature map, the scanned image space context association representation feature map and the backup scanned image space context association representation feature map. The context-related representation feature map is reshaped to obtain the scanned image channel context-related representation feature matrix, the scanned image space context-related representation feature matrix and the backup scanned image space context-related representation feature matrix; the cross-channel cross-covariance matrix between the scanned image channel context-related representation feature matrix and the scanned image space context-related representation feature matrix is calculated; the cross-channel cross-covariance matrix is activated using the Softmax function to obtain the scanned image feature global interactive attention matrix; the product between the backup scanned image space context-related representation feature matrix and the scanned image feature global interactive attention matrix is calculated to obtain the attention-enhanced scanned image feature representation matrix; the attention-enhanced scanned image feature representation matrix is reshaped to obtain the enhanced scanned image feature map.
[0016] Optionally, based on the aggregated features of the set of enhanced scanned code image feature maps, a jump link is generated to jump to the second group chat QR code, including: inputting the set of enhanced scanned code image feature maps into a feature aggregation network based on feature local energy distribution gating to obtain a scanned image aggregate representation vector; inputting the scanned image aggregate representation vector into a decoder to obtain a scan result, and the scan result is the jump link.
[0017] Optionally, the set of enhanced scanned code image feature maps is input into a feature aggregation network based on feature local energy distribution gating to obtain a scanned image aggregation representation vector, including: expanding each enhanced scanned code image feature map in the set of enhanced scanned code image feature maps into an enhanced scanned code image feature vector to obtain a set of enhanced scanned code image feature vectors; based on the maximum value, minimum value, mean value and variance of each enhanced scanned code image feature vector in the set of enhanced scanned code image feature vectors, determining the characteristic energy level coefficients of each enhanced scanned code image feature vector to obtain a set of scanned code image feature energy level coefficients; determining The scale of the local neighborhood is calculated, and the local neighborhood significance descriptor of each scanned image feature energy level coefficient in the scanned image feature energy level coefficient is calculated to obtain a set of scanned image feature energy level significance descriptors; the set of scanned image feature energy level significance descriptors is input into a mask module based on a gating function to obtain a set of mask-gated probabilistic scanned image feature energy level significance descriptors; the set of mask-gated probabilistic scanned image feature energy level significance descriptors is used as a set of weights, and the position-weighted sum of the set of enhanced scanned image feature vectors is calculated to obtain the scanned image aggregate representation vector.
[0018] Optionally, based on the maximum value, minimum value, mean value and variance of each enhanced scanned code image feature vector in the set of enhanced scanned code image feature vectors, the characteristic energy level coefficients of each enhanced scanned code image feature vector are determined to obtain a set of scanned code image characteristic energy level coefficients, including: calculating the sum of the variance and the bias term of the enhanced scanned code image feature vector to obtain a first intermediate term, and calculating the square of the difference between the characteristic maximum value and the mean of the enhanced scanned code image feature vector, the square of the difference between the characteristic minimum value and the mean of the enhanced scanned code image feature vector, and the sum of the bias terms to obtain a second intermediate term; calculating the first intermediate term divided by the second intermediate term to obtain the scanned code image characteristic energy level coefficient.
[0019] In a second aspect, the present application provides a device for scanning a code to join a group, the device comprising:
[0020] A first group chat QR code generating module, used to generate a first group chat QR code corresponding to the first group;
[0021] A group member upper limit setting module, used to set the group member upper limit of the first group;
[0022] A module for obtaining the real-time total number of group members, used to obtain the real-time total number of group members of the first group through a robot;
[0023] A second group chat QR code generating module, configured to generate a second group chat QR code corresponding to a second group in response to the real-time total number of group members of the first group being equal to the upper limit of group members;
[0024] A mapping relationship building module, used to build a mapping relationship from the first group chat QR code to the second group chat QR code, so that when a user scans the first group chat QR code, it can automatically jump to the second group chat QR code;
[0025] The mapping relationship canceling module is used to cancel the mapping relationship between the first group chat QR code and the second group chat QR code in response to the generation time of the first group chat QR code exceeding a preset threshold.
[0026] In a third aspect, the present application provides an electronic device, comprising: a memory for storing instructions; a processor coupled to the memory, the processor being configured to execute the method of scanning a code to join a group based on the instructions stored in the memory.
[0027] With the above technical solution, the robot monitors the number of group members in real time, automatically creates a new group chat when the upper limit is reached, and uses deep learning technology to build a mapping relationship between the new group chat QR code and the original group chat QR code. At the same time, when the original group chat QR code expires, this mapping relationship is cancelled, so that when the user scans the original group chat QR code, it can automatically jump to the new group chat QR code and ensure that the user can be guided to the valid group chat QR code. In this way, seamless group chat switching and user management can be achieved, effectively solving the problem of users being unable to join due to full groups, and ensuring the continuity of users joining group chats, thereby effectively improving user satisfaction.
[0028] Other features and advantages of the present application will be described in detail in the subsequent detailed description. BRIEF DESCRIPTION OF THE DRAWINGS
[0029] The above and other features, advantages and aspects of the embodiments of the present application will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and the originals and elements are not necessarily drawn to scale. In the drawings:
[0030] Figure 1 The present invention is a flowchart of a method for joining a group by scanning a code according to an exemplary embodiment.
[0031] Figure 2 is based on Figure 1 The illustrated embodiment shows a flowchart of step S105 of a method for joining a group by scanning a code.
[0032] Figure 3 The present invention is a block diagram of a device for joining a group by scanning a QR code according to an exemplary embodiment.
[0033] Figure 4 It is a block diagram of an electronic device according to an exemplary embodiment.
[0034] Figure 5 It is an application scenario diagram of a method for joining a group by scanning a code according to an exemplary embodiment. DETAILED DESCRIPTION
[0035] The embodiments of the present application will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present application are shown in the accompanying drawings, it should be understood that the present application can be implemented in various forms and should not be construed as being limited to the embodiments described herein. Instead, these embodiments are provided to provide a more thorough and complete understanding of the present application. It should be understood that the drawings and embodiments of the present application are only for exemplary purposes and are not intended to limit the scope of protection of the present application.
[0036] It should be understood that the various steps described in the method implementation of the present application can be performed in different orders and / or performed in parallel. In addition, the method implementation may include additional steps and / or omit the steps shown. The scope of the present application is not limited in this respect.
[0037] The term "including" and its variations used herein are open inclusions, i.e., "including but not limited to". The term "based on" means "based at least in part on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.
[0038] It should be noted that the concepts such as "first" and "second" mentioned in this application are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.
[0039] It should be noted that the modifications of "one" and "plurality" mentioned in the present application are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".
[0040] The names of the messages or information exchanged between multiple devices in the embodiments of the present application are only used for illustrative purposes and are not used to limit the scope of these messages or information.
[0041] The specific implementation of the present application is described in detail below with reference to the accompanying drawings.
[0042] In response to the above technical problems, the technical concept of this application is to monitor the number of group members in real time through a robot, automatically create a new group chat when the upper limit is reached, and use deep learning technology to build a mapping relationship between the new group chat QR code and the original group chat QR code. At the same time, when the original group chat QR code expires, this mapping relationship is cancelled, so that when the user scans the original group chat QR code, it can automatically jump to the new group chat QR code and ensure that the user can be guided to the valid group chat QR code. In this way, seamless group chat switching and user management can be achieved, effectively solving the problem of users being unable to join due to full groups, and ensuring the continuity of users joining group chats, thereby effectively improving user satisfaction.
[0043] Figure 1 is a flow chart of a method for scanning a code to join a group according to an exemplary embodiment. Figure 1 As shown, the method includes:
[0044] Step S101, generating a first group chat QR code corresponding to the first group;
[0045] Step S102, and setting the upper limit of the number of group members of the first group;
[0046] Step S103: obtaining the real-time total number of group members of the first group through the robot;
[0047] Step S104: in response to the real-time total number of group members of the first group being equal to the upper limit of group members, generating a second group chat QR code corresponding to the second group;
[0048] Step S105: construct a mapping relationship between the first group chat QR code and the second group chat QR code, so that when a user scans the first group chat QR code, the user can automatically jump to the second group chat QR code;
[0049] Step S106: In response to the generation time of the first group chat QR code exceeding a preset threshold, canceling the mapping relationship between the first group chat QR code and the second group chat QR code.
[0050] Figure 2 is based on Figure 1 The embodiment shown is a flowchart of step S105 of a method for scanning a code to join a group, as shown in FIG. Figure 2 As shown, step S105, constructing a mapping relationship from the first group chat QR code to the second group chat QR code, so that when a user scans the first group chat QR code, it can automatically jump to the second group chat QR code, including:
[0051] Step S1051: Obtain a scanned image of the first group chat QR code;
[0052] Step S1052, rotating the scanned image at multiple angles to obtain a set of enhanced scanned images;
[0053] Step S1053: extracting image features from each enhanced scan image in the set of enhanced scan images to obtain a set of scanned code image feature maps;
[0054] Step S1054: performing autocorrelation attention enhancement on each of the scanned code image feature maps in the set of scanned code image feature maps to obtain a set of enhanced scanned code image feature maps;
[0055] Step S1055: Based on the aggregated features of the set of enhanced scanned code image feature maps, generate a jump link to jump to the second group chat QR code.
[0056] Specifically, in the technical solution of the present application, a mapping relationship between the first group chat QR code and the second group chat QR code is constructed. First, a scanned image of the first group chat QR code is obtained. It should be understood that the scanned image is image data obtained when a user scans the first group chat QR code. By processing the scanned image with image recognition technology, key information in the QR code image can be extracted, and a corresponding jump link is generated accordingly to redirect the user to the second group chat QR code.
[0057] Next, considering that in actual applications, users may scan the QR code at different angles, such as facing, tilting or rotating, etc. Therefore, in the technical solution of the present application, the scanned image is further rotated at multiple angles to obtain a set of enhanced scanned images, so as to simulate scanning conditions at different angles, thereby improving the adaptability to different scanning angles and reducing recognition errors caused by scanning angle problems.
[0058] Next, in order to obtain high-quality scanned image feature representation, the present application adopts a scanned code image feature extractor based on a void convolutional neural network model to perform feature extraction on each enhanced scanned image in the set of enhanced scanned images, so as to utilize the unique network structure of the void convolutional neural network to expand the receptive field without increasing the number of parameters, effectively capture the local details and spatial context information of the enhanced scanned image, generate a set of scanned code image feature maps, and provide accurate data support for subsequent QR code parsing.
[0059] In one embodiment of the present application, image features are extracted for each enhanced scan image in the set of enhanced scan images to obtain a set of scanned code image feature maps, including: inputting each enhanced scan image in the set of enhanced scan images into a scanned code image feature extractor based on a void convolutional neural network model to obtain the set of scanned code image feature maps.
[0060] Furthermore, considering that the user may be affected by factors such as illumination changes and jitter when scanning a QR code, the scanned image feature map may be subject to noise interference. Therefore, in the technical solution of the present application, a feature space structure-maintaining self-attention enhancement module based on cross-channel crossover is further introduced to enhance the feature maps of each scanned image to obtain a set of enhanced scanned image feature maps. Specifically, the feature space structure-maintaining self-attention enhancement module first performs layer normalization on the scanned image feature map to eliminate the scale differences between different layers and ensure the stability of feature processing. Then, the channel context association and spatial structure information of the scanned image feature map are captured through convolution processing, and the channel context association information of the scanned image feature map is used as a query, and the spatial structure information of the scanned image feature map is used as a key and value. Based on the self-attention mechanism, feature cross-channel global association interaction is performed. While retaining the spatial structure of the scanned image feature map, the channel association information between feature structures is fused in units of feature space structure to take into account the robustness and richness of feature expression and enhance the expressiveness of the feature map.
[0061] In one embodiment of the present application, each scanned image feature map in the set of scanned image feature maps is subjected to autocorrelation attention enhancement to obtain a set of enhanced scanned image feature maps, including: inputting each scanned image feature map in the set of scanned image feature maps into a self-attention enhancement module based on a feature space structure maintained across channels to obtain the set of enhanced scanned image feature maps.
[0062] Furthermore, in one embodiment of the present application, each of the scanned image feature maps in the set of the scanned image feature maps is input into a self-attention enhancement module based on a feature space structure maintained across channels to obtain the set of enhanced scanned image feature maps, including: performing layer normalization on the scanned image feature map to obtain a normalized scanned image feature map; performing point convolution processing on the normalized scanned image feature map to obtain a scanned image channel context association representation feature map; performing convolution encoding on the scanned image channel context association representation feature map to obtain a scanned image space context association representation feature map; copying the scanned image space context association representation feature map to obtain a backup scanned image space context association representation feature map; performing convolution encoding on the scanned image channel context association representation feature map, the scanned image space context association representation feature map and the backup scanned image space context association representation feature map. The image space context association representation feature map is reshaped to obtain the scanned image channel context association representation feature matrix, the scanned image space context association representation feature matrix and the backup scanned image space context association representation feature matrix; the cross-channel cross covariance matrix between the scanned image channel context association representation feature matrix and the scanned image space context association representation feature matrix is calculated; the cross-channel cross covariance matrix is activated using the Softmax function to obtain the scanned image feature global interactive attention matrix; the product between the backup scanned image space context association representation feature matrix and the scanned image feature global interactive attention matrix is calculated to obtain the attention enhanced scanned image feature representation matrix; the attention enhanced scanned image feature representation matrix is reshaped to obtain the enhanced scanned image feature map.
[0063] Specifically, the scanned code image feature map is processed by the following autocorrelation attention enhancement formula to obtain the enhanced scanned code image feature map, wherein the autocorrelation attention enhancement formula is:
[0064] F ln =LayerNormalization(F i )
[0065] F Q =Conv 1×1 (F ln )
[0066] F K =Cinv 3×3 (Cinv 1×1 (F ln ))
[0067] F V =Copy(F K )
[0068] MQ =Reshape(F Q )
[0069] M K =Reshape(F K )
[0070] M V =Reshape(F V )
[0071]
[0072] Among them, F i represents the scanned image feature map, Layer Normalization (·) represents the layer normalization operation, F ln Represents the normalized scanned image feature map, Conv 1×1 represents point convolution, F Q Represents the scanned image channel context association representation feature map, Conv 3×3 represents the convolution processing based on 3×3 convolution kernel, F K represents the scanned image spatial context association representation feature map, Copy(·) represents the copy operation, F V represents the backup scanned code image spatial context association representation feature map, reshape(·) represents feature shape reshaping, M Q 、M K and M V They represent the scanned image channel context association representation feature matrix, the scanned image space context association representation feature matrix and the backup scanned image space context association representation feature matrix, M a represents the cross-channel cross covariance matrix, θ is the scaling factor, softmax represents the normalized exponential function, Represents matrix multiplication operation, F a Represents the enhanced scan code image feature map.
[0073] Furthermore, in one embodiment of the present application, based on the aggregated features of the set of enhanced scanned code image feature maps, a jump link is generated to jump to the second group chat QR code, including: inputting the set of enhanced scanned code image feature maps into a feature aggregation network based on feature local energy distribution gating to obtain a scanned image aggregate representation vector; inputting the scanned image aggregate representation vector into a decoder to obtain a scan result, and the scan result is the jump link.
[0074] Secondly, in order to extract the core information of the two-dimensional code image from the set of enhanced scanned images under multi-angle rotation, the present application uses a feature aggregation network based on feature local energy distribution gating to aggregate the set of enhanced scanned image feature maps, so as to integrate the feature information of each enhanced scanned image feature map and obtain a stable and representative scanned image aggregation representation vector. Specifically, the feature aggregation network calculates the characteristic energy level coefficient based on the statistical characteristics of each enhanced scanned image feature map, and quantifies its energy distribution and energy level. Next, the scale of the local neighborhood is determined, and the energy distribution characteristics of each enhanced scanned image feature map in the local neighborhood are captured by calculating the local neighborhood significance descriptor of each characteristic energy level coefficient. Furthermore, the local neighborhood significance descriptor is adaptively screened based on the gated mask technology to dynamically adjust the feature weights, strengthen the significant features in the set of enhanced scanned image feature maps, and obtain the core information of the two-dimensional code image, so as to achieve accurate aggregation of image features scanned at different angles.
[0075] In one embodiment of the present application, the set of enhanced scanned code image feature maps is input into a feature aggregation network based on feature local energy distribution gating to obtain a scanned image aggregation representation vector, including: expanding each enhanced scanned code image feature map in the set of enhanced scanned code image feature maps into an enhanced scanned code image feature vector to obtain a set of enhanced scanned code image feature vectors; based on the maximum value, minimum value, mean value and variance of each enhanced scanned code image feature vector in the set of enhanced scanned code image feature vectors, determining the feature energy level coefficients of each enhanced scanned code image feature vector to obtain a set of scanned code image feature energy level coefficients. Determine the scale of the local neighborhood, calculate the local neighborhood significance descriptor of each scanned image feature energy level coefficient in the scanned image feature energy level coefficient to obtain a set of scanned image feature energy level significance descriptors; input the set of scanned image feature energy level significance descriptors into a mask module based on a gating function to obtain a set of mask-gated probabilistic scanned image feature energy level significance descriptors; use the set of mask-gated probabilistic scanned image feature energy level significance descriptors as a set of weights, calculate the position-weighted sum of the set of enhanced scanned image feature vectors to obtain the scanned image aggregate representation vector.
[0076] Furthermore, in one embodiment of the present application, based on the maximum value, minimum value, mean value and variance of each enhanced scanned code image feature vector in the set of enhanced scanned code image feature vectors, the characteristic energy level coefficients of each enhanced scanned code image feature vector are determined to obtain a set of scanned code image characteristic energy level coefficients, including: calculating the sum of the variance and the bias term of the enhanced scanned code image feature vector to obtain a first intermediate term, and calculating the square of the difference between the characteristic maximum value and the mean of the enhanced scanned code image feature vector, the square of the difference between the characteristic minimum value and the mean of the enhanced scanned code image feature vector, and the sum of the bias terms to obtain a second intermediate term; calculating the first intermediate term divided by the second intermediate term to obtain the scanned code image characteristic energy level coefficient.
[0077] Specifically, the set of enhanced scanned code image feature vectors is processed using the following feature aggregation formula to obtain the scanned image aggregation representation vector, wherein the feature aggregation formula is:
[0078] X={x1,x2,...,x n}
[0079]
[0080] w si =mask(w i )
[0081]
[0082] Wherein, X represents the set of enhanced scanned code image feature vectors, the value of n is the number of feature vectors in the set of enhanced scanned code image feature vectors, x1, x2, x i and x n Respectively represent the first, second, i-th and n-th enhanced scanned code image feature vectors in the set of enhanced scanned code image feature vectors, μ i is the feature mean of the feature vector of the i-th enhanced scanned code image, σ 2 i is the feature variance of the i-th enhanced scanned code image feature vector, max(x i ) and min(x i ) respectively represent the maximum and minimum values of each eigenvalue of the eigenvalue vector of the i-th enhanced scanned code image, ∈ is the bias term, e i represents the scanned code image feature energy level coefficient of the i-th enhanced scanned code image feature vector, e q Indicated by e i The qth scanned image feature energy level coefficient in the local neighborhood centered at r represents the number of characteristic energy level coefficients of the scanned image in the local neighborhood, e ciis the energy level saliency descriptor of the i-th scanned image feature, w i represents the saliency descriptor of the feature energy level of the i-th probabilistic scanned image, mask(·) represents mask processing, γ represents the preset mask threshold, and w si represents the ith mask-gated probabilistic scanned image feature energy level significance descriptor, and v is the aggregated representation vector of the scanned image.
[0083] Then, the scanned image aggregate representation vector is input into the decoder to obtain a scan result, which is a jump link. That is, by utilizing the recursive decoding structure of the decoder model and based on the QR code information in the scanned image aggregate representation vector, the scanned image aggregate representation vector is decoded into understandable structured information through multi-step reasoning, that is, a jump link associated with the second group chat QR code is generated to guide the user to jump to the group chat QR code of the second group chat. In this way, the user can automatically jump from the first group chat to the second group chat without manually entering or searching for a new QR code, which greatly simplifies the user operation process and improves the consistency and convenience of the user experience.
[0084] The present application takes into account that each enhanced scanned code image feature map in the set of enhanced scanned code image feature maps respectively represents the image enhancement semantic features of the enhanced scanned image. In this way, when the set of enhanced scanned code image feature maps is input into the feature aggregation network based on feature local energy distribution gating, the obtained scanned image aggregation representation vector will cause insufficient feature aggregation coverage due to the differences in feature energy level significance descriptors of each enhanced scanned code image semantic feature in the set, thereby leading to outlier class inference mapping deviation, and the accuracy of the scanning result obtained by inputting the scanned image aggregation representation vector into the decoder.
[0085] Based on this, in a preferred example, inputting the scanned image aggregation representation vector into a decoder to obtain a scan result includes:
[0086] Calculating a feature mean of the scanned image aggregate representation vector, and dividing the feature mean by a difference between a maximum eigenvalue and a minimum eigenvalue of the scanned image aggregate representation vector to obtain a scanned image aggregate representation distribution representation value;
[0087] Subtracting the scanned image aggregate representation distribution characterization value from one and dividing the result by the scanned image aggregate representation distribution characterization value to obtain a scanned image aggregate representation distribution modulation value;
[0088] Activating the scanned image aggregate representation vector through a probabilistic function to obtain a probabilistic scanned image aggregate representation vector;
[0089] After performing point subtraction between the probabilistic scanned image aggregate representation vector and the scanned image aggregate representation distribution modulation value, taking the absolute value and calculating the negative of the logarithmic value with base 2 to obtain the probabilistic scanned image aggregate representation distribution modulation information vector;
[0090] After dividing the scanned image aggregate representation distribution characterization value by one minus the difference of each eigenvalue of the probabilistic scanned image aggregate representation vector, summing all eigenvalues of the probabilistic scanned image aggregate representation vector and dividing by the length of the scanned image aggregate representation vector to obtain a probabilistic scanned image aggregate representation distribution modulation bias value;
[0091] Performing a dotted multiplication of the probabilistic scanned image aggregate representation distribution modulation information vector and the probabilistic scanned image aggregate representation distribution modulation bias value and a weight as a hyperparameter to obtain an optimized scanned image aggregate representation vector; and
[0092] The optimized scanned image aggregation representation vector is input into the decoder to obtain the scan result.
[0093] The optimized scanned image aggregation representation vector is expressed as:
[0094]
[0095] And among them:
[0096]
[0097] in, represents the feature mean of the scanned image aggregation representation vector, v max and v min represents the maximum eigenvalue and the minimum eigenvalue in the scanned image aggregate representation vector respectively, p represents the distribution representation value of the scanned image aggregate representation, V represents the probabilistic scanned image aggregate representation vector obtained after the scanned image aggregate representation vector is activated by the probabilistic function, and v i represents the ith eigenvalue of the probabilistic scanned image aggregate representation vector, log represents a logarithmic function with base 2, ε is a weight as a hyperparameter, the value of L is the length of the probabilistic scanned image aggregate representation vector, V′ represents the optimized scanned image aggregate representation vector, represents positional subtraction, Represents positional addition.
[0098] That is, in the above preferred example, the eigenvalue-based probability information distribution planning of the scanned image aggregate representation vector is performed by using the Bernoulli probability modulation distribution of the scanned image aggregate representation vector relative to the eigenvalue distribution, and the probability reverse mapping of the probability features of the scanned image aggregate representation vector as a whole is used as an extended coverage of the set mapping space of the scanned image aggregate representation vector to independently understand the interaction path between the intuitive probability information distribution and the abstract probability space mapping of the scanned image aggregate representation vector, so as to improve the accuracy of the scanning result obtained by inputting the optimized scanned image aggregate representation vector into the decoder by avoiding the counterfactual reasoning mapping of the outlier feature distribution of the scanned image aggregate representation vector to the class probability.
[0099] In summary, the above scheme is adopted to monitor the number of group members in real time through the robot. When the upper limit is reached, a new group chat is automatically created, and the mapping relationship between the new group chat QR code and the original group chat QR code is constructed by deep learning technology. At the same time, when the original group chat QR code expires, this mapping relationship is cancelled, so that when the user scans the original group chat QR code, it can automatically jump to the new group chat QR code and ensure that the user can be guided to the valid group chat QR code. In this way, seamless group chat switching and user management can be achieved, effectively solving the problem of users being unable to join due to full groups, and ensuring the continuity of users joining group chats, thereby effectively improving user satisfaction.
[0100] Figure 3 FIG. 1 is a block diagram of a device for scanning a code to join a group according to an exemplary embodiment. Figure 3 As shown, the device 200 includes:
[0101] A first group chat QR code generating module 201, configured to generate a first group chat QR code corresponding to a first group;
[0102] A group member upper limit setting module 202, used to set the group member upper limit of the first group;
[0103] A real-time total number of group members obtaining module 203, used to obtain the real-time total number of group members of the first group through a robot;
[0104] A second group chat QR code generating module 204, configured to generate a second group chat QR code corresponding to a second group in response to the real-time total number of group members of the first group being equal to the upper limit of group members;
[0105] A mapping relationship building module 205, configured to build a mapping relationship from the first group chat QR code to the second group chat QR code, so that when a user scans the first group chat QR code, the user can automatically jump to the second group chat QR code;
[0106] The mapping relationship canceling module 206 is configured to cancel the mapping relationship between the first group chat QR code and the second group chat QR code in response to the generation time of the first group chat QR code exceeding a preset threshold.
[0107] Furthermore, the present application provides an electronic device, comprising: a memory for storing instructions; a processor coupled to the memory, the processor being configured to execute the method of scanning a code to join a group based on the instructions stored in the memory.
[0108] Reference below Figure 4 , which shows a schematic diagram of the structure of an electronic device 600 suitable for implementing the embodiment of the present application. The terminal device in the embodiment of the present application may include but is not limited to mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 4 The electronic device shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.
[0109] like Figure 4 As shown, the electronic device 600 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 601, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 602 or a program loaded from a storage device 608 into a random access memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the electronic device 600 are also stored. The processing device 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.
[0110] Typically, the following devices may be connected to the I / O interface 605: an input device 606 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 607 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 608 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 609. The communication device 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. Although Figure 4 The electronic device 600 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead.
[0111] In particular, according to an embodiment of the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present application includes a computer program product, which includes a computer program carried on a non-transitory computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication device 609, or installed from the storage device 608, or installed from the ROM 602. When the computer program is executed by the processing device 601, the above-mentioned functions defined in the method of the embodiment of the present application are executed.
[0112] It should be noted that the computer-readable medium mentioned above in the present application may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present application, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The computer readable signal medium may also be any computer readable medium other than a computer readable storage medium, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer readable medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.
[0113] In some embodiments, the client and the server may communicate using any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.
[0114] The computer-readable medium may be included in the electronic device, or may exist independently without being incorporated into the electronic device.
[0115] Computer program code for performing the operations of the present application may be written in one or more programming languages or a combination thereof, including, but not limited to, object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).
[0116] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.
[0117] The modules involved in the embodiments described in this application can be implemented by software or hardware. The name of the module does not limit the module itself in some cases. For example, the test parameter acquisition module can also be described as a "module for acquiring device test parameters corresponding to the target device".
[0118] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.
[0119] In the context of the present application, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
[0120] Figure 5 FIG. 1 is an application scenario diagram of a method for scanning a code to join a group according to an exemplary embodiment. Figure 5 As shown, in this application scenario, first, a scanned image of the first group chat QR code is obtained (for example, Figure 5 Then, the acquired scanned image is input to a server (e.g., Figure 5 In S) shown in , the server is capable of processing the scanned image based on a scan code to join a group algorithm, so as to cancel the mapping relationship between the first group chat QR code and the second group chat QR code in response to the generation time of the first group chat QR code exceeding a preset threshold.
[0121] The above description is only a preferred embodiment of the present application and an explanation of the technical principles used. Those skilled in the art should understand that the scope of disclosure involved in the present application is not limited to the technical solution formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosed concept. For example, the above features are replaced with the technical features with similar functions disclosed in this application (but not limited to) by each other to form a technical solution.
[0122] In addition, although each operation is described in a specific order, this should not be construed as requiring these operations to be performed in the specific order shown or to be performed in a sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although some specific implementation details are included in the above discussion, these should not be construed as limiting the scope of the application. Some features described in the context of a separate embodiment can also be implemented in a single embodiment in combination. On the contrary, the various features described in the context of a single embodiment can also be implemented in multiple embodiments individually or in any suitable sub-combination mode.
[0123] Although the subject matter has been described in language specific to structural features and / or method logic actions, it should be understood that the subject matter defined is not necessarily limited to the specific features or actions described above. On the contrary, the specific features and actions described above are merely exemplary forms of implementation. With respect to the apparatus in the above-mentioned embodiments, the specific manner in which each module performs the operation has been described in detail in the embodiments related to the method, and will not be described in detail here.
Claims
1. A method for joining a group by scanning a code, characterized in that: include: Generate a first group chat QR code corresponding to the first group; and setting an upper limit of group members of the first group; Obtaining the real-time total number of group members of the first group through the robot; In response to the real-time total number of group members of the first group being equal to the upper limit of group members, generating a second group chat QR code corresponding to the second group; Constructing a mapping relationship between the first group chat QR code and the second group chat QR code, so that when a user scans the first group chat QR code, the user can automatically jump to the second group chat QR code; In response to the generation time of the first group chat QR code exceeding a preset threshold, canceling the mapping relationship between the first group chat QR code and the second group chat QR code.
2. The method for joining a group by scanning a QR code according to claim 1, characterized in that: Constructing a mapping relationship between the first group chat QR code and the second group chat QR code so that when a user scans the first group chat QR code, the user can automatically jump to the second group chat QR code, including: Obtaining a scanned image of the first group chat QR code; Rotating the scanned image at multiple angles to obtain a set of enhanced scanned images; Performing image feature extraction on each enhanced scan image in the set of enhanced scan images to obtain a set of scanned code image feature maps; Performing autocorrelation attention enhancement on each of the scanned code image feature maps in the set of scanned code image feature maps to obtain a set of enhanced scanned code image feature maps; Based on the aggregated features of the set of enhanced scanned code image feature maps, a jump link is generated to jump to the second group chat QR code.
3. The method for joining a group by scanning a QR code according to claim 2, characterized in that: Performing image feature extraction on each enhanced scan image in the set of enhanced scan images to obtain a set of scanned code image feature maps, including: Each enhanced scan image in the set of enhanced scan images is input into a scanned code image feature extractor based on a hole convolutional neural network model to obtain a set of scanned code image feature maps.
4. The method for joining a group by scanning a QR code according to claim 3, characterized in that: The self-correlation attention enhancement is performed on each of the scanned image feature maps in the set of scanned image feature maps to obtain a set of enhanced scanned image feature maps, including: Each of the scanned code image feature maps in the set of the scanned code image feature maps is input into a feature space structure-maintaining self-attention enhancement module based on cross-channel crossover to obtain the set of enhanced scanned code image feature maps.
5. The method for joining a group by scanning a QR code according to claim 4, characterized in that: Inputting each of the scanned image feature maps in the set of the scanned image feature maps into a feature space structure-maintaining self-attention enhancement module based on cross-channel crossover to obtain the set of enhanced scanned image feature maps, including: Performing layer normalization on the scanned code image feature map to obtain a normalized scanned code image feature map; Performing point convolution processing on the normalized scanned code image feature map to obtain a scanned code image channel context association representation feature map; Performing convolution encoding on the scanned code image channel context association representation feature map to obtain the scanned code image space context association representation feature map; Copying the scanned code image spatial context association representation feature map to obtain a backup scanned code image spatial context association representation feature map; Reshape the scanned code image channel context association representation feature map, the scanned code image space context association representation feature map and the backup scanned code image space context association representation feature map to obtain a scanned code image channel context association representation feature matrix, a scanned code image space context association representation feature matrix and a backup scanned code image space context association representation feature matrix; Calculate the cross-channel cross covariance matrix between the scanned code image channel context association representation feature matrix and the scanned code image space context association representation feature matrix; Use the Softmax function to activate the cross-channel cross-covariance matrix to obtain a global interactive attention matrix of the scanned image features; Calculate the product of the backup scanned code image spatial context association representation feature matrix and the scanned code image feature global interactive attention matrix to obtain an attention-enhanced scanned code image feature representation matrix; The feature representation matrix of the attention-enhanced code scanning image is reshaped to obtain the feature map of the enhanced code scanning image.
6. The method for joining a group by scanning a QR code according to claim 5, characterized in that: Based on the aggregated features of the set of enhanced scanned code image feature graphs, generating a jump link to jump to the second group chat QR code includes: Inputting the set of enhanced scanned code image feature maps into a feature aggregation network based on feature local energy distribution gating to obtain a scanned image aggregation representation vector; The scanned image aggregation representation vector is input into a decoder to obtain a scan result, where the scan result is the jump link.
7. The method for joining a group by scanning a code according to claim 6, characterized in that: Inputting the set of enhanced scanned code image feature maps into a feature aggregation network based on feature local energy distribution gating to obtain a scanned image aggregation representation vector, including: Expanding each enhanced code scanning image feature map in the set of enhanced code scanning image feature maps into an enhanced code scanning image feature vector to obtain a set of enhanced code scanning image feature vectors; Based on the maximum value, minimum value, mean value and variance of each enhanced code scanning image feature vector in the set of enhanced code scanning image feature vectors, determining the feature energy level coefficients of each enhanced code scanning image feature vector to obtain a set of code scanning image feature energy level coefficients; Determine the scale of the local neighborhood, calculate the local neighborhood significance descriptor of each scanned image feature energy level coefficient in the scanned image feature energy level coefficient to obtain a set of scanned image feature energy level significance descriptors; Inputting the set of scanned image feature energy level significance descriptors into a mask module based on a gating function to obtain a set of mask-gated probabilistic scanned image feature energy level significance descriptors; The set of mask-gated probabilistic scanned image feature energy level significance descriptors is used as a set of weights, and the position-weighted sum of the set of enhanced scanned image feature vectors is calculated to obtain the scanned image aggregate representation vector.
8. The method for joining a group by scanning a QR code according to claim 7, characterized in that: Based on the maximum value, minimum value, mean value and variance of each enhanced scanned code image feature vector in the set of enhanced scanned code image feature vectors, determining the feature energy level coefficients of each enhanced scanned code image feature vector to obtain a set of scanned code image feature energy level coefficients, including: Calculate the sum of the variance and the bias term of the enhanced scanned code image feature vector to obtain a first intermediate term, and calculate the square of the difference between the maximum feature value and the mean value of the enhanced scanned code image feature vector, the square of the difference between the minimum feature value and the mean value of the enhanced scanned code image feature vector, and the sum of the bias term to obtain a second intermediate term; The first intermediate term is divided by the second intermediate term to obtain the characteristic energy level coefficient of the scanned code image.
9. A device for joining a group by scanning a QR code, characterized in that: include: A first group chat QR code generating module, used to generate a first group chat QR code corresponding to the first group; A group member upper limit setting module, used to set the group member upper limit of the first group; A module for obtaining the real-time total number of group members, used to obtain the real-time total number of group members of the first group through a robot; A second group chat QR code generating module, configured to generate a second group chat QR code corresponding to a second group in response to the real-time total number of group members of the first group being equal to the upper limit of group members; A mapping relationship building module, used to build a mapping relationship from the first group chat QR code to the second group chat QR code, so that when a user scans the first group chat QR code, it can automatically jump to the second group chat QR code; The mapping relationship canceling module is used to cancel the mapping relationship between the first group chat QR code and the second group chat QR code in response to the generation time of the first group chat QR code exceeding a preset threshold.
10. An electronic device, characterized in that: include: A memory for storing instructions; A processor is coupled to the memory, and the processor is configured to execute the method for joining a group by scanning a code according to any one of claims 1 to 8 based on instructions stored in the memory.
Citation Information
Patent Citations
Livestock and poultry manure resourceful treatment system and treatment method
CN118894628A
Automatic seeder control system and method based on fuzzy pid algorithm
CN118938651A
Customer resource management system and method based on large model
CN119090193A
Cited By
Intelligent conveying system and method for intelligent cosmetic packaging
CN119018433A
Customer resource management system and method based on large model
CN119090193A
