阅读说明：本技术 一种信息处理方法及相关设备 (Information processing method and related equipment ) 是由 侯琛 于 2020-03-13 设计创作，主要内容包括：本申请提供了一种信息处理方法及相关设备,在对车联网中待传输的信息进行分片处理时,可以减少信息分片处理过程中的耗时,进而减少信息传输过程中的延时。该方法包括:步骤1、获取目标信息对应的M个预设分片位置；步骤2、根据N个比特位计算M个预设分片位置中任意两个相邻的预设分片位置之间的比特位数量,得到比特位数量集合；步骤3、确定目标比特位数量；步骤4、根据第一预设分片位置以及第二预设分片位置确定第一分片信息以及第二分片信息；若第一分片信息和/或第二分片信息中包含目标预设分片位置,则基于第一分片信息和/或第二分片信息迭代执行步骤1至步骤4,直至第一分片信息以及第二分片信息中不包含目标预设分片位置为止。(The application provides an information processing method and related equipment, which can reduce time consumption in an information fragmentation processing process and further reduce time delay in an information transmission process when fragmentation processing is carried out on information to be transmitted in an internet of vehicles. Step 1, obtaining M preset fragment positions corresponding to target information; step 2, calculating the bit quantity between any two adjacent preset fragmentation positions in the M preset fragmentation positions according to the N bits to obtain a bit quantity set; step 3, determining the number of target bits; step 4, determining first fragmentation information and second fragmentation information according to the first preset fragmentation position and the second preset fragmentation position; and if the first fragmentation information and/or the second fragmentation information contain the target preset fragmentation position, iteratively executing the steps 1 to 4 based on the first fragmentation information and/or the second fragmentation information until the first fragmentation information and the second fragmentation information do not contain the target preset fragmentation position.)

1. An information processing method characterized by comprising:

step 1, obtaining M preset slicing positions corresponding to target information, wherein the target information is information to be transmitted with N bits, and M and N are positive integers larger than or equal to 1;

step 2, calculating the bit quantity between any two adjacent preset slicing positions in the M preset slicing positions according to the N bits to obtain a bit quantity set;

step 3, determining a target bit quantity, wherein the target bit quantity is a bit quantity which is greater than a first preset value in the bit quantity set, and the target bit quantity corresponds to a first preset slicing position and a second preset slicing position in the M preset slicing positions;

step 4, determining first fragmentation information and second fragmentation information according to the first preset fragmentation position and the second preset fragmentation position;

if the first fragmentation information and/or the second fragmentation information contain target preset fragmentation positions, iteratively executing the steps 1 to 4 based on the first fragmentation information and/or the second fragmentation information until the first fragmentation information and the second fragmentation information do not contain the target preset fragmentation positions, wherein the target preset fragmentation positions are any preset fragmentation positions in the M preset fragmentation positions.

2. The method according to claim 1, wherein the determining first fragmentation information and second fragmentation information according to the first preset fragmentation position and the second preset fragmentation position comprises:

judging whether the first preset slicing position and the second preset slicing position are boundary candidate slicing positions, wherein the boundary candidate slicing positions are positions before a first bit in the N bits and positions after a last bit in the N bits;

when the first preset fragmentation position or the second preset fragmentation position is the boundary candidate fragmentation position, fragmenting the target information according to a preset fragmentation position which is not the boundary candidate fragmentation position in the first preset fragmentation position and the second preset fragmentation position to obtain first fragmentation information and second fragmentation information;

when the first preset fragmentation position and the second preset fragmentation position are not the boundary candidate fragmentation position, fragmenting the target information according to the first preset fragmentation position or the second preset fragmentation position to obtain the first fragmentation information and the second fragmentation information.

3. The method according to claim 1 or 2, wherein the obtaining M preset fragmentation positions corresponding to the target information comprises:

determining a candidate slice position corresponding to the target information, where the candidate slice position is a position before a first bit in the N bits, a position between two adjacent bits in the N bits, and a position after a last bit in the N bits;

and determining the M preset fragment positions according to the candidate fragment positions.

4. The method according to claim 1 or 2, characterized in that the method further comprises:

and if the first fragmentation information and the second fragmentation information do not contain the target preset fragmentation position, transmitting the first fragmentation information and the second fragmentation information.

5. An information processing apparatus characterized by comprising:

the acquisition unit is used for executing the step 1 and acquiring M preset slicing positions corresponding to target information, wherein the target information is information to be transmitted with N bits, and M and N are positive integers which are larger than or equal to 1;

a calculating unit, configured to execute step 2, calculate, according to the N bits, a bit number between any two adjacent preset fragmentation positions in the M preset fragmentation positions, to obtain a bit number set;

a first determining unit, configured to execute step 3 and determine a target bit number, where the target bit number is a bit number greater than a first preset value in the bit number set, and the target bit number corresponds to a first preset slicing position and a second preset slicing position in the M preset slicing positions;

a second determining unit, configured to execute step 4, and determine first fragmentation information and second fragmentation information according to the first preset fragmentation position and the second preset fragmentation position;

and the processing unit is used for iteratively executing the steps 1 to 4 based on the first fragmentation information and/or the second fragmentation information when the first fragmentation information and/or the second fragmentation information contains a target preset fragmentation position until the first fragmentation information and the second fragmentation information do not contain the target preset fragmentation position, wherein the target preset fragmentation position is any one preset fragmentation position in the M preset fragmentation positions.

6. The apparatus according to claim 5, wherein the second determining unit is specifically configured to:

judging whether the first preset slicing position and the second preset slicing position are boundary candidate slicing positions, wherein the boundary candidate slicing positions are positions before a first bit in the N bits and positions after a last bit in the N bits;

when the first preset fragmentation position or the second preset fragmentation position is the boundary candidate fragmentation position, fragmenting the target information according to a preset fragmentation position which is not the boundary candidate fragmentation position in the first preset fragmentation position and the second preset fragmentation position to obtain first fragmentation information and second fragmentation information;

when the first preset fragmentation position and the second preset fragmentation position are not the boundary candidate fragmentation position, fragmenting the target information according to the first preset fragmentation position or the second preset fragmentation position to obtain the first fragmentation information and the second fragmentation information.

7. The apparatus according to claim 5 or 6, wherein the obtaining unit is specifically configured to:

determining a candidate slice position corresponding to the target information, where the candidate slice position is a position before a first bit in the N bits, a position between two adjacent bits in the N bits, and a position after a last bit in the N bits;

and determining the M preset fragment positions according to the candidate fragment positions.

8. The apparatus of claim 5 or 6, wherein the processing unit is further configured to:

and if the first fragmentation information and the second fragmentation information do not contain the target preset fragmentation position, transmitting the first fragmentation information and the second fragmentation information.

9. A computer device, comprising:

at least one processor, a memory and a transceiver connected, wherein the memory is configured to store program code that is loaded and executed by the processor to implement the steps of the information processing method of any one of claims 1 to 4.

10. A computer-readable storage medium, characterized in that it comprises instructions which, when run on a computer, cause the computer to carry out the steps of the information processing method according to any one of claims 1 to 4.

Technical Field

The application relates to the field of car networking, in particular to an information processing method and related equipment.

Background

The delay mainly comes from information processing delay and information transmission delay. Because the channel transmission bandwidth is limited (not enough to transmit one piece of information at a time), the information needs to be fragmented into multiple parts, one part at a time, before it can be transmitted. How to reduce the time delay caused by the information fragmentation is a key problem facing the cooperative landing of the vehicle and the road.

The current method is to acquire each preset fragmentation position, then poll each preset fragmentation position from the beginning of the information in sequence, and fragment the information at each preset fragmentation position when browsing. For example, a frame of information has 10 bits. After the 3 rd bit, before the 4 th bit and after the 6 th bit, before the 7 th bit are two preset slicing positions. And sequentially polling each preset slicing position from the beginning of the information, and dividing the information into two parts before browsing to the 4 th bit after the 3 rd bit, wherein the first part is the 1 st to 3 rd bits, and the second part is the 4 th to 10 th bits. For the remaining part, the remaining information is split into two parts at this point before browsing to the 7 th bit after the 6 th bit. Thus, the original information is fragmented into three parts: the first part is bits 1 to 3, the second part is bits 4 to 6, and the third part is bits 7 to 10 (before each fragmentation and transmission, it is necessary to check whether each bit of the part to be fragmented has changed).

Therefore, the fragmentation is performed from the beginning of one frame of information according to the preset fragmentation position, and the time is long when the information processing is performed.

Disclosure of Invention

The application provides an information processing method and related equipment, which can reduce time consumption in an information fragmentation processing process and further reduce time delay in an information transmission process when fragmentation processing is carried out on information to be transmitted in an internet of vehicles.

A first aspect of the present application provides an information processing method, including:

step 1, obtaining M preset slicing positions corresponding to target information, wherein the target information is information to be transmitted with N bits, and M and N are positive integers larger than or equal to 1;

step 2, calculating the bit quantity between any two adjacent preset slicing positions in the M preset slicing positions according to the N bits to obtain a bit quantity set;

step 3, determining a target bit quantity, wherein the target bit quantity is a bit quantity which is greater than a first preset value in the bit quantity set, and the target bit quantity corresponds to a first preset slicing position and a second preset slicing position in the M preset slicing positions;

step 4, determining first fragmentation information and second fragmentation information according to the first preset fragmentation position and the second preset fragmentation position;

if the first fragmentation information and/or the second fragmentation information contain target preset fragmentation positions, iteratively executing the steps 1 to 4 based on the first fragmentation information and/or the second fragmentation information until the first fragmentation information and the second fragmentation information do not contain the target preset fragmentation positions, wherein the target preset fragmentation positions are any preset fragmentation positions in the M preset fragmentation positions.

Optionally, the determining first fragmentation information and second fragmentation information according to the first preset fragmentation position and the second preset fragmentation position includes:

judging whether the first preset slicing position and the second preset slicing position are boundary candidate slicing positions, wherein the boundary candidate slicing positions are positions before a first bit in the N bits and positions after a last bit in the N bits;

when the first preset fragmentation position or the second preset fragmentation position is the boundary candidate fragmentation position, fragmenting the target information according to a preset fragmentation position which is not the boundary candidate fragmentation position in the first preset fragmentation position and the second preset fragmentation position to obtain first fragmentation information and second fragmentation information;

when the first preset fragmentation position and the second preset fragmentation position are not the boundary candidate fragmentation position, fragmenting the target information according to the first preset fragmentation position or the second preset fragmentation position to obtain the first fragmentation information and the second fragmentation information.

Optionally, the obtaining M preset fragment positions corresponding to the target information includes:

determining a candidate slice position corresponding to the target information, where the candidate slice position is a position before a first bit in the N bits, a position between two adjacent bits in the N bits, and a position after a last bit in the N bits;

and determining the M preset fragment positions according to the candidate fragment positions.

Optionally, the method further comprises:

and if the first fragmentation information and the second fragmentation information do not contain the target preset fragmentation position, transmitting the first fragmentation information and the second fragmentation information.

A second aspect of the present application provides an information processing apparatus comprising:

the acquisition unit is used for executing the step 1 and acquiring M preset slicing positions corresponding to target information, wherein the target information is information to be transmitted with N bits, and M and N are positive integers which are larger than or equal to 1;

a calculating unit, configured to execute step 2, calculate, according to the N bits, a bit number between any two adjacent preset fragmentation positions in the M preset fragmentation positions, to obtain a bit number set;

a first determining unit, configured to execute step 3 and determine a target bit number, where the target bit number is a bit number greater than a first preset value in the bit number set, and the target bit number corresponds to a first preset slicing position and a second preset slicing position in the M preset slicing positions;

a second determining unit, configured to execute step 4, and determine first fragmentation information and second fragmentation information according to the first preset fragmentation position and the second preset fragmentation position;

and the processing unit is used for iteratively executing the steps 1 to 4 based on the first fragmentation information and/or the second fragmentation information when the first fragmentation information and/or the second fragmentation information contains a target preset fragmentation position until the first fragmentation information and the second fragmentation information do not contain the target preset fragmentation position, wherein the target preset fragmentation position is any one preset fragmentation position in the M preset fragmentation positions.

Optionally, the second determining unit is specifically configured to:

judging whether the first preset slicing position and the second preset slicing position are boundary candidate slicing positions, wherein the boundary candidate slicing positions are positions before a first bit in the N bits and positions after a last bit in the N bits;

when the first preset fragmentation position or the second preset fragmentation position is the boundary candidate fragmentation position, fragmenting the target information according to a preset fragmentation position which is not the boundary candidate fragmentation position in the first preset fragmentation position and the second preset fragmentation position to obtain first fragmentation information and second fragmentation information;

when the first preset fragmentation position and the second preset fragmentation position are not the boundary candidate fragmentation position, fragmenting the target information according to the first preset fragmentation position or the second preset fragmentation position to obtain the first fragmentation information and the second fragmentation information.

Optionally, the obtaining unit is specifically configured to:

determining a candidate slice position corresponding to the target information, where the candidate slice position is a position before a first bit in the N bits, a position between two adjacent bits in the N bits, and a position after a last bit in the N bits;

and determining the M preset fragment positions according to the candidate fragment positions.

Optionally, the processing unit is further configured to:

and if the first fragmentation information and the second fragmentation information do not contain the target preset fragmentation position, transmitting the first fragmentation information and the second fragmentation information.

A third aspect of the present application provides a computer apparatus comprising at least one connected processor, a memory and a transceiver, wherein the memory is used for storing program code, and the program code is loaded and executed by the processor to implement the steps of the information processing method according to the above aspects.

A fourth aspect of the present application provides a computer-readable storage medium including instructions that, when executed on a computer, cause the computer to perform the steps of the information processing method according to the above-described aspects.

In summary, in the embodiment provided by the application, when the fragmentation position is selected each time, the target bit number greater than the first preset value in the bit number set is selected, so that the unit time consumed for detecting the remaining fragmentation information after information fragmentation is less and less, and therefore, when the information to be transmitted in the internet of vehicles is subjected to fragmentation processing, the time consumed by the information fragmentation processing is reduced, and further, the time consumed by the information in the transmission process is reduced.

Drawings

Fig. 1 is a schematic flow chart of fragmentation and transmission of information provided in an embodiment of the present application;

fig. 2 is a network architecture diagram of an information processing method according to an embodiment of the present application;

fig. 3 is a schematic flowchart of an information processing method according to an embodiment of the present application;

fig. 4 is a schematic view of a virtual structure of an information processing apparatus according to an embodiment of the present application;

fig. 5 is a schematic hardware structure diagram of a server according to an embodiment of the present disclosure;

fig. 6 is a schematic diagram of a hardware structure of an information processing apparatus according to an embodiment of the present application.

Detailed Description

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments.

The terms "first," "second," and the like in the description and in the claims of the present application and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It will be appreciated that the data so used may be interchanged under appropriate circumstances such that the embodiments described herein may be practiced otherwise than as specifically illustrated or described herein. Furthermore, the terms "comprise," "include," and "have," and any variations thereof, are intended to cover non-exclusive inclusions, such that a process, method, system, article, or apparatus that comprises a list of steps or modules is not necessarily limited to those steps or modules expressly listed, but may include other steps or modules not expressly listed or inherent to such process, method, article, or apparatus, the division of modules presented herein is merely a logical division that may be implemented in a practical application in a further manner, such that a plurality of modules may be combined or integrated into another system, or some feature vectors may be omitted, or not implemented, and such that couplings or direct couplings or communicative coupling between each other as shown or discussed may be through some interfaces, indirect couplings or communicative coupling between modules may be electrical or other similar, this application is not intended to be limiting. The modules or sub-modules described as separate components may or may not be physically separated, may or may not be physical modules, or may be distributed in a plurality of circuit modules, and some or all of the modules may be selected according to actual needs to achieve the purpose of the present disclosure.

With the research and progress of artificial intelligence technology, the artificial intelligence technology is developed and applied in a plurality of fields, such as common smart homes, smart wearable devices, virtual assistants, smart speakers, smart marketing, unmanned driving, automatic driving, unmanned aerial vehicles, robots, smart medical care, smart customer service, and the like. The automatic driving technology generally comprises technologies such as high-precision maps, environment perception, behavior decision, path planning, motion control and the like, has wide application prospects, and is explained in the following for the artificial intelligence and machine vision technologies:

artificial Intelligence (AI) is a theory, method, technique and application system that uses a digital computer or a machine controlled by a digital computer to simulate, extend and expand human Intelligence, perceive the environment, acquire knowledge and use the knowledge to obtain the best results. In other words, artificial intelligence is a comprehensive technique of computer science that attempts to understand the essence of intelligence and produce a new intelligent machine that can react in a manner similar to human intelligence. Artificial intelligence is the research of the design principle and the realization method of various intelligent machines, so that the machines have the functions of perception, reasoning and decision making.

The artificial intelligence technology is a comprehensive subject and relates to the field of extensive technology, namely the technology of a hardware level and the technology of a software level. The artificial intelligence infrastructure generally includes technologies such as sensors, dedicated artificial intelligence chips, cloud computing, distributed storage, big data processing technologies, operation/interaction systems, mechatronics, and the like. The artificial intelligence software technology mainly comprises a computer vision technology, a voice processing technology, a natural language processing technology, machine learning/deep learning and the like.

Computer Vision technology (CV) Computer Vision is a science for researching how to make a machine "see", and further refers to that a camera and a Computer are used to replace human eyes to perform machine Vision such as identification, tracking and measurement on a target, and further image processing is performed, so that the Computer processing becomes an image more suitable for human eyes to observe or transmitted to an instrument to detect. As a scientific discipline, computer vision research-related theories and techniques attempt to build artificial intelligence systems that can capture information from images or multidimensional data. Computer vision technologies generally include image processing, image recognition, image semantic understanding, image retrieval, OCR, video processing, video semantic understanding, video content/behavior recognition, three-dimensional object reconstruction, 3D technologies, virtual reality, augmented reality, synchronous positioning, map construction, and other technologies, and also include common biometric technologies such as face recognition and fingerprint recognition.

The information processing method can be applied to information transmission products under any bandwidth constraint conditions such as vehicle-road cooperation, vehicle networking, automatic driving, intelligent transportation, high-precision positioning and accurate navigation. In the fragmented transmission of information, limited by the transmission bandwidth of the channel (not enough to transmit one piece of information at a time), the information needs to be fragmented into multiple parts before being transmitted, one part at a time.

The information is represented by bits. Because the channel transmission bandwidth is limited (not enough to transmit one piece of information at a time), the information needs to be fragmented into multiple parts, one part at a time, before it can be transmitted. Since fragmentation and transmission may cause information to change, before each fragmentation and transmission, it is necessary to check whether each bit of the part to be fragmented has changed (if there is a change, the information is in error).

Referring to fig. 1, fig. 1 is a schematic flow chart of providing fragmentation and transmission of information according to an embodiment of the present application, including:

101. bit bits of the information part to be fragmented are detected bit by bit; in the process of transmitting information, bit bits of the part to be sliced are detected bit by bit to obtain the slicing position.

102. Fragmenting the information according to the detected fragmentation position; and after the slicing position is obtained, slicing is carried out according to the slicing position to obtain slicing information.

103. And transmitting the fragment information.

104. And judging whether the information fragmentation is finished, if so, executing the step 105, otherwise, repeatedly executing the steps 101 to 103 until the information transmission is finished.

105. And (6) ending.

It should be noted that, information is represented by bits (for example, information inside a computer is essentially a bit string composed of 0 and 1), because of the limitation of channel transmission bandwidth (one-time is not enough to transmit one piece of information), information needs to be fragmented into multiple parts before transmitting information, and one part needs to be transmitted at a time, because fragmentation and transmission may cause information change, it needs to check whether each bit of the part to be fragmented changes before each fragmentation and transmission. If there is a change, the message is in error.

It takes N unit times for an information having N bits to check the information, i.e., each bit needs to be checked once (one unit time refers to a time period required for checking whether a bit is changed).

If a frame of information needs to be fragmented into multiple parts, the order of fragmentation can affect the overall length of time it takes to examine the information. For example, a frame of information consists of 20 bits (here, for illustration, in practice, the bits of the information are mostly larger than 20 bits), and the information is arranged from left to right, and is numbered in ascending order from 1. It is desirable that fragmentation is performed at three positions before the 3 rd bit after the 2 nd bit, before the 9 th bit after the 8 th bit, and before the 11 th bit after the 10 th bit of the information, and that a part of which the number of bits that have been fragmented satisfies the requirement is transmitted once per fragmentation.

If the first two bits (1 st and 2 nd bits) are sliced before the first two bits are sliced, it takes 20 unit time to check whether there is a change in 20 bits. The 1 st bit and the 2 nd bit which are separated are transmitted out through a channel; before slicing out the 3 rd to 8 th bits, it is checked whether the remaining 18 bits are changed (slicing and transmitting the 1 st and 2 nd bits may cause the remaining bits to be changed), and it takes 18 time units. Transmitting the 3 rd to 8 th bits which are fragmented out through a channel; before slicing out the 9 th bit to the 10 th bit, it is checked whether the remaining 12 bits are changed (slicing and transmitting the 3 rd bit to the 8 th bit may cause the remaining bits to be changed), and it takes 12 unit times. The 9 th to 10 th bits are transmitted through the channel. Before transmitting the remaining 11 th to 20 th bits, it is checked whether they are changed (slicing and transmitting the 9 th to 10 th bits may cause the 11 th to 20 th bits to be changed), which takes 10 unit times, and it takes 20+18+12+10 to 60 unit times in total.

If the slicing is performed in a right-to-left manner, before slicing the 11 th bit to the 20 th bit, it is required to check whether 20 bits are changed, 20 unit time is spent, and the sliced 11 th bit to the 20 th bit are transmitted through a channel; before slicing the 9 th to 10 th bits, it is necessary to check whether the remaining 10 bits are changed (slicing and transmitting the 11 th to 20 th bits may cause the remaining bits to be changed), and it takes 10 time units, and the sliced 9 th to 10 th bits are transmitted through the channel; before slicing the 3 rd to 8 th bits, it is necessary to check whether the remaining 8 bits change (slicing and transmitting the 9 th to 10 th bits may cause the remaining bits to change), which takes 8 unit time, and before transmitting the remaining 1 st to 2 nd bits, it is necessary to check whether they change (slicing and transmitting the 3 rd to 8 th bits may cause the 1 st to 2 nd bits to change), which takes 2 unit time. It takes a total of 20+10+8+2 to 40 unit times.

And the transmission can be carried out after the fragments are fragmented according to other orders. For example, the left part and the right part may be sliced after the 8 th bit and before the 9 th bit, respectively, and the total unit time spent for bit detection is different from the unit time spent in the above two modes; for given information and information slicing positions (for example, "wish to slice before the 3 rd bit after the 2 nd bit, before the 9 th bit after the 8 th bit, and before the 11 th bit after the 10 th bit of the information"), it can be seen that different slicing positions consume different time lengths, and how to reduce the delay caused by information slicing is a key problem facing the cooperative landing of the vehicle and the road. In view of this, embodiments of the present application provide a data processing method for solving the problem.

Referring to fig. 2, fig. 2 is a network architecture diagram of an information processing method according to an embodiment of the present application, including an object 201 to be detected, an information processing apparatus 202, and a receiving apparatus 203. The format of information between the information processing apparatus 202 and the detected object 201 and the receiving apparatus 203 is a vehicle wireless communication technology (V2X) format.

The information processing device 202 obtains target information of the detected object 201, then obtains M preset fragmentation positions corresponding to the target information, where the target information is information to be transmitted with N bits, where M and N are positive integers greater than or equal to 1, then calculates the number of bits between any two adjacent preset fragmentation positions in the M preset fragmentation positions according to the N bits to obtain a bit number set, then selects a target bit number greater than a first preset value in the bit number set, where the target bit number corresponds to the first preset fragmentation position and a second preset fragmentation position, then fragments the target information according to the first preset fragmentation position and the second preset fragmentation position to obtain first fragmentation information and second fragmentation information, and if the first fragmentation information and/or the second fragmentation information contains the target preset fragmentation position, and iterating the steps based on the first slicing information and/or the second slicing information until the first slicing information and the second slicing information do not contain the target preset slicing position, wherein the target preset slicing position is any one preset slicing position in the M preset slicing positions. In the embodiment provided by the application, when the fragmentation position is selected each time, the target bit number which is larger than the first preset value in the bit number set is selected, so that the unit time consumed for detecting the rest fragmentation information after information fragmentation is less and less, the time consumed by information fragmentation can be reduced, and the time consumed by information in the transmission process can be further reduced.

The information processing method of the present application will be described below from the perspective of an information processing apparatus, which may be a camera, a server, or another apparatus, and is not particularly limited.

Referring to fig. 3, fig. 3 is a schematic flow chart of an information processing method according to an embodiment of the present application, including:

301. and acquiring M preset fragment positions corresponding to the target information.

In this embodiment, the information processing apparatus may obtain M preset fragmentation positions corresponding to target information, where the target information is information with N bits, and the target information is a signal to be transmitted, where M and N are positive integers greater than or equal to 1.

In one embodiment, the acquiring, by the information processing apparatus, M preset fragment positions corresponding to the target information includes:

determining a candidate slicing position corresponding to the target information, wherein the candidate slicing position is a position before a first bit in the N bits, a position between two adjacent bits in the N bits and a position after a last bit in the N bits;

and determining M preset fragment positions according to the candidate fragment positions.

In this embodiment, the information processing apparatus may first obtain N bits corresponding to the target information, and then sequence the N bits according to a preset sequencing manner (the preset sequencing manner may, for example, sequence the N bits from left to right in an ascending order, or may also be another sequencing rule, for example, sequence the N bits from right to left in a descending order, where the specific limitation is not made, as long as the N bits can be numbered), and sequentially number the bits as 1, 2., N; after determining the sorting number of the N bits, the information processing apparatus determines a position between any two adjacent bits of the N bits, a position before a first bit and a position after a last bit of the N bits as candidate slice positions. Therefore, the target information having N bits has N +2 candidate slice positions. Sequencing the candidate fragment positions according to a preset sequencing mode, and determining the position before the first bit and the position after the last bit in the N bits as boundary candidate fragment positions; then, M preset fragmentation positions are determined according to the candidate fragmentation positions, where how to determine the M preset fragmentation positions according to the boundary candidate fragmentation positions is not specifically limited, for example, the M preset fragmentation positions may be selected from the boundary candidate fragmentation positions according to an actual situation, and of course, the M preset fragmentation positions may also be determined in other manners, for example, different preset fragmentation positions are adopted for information of different length bits or different types of information.

It should be noted that M preset slicing bitsThe information fragmentation method is used for (the M preset fragmentation positions refer to which candidate fragmentation position of the information needs to be fragmented, and the information fragmentation is not allowed in other candidate fragmentation positions except the M preset fragmentation positions)To indicate. Wherein the content of the first and second substances,m ∈ {0,1,2,. multidata, N, N +1}, 0 representing a position before a first bit of the N bits, N +1 representing a position after a last bit of the N bits, andx, y ∈ {0,1, 2.., n, n +1} (i.e., any two preset slicing positions of the M preset slicing positions cannot be the same candidate slicing position),indicating the need for target informationAnd slicing the target information at the candidate slicing positions.

302. And calculating the bit quantity between any two adjacent preset fragmentation positions in the M preset fragmentation positions according to the N bits to obtain a bit quantity set.

In this embodiment, after obtaining M preset slicing positions, the information processing apparatus may calculate, according to the N bits, the number of bits between any two adjacent preset slicing positions in the M preset slicing positions to obtain a bit number set, that is, the number of bits between any two adjacent preset slicing positions may be calculated here (N bits of the target information are known, and M preset slicing positions are also known, so that the number of bits between any two adjacent preset slicing positions in the M preset slicing positions may be calculated), which is L_s,s+1S ∈ {1, 2.. times, n } represents M preset slicesAny two adjacent preset slicing positions in positionAndthe number of bits in between.

303. A target number of bits is determined.

In this embodiment, after obtaining the bit number set, the information processing apparatus may select a target bit number greater than a first preset value from the bit number set, where the target bit number corresponds to a first preset slicing position and a second preset slicing position of the M preset slicing positions, that is, when slicing the target information, the information processing apparatus may select L_1,2,L_2,3,...,L_n-2,n-1The maximum value is selected (that is, the maximum value is the first preset value, which is taken as an example for description here, although other values may also be used, which are not limited specifically), and the mark is β ═ max (L)_1,2,L_2,3,...,L_n-2,n-1) (i.e., the target number of bits, if the maximum is not unique, then one is optional). By usingAndfor example, the target information consists of 10 bits, which are 1,2, 3 … and 10, and the preset slicing positions are 3, which are respectively an a slicing position between 1 and 2, a B slicing position between 5 and 6 and a C slicing position between 7 and 8, so that the number of bits between any two adjacent bits in the preset slicing positions is 2, 3, 4 and 5, and the number of bits between the slicing position a and the slicing position B is 6 and 7, so that the target bit number is obtained as the slicing positionThe number of bits between slice position a and slice position B is 4.

It should be noted that the above bits and preset slice positions are only examples and do not represent limitations thereto.

304. And determining the first fragmentation information and the second fragmentation information according to the first preset fragmentation position and the second preset fragmentation position.

In this embodiment, after obtaining the first preset fragmentation position and the second preset fragmentation position, the information processing apparatus may determine the first fragmentation information and the second fragmentation information according to the first preset fragmentation position and the second preset fragmentation position.

In one embodiment, the determining, by the information processing apparatus, the first fragmentation information and the second fragmentation information according to the first preset fragmentation position and the second preset fragmentation position includes:

judging whether the first preset slicing position and the second preset slicing position are boundary candidate slicing positions, wherein the boundary candidate slicing positions are positions before a first bit in the N bits and positions after a last bit in the N bits;

when the first preset fragmentation position or the second preset fragmentation position is the boundary candidate fragmentation position, fragmenting the target information according to the first preset fragmentation position and a preset fragmentation position which is not the boundary candidate fragmentation position in the second preset fragmentation position to obtain first fragmentation information and second fragmentation information;

when the first preset fragmentation position and the second preset fragmentation position are not boundary candidate fragmentation positions, fragmenting the target information according to the first preset fragmentation position or the second preset fragmentation position to obtain first fragmentation information and second fragmentation information.

In this embodiment, after the first preset slicing position and the second preset slicing position are obtained, that is, after the first preset slicing position and the second preset slicing position are obtained, the first preset slicing position and the second preset slicing position are obtainedAndcan judgeAndwhether it is a boundary candidate slice position, ifAndif one of the boundary candidate slicing positions is the boundary candidate slicing position, slicing the N bits of the target information according to another preset slicing position which is not the boundary candidate slicing position to obtain first slicing information and second slicing information (that is, dividing the N bits of the target information into two bit strings through the preset slicing position which is not the boundary candidate slicing position); if it is notAndif neither of the two preset fragment positions is the boundary candidate fragment position, then the position is determined to be the boundary candidate fragment positionAndoptionally selecting a preset slicing position to slice N bits of the target information to obtain first slicing information and second slicing information.

305. And judging whether the first fragment information and the second fragment information contain target preset fragment positions, if so, executing step 306, and if not, executing step 307.

In this embodiment, after obtaining the first fragmentation information and the second fragmentation information, the information processing apparatus may determine whether the first fragmentation information and the second fragmentation information include a target preset fragmentation position, where the target preset fragmentation position is any one of M preset fragmentation positions, where there are multiple determination results for determining the first fragmentation information and the second fragmentation information, and the determination results are described below:

1. the first fragmentation information or the second fragmentation information comprises a target preset fragmentation position;

2. the first fragmentation information and the second fragmentation information both comprise target preset fragmentation positions;

3. the first fragmentation information and the second fragmentation information do not contain target preset fragmentation positions;

the operation not performed for the different judgment results is executed, when the judgment results are 1 and 2, step 306 is executed, and when the judgment result is 3, step 307 is executed.

306. And iteratively executing the steps 301 to 305 based on the first slice information and/or the second slice information until the target preset slice position is not included in the first slice information and the second slice information.

In this embodiment, when the first fragmentation information or the second fragmentation information includes the target preset position, the steps 301 to 305 are repeatedly executed with the first fragmentation information or the second fragmentation information as the target information until the first fragmentation information and the second fragmentation information do not include the target preset fragmentation position. That is, the preset fragmentation positions corresponding to the first fragmentation information or the second fragmentation information are determined according to the M preset fragmentation positions, the bit number between any two adjacent preset fragmentation positions in the corresponding preset fragmentation positions is calculated, the bit number larger than the first preset value is determined, then fragmentation is performed, and so on until the first fragmentation information and the second fragmentation information do not contain the target preset fragmentation position. When the first fragmentation information and the second fragmentation information both include the target preset position, step 301 to step 305 are executed respectively with the first fragmentation information as the target information and the second fragmentation information as the target information until the first fragmentation information and the second fragmentation information do not include the target preset fragmentation position.

It should be noted that the first preset value is associated with the number of bits between any two adjacent preset fragmentation positions in the preset fragmentation positions, for example, the number of bits with the largest number may be used as the target number of bits, and of course, the second largest number of bits may also be used as the target number of bits, which is not limited specifically.

It should be further noted that, in the process of continuously fragmenting the first fragmentation information and the second fragmentation information, if there is fragmentation information that does not include the target preset fragmentation position, the fragmentation information that does not include the target preset fragmentation position is transmitted through the transmission channel. Namely, after each time of slicing, the bit string which can not be sliced is transmitted.

307. Other operations are performed.

In this embodiment, when neither the first fragmentation information nor the second fragmentation information includes the target preset fragmentation position, the first fragmentation information and the second fragmentation information are transmitted, that is, the information that cannot be fragmented is transmitted through the channel.

In summary, in the embodiment provided by the application, when the fragmentation position is selected each time, the target bit number greater than the first preset value in the bit number set is selected, and the unit time consumed for detecting the remaining fragmentation information after information fragmentation is less and less, so that the time consumed by information fragmentation can be reduced, and the time consumed by information transmission is further reduced.

Referring to fig. 2, the following description will be given by taking target information as collected information of whether a vehicle passes through or not as an example, and referring to fig. 2, the present invention includes a detected object 201 (such as an automobile), an information processing device 202 (such as a camera), and a receiving device 203 (such as a mobile phone), where the detected object is an automobile, the information processing device is a camera, and the receiving device is a mobile phone as an example. The camera shoots whether a vehicle passes by to obtain the information to be transmitted, the bit number contained in the transmitted information is determined, numbering the bits and determining the preset slicing position, and detecting whether each bit is changed after each slicing or transmission operation is finished, and counting the bit number between two adjacent preset fragmentation positions, finding a sub-bit string with the maximum bit number between the two adjacent preset fragmentation positions, then fragmenting the information, sequentially sending the fragmented information to a mobile phone by a camera (the information contains the time of information generation), and calculating the time interval (the difference between the latter and the former) from the generation of the information to the complete reception of the information by the receiving end according to the time of the generation of the information and the time of the reception of the information (the time can be automatically recorded by an information receiving device at the time of the reception of the information). In this way, when the slicing position is selected each time, the largest target bit number in the bit number set is selected, and the unit time consumed for detecting the rest slicing information after information slicing is less and less, so that the time consumption caused by information slicing can be reduced.

Referring to fig. 4, fig. 4 is a schematic view of a virtual structure of an information processing apparatus according to an embodiment of the present application, including:

an obtaining unit 401, configured to perform step 1, obtain M preset fragmentation positions corresponding to target information, where the target information is information to be transmitted with N bits, where M and N are positive integers greater than or equal to 1;

a calculating unit 402, configured to execute step 2, and calculate, according to the N bits, a bit number between any two adjacent preset fragmentation positions in the M preset fragmentation positions to obtain a bit number set;

a first determining unit 403, configured to execute step 3, determine a target bit number, where the target bit number is a bit number greater than a first preset value in the bit number set, and the target bit number corresponds to a first preset slicing position and a second preset slicing position in the M preset slicing positions;

a second determining unit 404, configured to perform step 4, and determine first fragmentation information and second fragmentation information according to the first preset fragmentation position and the second preset fragmentation position;

a processing unit 405, configured to, when the first fragmentation information and/or the second fragmentation information includes a target preset fragmentation position, iteratively perform steps 1 to 4 based on the first fragmentation information and/or the second fragmentation information until the first fragmentation information and the second fragmentation information do not include the target preset fragmentation position, where the target preset fragmentation position is any preset fragmentation position in the M preset fragmentation positions.

Optionally, the second determining unit 404 is specifically configured to:

judging whether the first preset slicing position and the second preset slicing position are boundary candidate slicing positions, wherein the boundary candidate slicing positions are positions before a first bit in the N bits and positions after a last bit in the N bits;

when the first preset fragmentation position or the second preset fragmentation position is the boundary candidate fragmentation position, fragmenting the target information according to a preset fragmentation position which is not the boundary candidate fragmentation position in the first preset fragmentation position and the second preset fragmentation position to obtain first fragmentation information and second fragmentation information;

when the first preset fragmentation position and the second preset fragmentation position are not the boundary candidate fragmentation position, fragmenting the target information according to the first preset fragmentation position or the second preset fragmentation position to obtain the first fragmentation information and the second fragmentation information.

Optionally, the obtaining unit 401 is specifically configured to:

determining a candidate slice position corresponding to the target information, where the candidate slice position is a position before a first bit in the N bits, a position between two adjacent bits in the N bits, and a position after a last bit in the N bits;

and determining the M preset fragment positions according to the candidate fragment positions.

Optionally, the processing unit 405 is further configured to:

and if the first fragmentation information and the second fragmentation information do not contain the target preset fragmentation position, transmitting the first fragmentation information and the second fragmentation information.

In summary, in the embodiment provided by the application, when the fragmentation position is selected each time, the target bit number greater than the first preset value in the bit number set is selected, and the unit time consumed for detecting the remaining fragmentation information after information fragmentation is less and less, so that the time consumed by information fragmentation can be reduced, and the time consumed by information transmission is further reduced.

Fig. 5 is a schematic diagram of a server structure provided by an embodiment of the present invention, where the server 500 may have a relatively large difference due to different configurations or performances, and may include one or more Central Processing Units (CPUs) 522 (e.g., one or more processors) and a memory 532, and one or more storage media 530 (e.g., one or more mass storage devices) for storing applications 542 or data 544. Memory 532 and storage media 530 may be, among other things, transient storage or persistent storage. The program stored on the storage medium 530 may include one or more modules (not shown), each of which may include a series of instruction operations for the server. Still further, the central processor 522 may be configured to communicate with the storage medium 530, and execute a series of instruction operations in the storage medium 530 on the server 500.

The server 500 may also include one or more power supplies 526, one or more wired or wireless network interfaces 550, one or more input-output interfaces 558, and/or one or more operating systems 541, such as Windows ServerTM, Mac OS XTM, UnixTM, and &lTtTtranslation = L "&gTtL &lTt/T &gTtinxTM, FreeDTM, and so forth.

The steps performed by the information processing apparatus in the above-described embodiment may be based on the server configuration shown in fig. 5.

Referring to fig. 6, an embodiment of an information processing apparatus 600 in the embodiment of the present application includes:

an input device 601, an output device 602, a processor 603 and a memory 604 (wherein the number of the processors 603 may be one or more, and one processor 603 is taken as an example in fig. 6). In some embodiments of the present application, the input device 601, the output device 602, the processor 603 and the memory 604 may be connected by a bus or other means, wherein the connection by the bus is exemplified in fig. 6.

The processor 603 is configured to perform the above-described operations performed by the information processing apparatus by calling the operation instructions stored in the memory 604.

An embodiment of the present application further provides a computer-readable storage medium, on which a program is stored, and the program, when executed by a processor, implements the steps of the information processing method described above.

The embodiment of the application further provides a processor, wherein the processor is used for running a program, and the program executes the steps of the information processing method when running.

The embodiment of the present application further provides a terminal device, where the device includes a processor, a memory, and a program stored in the memory and capable of running on the processor, and the program code is loaded and executed by the processor to implement the steps of the information processing method.

The present application also provides a computer program product adapted to perform the steps of the above-described information processing method when executed on a data processing device.

In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.

It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the system, the apparatus and the module described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, 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 specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.

Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.

It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The above are merely examples of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.