CN113301541A - SL communication video knowledge graph construction method and device - Google Patents

SL communication video knowledge graph construction method and device Download PDF

Info

Publication number
CN113301541A
CN113301541A CN202110849077.6A CN202110849077A CN113301541A CN 113301541 A CN113301541 A CN 113301541A CN 202110849077 A CN202110849077 A CN 202110849077A CN 113301541 A CN113301541 A CN 113301541A
Authority
CN
China
Prior art keywords
resource
domain resources
bit
video knowledge
resources
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202110849077.6A
Other languages
Chinese (zh)
Other versions
CN113301541B (en
Inventor
王婷
马洪江
何松泽
陈诗汉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chengdu University of Information Technology
Original Assignee
Chengdu University of Information Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chengdu University of Information Technology filed Critical Chengdu University of Information Technology
Priority to CN202110849077.6A priority Critical patent/CN113301541B/en
Publication of CN113301541A publication Critical patent/CN113301541A/en
Application granted granted Critical
Publication of CN113301541B publication Critical patent/CN113301541B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/046—Wireless resource allocation based on the type of the allocated resource the resource being in the space domain, e.g. beams

Abstract

The application provides a video knowledge graph construction method and device based on SL communication, which are used for realizing video knowledge graph construction in a big data packet transmission scene through SL communication. The method comprises the following steps: receiving a first physical sidelink shared channel PSSCH from a second terminal, wherein the first PSSCH is carried on a first resource, and the first resource comprises: the video knowledge graph tree comprises first spatial domain resources, M first frequency domain resources, N first time domain resources and M x N first bit domain resources, wherein the first spatial domain resources, the first frequency domain resources, the first time domain resources and the first bit domain resources are used for indicating a first video knowledge graph tree; determining first space domain resources, M first frequency domain resources, N first time domain resources and M × N first bit domain resources according to the first PSSCH; and constructing a first video knowledge graph tree according to the first spatial domain resources, the M first frequency domain resources, the N first time domain resources and the M x N first bit domain resources.

Description

SL communication video knowledge graph construction method and device
Technical Field
The present application relates to the field of communications technologies, and in particular, to a video knowledge graph construction method and apparatus based on SL communication.
Background
In New Radio (NR) technology, which is known as 5G technology, sidelink SL (sidelink SL) communication is a commonly used communication technology. SL refers to communication between a terminal and a terminal, for example, a User Equipment (UE) 1 communicates with a UE2 through a Sidelink, such as a physical Sidelink shared Channel (psch), a Physical Sidelink Control Channel (PSCCH), and the like, to complete a corresponding service cooperatively. The communication mode does not need to pass through an access network and a core network, thereby effectively reducing the transmission delay and improving the completion efficiency of the service.
However, due to limited communication capabilities of the terminals, SL communication cannot achieve large packet transmission. That is, in a large packet transmission scenario, such as video knowledge graph construction, ultra high definition video packet transmission, etc., the application of SL communication is limited.
Disclosure of Invention
The embodiment of the application provides a video knowledge graph construction method and device based on SL communication, so that the video knowledge graph construction under a large data packet transmission scene is realized through SL communication.
In order to achieve the purpose, the technical scheme is as follows:
in a first aspect, an embodiment of the present application provides a video knowledge graph building method based on SL communication, where the method includes: a first terminal receives a first physical sidelink shared channel PSSCH from a second terminal, wherein the first PSSCH is carried on a first resource, and the first resource comprises the following items: the video knowledge graph tree display method comprises the steps that first spatial domain resources, M first frequency domain resources, N first time domain resources and M x N first bit domain resources are used for indicating a first video knowledge graph tree, wherein M and N are integers larger than 1; the first terminal determines the first space domain resources, the M first frequency domain resources, the N first time domain resources and the M x N first bit domain resources according to the first PSSCH; and the first terminal constructs the first video knowledge graph tree according to the first airspace resources, the M first frequency domain resources, the N first time domain resources and the M x N first bit domain resources.
Based on the method described in the first aspect, a large amount of data corresponding to the first video knowledge graph tree is dispersedly loaded in the first space domain resource, the M first frequency domain resources, the N first time domain resources, and the M × N first bit domain resources, so that the data amount loaded by each resource can be reduced, and the problem that SL communication exceeds the communication capability of the terminal due to the fact that the data amount loaded by a certain resource is too large is avoided, so that the video knowledge graph is constructed in a large data packet transmission scene through SL communication.
Optionally, the constructing, by the first terminal, the first video knowledge graph tree according to the first spatial domain resource, the M first frequency domain resources, the N first time domain resources, and the M × N first bit domain resources includes: the first terminal determines a source node of the first video knowledge-graph tree according to the first airspace resource; determining, by the first terminal, M × N root nodes of the first video knowledge graph tree according to M × N combinations of the M first frequency domain resources and the M first time domain resources, wherein the M × N root nodes are child nodes of the M × N source nodes; and the first terminal determines video knowledge data corresponding to each root node in the M x N root nodes according to the bearing relation of the M x N first bit domain resources and the M x N combinations in one-to-one correspondence, so that the first video knowledge graph tree is constructed in a dimensional and hierarchical manner.
Optionally, an ith first frequency domain resource of the M first frequency domain resources and a jth first frequency domain resource of the N first time domain resources form a resource block RBijSaid RBijIs a root node of the first video knowledge-graph treeijI is an integer of any value from 1 to N-1, and j is an integer of any value from 1 to M-1; the resource block RBijCarrying a first one of the first bit-field resourcesijThe first bit field resourceijIncluding the root nodeijCorresponding video knowledge data;
an i +1 th first frequency domain resource of the M first frequency domain resourcesA source forming an RB with a jth first frequency domain resource of the N first time domain resourcesi+1jSaid RB i+1jIs a root node of the first video knowledge-graph treei+1j(ii) a The RB i+1jCarrying a first one of the first bit-field resourcesi+1jThe first bit field resourcei+1jIncluding the root nodei+1jCorresponding video knowledge data; the root nodei+1jIs the root nodeijA leaf node of (1);
an RB is formed by the (i + 1) th first frequency domain resource in the M first frequency domain resources and the (j + 1) th first frequency domain resource in the N first time domain resourcesi+1jSaid RB i+1j+1Is a root node of the first video knowledge-graph treei+1j+1(ii) a The RB i+1jCarrying a first one of the first bit-field resourcesi+1j+1The first bit field resourcei+1j+1Including the root nodei+1j+1Corresponding video knowledge data; the root nodei+1j+1Is the root nodeijA leaf node of (1);
it can be seen that the hierarchical relationship of the root node, that is, the leaf nodes of the root and child nodes, can be further constructed by skillfully mapping the time-frequency position of the RB and the positions of the child nodes in the tree, so that the first video knowledge graph tree with a complex structure can be constructed, and the applicability of the first video knowledge graph tree in an actual scene can be improved.
Optionally, the ith first frequency domain resource includes m subcarriers, the jth first frequency domain resource includes n symbols, and m and n are integers greater than 1; the s sub-carrier of the m sub-carriers and the t symbol of the n symbols form the RBijOne sub RB in (1)stThe sub RBstIs the root nodeijVirtual node in (1)stThe sub RBstCarrying the first bit field resourceijFirst bit sub-field resource inijSaid first bit sub-field resourceijIncluding the virtual nodestCorresponding children of video knowledge dataClass data. In other words, by utilizing finer granularity of frequency domain resources, such as subcarriers, and time domain resources, such as symbols, the first video knowledge graph tree with a further complicated structure, i.e. the video knowledge graph tree including virtual nodes, can be constructed to improve the applicability of the first video knowledge graph tree in the actual scene.
Optionally, the method further comprises: the first terminal receives a second PSSCH from the second terminal, wherein the second PSSCH is carried on a second resource, and the second resource comprises the following items: a second spatial domain resource, X second frequency domain resources, Y second time domain resources, and X Y second bit domain resources, where the second spatial domain resource, the X second frequency domain resources, the Y second time domain resources, and the X Y second bit domain resources are used to indicate a second video knowledgegraph tree, and X and Y are integers greater than 1; the first terminal determines the second space domain resources, the X second frequency domain resources, the Y second time domain resources, and the X Y second bit domain resources according to the second psch; and the first terminal constructs the second video knowledge graph tree according to the second spatial domain resources, the X second frequency domain resources, the Y second time domain resources and the X X Y second bit domain resources.
Optionally, the constructing, by the first terminal, the second video knowledge-graph tree according to the second spatial domain resource, the second frequency domain resource, the second time domain resource, and the second bit domain resource, includes: the first terminal determines a source node of the second video knowledge-graph tree according to the second airspace resource; determining, by the first terminal, the X Y root nodes of the second video knowledge-graph tree according to X Y combinations of the X second frequency-domain resources and the Y second time-domain resources, wherein the X Y root nodes are child nodes of the source node; and the first terminal determines video knowledge data corresponding to each root node in the X, Y root nodes according to the bearing relation of the X, Y second bit domain resources and the X, Y combinations in one-to-one correspondence, so that the second video knowledge graph tree is constructed in a dimensional and hierarchical manner.
Optionally, the o-th one of the X second frequency domain resources and the p-th one of the Y second time domain resources constitute a resource block RBopSaid RBopIs a root node of the second video knowledge-graph treeopO is an integer of any value from 1 to X-1, p is an integer of any value from 1 to Y-1; the resource block RBopCarrying a second bit-field resource of the second bit-field resourcesopThe second bit field resourceopIncluding the root nodeopCorresponding video knowledge data;
the (o + 1) th one of the X second frequency domain resources and the (p) th one of the Y second time domain resources form an RBo+1pSaid RB o+1pIs a root node of the second video knowledge-graph treeo+1p(ii) a The RB o+1pCarrying a second bit-field resource of the second bit-field resourceso+1pThe second bit field resourceo+1pIncluding the root nodeo+1pCorresponding video knowledge data; the root nodeo+1pIs the root nodeopA leaf node of (1);
the (o + 1) th one of the X second frequency domain resources and the (p + 1) th one of the Y second time domain resources form an RBo+1pSaid RB o+1p+1Is a root node of the second video knowledge-graph treeo+1p+1(ii) a The RB o+1pCarrying a second bit-field resource of the second bit-field resourceso+1p+1The second bit field resourceo+1p+1Including the root nodeo+1p+1Corresponding video knowledge data; the root nodeo+1p+1Is the root nodeopThe leaf node of (1).
It can be seen that the hierarchical relationship of the root node, that is, the leaf nodes of the root and child nodes, can be further constructed by skillfully mapping the time-frequency position of the RB and the positions of the child nodes in the tree, so that the second video knowledge graph tree with a complex structure can be constructed, and the applicability of the second video knowledge graph tree in an actual scene can be improved.
Optionally, the o-th second frequency domain resource includes m subcarriers, the p-th second frequency domain resource includes n symbols, and m and n are integers greater than 1; the s sub-carrier of the m sub-carriers and the t symbol of the n symbols form the RBopOne sub RB in (1)stThe sub RBstIs the root nodeopVirtual node in (1)stThe sub RBstCarrying the second bit-field resourcesopSecond bit sub-field resource inopThe second bit sub-field resourceopIncluding the virtual nodestCorresponding sub-data of video knowledge data. In other words, by using finer granularity of frequency domain resources, such as subcarriers, and time domain resources, such as symbols, the second video knowledge graph tree with a further complicated structure, i.e. the video knowledge graph tree including virtual nodes, can be constructed to improve the applicability of the second video knowledge graph tree in the actual scene.
Optionally, if the first spatial resource is the same as the second spatial resource, the source node of the first video knowledge-graph tree is the same as the source node of the second video knowledge-graph tree, and the method further includes: and the first terminal fuses the first video knowledge graph tree and the second video knowledge graph tree by taking the source node as a root to obtain a third video knowledge graph tree, wherein all root nodes of the first video knowledge graph tree form a first branch in the third video knowledge graph tree, and all root nodes of the second video knowledge graph tree form a second branch in the third video knowledge graph tree. That is to say, the second terminal may transmit different data through the same spatial resource, that is, the same air interface, to implement the fusion of multiple video knowledge-graph trees. Therefore, the fusion of a plurality of video knowledge graph trees can be realized more conveniently.
In a second aspect, an embodiment of the present application provides a video knowledge graph building apparatus based on SL communication, where the apparatus includes: a transceiver module, configured to receive a first uplink physical shared channel psch from a second terminal, where the first psch is carried on a first resource, and the first resource includes: a first spatial domain resource, a first frequency domain resource, a first time domain resource, and a first bit domain resource, the first spatial domain resource, the first frequency domain resource, the first time domain resource, and the first bit domain resource being used to indicate a first video knowledge-graph tree; a processing module, configured to determine the first spatial domain resource, the first frequency domain resource, the first time domain resource, and the first bit domain resource according to the first PSSCH; and constructing the first video knowledge-graph tree according to the first spatial domain resource, the first frequency domain resource, the first time domain resource and the first bit domain resource.
Optionally, the processing module is further configured to determine a source node of the first video knowledge-graph tree according to the first spatial domain resource; determining M x N root nodes of the first video knowledge-graph tree from M x N combinations of the M first frequency-domain resources and the M first time-domain resources, wherein the M x N root nodes are child nodes of the M x N source nodes; and determining video knowledge data corresponding to each root node in the M x N root nodes according to the bearing relationship of the M x N first bit domain resources and the M x N combinations in one-to-one correspondence.
Optionally, an ith first frequency domain resource of the M first frequency domain resources and a jth first frequency domain resource of the N first time domain resources form a resource block RBijSaid RBijIs a root node of the first video knowledge-graph treeijI is an integer of any value from 1 to N-1, and j is an integer of any value from 1 to M-1; the resource block RBijCarrying a first one of the first bit-field resourcesijThe first bit field resourceijIncluding the root nodeijCorresponding video knowledge data;
an RB is formed by the (i + 1) th first frequency domain resource in the M first frequency domain resources and the jth first frequency domain resource in the N first time domain resourcesi+1jSaid RB i+1jIs a root node of the first video knowledge-graph treei+1j(ii) a What is needed isRB as described above i+1jCarrying a first one of the first bit-field resourcesi+1jThe first bit field resourcei+1jIncluding the root nodei+1jCorresponding video knowledge data; the root nodei+1jIs the root nodeijA leaf node of (1);
an RB is formed by the (i + 1) th first frequency domain resource in the M first frequency domain resources and the (j + 1) th first frequency domain resource in the N first time domain resourcesi+1jSaid RB i+1j+1Is a root node of the first video knowledge-graph treei+1j+1(ii) a The RB i+1jCarrying a first one of the first bit-field resourcesi+1j+1The first bit field resourcei+1j+1Including the root nodei+1j+1Corresponding video knowledge data; the root nodei+1j+1Is the root nodeijA leaf node of (1);
optionally, the ith first frequency domain resource includes m subcarriers, the jth first frequency domain resource includes n symbols, and m and n are integers greater than 1; the s sub-carrier of the m sub-carriers and the t symbol of the n symbols form the RBijOne sub RB in (1)stThe sub RBstIs the root nodeijVirtual node in (1)stThe sub RBstCarrying the first bit field resourceijFirst bit sub-field resource inijSaid first bit sub-field resourceijIncluding the virtual nodestCorresponding sub-data of video knowledge data.
Optionally, the transceiver module is further configured to receive a second psch from the second terminal, where the second psch is carried on a second resource, and the second resource includes multiple items of: a second spatial domain resource, X second frequency domain resources, Y second time domain resources, and X Y second bit domain resources, where the second spatial domain resource, the X second frequency domain resources, the Y second time domain resources, and the X Y second bit domain resources are used to indicate a second video knowledgegraph tree, and X and Y are integers greater than 1; the processing module is further configured to determine the second spatial domain resources, the X second frequency domain resources, the Y second time domain resources, and the X Y second bit domain resources according to the second PSSCH; and constructing the second video knowledge graph tree according to the second spatial domain resources, the X second frequency domain resources, the Y second time domain resources and the X Y second bit domain resources.
Optionally, the processing module is further configured to determine, by the first terminal, a source node of the second video knowledge-graph tree according to the second spatial domain resource; determining the X Y root nodes of the second video knowledge-graph tree from X Y combinations of the X second frequency-domain resources and the Y second time-domain resources, wherein the X Y root nodes are child nodes of the source node; and determining video knowledge data corresponding to each root node in the X, Y root nodes according to the one-to-one bearing relation between the X, Y second bit domain resources and the X, Y combinations, thereby realizing the construction of a second video knowledge graph tree with dimensionality and hierarchy.
Optionally, the o-th one of the X second frequency domain resources and the p-th one of the Y second time domain resources constitute a resource block RBopSaid RBopIs a root node of the second video knowledge-graph treeopO is an integer of any value from 1 to X-1, p is an integer of any value from 1 to Y-1; the resource block RBopCarrying a second bit-field resource of the second bit-field resourcesopThe second bit field resourceopIncluding the root nodeopCorresponding video knowledge data;
the (o + 1) th one of the X second frequency domain resources and the (p) th one of the Y second time domain resources form an RBo+1pSaid RB o+1pIs a root node of the second video knowledge-graph treeo+1p(ii) a The RB o+1pCarrying a second bit-field resource of the second bit-field resourceso+1pThe second bit field resourceo+1pIncluding the root nodeo+1pCorresponding video learning numberAccordingly; the root nodeo+1pIs the root nodeopA leaf node of (1);
the (o + 1) th one of the X second frequency domain resources and the (p + 1) th one of the Y second time domain resources form an RBo+1pSaid RB o+1p+1Is a root node of the second video knowledge-graph treeo+1p+1(ii) a The RB o+1pCarrying a second bit-field resource of the second bit-field resourceso+1p+1The second bit field resourceo+1p+1Including the root nodeo+1p+1Corresponding video knowledge data; the root nodeo+1p+1Is the root nodeopThe leaf node of (1).
Optionally, the o-th second frequency domain resource includes m subcarriers, the p-th second frequency domain resource includes n symbols, and m and n are integers greater than 1; the s sub-carrier of the m sub-carriers and the t symbol of the n symbols form the RBopOne sub RB in (1)stThe sub RBstIs the root nodeopVirtual node in (1)stThe sub RBstCarrying the second bit-field resourcesopSecond bit sub-field resource inopThe second bit sub-field resourceopIncluding the virtual nodestCorresponding sub-data of video knowledge data. In other words, by using finer granularity of frequency domain resources, such as subcarriers, and time domain resources, such as symbols, the second video knowledge graph tree with a further complicated structure, i.e. the video knowledge graph tree including virtual nodes, can be constructed to improve the applicability of the second video knowledge graph tree in the actual scene.
Optionally, if the first airspace resource is the same as the second airspace resource, the source node of the first video knowledge graph tree is the same as the source node of the second video knowledge graph tree, and the processing module is further configured to fuse the first video knowledge graph tree with the second video knowledge graph tree by using the source node as a root to obtain a third video knowledge graph tree, where all root nodes of the first video knowledge graph tree constitute a first branch in the third video knowledge graph tree, and all root nodes of the second video knowledge graph tree constitute a second branch in the third video knowledge graph tree.
In a third aspect, an embodiment of the present application provides a computer-readable storage medium, on which a program code is stored, and when the program code is executed by the computer, the method according to the first aspect is performed.
Drawings
Fig. 1 is a first schematic architecture diagram of a communication system according to an embodiment of the present application;
fig. 2 is a flowchart of a video knowledge graph construction method based on SL communication according to an embodiment of the present disclosure;
fig. 3 is a schematic structural diagram of a video knowledge graph constructing apparatus based on SL communication according to an embodiment of the present disclosure;
fig. 4 is a schematic structural diagram of a video knowledge graph constructing apparatus based on SL communication according to an embodiment of the present application.
Detailed Description
The technical solution in the present application will be described below with reference to the accompanying drawings.
Referring to fig. 1, an embodiment of the present application provides a communication system, which may include: and the terminal equipment, such as the second terminal equipment and the second terminal equipment.
The terminal device may be an access terminal, a subscriber unit, a subscriber station, a mobile station, a remote terminal, a mobile device, a user terminal, a wireless communication device, a user agent, a mobile phone, a tablet (Pad), a computer with wireless transceiving function, a virtual reality terminal device, an augmented reality terminal device, etc.
Optionally, the communication system may further include: a network device.
The network device may be a device located on the network side of the communication system and having a transceiving function, or a chip system provided in the device. The network devices include, but are not limited to: an Access Point (AP) in a wireless fidelity (WiFi) system, such as a home gateway, a router, a server, a switch, a bridge, etc., an evolved Node B (eNB), a Radio Network Controller (RNC), a Node B (NB), a Base Station Controller (BSC), a Base Transceiver Station (BTS), a home base station (e.g., home evolved Node B, or home Node B, HNB), a Base Band Unit (BBU), a wireless relay Node, a wireless backhaul Node, a transmission point (transmission and reception point, TRP or transmission point, etc.), and may be 5G, such as a new radio interface (NR) system, a TP, a Transmission Point (TP), a group of antennas including one or more antenna panels (antenna panels) in the system, alternatively, the network node may also be a network node forming a gNB or a transmission point, such as a baseband unit (BBU), or a Distributed Unit (DU), a roadside unit (RSU) having a base station function, or the like.
The second terminal device and the flow of the second terminal device will be described in detail below with reference to the method.
Referring to fig. 2, an embodiment of the present application provides a clustered neural network determining method. The method may be applied to terminal devices, such as the second terminal device and the second terminal device, in the communication system shown in fig. 1. The method comprises the following steps:
the first terminal receives a first physical sidelink shared channel pscch from a second terminal S201.
The first PSSCH is loaded on a first resource, and the first resource comprises the following items: the video knowledge graph tree comprises first spatial domain resources, M first frequency domain resources, N first time domain resources and M x N first bit domain resources, wherein the first spatial domain resources, the M first frequency domain resources, the N first time domain resources and the M x N first bit domain resources are used for indicating the first video knowledge graph tree, and M and N are integers larger than 1.
S202, the first terminal determines, according to the first PSSCH, first spatial domain resources, M first frequency domain resources, N first time domain resources, and M × N first bit domain resources.
The first terminal may determine, by analyzing the first PSSCH, a first resource carrying the first PSSCH, thereby determining a first space domain resource, M first frequency domain resources, N first time domain resources, and M × N first bit domain resources.
S203, the first terminal constructs a first video knowledge graph tree according to the first space domain resources, the M first frequency domain resources, the N first time domain resources and the M × N first bit domain resources.
The first terminal can determine a source node of the first video knowledge graph tree according to the first airspace resource, so that M x N root nodes of the first video knowledge graph tree are determined according to M x N combinations of M first frequency domain resources and M first time domain resources, and then video knowledge data corresponding to each root node in the M x N root nodes are determined according to the one-to-one bearing relation between the M x N first bit domain resources and the M x N combinations, and therefore the first video knowledge graph tree is established in a dimensional and hierarchical mode. Wherein the M × N root nodes may be child nodes of the M × N source nodes.
Specifically, the ith first frequency domain resource of the M first frequency domain resources and the jth first frequency domain resource of the N first time domain resources form a resource block RBij，RBijAs a root node of a first video knowledge-graph treeijI is an integer of any value from 1 to N-1, and j is an integer of any value from 1 to M-1; resource block RBijCarrying first bit-field resources of first bit-field resourcesijFirst bit field resourceijIncluding a root nodeijCorresponding video knowledge data. The (i + 1) th first frequency domain resource of the M first frequency domain resources and the jth first frequency domain resource of the N first frequency domain resources form an RBi+1j，RB i+1jAs a root node of a first video knowledge-graph treei+1j；RB i+1jCarrying first bit-field resources of first bit-field resourcesi+1jFirst bit field resourcei+1jIncluding a root nodei+1jCorresponding video knowledge data; root nodei+1jIs a root nodeijLeaf node ofAnd (4) point. The (i + 1) th first frequency domain resource of the M first frequency domain resources and the (j + 1) th first frequency domain resource of the N first frequency domain resources form an RBi+1j，RB i+1j+1As a root node of a first video knowledge-graph treei+1j+1；RB i+1jCarrying first bit-field resources of first bit-field resourcesi+1j+1First bit field resourcei+1j+1Including a root nodei+1j+1Corresponding video knowledge data; root nodei+1j+1Is a root nodeijA leaf node of (1);
it can be seen that the hierarchical relationship of the root node, that is, the leaf nodes of the root and child nodes, can be further constructed by skillfully mapping the time-frequency position of the RB and the positions of the child nodes in the tree, so that the first video knowledge graph tree with a complex structure can be constructed, and the applicability of the first video knowledge graph tree in an actual scene can be improved.
For example, the first spatial domain resource is NR1, and the M first frequency domain resources include: first frequency domain resources 1 and first frequency domain resources 2, the N first time domain resources comprising: first time domain resource 1 and first time domain resource 2, the first video knowledge-graph tree may then comprise: source node 1 → root node 11 → root node 21, and source node 1 → root node 21 → root node 22.
Alternatively, the ith first frequency domain resource may include m subcarriers, the jth first frequency domain resource may include n symbols, and m and n are integers greater than 1. Thus, the s-th subcarrier of the m subcarriers and the t-th symbol of the n symbols constitute an RBijOne sub RB in (1)stRadical B of ZistIs a root nodeijVirtual node in (1)stRadical B of ZistCarrying first bit field resourcesijFirst bit sub-field resource inijFirst bit sub-field resourceijIncluding virtual nodesstCorresponding sub-data of video knowledge data. In other words, by utilizing finer granularity of frequency domain resources, such as subcarriers, and time domain resources, such as symbols, the first video knowledge graph tree with a further complicated structure, i.e., the video knowledge graph tree including virtual nodes, can be constructed to improve the first video knowledge graphApplicability of spectral trees in real scenes.
As another example, the first frequency domain resource 1 includes: subcarrier 1 and subcarrier 2, the first time domain resource 1 includes: symbol 1 and symbol 2, then the source node 1 → root node 11 may include: source node 1 → virtual node 11 → virtual node 21, and source node 1 → virtual node 21 → virtual node 22.
With reference to the foregoing S201-S203, in some application scenarios, the method may further include:
step 1, a first terminal receives a second PSSCH from a second terminal, wherein the second PSSCH is carried on a second resource, and the second resource comprises the following items: the second spatial domain resources, the X second frequency domain resources, the Y second time domain resources, and the X Y second bit domain resources are used to indicate the second video knowledge graph tree, and X and Y are integers greater than 1.
And step 2, the first terminal determines second space domain resources, X second frequency domain resources, Y second time domain resources and X Y second bit domain resources according to the second PSSCH.
And 3, the first terminal constructs a second video knowledge graph tree according to the second space domain resources, the X second frequency domain resources, the Y second time domain resources and the X Y second bit domain resources.
The first terminal can determine a source node of the second video knowledge graph tree according to the second space domain resources, so that X × Y root nodes of the second video knowledge graph tree are determined according to X × Y combinations of X second frequency domain resources and Y second time domain resources, and then video knowledge data corresponding to each root node in the X × Y root nodes are determined according to a one-to-one bearing relation between the X × Y second bit domain resources and the X × Y combinations, so that the second video knowledge graph tree is constructed in a dimensional and hierarchical manner. Wherein, X Y root nodes are child nodes of the source node.
Specifically, the o-th one of the X second frequency domain resources and the p-th one of the Y second time domain resources constitute one resource block RBop，RBopAs root node of the second video knowledge-graph treeopO is an integer of any value from 1 to X-1, p is an integer of any value from 1 to Y-1; resource block RBopCarrying second bit field resources of second bit field resourcesopSecond bit field resourceopIncluding a root nodeopCorresponding video knowledge data. The (o + 1) th one of the X second frequency domain resources and the (p) th one of the Y second time domain resources form an RBo+1p，RB o+1pAs root node of the second video knowledge-graph treeo+1p；RB o+1pCarrying second bit field resources of second bit field resourceso+1pSecond bit field resourceo+1pIncluding a root nodeo+1pCorresponding video knowledge data; root nodeo+1pIs a root nodeopThe leaf node of (1). The (o + 1) th second frequency domain resource of the X second frequency domain resources and the (p + 1) th second frequency domain resource of the Y second time domain resources form an RBo+1p，RB o+1p+1As root node of the second video knowledge-graph treeo+1p+1；RB o+1pCarrying second bit field resources of second bit field resourceso+1p+1Second bit field resourceo+1p+1Including a root nodeo+1p+1Corresponding video knowledge data; root nodeo+1p+1Is a root nodeopThe leaf node of (1).
It can be seen that the hierarchical relationship of the root node, that is, the leaf nodes of the root and child nodes, can be further constructed by skillfully mapping the time-frequency position of the RB and the positions of the child nodes in the tree, so that the second video knowledge graph tree with a complex structure can be constructed, and the applicability of the second video knowledge graph tree in an actual scene can be improved.
For another example, the second spatial domain resource is NR1, and the X second frequency domain resources include: second frequency domain resources 3 and second frequency domain resources 4, the Y second time domain resources comprising: second time domain resource 3 and second time domain resource 4, the second video knowledge-graph tree may then include: source node 1 → root node 33 → root node 34, and source node 1 → root node 43 → root node 44.
Optionally, the ith second frequency domain resource includes m subcarriers, the pth second frequency domain resource includes n symbols, and m and n are integers greater than 1; the s sub-carrier of the m sub-carriers and the t symbol of the n symbols form an RBopOne sub RB in (1)stRadical B of ZistIs a root nodeopVirtual node in (1)stRadical B of ZistCarrying second bit field resourcesopSecond bit sub-field resource inopSecond bit sub-field resourceopIncluding virtual nodesstCorresponding sub-data of video knowledge data. In other words, by using finer granularity of frequency domain resources, such as subcarriers, and time domain resources, such as symbols, the second video knowledge graph tree with a further complicated structure, i.e. the video knowledge graph tree including virtual nodes, can be constructed to improve the applicability of the second video knowledge graph tree in the actual scene.
Also for example, the second frequency domain resources 3 include: subcarrier 3 and subcarrier 4, the first time domain resource 3 includes: symbol 3 and symbol 4, then the source node 1 → root node 33 may include: source node 1 → virtual node 33 → virtual node 43, and source node 1 → virtual node 43 → virtual node 44.
Optionally, if the first spatial resource is the same as the second spatial resource, the source node of the first video knowledge-graph tree is the same as the source node of the second video knowledge-graph tree, and the method further includes: the first terminal takes the source node as a root and fuses the first video knowledge graph tree and the second video knowledge graph tree to obtain a third video knowledge graph tree, wherein all root nodes of the first video knowledge graph tree form first branches in the third video knowledge graph tree, and all root nodes of the second video knowledge graph tree form second branches in the third video knowledge graph tree. That is to say, the second terminal may transmit different data through the same spatial resource, that is, the same air interface, to implement the fusion of multiple video knowledge-graph trees. Therefore, the fusion of a plurality of video knowledge graph trees can be realized more conveniently.
In summary, a large amount of data corresponding to the first video knowledge graph tree is dispersedly loaded in the first spatial domain resource, the M first frequency domain resources, the N first time domain resources, and the M × N first bit domain resources, so that the data amount loaded by each resource can be reduced, and the SL communication is prevented from exceeding the communication capability of the terminal due to the fact that the data amount loaded by a certain resource is too large, so that the video knowledge graph is constructed in a large data packet transmission scene through the SL communication.
Referring to fig. 3, the present embodiment further provides a video knowledge graph constructing apparatus 300 based on SL communication, where the apparatus 300 includes:
a transceiver module 301, configured to receive a first uplink physical shared channel psch from a second terminal, where the first psch is carried on a first resource, and the first resource includes multiple items: the video knowledge graph tree comprises a first spatial domain resource, a first frequency domain resource, a first time domain resource and a first bit domain resource, wherein the first spatial domain resource, the first frequency domain resource, the first time domain resource and the first bit domain resource are used for indicating a first video knowledge graph tree;
a processing module 302, configured to determine a first spatial domain resource, a first frequency domain resource, a first time domain resource, and a first bit domain resource according to the first PSSCH; and constructing a first video knowledge graph tree according to the first spatial domain resource, the first frequency domain resource, the first time domain resource and the first bit domain resource.
Optionally, the processing module 302 is further configured to determine a source node of the first video knowledge-graph tree according to the first spatial domain resource; determining M X N root nodes of the first video knowledge graph tree according to M X N combinations of the M first frequency domain resources and the M first time domain resources, wherein the M X N root nodes are child nodes of the M X N source nodes; and determining video knowledge data corresponding to each root node in the M x N root nodes according to the bearing relation of the M x N first bit domain resources and the M x N combinations in one-to-one correspondence.
Optionally, the ith first frequency domain resource of the M first frequency domain resources and the jth first frequency domain resource of the N first time domain resources form a resource block RBij，RBijAs a root node of a first video knowledge-graph treeijI is an integer of any value from 1 to N-1, and j is an integer of any value from 1 to M-1; resource block RBijCarrying first bit field resourcesFirst bit field resource inijFirst bit field resourceijIncluding a root nodeijCorresponding video knowledge data;
the (i + 1) th first frequency domain resource of the M first frequency domain resources and the jth first frequency domain resource of the N first frequency domain resources form an RBi+1j，RB i+1jAs a root node of a first video knowledge-graph treei+1j；RB i+1jCarrying first bit-field resources of first bit-field resourcesi+1jFirst bit field resourcei+1jIncluding a root nodei+1jCorresponding video knowledge data; root nodei+1jIs a root nodeijA leaf node of (1);
the (i + 1) th first frequency domain resource of the M first frequency domain resources and the (j + 1) th first frequency domain resource of the N first frequency domain resources form an RBi+1j，RB i+1j+1As a root node of a first video knowledge-graph treei+1j+1；RB i+1jCarrying first bit-field resources of first bit-field resourcesi+1j+1First bit field resourcei+1j+1Including a root nodei+1j+1Corresponding video knowledge data; root nodei+1j+1Is a root nodeijA leaf node of (1);
optionally, the ith first frequency domain resource includes m subcarriers, the jth first frequency domain resource includes n symbols, and m and n are integers greater than 1; the s sub-carrier of the m sub-carriers and the t symbol of the n symbols form an RBijOne sub RB in (1)stRadical B of ZistIs a root nodeijVirtual node in (1)stRadical B of ZistCarrying first bit field resourcesijFirst bit sub-field resource inijFirst bit sub-field resourceijIncluding virtual nodesstCorresponding sub-data of video knowledge data.
Optionally, the transceiver module 301 is further configured to receive a second psch from a second terminal, where the second psch is carried on a second resource, and the second resource includes multiple items of: the second spatial domain resources, the X second frequency domain resources, the Y second time domain resources, and the X Y second bit domain resources are used to indicate a second video knowledge graph tree, and X and Y are integers greater than 1; the processing module 302 is further configured to determine, according to the second psch, a second spatial domain resource, X second frequency domain resources, Y second time domain resources, and X × Y second bit domain resources; and constructing a second video knowledge graph tree according to the second space domain resources, the X second frequency domain resources, the Y second time domain resources and the X Y second bit domain resources.
Optionally, the processing module 302 is further configured to determine a source node of a second video knowledge-graph tree according to the second spatial domain resource; determining X Y root nodes of the second video knowledge graph tree according to X Y combinations of the X second frequency domain resources and the Y second time domain resources, wherein the X Y root nodes are child nodes of the source node; and determining video knowledge data corresponding to each root node in the X, Y root nodes according to the one-to-one bearing relation between the X, Y second bit domain resources and the X, Y combinations, thereby realizing the construction of a second video knowledge graph tree with dimensionality and hierarchy.
Optionally, the o-th one of the X second frequency domain resources and the p-th one of the Y second time domain resources constitute a resource block RBop，RBopAs root node of the second video knowledge-graph treeopO is an integer of any value from 1 to X-1, p is an integer of any value from 1 to Y-1; resource block RBopCarrying second bit field resources of second bit field resourcesopSecond bit field resourceopIncluding a root nodeopCorresponding video knowledge data;
the (o + 1) th one of the X second frequency domain resources and the (p) th one of the Y second time domain resources form an RBo+1p，RB o+1pAs root node of the second video knowledge-graph treeo+1p；RB o+1pCarrying second bit field resources of second bit field resourceso+1pSecond bit field resourceo+1pIncluding a root nodeo+1pCorresponding video knowledge data; root nodeo+1pIs a root nodeopLeaf node ofPoint;
the (o + 1) th second frequency domain resource of the X second frequency domain resources and the (p + 1) th second frequency domain resource of the Y second time domain resources form an RBo+1p，RB o+1p+1As root node of the second video knowledge-graph treeo+1p+1；RB o+1pCarrying second bit field resources of second bit field resourceso+1p+1Second bit field resourceo+1p+1Including a root nodeo+1p+1Corresponding video knowledge data; root nodeo+1p+1Is a root nodeopThe leaf node of (1).
Optionally, the ith second frequency domain resource includes m subcarriers, the pth second frequency domain resource includes n symbols, and m and n are integers greater than 1; the s sub-carrier of the m sub-carriers and the t symbol of the n symbols form an RBopOne sub RB in (1)stRadical B of ZistIs a root nodeopVirtual node in (1)stRadical B of ZistCarrying second bit field resourcesopSecond bit sub-field resource inopSecond bit sub-field resourceopIncluding virtual nodesstCorresponding sub-data of video knowledge data. In other words, by using finer granularity of frequency domain resources, such as subcarriers, and time domain resources, such as symbols, the second video knowledge graph tree with a further complicated structure, i.e. the video knowledge graph tree including virtual nodes, can be constructed to improve the applicability of the second video knowledge graph tree in the actual scene.
Optionally, if the first spatial domain resource is the same as the second spatial domain resource, the source nodes of the first video knowledge graph tree are the same as the source nodes of the second video knowledge graph tree, and the processing module 302 is further configured to fuse the first video knowledge graph tree and the second video knowledge graph tree by taking the source nodes as the roots to obtain a third video knowledge graph tree, where all root nodes of the first video knowledge graph tree form first branches in the third video knowledge graph tree, and all root nodes of the second video knowledge graph tree form second branches in the third video knowledge graph tree.
The following describes the components of the video knowledge-graph constructing apparatus 400 based on SL communication with reference to fig. 4:
the processor 401 is a control center of the video knowledge graph building apparatus 400 based on SL communication, and may be a single processor or a collective term for a plurality of processing elements. For example, the processor 401 is one or more Central Processing Units (CPUs), or may be an Application Specific Integrated Circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of the present application, such as: one or more microprocessors (digital signal processors, DSPs), or one or more Field Programmable Gate Arrays (FPGAs).
Alternatively, processor 401 may perform various functions of SL communication based video knowledge map construction apparatus 400 by running or executing software programs stored in memory 402 and invoking data stored in memory 402.
In particular implementations, processor 401 may include one or more CPUs such as CPU0 and CPU1 shown in fig. 4 as an example.
In a specific implementation, the video knowledge graph building apparatus 400 based on SL communication may also include a plurality of processors, such as the processor 401 and the processor 404 shown in fig. 4, as an embodiment. Each of these processors may be a single-Core Processor (CPU) or a multi-Core Processor (CPU). A processor herein may refer to one or more devices, circuits, and/or processing cores for processing data (e.g., computer program instructions).
The memory 402 is configured to store a software program for executing the scheme of the present application, and is controlled by the processor 401 to execute the software program.
Alternatively, memory 402 may be a read-only memory (ROM) or other type of static storage device that may store static information and instructions, a Random Access Memory (RAM) or other type of dynamic storage device that may store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compact disc, laser disc, optical disc, digital versatile disc, Blu-ray disc, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory 402 may be integrated with the processor 401, or may be independent, and is coupled to the processor 401 through an interface circuit (not shown in fig. 4) of the video knowledge map building apparatus 400 based on SL communication, which is not specifically limited in this embodiment of the present application.
A transceiver 403 for communication with other devices. For example, the video knowledge graph building apparatus 400 based on SL communication is a network device, and the transceiver 403 may be used to communicate with a terminal device or communicate with another network device.
Optionally, the transceiver 403 may include a receiver and a transmitter (not separately shown in fig. 4). Wherein the receiver is configured to implement a receive function and the transmitter is configured to implement a transmit function.
Alternatively, the transceiver 403 may be integrated with the processor 401, or may exist independently, and is coupled to the processor 401 through an interface circuit (not shown in fig. 4) of the video knowledge map building apparatus 400 based on SL communication, which is not specifically limited in this embodiment of the present application.
It should be noted that the structure of the apparatus 400 shown in fig. 4 does not constitute a limitation of the communication apparatus, and an actual communication apparatus may include more or less components than those shown, or combine some components, or arrange different components.
In addition, the technical effects of the method of the above method embodiment can be referred to for the technical effects of the apparatus 400, and are not described herein again.
It should be understood that the processor in the embodiments of the present application may be a Central Processing Unit (CPU), and the processor may also be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
It will also be appreciated that the memory in the embodiments of the subject application can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. The non-volatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an electrically Erasable EPROM (EEPROM), or a flash memory. Volatile memory can be Random Access Memory (RAM), which acts as external cache memory. By way of example, but not limitation, many forms of Random Access Memory (RAM) are available, such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), Enhanced SDRAM (ESDRAM), synchlink DRAM (SLDRAM), and direct bus RAM (DR RAM).
The above embodiments may be implemented in whole or in part by software, hardware (e.g., circuitry), firmware, or any combination thereof. When implemented in software, the above-described embodiments may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions or computer programs. The procedures or functions according to the embodiments of the present application are generated in whole or in part when a computer instruction or a computer program is loaded or executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains one or more collections of available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium. The semiconductor medium may be a solid state disk.
It should be understood that the term "and/or" herein is merely one type of association relationship that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone, wherein A and B can be singular or plural. In addition, the "/" in this document generally indicates that the former and latter associated objects are in an "or" relationship, but may also indicate an "and/or" relationship, which may be understood with particular reference to the former and latter text.
In the present application, "at least one" means one or more, "a plurality" means two or more. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of the singular or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, a-b, a-c, b-c, or a-b-c, wherein a, b, c may be single or multiple.
It should be understood that, in the various embodiments of the present application, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a unit is merely a logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some feature fields may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
Units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (10)

1. A video knowledge graph construction method based on SL communication is characterized by comprising the following steps:
a first terminal receives a first physical sidelink shared channel PSSCH from a second terminal, wherein the first PSSCH is carried on a first resource, and the first resource comprises the following items: the video knowledge graph tree display method comprises the steps that first spatial domain resources, M first frequency domain resources, N first time domain resources and M x N first bit domain resources are used for indicating a first video knowledge graph tree, wherein M and N are integers larger than 1;
the first terminal determines the first space domain resources, the M first frequency domain resources, the N first time domain resources and the M x N first bit domain resources according to the first PSSCH;
and the first terminal constructs the first video knowledge graph tree according to the first airspace resources, the M first frequency domain resources, the N first time domain resources and the M x N first bit domain resources.
2. A SL communication-based video knowledgegraph building method according to claim 1, wherein said first terminal builds said first video knowledgegraph tree from said first spatial domain resources, said M first frequency domain resources, N first time domain resources, and M x N first bit domain resources, comprising:
the first terminal determines a source node of the first video knowledge-graph tree according to the first airspace resource;
determining, by the first terminal, M × N root nodes of the first video knowledge graph tree according to M × N combinations of the M first frequency domain resources and the M first time domain resources, wherein the M × N root nodes are child nodes of the M × N source nodes;
and the first terminal determines video knowledge data corresponding to each root node in the M x N root nodes according to the bearing relation of the M x N first bit domain resources and the M x N combinations in one-to-one correspondence.
3. A SL communication based video knowledge graph construction method according to claim 2,
the ith first frequency domain resource of the M first frequency domain resources and the jth first frequency domain resource of the N first time domain resources form a resource block RBijSaid RBijIs a root node of the first video knowledge-graph treeijI is an integer of any value from 1 to N-1, and j is an integer of any value from 1 to M-1; the resource block RBijCarrying a first one of the first bit-field resourcesijThe first bit field resourceijIncluding the root nodeijCorresponding video knowledge data;
an RB is formed by the (i + 1) th first frequency domain resource in the M first frequency domain resources and the jth first frequency domain resource in the N first time domain resourcesi+1jSaid RB i+1jIs a root node of the first video knowledge-graph treei+1j(ii) a The RB i+1jCarrying a first one of the first bit-field resourcesi+1jThe first bit field resourcei+1jIncluding the root nodei+1jCorresponding video knowledge data; the root nodei+1jIs the root nodeijA leaf node of (1);
an RB is formed by the (i + 1) th first frequency domain resource in the M first frequency domain resources and the (j + 1) th first frequency domain resource in the N first time domain resourcesi+1jSaid RB i+1j+1Is a root node of the first video knowledge-graph treei+1j+1(ii) a The RB i+1jCarrying a first one of the first bit-field resourcesi+1j+1The first bit field resourcei+1j+1Including the root nodei+1j+1Corresponding video knowledge data; the root nodei+1j+1Is the root nodeijThe leaf node of (1).
4. A SL communication based video knowledge graph construction method according to claim 3,
the ith first frequency domain resource comprises m subcarriers, the jth first frequency domain resource comprises n symbols, and m and n are integers greater than 1; the s sub-carrier of the m sub-carriers and the t symbol of the n symbols form the RBijOne sub RB in (1)stThe sub RBstIs the root nodeijVirtual node in (1)stThe sub RBstCarrying the first bit field resourceijFirst bit sub-field resource inijSaid first bit sub-field resourceijIncluding the virtual nodestCorresponding sub-data of video knowledge data.
5. A SL communication-based video knowledge graph construction method according to claim 1, wherein said method further comprises:
the first terminal receives a second PSSCH from the second terminal, wherein the second PSSCH is carried on a second resource, and the second resource comprises the following items: a second spatial domain resource, X second frequency domain resources, Y second time domain resources, and X Y second bit domain resources, where the second spatial domain resource, the X second frequency domain resources, the Y second time domain resources, and the X Y second bit domain resources are used to indicate a second video knowledgegraph tree, and X and Y are integers greater than 1;
the first terminal determines the second space domain resources, the X second frequency domain resources, the Y second time domain resources, and the X Y second bit domain resources according to the second psch;
and the first terminal constructs the second video knowledge graph tree according to the second spatial domain resources, the X second frequency domain resources, the Y second time domain resources and the X X Y second bit domain resources.
6. A SL communication based video knowledgegraph building method according to claim 5, wherein said first terminal builds said second video knowledgegraph tree according to said second spatial domain resource, said second frequency domain resource, said second time domain resource and said second bit domain resource, comprising:
the first terminal determines a source node of the second video knowledge-graph tree according to the second airspace resource;
determining, by the first terminal, the X Y root nodes of the second video knowledge-graph tree according to X Y combinations of the X second frequency-domain resources and the Y second time-domain resources, wherein the X Y root nodes are child nodes of the source node;
and the first terminal determines video knowledge data corresponding to each root node in the X, Y root nodes according to the bearing relationship of the X, Y second bit domain resources and the X, Y combinations in one-to-one correspondence.
7. A SL communication based video knowledge graph construction method according to claim 6,
the o-th one of the X second frequency domain resources and the p-th one of the Y second time domain resources form a resource block RBopSaid RBopIs a root node of the second video knowledge-graph treeopO is an integer of any value from 1 to X-1, p is an integer of any value from 1 to Y-1; the resource block RBopCarrying a second bit-field resource of the second bit-field resourcesopThe second bit field resourceopIncluding the root nodeopCorresponding video knowledge data;
the (o + 1) th one of the X second frequency domain resources and the (p) th one of the Y second time domain resources form an RBo+1pSaid RB o+1pIs a root node of the second video knowledge-graph treeo+1p(ii) a The RB o+1pCarrying a second bit-field resource of the second bit-field resourceso+1pThe second bit field resourceo+1pIncluding the root nodeo+1pCorresponding video knowledge data; the root nodeo+1pIs the root nodeopA leaf node of (1);
the (o + 1) th one of the X second frequency domain resources and the (p + 1) th one of the Y second time domain resources form an RBo+1pSaid RB o+1p+1Is a root node of the second video knowledge-graph treeo+1p+1(ii) a The RB o+1pCarrying a second bit-field resource of the second bit-field resourceso+1p+1The second bit field resourceo+1p+1Including the root nodeo+1p+1Corresponding video knowledge data; the root nodeo+1p+1Is the root nodeopThe leaf node of (1).
8. A SL communication based video knowledge graph construction method according to claim 7,
the ith second frequency domain resource comprises m subcarriers, the pth second frequency domain resource comprises n symbols, and m and n are integers greater than 1; the s sub-carrier of the m sub-carriers and the t symbol of the n symbols form the RBopOne sub RB in (1)stThe sub RBstIs the root nodeopVirtual node in (1)stThe sub RBstCarrying the second bit-field resourcesopSecond bit sub-field resource inopThe second bit sub-field resourceopIncluding the virtual nodestCorresponding sub-data of video knowledge data.
9. A SL communication based video knowledge-graph building method according to claim 5, wherein if said first spatial domain resource is the same as said second spatial domain resource, then said first video knowledge-graph tree is the same as a source node of said second video knowledge-graph tree, said method further comprising:
and the first terminal fuses the first video knowledge graph tree and the second video knowledge graph tree by taking the source node as a root to obtain a third video knowledge graph tree, wherein all root nodes of the first video knowledge graph tree form a first branch in the third video knowledge graph tree, and all root nodes of the second video knowledge graph tree form a second branch in the third video knowledge graph tree.
10. An apparatus for constructing video knowledge graph based on SL communication, the apparatus comprising:
a transceiver module, configured to receive a first uplink physical shared channel psch from a second terminal, where the first psch is carried on a first resource, and the first resource includes: a first spatial domain resource, a first frequency domain resource, a first time domain resource, and a first bit domain resource, the first spatial domain resource, the first frequency domain resource, the first time domain resource, and the first bit domain resource being used to indicate a first video knowledge-graph tree;
a processing module, configured to determine the first spatial domain resource, the first frequency domain resource, the first time domain resource, and the first bit domain resource according to the first PSSCH; and constructing the first video knowledge-graph tree according to the first spatial domain resource, the first frequency domain resource, the first time domain resource and the first bit domain resource.
CN202110849077.6A 2021-07-27 2021-07-27 SL communication video knowledge graph construction method and device Active CN113301541B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110849077.6A CN113301541B (en) 2021-07-27 2021-07-27 SL communication video knowledge graph construction method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110849077.6A CN113301541B (en) 2021-07-27 2021-07-27 SL communication video knowledge graph construction method and device

Publications (2)

Publication Number Publication Date
CN113301541A true CN113301541A (en) 2021-08-24
CN113301541B CN113301541B (en) 2021-11-12

Family

ID=77331147

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110849077.6A Active CN113301541B (en) 2021-07-27 2021-07-27 SL communication video knowledge graph construction method and device

Country Status (1)

Country Link
CN (1) CN113301541B (en)

Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170295601A1 (en) * 2014-08-22 2017-10-12 Lg Electronics Inc. Method for device-to-device communication in wireless communication system and apparatus therefor
CN109145153A (en) * 2018-07-02 2019-01-04 北京奇艺世纪科技有限公司 It is intended to recognition methods and the device of classification
CN110278563A (en) * 2019-05-23 2019-09-24 华为技术有限公司 Determine the method and device of frequency spectrum resource
US20200053528A1 (en) * 2018-08-10 2020-02-13 Mediatek Inc. Multiplexing of physical sidelink control channel (pscch) and physical sidelink shared channel (pssch)
CN110858958A (en) * 2018-08-23 2020-03-03 华为技术有限公司 Communication method and device of V2X
CN111435909A (en) * 2019-01-11 2020-07-21 华为技术有限公司 Method and device for transmitting and receiving feedback channel
CN112075112A (en) * 2018-05-01 2020-12-11 华为技术有限公司 Method and apparatus for sidestream communication and resource allocation
CN112153705A (en) * 2019-06-29 2020-12-29 华为技术有限公司 Communication method and device
CN112399586A (en) * 2019-08-16 2021-02-23 华为技术有限公司 Method and device for configuring time domain resources
CN112398594A (en) * 2019-08-14 2021-02-23 中国移动通信有限公司研究院 sending method of sidelink HARQ-ACK, PSFCH resource determination method and equipment
WO2021063212A1 (en) * 2019-09-30 2021-04-08 北京紫光展锐通信技术有限公司 Feedback method and apparatus
CN112970309A (en) * 2018-11-02 2021-06-15 华为技术有限公司 Method and apparatus for sidestream communication and resource allocation

Patent Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170295601A1 (en) * 2014-08-22 2017-10-12 Lg Electronics Inc. Method for device-to-device communication in wireless communication system and apparatus therefor
CN112075112A (en) * 2018-05-01 2020-12-11 华为技术有限公司 Method and apparatus for sidestream communication and resource allocation
CN109145153A (en) * 2018-07-02 2019-01-04 北京奇艺世纪科技有限公司 It is intended to recognition methods and the device of classification
US20200053528A1 (en) * 2018-08-10 2020-02-13 Mediatek Inc. Multiplexing of physical sidelink control channel (pscch) and physical sidelink shared channel (pssch)
CN110858958A (en) * 2018-08-23 2020-03-03 华为技术有限公司 Communication method and device of V2X
CN112970309A (en) * 2018-11-02 2021-06-15 华为技术有限公司 Method and apparatus for sidestream communication and resource allocation
CN111435909A (en) * 2019-01-11 2020-07-21 华为技术有限公司 Method and device for transmitting and receiving feedback channel
CN110278563A (en) * 2019-05-23 2019-09-24 华为技术有限公司 Determine the method and device of frequency spectrum resource
CN112153705A (en) * 2019-06-29 2020-12-29 华为技术有限公司 Communication method and device
CN112398594A (en) * 2019-08-14 2021-02-23 中国移动通信有限公司研究院 sending method of sidelink HARQ-ACK, PSFCH resource determination method and equipment
CN112399586A (en) * 2019-08-16 2021-02-23 华为技术有限公司 Method and device for configuring time domain resources
WO2021063212A1 (en) * 2019-09-30 2021-04-08 北京紫光展锐通信技术有限公司 Feedback method and apparatus

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
INTEL CORPORATION: ""R1-1913232 - Summary#1 of 5G V2X mode 2"", 《3GPP TSG RAN WG1 MEETING #99 R1-1913232》 *
宋柯佳: "D2D自组网广播单播调度技术研究", 《中国优秀硕士学位论文辑》 *

Also Published As

Publication number Publication date
CN113301541B (en) 2021-11-12

Similar Documents

Publication Publication Date Title
JP7334743B2 (en) Electronic equipment and spectrum management method
CN110166194B (en) Pilot signal generation method and device
KR102365600B1 (en) Method for transmitting and receiving location information and apparatus therof
US20230198945A1 (en) Gateway for mobile terminated wireless communication in a 5g or other next generation wireless network
KR20190115817A (en) Beamforming Device and Method for Non-orthogonal Multiple Acecess
CN110740481A (en) Data processing method, apparatus and computer storage medium based on quality of service
US10848220B2 (en) Compressing and decompressing beamspace coefficients
CN113301541B (en) SL communication video knowledge graph construction method and device
CN107276733B (en) A kind of method, base station and the terminal of the port mapping of determining DMRS
CN113630895A (en) Data packet transmission method and device
CN112822000B (en) Control method of intelligent LED display screen based on 5g control system and intelligent LED display screen
CN113630884A (en) Resource block adjusting method and device for side-chain communication
CN115296938A (en) Cloud computing management system and cloud computing management method
CN114071516A (en) Carrier configuration method, system, processing equipment and chip of distributed antenna system
CN110351004B (en) Communication method and communication device
CN113783833B (en) Method and device for constructing computer security knowledge graph
CN113630390A (en) Network security communication method and device of terminal equipment based on big data
CN113630811A (en) Communication method and device based on data characteristics
KR102505267B1 (en) Device, system, method and program for disease spread prediction service using big data
CN113875304A (en) Reference signal transmission method and device
CN115087009B (en) Method and device for detecting downlink signal of flexible frame structure simulation system
CN114402538B (en) Beam forming method, communication device, readable storage medium and communication system
CN114867104B (en) Positioning method and device based on multiple beams
KR102485469B1 (en) Device, system, method and program for providing non-fungible token-based hair salon management service
CN116208992B (en) Running state stability evaluation method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant