Method and device for displaying object identifier, equipment and medium

By dynamically adjusting the candidate areas and display methods in multi-user interactive applications, the flexibility and clarity issues of user identification display are solved, and flexible differentiation and efficient processing of groups are achieved.

CN120803301APending Publication Date: 2025-10-17BEIJING ZITIAO NETWORK TECH CO LTD
View PDF 17 Cites 0 Cited by

Patent Information

Application Number
CN202410433875.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-04-10
Publication Date
2025-10-17

AI Technical Summary

Technical Problem

In multi-user interactive applications, existing technologies have difficulty in flexibly and effectively presenting user identities in different groups, especially when the number of groups and users changes, resulting in limited display methods.

Method used

By determining multiple candidate areas and dynamically adjusting the display mode based on the number of objects, different colors and dotted lines are used to distinguish groups, and contour boundary processing is combined to improve display efficiency.

Benefits of technology

It enables flexible and clear display of user identification when the number of groups and users changes, improving visual distinction and processing efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120803301A_ABST
    Figure CN120803301A_ABST
Patent Text Reader

Abstract

The invention provides a method and device for displaying an object identifier, equipment and a medium. In one method, a plurality of objects corresponding to a target event are determined, the plurality of objects including a first set of objects having a first type and a second set of objects having a second type. Based on the number of the multiple objects, multiple candidate areas used for presenting the object identifiers of the multiple objects in the preset area are determined, and the target candidate area in the multiple candidate areas is used for presenting the target object identifier of the target object in the multiple objects. A plurality of object identifications of the plurality of objects are presented based on the plurality of candidate regions, where a first set of object identifications of a first set of objects are presented in a first display manner and a second set of object identifications of a second set of objects are presented in a second display manner. In this way, the mode for presenting each object identifier can be determined according to the number of the objects participating in the event, so that different types of objects are distinguished in a clearer mode.
Need to check novelty before this filing date? Find Prior Art

Description

TECHNICAL FIELD

[0001] Exemplary implementations of the present disclosure generally relate to object management, and in particular, to methods, apparatuses, devices, and computer-readable storage media for displaying object identifications in an interactive application. BACKGROUND

[0002] With the development of computer technology and network technology, a variety of interactive applications have been developed. In a multi-user interactive application, multiple users can participate in an event such as a singing competition, a debate competition, etc. in the interactive application. For example, in a singing competition, group A and group B can each include one or more users, and at this time, the identifications of the users in group A and group B can be respectively presented in the interactive application. However, the number of groups and the number of users in each group can vary. Thus, it is desirable to present the identifications of the users in each group in a more flexible and effective manner. SUMMARY

[0003] In a first aspect of the present disclosure, a method for displaying object identifications is provided. In the method, a plurality of objects corresponding to a target event is determined, the plurality of objects including a first group of objects having a first type and a second group of objects having a second type. Based on a number of objects of the plurality of objects, a plurality of candidate regions for presenting object identifications of the plurality of objects in a predetermined region is determined, a target candidate region of the plurality of candidate regions being for presenting a target object identification of a target object of the plurality of objects. The plurality of object identifications of the plurality of objects is presented based on the plurality of candidate regions, wherein a first group of object identifications of the first group of objects is presented with a first display manner, and a second group of object identifications of the second group of objects is presented with a second display manner.

[0004] In a second aspect of the present disclosure, an apparatus for displaying object identifications is provided. The apparatus includes an object determining module configured to determine a plurality of objects corresponding to a target event, the plurality of objects including a first group of objects having a first type and a second group of objects having a second type; a region determining module configured to determine, based on a number of objects of the plurality of objects, a plurality of candidate regions for presenting object identifications of the plurality of objects in a predetermined region, a target candidate region of the plurality of candidate regions being for presenting a target object identification of a target object of the plurality of objects; and a presenting module configured to present the plurality of object identifications of the plurality of objects based on the plurality of candidate regions, wherein a first group of object identifications of the first group of objects is presented with a first display manner, and a second group of object identifications of the second group of objects is presented with a second display manner.

[0005] In a third aspect of the present disclosure, an electronic device is provided. The electronic device includes: at least one processing unit; and at least one memory, the at least one memory being coupled to the at least one processing unit and storing instructions for execution by the at least one processing unit, the instructions, when executed by the at least one processing unit, causing the electronic device to perform the method according to the first aspect of the present disclosure.

[0006] In a fourth aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the processor implements the method according to the first aspect of the present disclosure.

[0007] It should be understood that the content described in this summary section is not intended to limit the key features or important features of the implementation of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will become easy to understand through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0008] The above and other features, advantages and aspects of various implementations of the present disclosure will become more apparent hereinafter with reference to the following detailed description in conjunction with the accompanying drawings. In the accompanying drawings, the same or similar reference numerals represent the same or similar elements, wherein:

[0009] Figure 1 A block diagram illustrating an application environment according to an exemplary implementation of the present disclosure is shown;

[0010] Figure 2 A block diagram for displaying object identification according to some implementations of the present disclosure is shown;

[0011] Figure 3 A block diagram illustrating candidate regions according to some implementations of the present disclosure is shown;

[0012] Figure 4 A block diagram illustrating contour locations of a first set of object identifiers according to some implementations of the present disclosure;

[0013] Figure 5 A block diagram illustrating object identification according to some implementations of the present disclosure;

[0014] Figure 6 A block diagram illustrating a process for processing a boundary according to some implementations of the present disclosure is shown;

[0015] Figure 7A and Figure 7B block diagrams respectively illustrating a gap between a first boundary and a second boundary according to some implementations of the present disclosure;

[0016] Figure 7Ca block diagram illustrating a connection line between a first boundary and a second boundary according to some implementations of the present disclosure;

[0017] Figure 8 A block diagram illustrating a page of an interactive application according to some implementations of the present disclosure is shown;

[0018] Figure 9 A block diagram illustrating a page of an interactive application according to some implementations of the present disclosure is shown;

[0019] Figure 10 A flowchart illustrating a method for displaying an object identification according to some implementations of the present disclosure is shown;

[0020] Figure 11 A block diagram illustrating an apparatus for displaying an object identification according to some implementations of the present disclosure; and

[0021] Figure 12 A block diagram is shown of a device capable of implementing various implementations of the present disclosure. DETAILED DESCRIPTION

[0022] The following describes implementations of the present disclosure in more detail with reference to the accompanying drawings. Although certain implementations of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as limited to the implementations described herein. Rather, these implementations are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and implementations of the present disclosure are for illustrative purposes only and are not intended to limit the scope of protection of the present disclosure.

[0023] In the description of the implementation of the present disclosure, the term "including" and similar terms should be understood as open inclusion, that is, "including but not limited to". The term "based on" should be understood as "based at least in part on". The term "an implementation" or "the implementation" should be understood as "at least one implementation". The term "some implementations" should be understood as "at least some implementations". The following may also include other explicit and implicit definitions. As used herein, the term "model" can represent the association relationship between various data. For example, the above-mentioned association relationship can be obtained based on a variety of technical solutions currently known and / or to be developed in the future.

[0024] It is understandable that the data involved in this technical solution (including but not limited to the data itself, the acquisition or use of the data) must comply with the requirements of relevant laws, regulations and relevant provisions.

[0025] It can be understood that, before using the technical solutions disclosed in the embodiments of the present disclosure, the type of personal information involved in the present disclosure, the use range, the use scenario, etc. should be informed to the user and the authorization of the user should be obtained through appropriate means according to relevant laws and regulations.

[0026] For example, in response to receiving an active request of a user, a prompt information is sent to the user to explicitly prompt the user that the operation requested to be performed will require obtaining and using personal information of the user. Thus, the user can autonomously select whether to provide personal information to the software or hardware such as an electronic device, an application program, a server or a storage medium, etc. performing the operation of the technical solutions of the present disclosure according to the prompt information.

[0027] As an optional but non-limiting implementation manner, in response to receiving an active request of a user, the manner of sending a prompt information to the user can be, for example, a pop-up window manner, in which the prompt information can be presented in a text manner. In addition, the pop-up window can also carry a selection control for the user to select “agree” or “disagree” to provide personal information to the electronic device.

[0028] It can be understood that the above notification and obtaining of user authorization process is only illustrative, and does not limit the implementation manners of the present disclosure, and other manners meeting relevant laws and regulations can also be applied to the implementation manners of the present disclosure.

[0029] The term “in response to” used herein represents the state that the corresponding event occurs or the condition is met. It will be understood that the execution time of the subsequent action performed in response to the event or condition is not necessarily strongly associated with the time when the event occurs or the condition is established. For example, in some cases, the subsequent action can be performed immediately when the event occurs or the condition is established; while in other cases, the subsequent action can be performed after a period of time after the event occurs or the condition is established.

[0030] Example Environment

[0031] In a multi-user interactive application, multiple users can participate in events such as singing competitions, debate competitions, etc. in the interactive application. Referring to Figure 1 An application environment according to one example implementation of the present disclosure is described, which Figure 1 A block diagram 100 of an application environment according to one example implementation of the present disclosure is shown. As shown in the block diagram 100, the application environment includes a user terminal 1000, a server 2000, and a network 3000. Figure 1As shown, interactive application 110 can be, for example, an application that provides live audio and / or video streaming capabilities. For example, interactive application 110 can provide a live broadcast of a competitive event, such as a singing competition, and users can join Group A or Group B to participate in the competition. In the context of this disclosure, a singing competition will be used as an example event to describe a specific application environment for displaying object identifiers. Here, an object can represent a user in interactive application 110, and the object identifier can represent the user's identifier, such as the user's name, avatar, or live video of the user participating in the event, etc.

[0032] In order to facilitate the distinction between the users in Group A and Group B, the user identifiers in Group A and Group B can be presented in different display modes (e.g., different colors) in the page of the interactive application. For example, each user in Group A can be represented in red in the left area, and each user in Group B can be represented in blue in the right area. However, users may withdraw from the competition, or new users may join the competition, which may cause the number of users in each group to change. Alternatively and / or additionally, another group (e.g., Group C) may join the competition. However, the area used to represent each group is fixed (e.g., the Group A area on the left and the Group B area on the right can accommodate up to 4 users), which seriously limits the number of groups participating in the event and the number of users in each group.

[0033] For example, when more users want to join group A or group B, or a new user wants to form another group C to participate in a singing competition, it is impossible to present the status of each group in the interactive application. Therefore, it is desired to present the identities of users in each group in a more flexible and effective manner.

[0034] Summary of displaying object identification

[0035] In order to at least partially address the deficiencies in the prior art, according to an exemplary implementation of the present disclosure, a method for displaying an object identifier is proposed. Figure 2 An overview of an exemplary implementation of the present disclosure is described below. Figure 2 A block diagram 200 for displaying object identification according to some implementations of the present disclosure is shown. Figure 2 As shown, a plurality of objects 230 corresponding to the target event may be determined. Here, the plurality of objects may be of different types, for example, the plurality of objects may include a first group of objects 210 of a first type and a second group of objects 220 of a second type.

[0036] In the following, only a singing competition is taken as a specific example of a target event, alternatively and / or additionally, the event can be a debate competition, or other talent competition, etc. Here the objects can be users in the interactive application, and the type of object can be a group that the user belongs to, e.g. group A or group B, etc. A plurality of candidate regions for presenting object identities of the plurality of objects in the predetermined region can be determined based on the object quantity 232. Here the object quantity 232 represents the number of all users participating in the event, and the predetermined region can be a region with a predetermined position and size in a page of the interactive application.

[0037] Here a target candidate region in the plurality of candidate regions is for presenting a target object identity of a target object in the plurality of objects. Assuming the object quantity is represented as N, the number of the plurality of candidate regions can be greater than or equal to the object quantity N. In this way, the object identity of each object can be presented in one candidate region. The number of candidate regions can be determined based on various manners, and the predetermined region can be divided in a manner of a rectangular grid.

[0038] For example, the predetermined region can be divided into W*H candidate regions, where W represents the number of columns in the width direction, and H represents the number of rows in the height direction. Specifically, the specific values of W and H can be determined based on the ratio of the width and height of the predetermined region 240; alternatively and / or additionally, the number of rows and columns can have the same value. As Figure 2 shown, the predetermined region 240 can be divided into 9 candidate regions (e.g. candidate regions #1 to #9) represented in a rectangular manner. For example, the candidate region 250 can represent the first candidate region. Alternatively and / or additionally, the rows and columns of candidate regions can have different values.

[0039] After the plurality of candidate regions have been determined, the plurality of object identities of the plurality of objects can be presented based on the plurality of candidate regions. For example, the first group of object identities of the first group of objects can be presented with a first display manner, and the second group of object identities of the second group of objects can be presented with a second display manner. As Figure 2 shown, the first group of objects (i.e. users of group A are displayed in candidate regions #2, #3, #5, #9) can be represented in red, and the second group of objects (i.e. users of group B are displayed in candidate regions #1, #4, #6, #7, #8) can be represented in blue. Alternatively and / or additionally, the boundary between group A and group B can be divided with a dashed line, thereby distinguishing the two groups in a more explicit manner.

[0040] With the example implementation of the present disclosure, without setting an upper limit on the number of different types of objects participating in the event, or without setting an upper limit on the number of objects of each type, the manner of presenting the object identifiers can be determined in a more flexible manner in real time according to the number of objects participating in the event. In this way, the object identifiers can be presented in a manner that is more conducive to distinguishing different types of objects according to the number of types of objects participating in the event, and the number of objects of each type.

[0041] Detailed process of displaying object identification

[0042] Having described an example implementation according to the present disclosure, more details regarding displaying the object identifiers will be described below. According to an example implementation of the present disclosure, the shape of the candidate region can include a rectangle, a square, a hexagon, a triangle, a circle, etc. In this way, richer visual information can be presented in the interactive application. For ease of description, the specific presentation process will be described below only by way of example of a rectangle.

[0043] According to an example implementation of the present disclosure, the candidate regions can be determined based on the total number of objects. For example, a predetermined region can be divided into W*H candidate regions, where W*H≥N, i.e., the number of candidate regions should be higher than the number of objects. In this way, it can be ensured that the predetermined region 240 includes sufficient candidate regions, and each object identifier can be presented in one candidate region.

[0044] The correspondence between the object identifiers of the plurality of objects and the plurality of candidate regions can be determined based on a variety of manners. For a target object in the plurality of objects, the presentation position of the identifier of the target object can be determined based on the time at which the target object participates in the event. As shown in Figure 2 The object identifiers can be presented in the candidate regions #1 to #9 in chronological order from early to late. In the environment of a live application, the candidate regions can represent a “mic position”, i.e., the microphone position of the user participating in the event.

[0045] Here, the object identifier can include at least any of the following, for example: the ID, name, avatar, or video of the user, etc. The object identifiers of different types of objects can be presented in different display manners. For example, for a user in group A, a red semi-transparent layer can be displayed on top of the ID, name, avatar, video, etc. of the user; for a user in group B, a blue semi-transparent layer can be displayed on top. In this way, the users in different groups can be explicitly distinguished by using different display manners.

[0046] According to one example implementation of the present disclosure, the identification of each user can be updated in real time based on the latest data of the users currently participating in the event. The number of users participating in the event can change, for example, a user at candidate position #7 can quit the event, at which time a different display manner (e.g., black, etc.) can be utilized to represent the idle candidate region. For another example, a new user can join the event, at which time the identification of the new user can be presented in the idle candidate region in the predetermined region. Assuming that the new user joins another new group (group C), at which time the identification of the new user can be presented at candidate position #7, and a different display manner can be utilized to distinguish the user. For example, a semi-transparent layer of yellow color can be superimposed on top of the identification of the new user. In this way, more types of users can be presented without changing the layout of the predetermined region.

[0047] According to one example implementation of the present disclosure, the presentation position of a target object can be determined based on a distance between the target candidate region and another candidate region in the plurality of candidate regions that has another target object of the same type as the target object. In a case where the predetermined region includes a plurality of idle candidate regions, the type of the object at the adjacent candidate region adjacent to the idle candidate region in the predetermined region can be determined, and then one idle candidate region is selected from the plurality of idle candidate regions. Specifically, it is expected that the type at the adjacent candidate region of the selected idle candidate region is the same as the type of the new user. For example, if there is one or more idle regions around the A group users, one idle region can be selected to present the user identification of another user of the A group. In this way, the new user can form a larger connected region with other users in the same group, so that each user in the same group can be presented in a more concentrated manner.

[0048] According to one example implementation of the present disclosure, the presentation position of a target object can be determined based on a distance between the target candidate region and another candidate region in the plurality of candidate regions that has another target object of a different type as the target object. For example, an idle candidate region far away from the users in the B group can be selected as much as possible to present the user identification of the A group. In this way, the distance of the users in different groups can be pulled away, so that the users in different groups can be separated in a more obvious manner.

[0049] Specifically, in the presence of W*H candidate regions, the top-left candidate region #1 can be selected for the first user of the A group, and the free candidate regions can be selected for the other users of the A group in a diffused manner around the candidate region #1. Similarly, the bottom-right candidate region #(W*H) can be selected for the first user of the B group, and the candidate regions can be selected for the other users of the B group in a diffused manner around the candidate region #(W*H). When a new group (e.g., the C group) appears, a free candidate region near the top-right or bottom-left corner can be selected for the first user of the C group, and so on.

[0050] According to one example implementation of the present disclosure, the plurality of candidate regions can be determined again when a change in the object quantity of the plurality of objects satisfies a predetermined condition. For example, if the object quantity increases and exceeds the number of candidate regions, the number of candidate regions can be increased and the plurality of candidate regions can be determined again. For example, the number of candidate regions can be changed from the current 3*3 to 3*4 or 4*4 so as to accommodate more users.

[0051] For another example, if a user exits the game and causes the object quantity to decrease and a large number of free regions to be generated in the predetermined region, the number of candidate regions can be decreased and the plurality of candidate regions can be determined again. Assuming that there are currently only 2 users participating in the event, the number of candidate regions can be changed from the current 3*3 to 3*2 or 2*3, and so on. In this way, the number and layout of candidate regions can be adjusted in time with the change in the number of users participating in the event, and thus the users in different groups can be distinguished in a more explicit and concise manner.

[0052] According to one example implementation of the present disclosure, at the boundary position between each user in different groups, a separation line can be presented in a different display manner (e.g., referred to as a third display manner). As shown in Figure 2 The boundary between the A group and the B group can be represented by a dashed line so as to distinguish the users in different groups in a more prominent visual effect. Specifically, each boundary of the object identifiers of each object in a group of objects can be traversed. In the case of a rectangular candidate region, each object identifier is represented in a rectangular region, at which time the boundary (e.g., referred to as a first boundary) of the candidate region can correspond to at least any one of the following in the rectangular region: an upper side boundary, a lower side boundary, a left side boundary, and a right side boundary.

[0053] Figure 3 A block diagram 300 of a candidate region according to some implementations of the present disclosure is shown. As Figure 3As shown, the candidate region 310 can be represented by four vertices P0, P1, P2 and P3 of the rectangular region. According to one example implementation of the present disclosure, the coordinates of each vertex can include a horizontal coordinate and a vertical coordinate, and a data structure can be constructed by using various programming languages to store the relevant information of the candidate region. For example, the data structure of the candidate region can be defined by using the four vertices of the rectangle. For the convenience of calculation, a line segment can also be defined by using two vertices at the two ends of the line segment. Further, the specific direction of the line segment (e.g., horizontal and / or vertical) can not be perceived, and only one vertex coordinate can be used to represent a vertex (i.e., the other coordinate in the horizontal and / or vertical direction is ignored).

[0054] According to one example implementation of the present disclosure, a set of contour boundaries associated with the first set of object identifiers can be determined. Specifically, for a certain object identifier in the first set of object identifiers (e.g., referred to as the first object identifier), if it is determined that the first boundary of the first object identifier is located at the contour position of the first set of object identifiers, the first boundary is added to the set of contour boundaries. After the processing of each boundary has been completed, the set of contour boundaries will include all the boundaries located at the contour position. Further, each boundary in the set of contour boundaries can be presented by using the third display manner. In this way, the process of determining the boundary line between different types of object identifiers can be converted into a simple comparison process, thereby improving the processing efficiency.

[0055] According to one example implementation of the present disclosure, any set of object identifiers can be traversed, and the boundaries located at the contour position are sought. Alternatively and / or additionally, based on the number of each type of object, it can be determined at which type of object identifier the contour position presents the boundary line. For example, the type corresponding to the smaller number of types can be selected, and in the example above, the group A includes 4 users and the group B includes 5 users, and in this case, the contours of the user identifiers in the group A can be presented by using the third display manner. In this way, the amount of calculation involved in the traversal process can be reduced, thereby improving the processing efficiency.

[0056] According to one example implementation of the present disclosure, the third display manner can be associated with the first display manner. For example, the contour line of the user identifiers in the group A can be highlighted by using the red color with higher brightness. In this way, the color of the contour line of the group A matches the color of the user identifiers in the group A (e.g., dark red color with lower brightness), and thus the boundary between different types of objects can be distinguished in a more visually coordinated manner.

[0057] According to an example implementation of the present disclosure, the contour location may relate to various situations: adjacent boundaries between different types of object identifiers, or a boundary of a predetermined area. Specifically, if it is determined that a first boundary corresponds to an adjacent boundary between a first object identifier and a second object identifier of a second object in the second group of objects, then the first boundary may be determined to be located at the contour location.

[0058] For ease of calculation, the boundaries of the object identifier can be represented by line segments between the four vertices of the candidate region. For example, the candidate region 310 can be filled to present the object identifier, and the four boundaries of the object identifier can be represented as: P0P1, P1P2, P2P3, and P0P3. The boundaries of each object identifier can be represented in a similar manner. Furthermore, by comparing the boundaries, it can be determined whether a boundary is an adjacent boundary between two different types of object identifiers.

[0059] See also Figure 4 Describe in more detail the Figure 4 A block diagram 400 is shown showing the contour positions of a first set of object identifiers according to some implementations of the present disclosure. Figure 4 As shown, the object identification of each object in group A can be traversed. First, the left boundary of the object identification located at candidate area #2 is processed. By comparison, it can be seen that the object identification at candidate area #1 belongs to group B, and the object identification at candidate area #2 belongs to group A. At this time, boundary 411 is an adjacent boundary between two object identifications of different types, and thus the boundary 411 is located at the contour position of the object identification of group A. Other boundaries of the object identification at candidate area #2 (such as the upper boundary, the right boundary, and the lower boundary) can be processed in a similar manner. Using the example implementation of the present disclosure, the adjacent boundaries between object identifications of different types can be determined by simple boundary comparison to improve processing efficiency.

[0060] Alternatively and / or additionally, if it is determined that the first boundary is located at the boundary of the predetermined area, it may be determined that the first boundary is located at the contour position. Figure 4 As shown in FIG. 2 , by comparison, it can be seen that the upper boundary 410 of the object identifier at candidate region #2 is located at the boundary of the predetermined region, and thus this boundary 410 can be added to the contour boundary set. Each boundary of each object identifier in group A can be processed one by one in a similar manner, thereby adding all boundaries located at the contour position to the contour boundary set. At this point, the contour boundary set can include boundaries 411, 410, 412, 413, 414, 415, 416, 417, 420, 421, 422, and 423.

[0061] It should be understood that the above is only a specific example, and alternatively and / or additionally, a portion of the interior of the candidate area may be filled in order to present the object identification.Figure 5 Describe in more detail the Figure 5 A block diagram 500 illustrating object identification according to some implementations of the present disclosure is shown. Figure 5 As shown, vertices Q0, Q1, Q2, and Q3 of object identifier 510 may be located inside candidate region 310, for example, indented by one or more pixels toward the center of candidate region 310. In this way, gaps will exist between the displayed object identifiers, thus avoiding overlapping display between the boundaries of the object identifiers, thereby providing a better visual effect.

[0062] When determining whether a boundary is located at an outline position, the indentation distance should be considered. Specifically, for the upper boundary of an object identifier, the condition for the lower boundary of the adjacent object identifier to be satisfied is: the y value of the upper line segment of the object identifier is equal to the y value of the lower boundary of the other object identifier + diff. Where diff is the spacing between the microphone positions. The lower boundary, left boundary, and right boundary of the object identifier can be processed in a similar manner.

[0063] According to an example implementation of the present disclosure, to simplify the judgment logic, for all parallel line segments, the specific direction of the line segment can be ignored, and only the numerical values ​​of its starting and ending points can be retained to achieve simplified processing. For example, for a horizontal line segment with starting coordinates (5, 10) and ending coordinates (5, 20), the boundary can be represented using the simplified data structure {10, 20}, and its horizontal coordinates do not need to be recorded. According to an example implementation of the present disclosure, a conversion function can be written to simplify the data structure of each boundary of the object identifier, thereby improving the efficiency of subsequent processing.

[0064] According to an exemplary implementation of the present disclosure, microphone positions adjacent to the target microphone position's boundaries (the upper / left / lower / right boundaries of the microphone position) (i.e., corresponding to the lower / right / upper / left boundaries of other microphone positions) can be screened. Specifically, if the difference between the upper boundary of one microphone position and the lower boundary of another microphone position satisfies diff, then the two microphone positions are adjacent. Similarly, if the difference between the left boundary of one microphone position and the right boundary of another microphone position satisfies diff, then the two microphone positions are adjacent, and so on. In this way, the outlines of different types of object markers can be determined in a simpler and more efficient manner.

[0065] Figure 6 A block diagram 600 is shown of a process for processing a boundary according to some implementations of the present disclosure. Figure 6As shown, at block 610, an array of target line segments and an array of adjacent line segments of the same type (also referred to as a first array) can be input. At block 611, the line segments in the first array can be sorted according to the position relationship of the starting points of the line segments. At block 612, an empty array of line segments (also referred to as a second array) can be created, and at block 613, a first temporary variable can be defined with a value of the starting point of the first line segment. Further, a second temporary variable can be defined with a value of the starting point of the first line segment. At block 614, a third temporary variable i can be defined and set to 0 for traversing each line segment in the first array.

[0066] At block 615, the third temporary variable can be compared with the length of the first array. If the third temporary variable is less than the length (i.e., the result of the determination is "yes"), the process proceeds to block 630; otherwise, the process proceeds to block 616 (i.e., the result of the determination is "no"). At block 630, the third temporary variable can be increased by 1 for processing the next line segment in the first array. At block 631, the line segment at position i in the first array can be obtained, which can be denoted as a second line segment. At block 632, a relationship between the end point of the second line segment and the first temporary variable can be determined. If the end point of the second line segment is less than or equal to the first temporary variable (i.e., the result of the determination at block 632 is "yes"), the process proceeds to block 615, and the processing of the line segment b is completed. Otherwise, if the result of the determination at block 632 is "no", the process proceeds to block 633 for determining whether a distance between the end point of the second line segment and the line segment at i-1 (i.e., the previous line segment in the second array) is a predetermined distance (e.g., denoted as diff).

[0067] If the result of the determination at block 633 is "yes", the process proceeds to block 634 for shifting the starting point of the second line segment forward by the predetermined distance. If the result of the determination at block 633 is "no", the process proceeds to block 635 for determining whether the value of the first temporary variable satisfies being less than the end point of the second line segment. If the result of the determination at block 635 is "yes", the process proceeds to block 636 for setting the value of the second temporary variable to the end point of the second line segment. At block 637, the value of the second temporary variable can be modified. If the result of the determination at block 635 is "no", the process directly proceeds to block 637.

[0068] At block 638, it can be determined whether the value of the second temporary variable is less than the end point of the first line segment. If the determination at block 638 is "yes", the process proceeds to block 620; otherwise, the process proceeds to block 639 to set the second temporary variable to the start point of the first line segment. Further, at block 620, it can be determined whether the first temporary variable is less than the second temporary variable. If the determination at block 620 is "yes", the process proceeds to block 621; otherwise, the process proceeds to block 624. At block 621, a third line segment is created, which has a start point of the first temporary variable and an end point of the second temporary variable. At block 622, the third line segment is stored in a line segment array (e.g., a third array). At block 623, the first temporary variable is set to the end point of the second line segment and the second temporary variable is set to the end point of the second line segment.

[0069] Further, at block 624, it can be determined whether the first temporary variable is greater than the end point of the first line segment. If the determination is "yes", the process proceeds to block 616; otherwise, the process proceeds to block 615. At block 616, the first temporary variable can be compared to the end point of the first line segment. If the comparison is "less than", the process proceeds to block 617. At block 617, a fourth line segment can be created, which has a start point equal to the first temporary variable and an end point equal to the end point of the second line segment. At block 618, the fourth line segment is stored in the third array. At block 619, the third array includes line segments that lie within the contour region that need to be drawn. Further, the third array can be output. At this point, the third array includes all the boundaries that are to be drawn.

[0070] According to one example implementation of the present disclosure, each boundary in the set of contour boundaries can be determined in the manner described above. For example, after each boundary of all the object identifications in set A has been traversed, each boundary in the set of contour boundaries can be drawn one by one. It should be appreciated that when the object identifications are represented in a nested manner, the end points of the determined boundaries can not be continuous, and thus a connecting line needs to be added at the discontinuous portion.

[0071] Since the area of the object identification is smaller than the predetermined area, there can be a gap between the boundaries of two adjacent object identifications. Referring to Figure 7A and 7B More details are described, which Figure 7A A block diagram 700A illustrating a gap between a first boundary and a second boundary according to some implementations of the present disclosure is shown. As Figure 7A shown, assume that boundary 710 and boundary 712 are two boundaries of two horizontally adjacent object regions, there can be a gap 714 between the end point E1 of boundary 710 and the end point E2 of boundary 720. For another example, Figure 7BA block diagram 700B showing a gap between a first boundary and a second boundary according to some implementations of the present disclosure is shown. As Figure 7B shown, assuming that the boundary 720 and the boundary 722 are two boundaries of two object regions that are vertically adjacent, there can be a gap 724 between the end point E4 of the boundary 720 and the boundary E3 of the boundary 722.

[0072] It should be appreciated that Figure 7A and Figure 7B are merely illustrative, and there can be gaps located at other positions. According to one example implementation of the present disclosure, a gap between boundaries can be detected, and a connecting line can be added at the gap. Specifically, if it is determined that a distance between a first end point of a first boundary and a second end point of a second boundary satisfies a predetermined condition, a connecting line can be presented between the first boundary and the second boundary using a third display mode. Here, the predetermined condition can represent, for example, that the distance between the first end point and the second end point is equal to diff (as shown in Figure 7A ). Alternatively and / or additionally, the predetermined condition can represent that the distance between the first end point and the second end point is equal to √2 times diff (as shown in Figure 7B ). In this way, a gap region to be filled can be determined through simple mathematical operations.

[0073] According to one example implementation of the present disclosure, in the process of presenting a connecting line, if it is determined that a first direction of a first boundary is consistent with a second direction of a second boundary, a straight line segment connecting the first boundary and the second boundary can be used as the connecting line. As Figure 7A shown, a line segment can be filled at the gap 714 between points E1 and E2, so as to make the boundaries 710 and 712 present a continuous visual effect.

[0074] According to one example implementation of the present disclosure, in the process of presenting a connecting line, if it is determined that a first direction of a first boundary is perpendicular to a second direction of a second boundary, an arc line segment connecting the first boundary and the second boundary can be used as the connecting line. Referring to Figure 7C more details are described, the Figure 7C A block diagram 700C showing a connecting line between a first boundary and a second boundary according to some implementations of the present disclosure is shown.

[0075] As Figure 7C shown, assuming that a vertical boundary is located at the left side of a horizontal boundary, there can be eight position relationships between two boundaries that are perpendicular to each other, which are represented as position relationships 730, 731, 732, 733, 734, 735, 736, and 737, respectively. At this time, a connecting line represented by an arc line segment (for example, 1 / 4 of a circle arc) can be drawn between the two boundaries that are perpendicular to each other. For example, the drawing process can be implemented using the following process. It should be appreciated that Figure 7CThe position relationship in FIG. 7 and the following drawing process are only illustrative. The vertical boundary can be located to the right of the horizontal boundary, and the corresponding process can be performed based on the similar principles described above.

[0076] Referring to FIG. 7, the position relationship 730 shows that the arc of the upper left 1 / 4 is drawn, or the arc is not drawn; the position relationship 731 shows that the arc of the upper left 1 / 4 is drawn; the position relationship 732 shows that the arc of the upper left 1 / 4 is drawn; the position relationship 733 shows that the arc of the lower left 1 / 4 is drawn; the position relationship 734 shows that the arc of the lower left 1 / 4 is drawn, or the arc is not drawn; the position relationship 735 shows that the arc of the lower left 1 / 4 is drawn; the position relationship 736 shows that the arc of the lower left 1 / 4 is drawn; and the position relationship 737 shows that the arc of the upper left 1 / 4 is drawn. Figure 7C According to one example implementation of the present disclosure, an intersection point can exist between the target boundary in the first boundary and the second boundary and the arc segment, and in this case, the part corresponding to the intersection point needs to be removed from the target boundary. Referring to the position relationship 731 in FIG. 7, the intersection point of the arc segment and the horizontal boundary is R1, and in this case, the part 740 to the left of the intersection point R1 can be removed from the horizontal boundary.

[0077] Figure 7C Referring to the position relationship 732 in FIG. 7, the intersection point of the arc segment and the vertical boundary is R2, and in this case, the part 742 above the intersection point R2 can be removed from the vertical boundary. Referring to the position relationship 733 in FIG. 7, the intersection point of the arc segment and the horizontal boundary is R3, and in this case, the part 744 to the left of the intersection point R3 can be removed from the vertical boundary. Referring to the position relationship 735 in FIG. 7, the intersection point of the arc segment and the vertical boundary is R4, and in this case, the part 746 below the intersection point R4 can be removed from the vertical boundary. In other words, the redundant part on the same side of the intersection point of the arc segment can be removed from the target boundary. With the example implementation of the present disclosure, a more smooth contour line can be presented, thereby providing a better visual effect.

[0078] It should be understood that the above only shows the process of determining the contour line in an example manner. The position of the contour line can be adjusted based on the principles described above. For example, the position of the contour line can be expanded outward by a distance of diff / 2 so as to present the contour line at the middle position between two adjacent object identifiers. In this way, the boundary between different types of object identifiers can be presented in a more obvious manner, thereby facilitating the differentiation of different types of objects. A block diagram 800 of a page of an interactive application according to some implementations of the present disclosure is shown. As shown in FIG. 8, a plurality of users in group A are divided into two areas, and a contour line 810 can surround the seats #2, #3 and #5, and a contour line 820 can surround the seat #9.

[0079] Figure 8 It should be understood that the above only shows the process of determining the contour line in an example manner. The position of the contour line can be adjusted based on the principles described above. For example, the position of the contour line can be expanded outward by a distance of diff / 2 so as to present the contour line at the middle position between two adjacent object identifiers. In this way, the boundary between different types of object identifiers can be presented in a more obvious manner, thereby facilitating the differentiation of different types of objects. Figure 8 A block diagram 800 of a page of an interactive application according to some implementations of the present disclosure is shown. As shown in FIG. 8, a plurality of users in group A are divided into two areas, and a contour line 810 can surround the seats #2, #3 and #5, and a contour line 820 can surround the seat #9.​

[0080] According to one example implementation of the present disclosure, the predetermined region in the interactive application can have different positions and / or shapes, and the shapes and layouts of the candidate regions in different interactive applications can be different. Figure 9 A block diagram 900 of a page of an interactive application according to some implementations of the present disclosure is shown. As shown, in the interactive application 910, the predetermined region 912 can be a square region, and a plurality of seats can be presented in the predetermined region 912 in a square grid manner. In the interactive application 920, the predetermined region 922 can be a rectangular region, and a plurality of seats can be presented in the predetermined region 922 in a rectangular sequence manner. In the interactive application 930, the predetermined region 932 can be a hexagonal region, and a plurality of seats can be presented in the predetermined region 932 in a hexagonal grid manner, and so on. Figure 9

[0081] According to one example implementation of the present disclosure, the method is implemented in a live application, the target event is a live confrontation event (e.g., a singing competition) in the live application, and the object identifiers are identifiers of users participating in the live confrontation event. In this way, different types of users participating in the competition event can be explicitly distinguished, and in turn, different groups of songs can be distinguished in a more explicit manner.

[0082] With the example implementations of the present disclosure, the manner for presenting the object identifiers of the participating objects in the event can be determined in a more flexible manner according to the number of the participating objects. In this way, the object identifiers can be presented in a manner that is more beneficial to distinguishing different types of objects according to the number of types of participating objects and the number of objects of each type.

[0083] Example Process

[0084] Figure 10 A flowchart of a method 1000 for displaying object identifiers according to some implementations of the present disclosure is shown. At block 1010, a plurality of objects corresponding to a target event is determined, the plurality of objects including a first group of objects of a first type and a second group of objects of a second type. A plurality of candidate regions for presenting object identifiers of the plurality of objects in a predetermined region is determined based on the number of objects of the plurality of objects, a target candidate region of the plurality of candidate regions being used for presenting a target object identifier of a target object of the plurality of objects. A plurality of object identifiers of the plurality of objects is presented based on the plurality of candidate regions, wherein a first group of object identifiers of the first group of objects is presented using a first display manner, and a second group of object identifiers of the second group of objects is presented using a second display manner.

[0085] ​According to one example implementation of the disclosure, the method further includes: determining a set of contour boundaries associated with the first set of object identifiers; and presenting at least one boundary in the set of contour boundaries using a third display manner.

[0086] According to one example implementation of the disclosure, determining the set of contour boundaries associated with the first set of object identifiers includes: for a first object identifier in the first set of object identifiers, in response to determining that a first boundary of the first object identifier is located at a contour position of the first object identifier, adding the first boundary to the set of contour boundaries.

[0087] According to one example implementation of the disclosure, determining that the first boundary of the first object identifier is located at the contour position includes determining that the first boundary is located at the contour position in response to at least one of: the first boundary corresponding to an adjacent boundary between the first object identifier and a second object identifier of a second object in the second set of objects; and the first boundary being located at a boundary of a predetermined region.

[0088] According to one example implementation of the disclosure, the plurality of candidate regions are rectangular regions, and the first boundary corresponds to at least one of: an upper side boundary, a lower side boundary, a left side boundary, and a right side boundary in the rectangular regions.

[0089] According to one example implementation of the disclosure, the set of contour boundaries further includes a second boundary, and presenting at least one boundary in the set of contour boundaries includes: in response to determining that a distance between a first end point of the first boundary and a second end point of the second boundary satisfies a predetermined condition, presenting a connection line between the first boundary and the second boundary using the third display manner.

[0090] According to one example implementation of the disclosure, presenting the connection line includes: in response to determining that a first direction of the first boundary is consistent with a second direction of the second boundary, using a straight line segment connecting the first boundary and the second boundary as the connection line.

[0091] According to one example implementation of the disclosure, for a target object in the plurality of objects, a target candidate region in the plurality of candidate regions for presenting the target object is determined based on at least one of: a time at which the target object participates in a target event; a distance between the target candidate region and another candidate region in the plurality of candidate regions for another target object in the plurality of objects that has a same type as the target object; and a distance between the target candidate region and another candidate region in the plurality of candidate regions for another target object in the plurality of objects that has a different type from the target object.

[0092] According to one example implementation of the disclosure, the third display manner is associated with the first display manner, and a first number of objects in the first set of objects is not higher than a second number of objects in the second set of objects.

[0093] According to one example implementation of the present disclosure, determining the plurality of candidate regions comprises: in response to determining that a change in the object quantity of the plurality of objects satisfies a predetermined condition, determining the plurality of candidate regions.

[0094] According to one example implementation of the present disclosure, the method is implemented in a live application, the target event is a live confrontation event in the live application, and the object identification is an identification of a user participating in the live confrontation event.

[0095] Example Devices and Apparatus

[0096] Figure 11 A block diagram of an apparatus 1100 for displaying object identifications according to some implementations of the present disclosure is shown. The apparatus 1100 includes: an object determination module 1110 configured to determine a plurality of objects corresponding to a target event, the plurality of objects including a first group of objects having a first type and a second group of objects having a second type; a region determination module 1120 configured to determine, based on an object quantity of the plurality of objects, a plurality of candidate regions in a predetermined region for presenting object identifications of the plurality of objects, a target candidate region in the plurality of candidate regions being for presenting a target object identification of a target object in the plurality of objects; and a presentation module 1130 configured to present the plurality of object identifications of the plurality of objects based on the plurality of candidate regions, wherein a first group of object identifications of the first group of objects are presented with a first display manner, and a second group of object identifications of the second group of objects are presented with a second display manner.

[0097] According to one example implementation of the present disclosure, the apparatus further includes: a set determination module configured to determine a set of contour boundaries associated with the first group of object identifiers; and a boundary presentation module configured to present at least one boundary in the set of contour boundaries with a third display manner.

[0098] According to one example implementation of the present disclosure, the set determination module further includes: an adding module configured to, for a first object identification in the first group of object identifications, in response to determining that a first boundary of the first object identification is located at a contour position of the first object identification, add the first boundary to the set of contour boundaries.

[0099] According to one example implementation of the present disclosure, the adding module includes a boundary determination module configured to determine that the first boundary of the first object identification is located at the contour position comprises determining that the first boundary is located at the contour position in response to at least any one of: the first boundary corresponding to an adjacent boundary between the first object identification and a second object identification of a second object in the second group of objects; and the first boundary being located at a boundary of the predetermined region.

[0100] According to an exemplary implementation of the present disclosure, the plurality of candidate regions are rectangular regions, and the first boundary corresponds to at least any one of the following in the rectangular region: an upper boundary, a lower boundary, a left boundary, and a right boundary.

[0101] According to an example implementation of the present disclosure, the contour boundary set further includes a second boundary, and the presentation module includes: a connecting line presentation module, configured to present a connecting line between the first boundary and the second boundary using a third display mode in response to determining that the distance between the first endpoint of the first boundary and the second endpoint of the second boundary meets a predetermined condition.

[0102] According to an example implementation of the present disclosure, the connecting line presentation module includes: a straight line presentation module configured to use a straight line segment connecting the first boundary and the second boundary as a connecting line in response to determining that the first direction of the first boundary is consistent with the second direction of the second boundary.

[0103] According to an example implementation of the present disclosure, for a target object among multiple objects, a target candidate area for presenting the target object among multiple candidate areas is determined based on at least any one of the following: the time when the target object participates in a target event; the distance between the target candidate area and another candidate area of ​​another target object of the same type as the target object among the multiple candidate areas; and the distance between the target candidate area and another candidate area of ​​another target object of a different type as the target object among the multiple candidate areas.

[0104] According to an example implementation of the present disclosure, the third display mode is associated with the first display mode, and the number of first objects in the first group of objects is not greater than the number of second objects in the second group of objects.

[0105] According to an example implementation of the present disclosure, the region determination module includes: a trigger module configured to determine a plurality of candidate regions in response to determining that a change in the number of objects of the plurality of objects satisfies a predetermined condition.

[0106] According to an example implementation of the present disclosure, the apparatus is implemented in a live broadcast application, the target event is a live broadcast confrontation event in the live broadcast application, and the object identifier is an identifier of a user participating in the live broadcast confrontation event.

[0107] Figure 12 FIG1 shows a block diagram of a device 1200 capable of implementing multiple implementations of the present disclosure. It should be understood that Figure 12 The illustrated computing device 1200 is merely exemplary and should not be construed as limiting the functionality and scope of the implementations described herein. Figure 12 The illustrated computing device 1200 may be used to implement the methods described above.

[0108] like Figure 12 As shown, computing device 1200 is in the form of a general-purpose computing device. Components of computing device 1200 may include, but are not limited to, one or more processors or processing units 1210, memory 1220, storage device 1230, one or more communication units 1240, one or more input devices 1250, and one or more output devices 1260. Processing unit 1210 may be a real or virtual processor and is capable of performing various processes according to a program stored in memory 1220. In a multi-processor system, multiple processing units execute computer-executable instructions in parallel to increase the parallel processing capabilities of computing device 1200.

[0109] The computing device 1200 typically includes a plurality of computer storage media. Such media can be any available media accessible to the computing device 1200, including but not limited to volatile and non-volatile media, removable and non-removable media. The memory 1220 can be a volatile memory (e.g., registers, cache, random access memory (RAM)), a non-volatile memory (e.g., read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory), or some combination thereof. The storage device 1230 can be a removable or non-removable medium and can include a machine-readable medium such as a flash drive, a disk, or any other medium that can be used to store information and / or data (e.g., training data for training) and can be accessed within the computing device 1200.

[0110] The computing device 1200 may further include additional removable / non-removable, volatile / non-volatile storage media. Figure 12 As shown in FIG, a magnetic disk drive for reading from or writing to a removable, non-volatile magnetic disk (e.g., a "floppy disk") and an optical disk drive for reading from or writing to a removable, non-volatile optical disk may be provided. In these cases, each drive may be connected to a bus (not shown) by one or more data media interfaces. Memory 1220 may include a computer program product 1225 having one or more program modules configured to perform various methods or actions of various implementations of the present disclosure.

[0111] The communication unit 1240 enables communication with other computing devices via a communication medium. Additionally, the functionality of the components of the computing device 1200 can be implemented as a single computing cluster or multiple computing machines that can communicate via a communication connection. Thus, the computing device 1200 can operate in a networked environment using logical connections to one or more other servers, network personal computers (PCs), or other network nodes.

[0112] Input device 1250 can be one or more input devices, such as a mouse, a keyboard, a trackball, etc. Output device 1260 can be one or more output devices, such as a display, a speaker, a printer, etc. Computing device 1200 can also communicate with one or more external devices (not shown) such as a storage device, a display device, etc. through communication unit 1240, and with one or more devices that enable a user to interact with computing device 1200, and / or any devices (e.g., a network card, a modem, etc.) that enable computing device 1200 to communicate with one or more other computing devices. Such communication can occur via Input / Output (I / O) interface (not shown).

[0113] According to an example implementation of the present disclosure, a computer readable storage medium is provided having computer executable instructions stored thereon, where the computer executable instructions are executed by a processor to implement the method described above. According to an example implementation of the present disclosure, a computer program product is also provided that is tangibly stored on a non-transitory computer readable medium and includes computer executable instructions, where the computer executable instructions are executed by a processor to implement the method described above. According to an example implementation of the present disclosure, a computer program product is provided having a computer program stored thereon, which when executed by a processor implements the method described above.

[0114] Various aspects of the disclosure are described herein with reference to flowchart illustrations and / or block diagrams of methods, apparatuses, and computer program products according to implementations of the disclosure. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer readable program instructions.

[0115] These computer readable program instructions can be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions / acts specified in the flowchart and / or block diagram block or blocks. These computer readable program instructions can also be stored in a computer readable storage medium that can comprise a non-transitory computer readable storage medium. The instructions can be retrieved and executed by the computer or other programmable data processing apparatuses. Some or all of the computer readable program instructions can be loaded onto a computer or other programmable data processing apparatuses, which can include the computer readable storage medium, the processor, and the computer program product.

[0116] The computer readable program instructions can also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable data processing apparatus or other device to produce a computer implemented process such that the instructions which execute on the computer, other programmable data processing apparatus, or other device implement the functions / acts specified in the flowchart and / or block diagram block or blocks.

[0117] The computer readable program instructions can also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable data processing apparatus or other device to produce a computer implemented process such that the instructions which execute on the computer, other programmable data processing apparatus, or other device implement the functions / acts specified in the flowchart and / or block diagram block or blocks.

[0118] The implementations of the disclosure have been described above with the intent to be illustrative rather than limiting. Although being shown and described in terms of certain implementations and overall functions, the implementations are not intended to exclude other implementations or technologies. Modifications and changes can be made in arrangement, operation, and details of the methods and apparatus described. Many modifications and variations of the described implementations are possible and will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described implementations. None, individually or taken in any combination, is to be treated as limiting the described implementations unless otherwise indicated.

Claims

1. A method for displaying an object identification, comprising: determining a plurality of objects corresponding to a target event, the plurality of objects comprising a first group of objects of a first type and a second group of objects of a second type; Based on the number of the multiple objects, determining multiple candidate areas in a predetermined area for presenting object identifications of the multiple objects, wherein a target candidate area in the multiple candidate areas is used to present a target object identification of a target object among the multiple objects; as well as A plurality of object identifiers of the plurality of objects are presented based on the plurality of candidate regions, wherein a first group of object identifiers of the first group of objects are presented using a first display manner, and a second group of object identifiers of the second group of objects are presented using a second display manner.

2. The method according to claim 1, further comprising: determining a set of contour boundaries associated with the first set of object identifiers; as well as At least one boundary in the contour boundary set is presented using a third display mode.

3. The method of claim 2, wherein determining the set of contour boundaries associated with the first set of object identifiers comprises: For a first object identifier in the first group of object identifiers, in response to determining that a first boundary of the first object identifier is located at a contour position of the first group of object identifiers, the first boundary is added to a contour boundary set.

4. The method according to claim 3, wherein determining that the first boundary of the first object identifier is located in the contour area comprises determining that the first boundary is located at the contour position in response to at least any one of the following: The first boundary corresponds to an adjacent boundary between the first object identifier and a second object identifier of a second object in the second group of objects; and The first boundary is located at a boundary of the predetermined area. The method according to claim 3 , wherein the plurality of candidate regions are rectangular regions, and the first boundary corresponds to at least any one of the following in the rectangular region: an upper boundary, a lower boundary, a left boundary, and a right boundary.

6. The method of claim 5, wherein the set of contour boundaries further comprises a second boundary, and rendering the at least one boundary in the set of contour boundaries comprises: In response to determining that the distance between the first endpoint of the first boundary and the second endpoint of the second boundary meets a predetermined condition, a connecting line is presented between the first boundary and the second boundary using the third display mode.

7. The method according to claim 6, wherein presenting the connection line comprises: In response to determining that the first direction of the first boundary is consistent with the second direction of the second boundary, a straight line segment connecting the first boundary and the second boundary is used as the connecting line.

8. The method according to claim 1, wherein for a target object among the multiple objects, a target candidate region for presenting the target object among the multiple candidate regions is determined based on at least any one of the following: The time when the target object participates in the target event; a distance between the target candidate region and another candidate region of another target object of the same type as the target object among the plurality of candidate regions; and a distance between the target candidate region and another candidate region of another target object of a different type from the target object among the multiple candidate regions. 9 . The method according to claim 3 , wherein the third display mode is associated with the first display mode, and a first number of objects in the first group of objects is not greater than a second number of objects in the second group of objects.

10. The method according to claim 1, wherein determining the plurality of candidate regions comprises: In response to determining that a change in the number of objects of the plurality of objects satisfies a predetermined condition, the plurality of candidate regions are determined.

11. The method according to claim 1, wherein the method is implemented in a live broadcast application, the target event is a live broadcast confrontation event in the live broadcast application, and the object identifier is an identifier of a user participating in the live broadcast confrontation event.

12. A device for displaying an object identification, comprising: an object determination module configured to determine a plurality of objects corresponding to a target event, the plurality of objects comprising a first group of objects of a first type and a second group of objects of a second type; an area determination module configured to determine, based on the number of the plurality of objects, a plurality of candidate areas in a predetermined area for presenting object identifications of the plurality of objects, wherein a target candidate area in the plurality of candidate areas is used to present a target object identification of a target object among the plurality of objects; as well as The presenting module is configured to present a plurality of object identifiers of the plurality of objects based on the plurality of candidate regions, wherein a first group of object identifiers of the first group of objects is presented using a first format, and a second group of object identifiers of the second group of objects is presented using a second format.

13. An electronic device comprising: at least one processing unit; as well as At least one memory coupled to the at least one processing unit and storing instructions for execution by the at least one processing unit, the instructions causing the electronic device to perform the method according to any one of claims 1 to 11 when executed by the at least one processing unit.

14. A computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, causes the processor to implement the method according to any one of claims 1 to 11.

Citation Information

Patent Citations

  • Display control method and apparatus

    CN105068779A

  • Techniques for selecting objects in images

    CN107797733A

  • Venue seat value attribute setting method and device, and recommending method and device

    CN108550063A

  • Game interaction method and device

    CN112657186A

  • Method and device for processing mixed audio and video streams

    CN112752037A