EP4405900A1

EP4405900A1 - Method and system to reduce boundary co-ordinates of a region map for detecting an object

Info

Publication number: EP4405900A1
Application number: EP22786788.4A
Authority: EP
Inventors: Alastair Gregory; Deepak Kumar RAI; Lalit Kumar; Arun Kumar CHOKKAR
Original assignee: Continental Automotive Technologies GmbH
Current assignee: Aumovio Germany GmbH
Priority date: 2021-09-21
Filing date: 2022-09-16
Publication date: 2024-07-31
Also published as: WO2023046593A1; GB2610867A

Abstract

Present invention discloses a method and a system for reducing boundary co-ordinates of a region map for detecting an object in the region map. The method comprising creating a first boundary map (121) of a region using a plurality of boundary co-ordinates of the region received from one or more sources. Thereafter, the method comprising creating a second boundary map (123) adjacent to the first boundary map (121) using the plurality of boundary co-ordinates of the region and a pre-determined offset value. Subsequently, the method comprising identifying a plurality of random co-ordinates between the first boundary map (121) and the second boundary map (123) and connecting two or more co-ordinates among the plurality of random co-ordinates until the connection between the two or more co-ordinates does not intersect with the first boundary map (121) of the region and the second boundary map (123) of the region. The connection between the two or more co-ordinates represents a simplified first boundary map (125) of the region formed using minimum number of the plurality of random co-ordinates.

Description

METHOD AND SYSTEM TO REDUCE BOUNDARY CO-ORDINATES OF A REGION MAP FOR DETECTING AN OBJECT

TECHNICAL FIELD

[1] The present subject matter is generally related to the field of location determination, more particularly, but not exclusively, to a method and a system for reducing boundary co-ordinates of a region map for detecting an object in the region map.

BACKGROUND

[2] Typically, to detect a vehicle in which country or region it is located, millions of Global Navigation Satellite System (GNSS) co-ordinates are utilized. These co-ordinates are stored in a user device. This approach leads to significant amount of power consumption for processing the GNSS co-ordinates and memory for storing the GNSS co-ordinates. There are techniques that provide solution to these problems to some extent.

[3] For instance, US 6812925 Bl provides a method for performing simplification of a map using s-Voronoi diagrams. In this prior art method, map boundaries are simplified without any boundary limits, which may lead to deviation from original boundary map in kilometres. Furthermore, in this prior art, in case of Voronoi diagram, the Euclidean space may be divided into triangles using Delaunay triangulation. Thereafter, the centroid of each triangle may be found. In this approach, these centroids sometimes fall inside the actual boundary or outside the specified boundary, which is a drawback. Also, when these centroids are connected, it leads to intersection of two or more lines which needs to be simplified again, resulting in multiple refinement steps, thereby lengthening the process of determining vehicle location on a map

[4] The information disclosed in this background of the disclosure section is for enhancement of understanding of the general background of the invention and should not be taken as an acknowledgement or any form of suggestion that this information forms the prior art already known to a person skilled in the art. SUMMARY

[5] In an embodiment, the present disclosure relates to a method for reducing boundary co-ordinates of a region map for detecting an object in the region map. The method includes creating a first boundary map of a region using a plurality of boundary co-ordinates of the region received from one or more sources and creating a second boundary map adjacent to the first boundary map using the plurality of boundary co-ordinates of the region and a pre-determined offset value. Thereafter, the method comprising identifying a plurality of random co-ordinates between the first boundary map and the second boundary map. Lastly, the method comprising connecting two or more co-ordinates among the plurality of random co-ordinates until the connection between the two or more co-ordinates does not intersect with the first boundary map of the region and the second boundary map of the region. The connection between the two or more co-ordinates represents a simplified first boundary map of the region formed using minimum number of the plurality of random co-ordinates.

[6] In an embodiment, the present disclosure relates to a boundary co-ordinates system for reducing boundary co-ordinates of a region map for detecting an object in the region map. The boundary co-ordinates system comprising a processor and a memory communicatively coupled to the processor, wherein the memory stores processor-executable instructions, which on execution, cause the processor to create a first boundary map of a region using a plurality of boundary co-ordinates of the region received from one or more sources. Thereafter, the processor is configured to create a second boundary map adjacent to the first boundary map using the plurality of boundary co-ordinates of the region and a pre-determined offset value. In the subsequent step, the processor is configured identify a plurality of random co-ordinates between the first boundary map and the second boundary map. Lastly, the processor is configured to connect two or more co-ordinates among the plurality of random co-ordinates until the connection between the two or more co-ordinates does not intersect with the first boundary map of the region and the second boundary map of the region. The connection between the two or more co-ordinates represents a simplified first boundary map of the region formed using minimum number of the plurality of random co-ordinates. [7] Embodiments of the disclosure according to the above-described method and system may bring about several advantages.

[8] In present disclosure, the simplified first boundary map of a region is only few meters away in terms of deviation from a first boundary map (i.e. , original boundary map) of the region, thereby, making this method relatively accurate.

[9] The method for reducing boundary co-ordinates of a region map disclosed in the present disclosure significantly reduces number of co-ordinates required to represent a simplified first boundary map of a region from a first boundary map (i.e., original boundary map) of the region. For instance, using the method disclosed in the present disclosure, the simplified first boundary map of the region may be represented using few co-ordinates without changing the topography of the region instead of millions of co-ordinates typically required for representing the first boundary map (i.e., original boundary map) of the region.

[10] Furthermore, the use of present method reduces memory requirement significantly as only few co-ordinates are required to be stored in a device for representing the first boundary map (i.e., original boundary map) of the region instead of millions of boundary co-ordinates, thereby, making the present method feasible for navigation purpose.

[11] The method for reducing boundary co-ordinates of a region map described in the present disclosure allows fast processing of the boundary coordinates as the method of the present disclosure requires less iterative/multiple refinement steps.

[12] The foregoing summary is illustrative only and is not intended to be in any way limiting. In addition to the illustrative aspects, embodiments, and features described above, further aspects, embodiments, and features will become apparent by reference to the drawings and the following detailed description.

BRIEF DESCRIPTION OF THE ACCOMPANYING DRAWINGS

[13] The accompanying drawings, which are incorporated in and constitute a part of this disclosure, illustrate exemplary embodiments and together with the description, serve to explain the disclosed principles. In the figures, the left-most digit(s) of a reference number identifies the figure in which the reference number first appears. The same numbers are used throughout the figures to reference like features and components. Some embodiments of system and/or methods in accordance with embodiments of the present subject matter are now described below, by way of example only, and with reference to the accompanying figures.

[14] FIG. 1 A illustrates an exemplary environment for reducing boundary co-ordinates of a region map for detecting an object in the region map in accordance with some embodiments of the present disclosure.

[15] FIG. IB illustrates an exemplary first boundary map of a region in accordance with some embodiments of the present disclosure.

[16] FIG. 1C illustrates an exemplary second boundary map adjacent to a first boundary map of a region of FIG. IB in accordance with some embodiments of the present disclosure.

[17] FIG. ID- II illustrate a method of reducing boundary co-ordinates of a region map of FIG. IB in accordance with some embodiments of the present disclosure.

[18] FIG. 1J illustrates a simplified first boundary map along with a first boundary map and a second boundary map of a region in accordance with some embodiments of the present disclosure.

[19] FIG. 2 shows a detailed block diagram of a boundary co-ordinates system in accordance with some embodiments of the present disclosure.

[20] FIG. 3 illustrates a flowchart showing a method for reducing boundary co-ordinates of a region map for detecting an object in the region map in accordance with some embodiments of present disclosure.

[21] FIG. 4 illustrates a block diagram of an exemplary computer system for implementing embodiments consistent with the present disclosure. [22] It should be appreciated by those skilled in the art that any block diagrams herein represent conceptual views of illustrative systems embodying the principles of the present subject matter. Similarly, it will be appreciated that any flowcharts, flow diagrams, state transition diagrams, pseudo code, and the like represent various processes which may be substantially represented in computer readable medium and executed by a computer or processor, whether or not such computer or processor is explicitly shown.

DETAILED DESCRIPTION

[23] In the present document, the word "exemplary" is used herein to mean "serving as an example, instance, or illustration." Any embodiment or implementation of the present subject matter described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments.

[24] While the disclosure is susceptible to various modifications and alternative forms, specific embodiment thereof has been shown by way of example in the drawings and will be described in detail below. It should be understood, however that it is not intended to limit the disclosure to the particular forms disclosed, but on the contrary, the disclosure is to cover all modifications, equivalents, and alternatives falling within the scope of the disclosure.

[25] The terms “comprises”, “comprising”, or any other variations thereof, are intended to cover a non-exclusive inclusion, such that a setup, device or method that comprises a list of components or steps does not include only those components or steps but may include other components or steps not expressly listed or inherent to such setup or device or method. In other words, one or more elements in a system or apparatus proceeded by “comprises... a” does not, without more constraints, preclude the existence of other elements or additional elements in the system or method.

[26] In the following detailed description of the embodiments of the disclosure, reference is made to the accompanying drawings that form a part hereof, and in which are shown by way of illustration specific embodiments in which the disclosure may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the disclosure, and it is to be understood that other embodiments may be utilized and that changes may be made without departing from the scope of the present disclosure. The following description is, therefore, not to be taken in a limiting sense.

[27] Embodiment of the present disclosure provides a solution for reducing boundary co-ordinates of a region map for detecting an object in the region map. The present disclosure discloses a method to create/generate a simplified first boundary map of a region from a first boundary map of the region. The first boundary map may be an original (i.e., real) boundary map of the region consisting of millions of boundary co-ordinates. The simplified first boundary map of the region is formed using minimum number of a plurality of (random) co-ordinates. The simplified first boundary map of the region utilizes significantly less memory to store the co-ordinates of the simplified first boundary map of the region as compared to the co-ordinates of the first boundary map (i.e., original boundary map) of the region. The present method is simple and allows fast processing to achieve a simplified first boundary map of a region.

[28] FIG. 1 A illustrates an exemplary environment for reducing boundary co-ordinates of a region map for detecting an object in the region map in accordance with some embodiments of the present disclosure.

[29] As shown in the FIG. 1A, the environment 100 includes a boundary co-ordinates system 101, a communication network 109 and one or more sources 111. The boundary co-ordinates system 101 may be present on a server or in a navigation device of a vehicle. The server may be a local server or on a cloud server. The boundary co-ordinates system 101 may create a simplified first boundary map of a first boundary map (i.e., original boundary map) of a region by using minimum number of the plurality of (random) co-ordinates (discussed later in the section). The boundary co-ordinates system 101 may receive a plurality of boundary co-ordinates of a first boundary map of a region from the one or more sources 111 through the communication network 109. The boundary co-ordinates may refer to co-ordinates in terms of latitude and longitude. The one or more sources 111 may be at least one of Global navigation satellite system (GNSS), Global Positioning System (GPS) and a database comprising the plurality of boundary co-ordinates of the first boundary map of the region. In one embodiment, the one or more sources 111 may be any system that provides boundary co-ordinates in terms of latitude and longitude. The communication network 109 may include, but is not limited to, a direct interconnection, an e-commerce network, a Peer-to-Peer (P2P) network, Local Area Network (LAN), Wide Area Network (WAN), wireless network (for example, using Wireless Application Protocol), Internet, Wi-Fi, Bluetooth and the like.

[30] In the embodiment, the boundary co-ordinates system 101 may use a plurality of boundary co-ordinates of a first boundary map of a region received from the one or more sources 111 to create a simplified first boundary map of the region using minimum number of the plurality of (random) co-ordinates (discussed later in the section). The boundary co-ordinates system 101 may include an I/O interface 103, a memory 105 and a processor 107. The I/O interface 103 may be configured to communicate with the one or more sources 111. The I/O interface 103 may employ communication protocols/methods such as, without limitation, audio, analog, digital, monoaural, Radio Corporation of America (RCA) connector, stereo, IEEE®-1394 high speed serial bus, serial bus, Universal Serial Bus (USB), infrared, Personal System/2 (PS/2) port, Bayonet Neill-Concelman (BNC) connector, coaxial, component, composite, Digital Visual Interface (DVI), High-Definition Multimedia Interface (HDMI®), Radio Frequency (RF) antennas, S-Video, Video Graphics Array (VGA), IEEE® 802.11b/g/n/x, Bluetooth, cellular e.g., Code-Division Multiple Access (CDMA), High-Speed Packet Access (HSPA+), Global System for Mobile communications (GSM®), Long-Term Evolution (LTE®), Worldwide interoperability for Microwave access (WiMax®), or the like.

[31] The memory 105 may be communicatively coupled to the processor 107 of the boundary co-ordinates system 101. The memory 105 may, also, store processor instructions which may cause the processor 107 to execute the instructions for creating a simplified first boundary map of a first boundary map (i.e., original boundary map) of a region by using minimum number of the plurality of (random) co-ordinates.

[32] The processor 107 may include at least one data processor for creating a simplified first boundary map of a first boundary map (i.e., original boundary map) of a region by using minimum number of the plurality of (random) co-ordinates. [33] Hereafter, the operation of the boundary co-ordinates system 101 for creating a simplified first boundary map of a first boundary map (i.e. , original boundary map) of a region by using minimum number of the plurality of (random) co-ordinates is described.

[34] The boundary co-ordinates system 101 receives a plurality of boundary co-ordinates of a first boundary map 121 of a region from the one or more sources 111. The boundary co-ordinates system 101 creates the first boundary map 121 of the region using the plurality of boundary co-ordinates of the region received from the one or more sources 111, as shown in FIG. IB. The first boundary map 121 of the region is a real (i.e., original) boundary map of the region. Thereafter, the boundary co-ordinates system 101 creates a second boundary map 123 adjacent to the first boundary map 121 using the plurality of boundary co-ordinates of the region and a pre-determined offset value. The pre-determined offset value may be set by a manufacturer or may be set based on the requirement from customer on how close the customer wants a simplified first boundary map 125 to be with respect to the first boundary map 121. The second boundary map 123 may be created inside the first boundary map 121 of the region or outside the first boundary map 121 of the region. The pre-determined offset value may be a positive value or a negative value. When the pre-determined offset value is a positive value, the second boundary map 123 is created outside the first boundary map 121 of the region, as shown in FIG. 1C. When the pre-determined offset value is a negative value, the second boundary map 123 is created inside the first boundary map 121 of the region. Thereafter, the boundary co-ordinates system 101 identifies a plurality of random co-ordinates 1251, 1252, 125s and 1254 between the first boundary map 121 and the second boundary map 123 as shown in FIG. ID. In one embodiment, reducem and poly shape functionality in MATLAB programming language may be used to identify/get the plurality of random co-ordinates 1251, 1252, 125s and 1254 between the first boundary map 121 and the second boundary map. For sake of explanation, only four random co-ordinates 1251, 1252, 125s and 1254 are considered. Subsequently, the boundary co-ordinates system 101 connects two or more co-ordinates among the plurality of random co-ordinates 125i, 1252, 125s and 1254 until the connection between the two or more co-ordinates does not intersect with the first boundary map 121 of the region and the second boundary map 123 of the region. The connection between the two or more co-ordinates represents the simplified first boundary map 125 of the region formed using minimum number of the plurality of random co-ordinates 125i, 1252, 125s and 1254 as shown in FIG. II. In detail, the boundary co-ordinates system 101 connects a first co-ordinate 125i of the plurality of random co-ordinates 125i, 1252, 125s and 1254 and a second co-ordinate 125i of the plurality of random co-ordinates 1251, 1252, 125s and 1254 with a first line 127i as shown in FIG. IE. The second co-ordinate 1252 is a neighbouring co-ordinate to the first co-ordinate 125i. The boundary co-ordinates system 101 extends the first line 127i to connect the first co-ordinate 125i of the plurality of random co-ordinates 125i, 1252, 125s and 1254 and a third co-ordinate 125s of the plurality of random co-ordinates 1251, 1252, 125s and 1254 to form a second line 1272 (second line 1272 is shown as a long-dashed line in FIG. IF). The third co-ordinate 125s is the neighbouring co-ordinate to the second co-ordinate 1252. The boundary co-ordinates system 101 determines whether the second line 1272 intersects with the first boundary map 121 of the region or the second boundary map 123 of the region. Based on the determination, the boundary co-ordinates system 101 performs one or more operations. For instance, when the second line 1272 does not intersect with the first boundary map 121 of the region or the second boundary map 123 of the region as in FIG. IF, the boundary co-ordinates system 101 extends the first line 1271 to connect the first co-ordinate 125i of the plurality of random co-ordinates 125i, 1252, 125s and 1254 and a fourth co-ordinate 1254 of the plurality of random co-ordinates 1251, 1252, 125s and 1254 to form a third line 127s (third line 127s is shown as short-dashed line in FIG. 1G). The fourth co-ordinate 1254 is the neighbouring co-ordinate to the third co-ordinate 125s. Thereafter, the boundary co-ordinates system 101 performs operation from the determination step i.e., determining whether the third line 127s intersects with the first boundary map 121 of the region or the second boundary map 123 of the region iteratively for each of subsequent co-ordinates of the plurality of random co-ordinates 125i, 1252, 125s and 1254 to reduce number of boundary co-ordinates required to represent the first boundary map 121 of the region.

[35] However, when the second line 1272 intersects with the first boundary map 121 of the region or the second boundary map 123 of the region, the boundary co-ordinates system 101 retains the first line 127i connecting the first co-ordinate 1251 of the plurality of random co-ordinates 125i, 1252, 125s and 1254 and the second co-ordinate 1252 of the plurality of random co-ordinates 1251, 1252, 125s and 1254. Subsequently, the boundary co-ordinates system 101 connects the second co-ordinate 1252 of the plurality of random co-ordinates 125i, 1252, 125s and 1254 and the third co-ordinate 125s of the plurality of random co-ordinates 125i, 1252, 125s and 1254 with a fourth line. Thereafter, the boundary co-ordinates system 101 performs operation from the determination step i.e., determining whether the fourth line intersects with the first boundary map 121 of the region or the second boundary map 123 of the region iteratively for each of subsequent co-ordinates of the plurality of random co-ordinates 125i, 1252, 125s and 1254 to reduce number of boundary co-ordinates required to represent the first boundary map 121 of the region.

[36] With reference to FIG. 1G, the third line 127s intersects the first boundary map 121 of the region. In this case, when the third line 127s intersects with the first boundary map 121 of the region, the boundary co-ordinates system 101 retains the second line 1272 connecting the first co-ordinate 1251 of the plurality of random co-ordinates 1251, 1252, 125s and 1254 and the third co-ordinate 125s of the plurality of random co-ordinates 1251, 1252, 125s and 1254 as shown in FIG. 1H. Subsequently, the boundary co-ordinates system 101 connects the third co-ordinate 125s of the plurality of random co-ordinates 1251, 1252, 125s and 1254 and the fourth co-ordinate 1254 of the plurality of random co-ordinates 1251, 1252, 125s and 1254 with a fifth line 127s. Thereafter, the boundary co-ordinates system 101 performs operation from the determination step i.e., determining whether the fifth line 127s intersects with the first boundary map 121 of the region or the second boundary map 123 of the region iteratively for each of subsequent co-ordinates of the plurality of random co-ordinates 1251, 1252, 125s and 1254 to reduce number of boundary co-ordinates required to represent the first boundary map 121 of the region. An example of the boundary co-ordinates system 101 performing operation iteratively for each of subsequent co-ordinates of the plurality of random co-ordinates 1251, 1252, 125s and 1254 is shown in FIG. II. The final output of the boundary co-ordinates system 101 i.e., a simplified first boundary map 125 of the region formed using minimum number of the plurality of random co-ordinates 1251, 1252, 125s and 1254 is shown in FIG. 1J.

[37] FIG. 2 shows a detailed block diagram of a boundary co-ordinates system in accordance with some embodiments of the present disclosure.

[38] The boundary co-ordinates system 101, in addition to the I/O interface 103 and the processor 107 described above, may include data 201 and one or more modules 211, which are described herein in detail. In the embodiment, the data 201 may be stored within the memory 105. The data 201 may include, for example, offset data 203 and other data 205.

[39] The offset data 203 may include a pre-determined offset value. The pre-determined offset value may be a positive value or a negative value.

[40] The other data 205 may store data, including temporary data and temporary files, generated by one or more modules 211 for performing the various functions of the boundary co-ordinates system 101.

[41] In the embodiment, the data 201 in the memory 105 are processed by the one or more modules 211 present within the memory 105 of boundary co-ordinates system 101. In the embodiment, the one or more modules 211 may be implemented as dedicated hardware units. As used herein, the term module refers to an Application Specific Integrated Circuit (ASIC), an electronic circuit, a Field-Programmable Gate Arrays (FPGA), Programmable System-on-Chip (PSoC), a combinational logic circuit, and/or other suitable components that provide the described functionality. In some implementations, the one or more modules 211 may be communicatively coupled to the processor 107 for performing one or more functions of the boundary co-ordinates system 101. The said modules 211 when configured with the functionality defined in the present disclosure will result in a novel hardware.

[42] In one implementation, the one or more modules 211 may include, but are not limited to, a creating module 213, an identifying module 215, a connecting module 217, a determining 219 and a performing module 221. The one or more modules 211 may, also, include other modules 223 to perform various miscellaneous functionalities of the boundary co-ordinates system 101.

[43] The creating module 213 may create a first boundary map 121 of a region using a plurality of boundary co-ordinates of the region received from the one or more sources 111. The first boundary map 121 of the region may be a real boundary map of the region. Thereafter, the creating module 213 may create a second boundary map 123 adjacent to the first boundary map 121 using the plurality of boundary co-ordinates of the region and a pre-determined offset value. The second boundary map 123 may be created inside the first boundary map 121 of the region or outside the first boundary map 121 of the region. When the pre-determined offset value is a positive value, the second boundary map 123 may be created outside the first boundary map 121 of the region. When the pre-determined offset value is a negative value, the second boundary map 123 may be created inside the first boundary map 121 of the region. In one embodiment, the creating module 213 may create the first boundary map 121 and the second boundary map 123 using algorithm written in Python and MATLAB programming languages.

[44] The identifying module 215 may identify a plurality of random co-ordinates 125i, 1252, 125s and 1254 between the first boundary map 121 and the second boundary map 123.

[45] The connecting module 217 may connect two or more co-ordinates among the plurality of random co-ordinates 125i, 1252, 125s and 1254 identified by the identifying module 215 until the connection between the two or more co-ordinates does not intersect with the first boundary map 121 of the region and the second boundary map 123 of the region. The connection between the two or more co-ordinates may represent a simplified first boundary map 125 of the region formed using minimum number of the plurality of random co-ordinates 1251, 1252, 125s and 1254. For the connecting two or more co-ordinates among the plurality of random co-ordinates 125i, 1252, 125s and 1254, the connecting module 217 may connect a first co-ordinate 1251 of the plurality of random co-ordinates

1251, 1252, 125s and 1254 and a second co-ordinate 1252 of the plurality of random co-ordinates 125i, 1252, 125s and 1254 with a first line. The second co-ordinate 1252 may be a neighbouring co-ordinate to the first co-ordinate 125i. Thereafter, the connecting module 217 may extend the first line to connect the first co-ordinate 1251 of the plurality of random co-ordinates 125i, 1252, 125s and 1254 and a third co-ordinate 125s of the plurality of random co-ordinates 1251, 1252, 125s and 1254 to form a second line. The third co-ordinate 125s may be the neighbouring co-ordinate to the second co-ordinate 1252.

[46] When the second line does not intersect with the first boundary map 121 of the region or the second boundary map 123 of the region, the connecting module 217 may extend the first line to connect the first co-ordinate 1251 of the plurality of random co-ordinates 1251,

1252, 125s and 1254 and a fourth co-ordinate 1254 of the plurality of random co-ordinates 125i, 1252, 125s and 1254 to form a third line. The fourth co-ordinate 1254 may be the neighbouring co-ordinate to the third co-ordinate 125s.

[47] When the second line intersects with the first boundary map 121 of the region or the second boundary map 123 of the region, the connecting module 217 may retain the first line connecting the first co-ordinate 1251 of the plurality of random co-ordinates 1251, 1252, 125s and 1254 and the second co-ordinate 1252 of the plurality of random co-ordinates 1251, 1252, 125s and 1254. Thereafter, the connecting module 217 may connect the second co-ordinate 1252 of the plurality of random co-ordinates 125i, 1252, 125s and 1254 and the third co-ordinate 125s of the plurality of random co-ordinates 125i, 1252, 125s and 1254 with a fourth line.

[48] The determining module 219 may determine whether the second line intersects with the first boundary map 121 of the region or the second boundary map 123 of the region.

[49] The performing module 221 may perform one or more operations based on the determination. For instance, the performing module 221 may perform operation from the determination step iteratively for each of subsequent co-ordinates of the plurality of random co-ordinates 1251, 1252, 125s and 1254 to reduce number of boundary co-ordinates required to represent the first boundary map 121 of the region.

[50] FIG. 3 illustrates a flowchart showing a method for reducing boundary co-ordinates of a region map for detecting an object in the region map in accordance with some embodiments of present disclosure.

[51] As illustrated in FIG. 3, the method 300 includes one or more blocks for reducing boundary co-ordinates of a region map for detecting an obj ect in the region map. The method 300 may be described in the general context of computer executable instructions. Generally, computer executable instructions can include routines, programs, objects, components, data structures, procedures, modules, and functions, which perform particular functions or implement particular abstract data types. [52] The order in which the method 300 is described is not intended to be construed as a limitation, and any number of the described method blocks can be combined in any order to implement the method. Additionally, individual blocks may be deleted from the methods without departing from the scope of the subject matter described herein. Furthermore, the method can be implemented in any suitable hardware, software, firmware, or combination thereof.

[53] At block 301, the creating module 213 may create a first boundary map 121 of a region using a plurality of boundary co-ordinates 125i, 1252, 125s and 1254 of the region received from one or more sources 111. The first boundary map 121 of the region may be a real boundary map of the region.

[54] At block 303, the creating module 213 may create a second boundary map 123 adjacent to the first boundary map 121 using the plurality of boundary co-ordinates 125i, 1252, 125s and 1254 of the region and a pre-determined offset value. The second boundary map 123 may be created inside the first boundary map 121 of the region or outside the first boundary map 121 of the region. When the pre-determined offset value is a positive value, the second boundary map 123 may be created outside the first boundary map 121 of the region. When the pre-determined offset value is a negative value, the second boundary map 123 may be created inside the first boundary map 121 of the region.

[55] At block 305, the identifying module 215 may identify a plurality of random co-ordinates 1251, 1252, 125s and 1254 between the first boundary map 121 and the second boundary map 123.

[56] At block 307, the connecting module 217 may connect two or more co-ordinates among the plurality of random co-ordinates 125i, 1252, 125s and 1254 until the connection between the two or more co-ordinates does not intersect with the first boundary map 121 of the region and the second boundary map 123 of the region. The connection between the two or more co-ordinates may represent a simplified first boundary map 125 of the region formed using minimum number of the plurality of random co-ordinates 1251, 1252, 125s and 1254. The connecting two or more co-ordinates among the plurality of random co-ordinates 125i, 1252, 125s and 1254 may comprises following steps of: [57] the connecting module 217 may connect a first co-ordinate 125i of the plurality of random co-ordinates 125 i, 1252, 125s and 1254 and a second co-ordinate 1252 of the plurality of random co-ordinates 125 i, 1252, 125s and 1254 with a first line. The second co-ordinate 1252 may be a neighbouring co-ordinate to the first co-ordinate 125i.

[58] the connecting module 217 may extend the first line to connect the first co-ordinate 125i of the plurality of random co-ordinates 125i, 1252, 125s and 1254 and a third co-ordinate 125s of the plurality of random co-ordinates 1251, 1252, 125s and 1254 to form a second line. The third co-ordinate 125s may be the neighbouring co-ordinate to the second co-ordinate 1252.

[59] the determining module 219 may determine whether the second line intersects with the first boundary map 121 of the region or the second boundary map 123 of the region.

[60] the performing module 221 may perform one or more operations based on the determination.

[61] When the second line does not intersect with the first boundary map 121 of the region or the second boundary map 123 of the region,

[62] the connecting module 217 may extend the first line to connect the first co-ordinate 125i of the plurality of random co-ordinates 125i, 1252, 125s and 1254 and a fourth co-ordinate 1254 of the plurality of random co-ordinates 1251, 1252, 125s and 1254 to form a third line. The fourth co-ordinate 1254 may be the neighbouring co-ordinate to the third co-ordinate 125s.

[63] the performing module 221 may perform operation from the determination step iteratively for each of subsequent co-ordinates of the plurality of random co-ordinates 1251, 1252, 125s and 1254 to reduce number of boundary co-ordinates required to represent the first boundary map 121 of the region. [64] When the second line intersects with the first boundary map 121 of the region or the second boundary map 123 of the region,

[65] the connecting module 217 may retain the first line connecting the first co-ordinate 125i of the plurality of random co-ordinates 125i, 1252, 125s and 1254 and the second co-ordinate 1252 of the plurality of random co-ordinates 1251, 1252, 125s and 1254.

[66] the connecting module 217 may connect the second co-ordinate 1252 of the plurality of random co-ordinates 125i, 1252, 125s and 1254 and the third co-ordinate 125s of the plurality of random co-ordinates 125i, 1252, 125s and 1254 with a fourth line.

[67] the performing module 221 may perform operation from the determination step iteratively for each of subsequent co-ordinates of the plurality of random co-ordinates 1251, 1252, 125s and 1254 to reduce the number of boundary co-ordinates required to represent the first boundary map 121 of the region.

[68] Some of the technical advantages of the present disclosure are listed below.

[69] In present disclosure, the simplified first boundary map of a region is only few meters away in terms of deviation from a first boundary map (i.e. , original boundary map) of the region, thereby, making this method relatively accurate.

[70] The method for reducing boundary co-ordinates of a region map disclosed in the present disclosure significantly reduces number of co-ordinates required to represent a simplified first boundary map of a region from a first boundary map (i.e., original boundary map) of the region. For instance, using the method disclosed in the present disclosure, the simplified first boundary map of the region may be represented using few co-ordinates without changing the topography of the region instead of millions of co-ordinates typically required for representing the first boundary map (i.e., original boundary map) of the region.

[71] Furthermore, the use of present method reduces memory requirement significantly as only few co-ordinates are required to be stored in a (car) device for representing the first boundary map (i.e., original boundary map) of the region instead of millions of boundary co-ordinates, thereby, making the present method feasible for navigation purpose.

[72] The method for reducing boundary co-ordinates of a region map described in the present disclosure allows fast processing of the boundary coordinates as the method of the present disclosure requires less iterative/multiple refinement steps.

[73] FIG. 4 illustrates a block diagram of an exemplary computer system 400 for implementing embodiments consistent with the present disclosure.

[74] In an embodiment, the computer system 400 may be used to implement the boundary co-ordinates system 101. The computer system 400 may include a central processing unit (“CPU” or “processor”) 402. The processor 402 may include at least one data processor for reducing boundary co-ordinates of a region map for detecting an object in the region map. The processor 402 may include specialized processing units such as, integrated system (bus) controllers, memory management control units, floating point units, graphics processing units, digital signal processing units, etc.

[75] The processor 402 may be disposed in communication with one or more input/ output (I/O) devices (not shown) via I/O interface 401. The I/O interface 401 employ communication protocols/methods such as, without limitation, audio, analog, digital, monoaural, Radio Corporation of America (RCA) connector, stereo, IEEE®-1394 high speed serial bus, serial bus, Universal Serial Bus (USB), infrared, Personal System/2 (PS/2) port, Bayonet Neill-Concelman (BNC) connector, coaxial, component, composite, Digital Visual Interface (DVI), High-Definition Multimedia Interface (HDMI®), Radio Frequency (RF) antennas, S-Video, Video Graphics Array (VGA), IEEE® 802.11b/g/n/x, Bluetooth, cellular e.g., Code-Division Multiple Access (CDMA), High-Speed Packet Access (HSPA+), Global System for Mobile communications (GSM®), Long-Term Evolution (LTE®), Worldwide interoperability for Microwave access (WiMax®), or the like.

[76] Using the I/O interface 401, the computer system 400 may communicate with one or more I/O devices such as input devices 412 and output devices 413. For example, the input devices 412 may be an antenna, keyboard, mousejoystick, (infrared) remote control, camera, card reader, fax machine, dongle, biometric reader, microphone, touch screen, touchpad, trackball, stylus, scanner, storage device, transceiver, video device/source, etc. The output devices 413 may be a printer, fax machine, video display (e.g., Cathode Ray Tube (CRT), Liquid Crystal Display (LCD), Light-Emitting Diode (LED), plasma, Plasma Display Panel (PDP), Organic Light-Emitting Diode display (OLED) or the like), audio speaker, etc.

[77] In some embodiments, the computer system 400 consists of the boundary co-ordinates system 101. The processor 402 may be disposed in communication with the communication network 109 via a network interface 403. The network interface 403 may communicate with the communication network 109. The network interface 403 may employ connection protocols including, without limitation, direct connect, Ethernet (e.g., twisted pair 10/100/1000 Base T), Transmission Control Protocol/Intemet Protocol (TCP/IP), token ring, IEEE® 802.11a/b/g/n/x, etc. The communication network 109 may include, without limitation, a direct interconnection, Local Area Network (LAN), Wide Area Network (WAN), wireless network (e.g., using Wireless Application Protocol), the Internet, etc. Using the network interface 403 and the communication network 109, the computer system 400 may communicate with an ECU 111 of a vehicle. The network interface 403 may employ connection protocols include, but not limited to, direct connect, Ethernet (e.g., twisted pair 10/100/1000 Base T), Transmission Control Protocol/Intemet Protocol (TCP/IP), token ring, IEEE® 802.11a/b/g/n/x, etc.

[78] The communication network 109 includes, but is not limited to, a direct interconnection, a Peer to Peer (P2P) network, Local Area Network (LAN), Wide Area Network (WAN), wireless network (e.g., using Wireless Application Protocol), the Internet, Wi-Fi and such.

[79] In some embodiments, the processor 402 may be disposed in communication with a memory 405 (e.g., RAM, ROM, etc. not shown in FIG. 4) via a storage interface 404. The storage interface 404 may connect to memory 405 including, without limitation, memory drives, removable disc drives, etc., employing connection protocols such as, Serial Advanced Technology Attachment (SATA), Integrated Drive Electronics (IDE), IEEE®-1394, Universal Serial Bus (USB), fiber channel, Small Computer Systems Interface (SCSI), etc. The memory drives may further include a drum, magnetic disc drive, magneto-optical drive, optical drive, Redundant Array of Independent Discs (RAID), solid-state memory devices, solid-state drives, etc.

[80] The memory 405 may store a collection of program or database components, including, without limitation, user interface 406, an operating system 407, etc. In some embodiments, computer system 400 may store user/application data, such as, the data, variables, records, etc., as described in this disclosure. Such databases may be implemented as fault-tolerant, relational, scalable, secure databases such as Oracle or Sybase.

[81] The operating system 407 may facilitate resource management and operation of the computer system 400. Examples of operating systems include, without limitation, APPLE® MACINTOSH® OS X®, UNIX®, UNIX-like system distributions (E G., BERKELEY SOFTWARE DISTRIBUTION® (BSD), FREEBSD®, NETBSD®, OPENBSD, etc ), LINUX® DISTRIBUTIONS (E G., RED HAT®, UBUNTU®, KUBUNTU®, etc ), IBM®OS/2®, MICROSOFT® WINDOWS® (XP®, VISTA®/7/8, 10 etc ), APPLE® IOS®, GOOGLE™ ANDROID™, BLACKBERRY® OS, or the like.

[82] In some embodiments, the computer system 400 may implement web browser 408 stored program components. Web browser 408 may be a hypertext viewing application, such as MICROSOFT® INTERNET EXPLORER®, GOOGLE™ CHROME™, MOZILLA® FIREFOX®, APPLE® SAFARI®, etc. Secure web browsing may be provided using Secure Hypertext Transport Protocol (HTTPS), Secure Sockets Layer (SSL), Transport Layer Security (TLS), etc. Web browsers 408 may utilize facilities such as AJAX, DHTML, ADOBE® FLASH®, JAVASCRIPT®, JAVA®, Application Programming Interfaces (APIs), etc. The computer system 400 may implement a mail server (not shown in FIG. 4) stored program component. The mail server may be an Internet mail server such as Microsoft Exchange, or the like. The mail server may utilize facilities such as ASP, ACTIVEX®, ANSI® C++/C#, MICROSOFT®, NET, CGI SCRIPTS, JAVA®, JAVASCRIPT®, PERL®, PHP, PYTHON®, WEBOBJECTS®, etc. The mail server may utilize communication protocols such as Internet Message Access Protocol (IMAP), Messaging Application Programming Interface (MAPI), MICROSOFT® exchange, Post Office Protocol (POP), Simple Mail Transfer Protocol (SMTP), or the like. The computer system 400 may implement a mail client (not shown in FIG. 4) stored program component. The mail client may be a mail viewing application, such as APPLE® MAIL, MICROSOFT® ENTOURAGE®, MICROSOFT® OUTLOOK®, MOZILLA® THUNDERBIRD®, etc.

[83] Furthermore, one or more computer-readable storage media may be utilized in implementing embodiments consistent with the present disclosure. A computer-readable storage medium refers to any type of physical memory on which information or data readable by a processor may be stored. Thus, a computer-readable storage medium may store instructions for execution by one or more processors, including instructions for causing the processor(s) to perform steps or stages consistent with the embodiments described herein. The term “computer-readable medium” should be understood to include tangible items and exclude carrier waves and transient signals, i.e., be non-transitory. Examples include Random Access Memory (RAM), Read-Only Memory (ROM), volatile memory, non-volatile memory, hard drives, CD ROMs, DVDs, flash drives, disks, and any other known physical storage media.

[84] The described operations may be implemented as a method, system or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof. The described operations may be implemented as code maintained in a “non-transitory computer readable medium”, where a processor may read and execute the code from the computer readable medium. The processor is at least one of a microprocessor and a processor capable of processing and executing the queries. A non-transitory computer readable medium may include media such as magnetic storage medium (e.g., hard disk drives, floppy disks, tape, etc.), optical storage (CD-ROMs, DVDs, optical disks, etc.), volatile and non-volatile memory devices (e.g., EEPROMs, ROMs, PROMs, RAMs, DRAMs, SRAMs, Flash Memory, firmware, programmable logic, etc.), etc. Further, non-transitory computer-readable media include all computer-readable media except for a transitory. The code implementing the described operations may further be implemented in hardware logic (e.g., an integrated circuit chip, Programmable Gate Array (PGA), Application Specific Integrated Circuit (ASIC), etc.).

[85] The terms “an embodiment”, “embodiment”, “embodiments”, “the embodiment”, “the embodiments”, “one or more embodiments”, “some embodiments”, and “one embodiment” mean “one or more (but not all) embodiments of the invention(s)” unless expressly specified otherwise.

[86] The terms “including”, “comprising”, “having” and variations thereof mean “including but not limited to”, unless expressly specified otherwise.

[87] The enumerated listing of items does not imply that any or all of the items are mutually exclusive, unless expressly specified otherwise.

[88] The terms “a”, “an” and “the” mean “one or more”, unless expressly specified otherwise.

[89] A description of an embodiment with several components in communication with each other does not imply that all such components are required. On the contrary, a variety of optional components are described to illustrate the wide variety of possible embodiments of the invention.

[90] When a single device or article is described herein, it will be readily apparent that more than one device/article (whether or not they cooperate) may be used in place of a single device/article. Similarly, where more than one device or article is described herein (whether or not they cooperate), it will be readily apparent that a single device/article may be used in place of the more than one device or article or a different number of devices/articles may be used instead of the shown number of devices or programs. The functionality and/or the features of a device may be alternatively embodied by one or more other devices which are not explicitly described as having such functionality/features. Thus, other embodiments of the invention need not include the device itself.

[91] The illustrated operations of FIG. 3 show certain events occurring in a certain order. In alternative embodiments, certain operations may be performed in a different order, modified or removed. Moreover, steps may be added to the above-described logic and still conform to the described embodiments. Further, operations described herein may occur sequentially or certain operations may be processed in parallel. Yet further, operations may be performed by a single processing unit or by distributed processing units. [92] Finally, the language used in the specification has been principally selected for readability and instructional purposes, and it may not have been selected to delineate or circumscribe the inventive subject matter. It is therefore intended that the scope of the invention be limited not by this detailed description, but rather by any claims that issue on an application based here on. Accordingly, the disclosure of the embodiments of the invention is intended to be illustrative, but not limiting, of the scope of the invention, which is set forth in the following claims. [93] While various aspects and embodiments have been disclosed herein, other aspects and embodiments will be apparent to those skilled in the art. The various aspects and embodiments disclosed herein are for purposes of illustration and are not intended to be limiting, with the true scope being indicated by the following claims.

REFERRAL NUMERALS:

Claims

25 We claim:

1. A method for reducing boundary co-ordinates of a region map for detecting an obj ect in the region map, the method comprising: creating (301), by the boundary co-ordinates system (101), a first boundary map (121) of a region using a plurality of boundary co-ordinates of the region received from one or more sources (111); creating (303), by the boundary co-ordinates system (101), a second boundary map (123) adjacent to the first boundary map (121) using the plurality of boundary co-ordinates of the region and a pre-determined offset value; identifying (305), by the boundary co-ordinates system (101), a plurality of random co-ordinates (125i, 1252, 125s and 1254) between the first boundary map (121) and the second boundary map (123); and connecting (307), by the boundary co-ordinates system (101), two or more co-ordinates among the plurality of random co-ordinates (125i, 1252, 125s and 1254) until the connection between the two or more co-ordinates does not intersect with the first boundary map (121) of the region and the second boundary map (123) of the region, wherein the connection between the two or more co-ordinates represents a simplified first boundary map (125) of the region formed using minimum number of the plurality of random co-ordinates (125i, 1252, 125s and 1254).

2. The method of claim 1, wherein the first boundary map (121) of the region is a real boundary map of the region.

3. The method of claim 1, wherein the second boundary map (123) is created inside the first boundary map (121) of the region or outside the first boundary map (121) of the region.

4. The method of claim 1, wherein when the pre-determined offset value is a positive value, the second boundary map (123) is created outside the first boundary map (121) of the region.

5. The method of claim 1, wherein when the pre-determined offset value is a negative value, the second boundary map (123) is created inside the first boundary map (121) of the region.

6. The method of claim 1, wherein the connecting two or more co-ordinates among the plurality of random co-ordinates (125 i, 1252, 125s and 1254) comprises: connecting, by the boundary co-ordinates system (101), a first co-ordinate (1251) of the plurality of random co-ordinates (125i, 1252, 125s and 1254) and a second co-ordinate (1252) of the plurality of random co-ordinates (1251, 1252, 125s and 1254) with a first line, wherein the second co-ordinate (1252) is a neighbouring co-ordinate to the first co-ordinate (125i); extending, by the boundary co-ordinates system (101), the first line to connect the first co-ordinate (1251) of the plurality of random co-ordinates (125i, 1252, 125s and 1254) and a third co-ordinate (125s) of the plurality of random co-ordinates (1251, 1252, 125s and 1254) to form a second line, wherein the third co-ordinate (1253) is the neighbouring co-ordinate to the second co-ordinate (1252); determining, by the boundary co-ordinates system (101), whether the second line intersects with the first boundary map (121) of the region or the second boundary map (123) of the region; and performing one or more operations based on the determination.

7. The method of claim 6, wherein the one or more operations, when the second line does not intersect with the first boundary map (121) of the region or the second boundary map (123) of the region, comprises: extending, by the boundary co-ordinates system (101), the first line to connect the first co-ordinate of the plurality of random co-ordinates (1251, 1252, 125s and 1254) and a fourth co-ordinate (1254) of the plurality of random co-ordinates (1251, 1252, 125s and 1254) to form a third line, wherein the fourth co-ordinate (1254) is the neighbouring co-ordinate to the third co-ordinate (125s); and performing, by the boundary co-ordinates system (101), operation from the determination step iteratively for each of subsequent co-ordinates of the plurality of random co-ordinates (125i, 1252, 125s and 1254) to reduce number of boundary co-ordinates required to represent the first boundary map (121) of the region.

8. The method of claim 6, wherein the one or more operations, when the second line intersects with the first boundary map (121) of the region or the second boundary map (123) of the region, comprises: retaining, by the boundary co-ordinates system (101), the first line connecting the first co-ordinate (1251) of the plurality of random co-ordinates (125i, 1252, 125s and 1254) and the second co-ordinate (1252) of the plurality of random co-ordinates (1251, 1252, 125s and 1254); connecting, by the boundary co-ordinates system (101), the second co-ordinate (1252) of the plurality of random co-ordinates (125i, 1252, 125s and 1254) and the third co-ordinate (125s) of the plurality of random co-ordinates (1251, 1252, 125s and 1254) with a fourth line, and performing, by the boundary co-ordinates system (101), operation from the determination step iteratively for each of subsequent co-ordinates of the plurality of random co-ordinates (125i, 1252, 125s and 1254) to reduce the number of boundary co-ordinates required to represent the first boundary map (121) of the region.

9. A boundary co-ordinates system (101) for reducing boundary co-ordinates of a region map for detecting an object in the region map, the boundary co-ordinates system (101) comprising: a processor (107); and a memory (105) communicatively coupled to the processor (107), wherein the memory (105) stores processor-executable instructions, which on execution, cause the processor (107) to: create a first boundary map (121) of a region using a plurality of boundary coordinates of the region received from one or more sources (111); create a second boundary map (123) adjacent to the first boundary map (121) using the plurality of boundary co-ordinates of the region and a pre-determined offset value; identify a plurality of random co-ordinates (125i, 1252, 125s and 1254) between the first boundary map (121) and the second boundary map (123); and connect two or more co-ordinates among the plurality of random co-ordinates (125i, 1252, 125s and 1254) until the connection between the two or more 28 co-ordinates does not intersect with the first boundary map (121) of the region and the second boundary map (123) of the region, wherein the connection between the two or more co- ordinates represents a simplified first boundary map (125) of the region formed using minimum number of the plurality of random co-ordinates (1251, 1252, 125s and 1254).

10. The boundary co-ordinates system (101) of claim 9, wherein the first boundary map (121) of the region is a real boundary map of the region.

11. The boundary co-ordinates system (101) of claim 9, wherein the second boundary map (123) is created inside the first boundary map (121) of the region or outside the first boundary map (121) of the region.

12. The boundary co-ordinates system (101) of claim 9, wherein when the pre-determined offset value is a positive value, the second boundary map (123) is created outside the first boundary map (121) of the region, and wherein when the pre-determined offset value is a negative value, the second boundary map (123) is created inside the first boundary map (121) of the region.

13. The boundary co-ordinates system (101) of claim 9 is configured to: connect a first co-ordinate (1251) of the plurality of random co-ordinates (1251, 1252, 125s and 1254) and a second co-ordinate (1252) of the plurality of random co-ordinates (125i, 1252, 125s and 1254) with a first line, wherein the second co-ordinate (1252) is a neighbouring co-ordinate to the first co-ordinate (1251); extend the first line to connect the first co-ordinate (1251) of the plurality of random co-ordinates (125i, 1252, 125s and 1254) and a third co-ordinate (125s) of the plurality of random co-ordinates (125i, 1252, 125s and 1254) to form a second line, wherein the third co-ordinate (125s) is the neighbouring co-ordinate to the second co-ordinate (1252); determine whether the second line intersects with the first boundary map (121) of the region or the second boundary map (123) of the region; and perform one or more operations based on the determination. 29

14. The boundary co-ordinates system (101) of claim 13, wherein when the second line does not intersect with the first boundary map (121) of the region or the second boundary map (123) of the region, the boundary co-ordinates system (101) is configured to: extend the first line to connect the first co-ordinate (1251) of the plurality of random co-ordinates (1251, 1252, 125s and 1254) and a fourth co-ordinate (1254) of the plurality of random co-ordinates (125i, 1252, 125s and 1254) to form a third line, wherein the fourth co-ordinate (1254) is the neighboring co-ordinate to the third co-ordinate (125s); and perform operation from the determination step iteratively for each of subsequent co-ordinates of the plurality of random co-ordinates (125i, 1252, 125s and 1254) to reduce number of boundary co-ordinates required to represent the first boundary map (121) of the region.

15. The boundary co-ordinates system (101) of claim 13, wherein when the second line intersects with the first boundary map (121) of the region or the second boundary map (123) of the region, the boundary co-ordinates system (101) is configured to: retain the first line connecting the first co-ordinate (1251) of the plurality of random co-ordinates (1251, 1252, 125s and 1254) and the second co-ordinate (1252) of the plurality of random co-ordinates (125i, 1252, 125s and 1254); connect the second co-ordinate (1252) of the plurality of random co-ordinates (1251, 1252, 125s and 1254) and the third co-ordinate (125s) of the plurality of random co-ordinates (125i, 1252, 125s and 1254) with a fourth line, and perform operation from the determination step iteratively for each of subsequent co-ordinates of the plurality of random co-ordinates (125i, 1252, 125s and 1254) to reduce the number of boundary co-ordinates required to represent the first boundary map (121) of the region.