Sign In to Follow Application
View All Documents & Correspondence

Large Data Visualization System And Method Thereof

Abstract: The present invention provides a data processing system (100) including a screen and a processor (102). The screen is configured to display a plurality of data points (x, y). The processor (102) is configured to determine a fixed reference point (xf, yf) for displaying data on the screen. The processor (102) receives a data point (x1, y1) to be plotted on the screen. The processor (102) calculates x-offset and y-offset for the data point (x1, y1) with respect to the fixed reference point (xf, yf). The processor (102) plots the data point (x1, y1) on the screen based on the aforementioned x-offset and y-offset without replotting other data points on the screen. Ref. Fig.: Fig. 1

Get Free WhatsApp Updates!
Notices, Deadlines & Correspondence

Patent Information

Application #
Filing Date
14 January 2019
Publication Number
29/2020
Publication Type
INA
Invention Field
COMPUTER SCIENCE
Status
Email
info@krishnaandsaurastri.com
Parent Application

Applicants

Bharat Electronics Limited
Outer Ring Road, Nagavara, Bangalore 560045, Karnataka

Inventors

1. Arun Kumar NR
BSTC/PD&IC, Bharat Electronics Limited, Jalahalli, Bangalore 560013, Karnataka
2. Sandesh J Kolagi
BSTC/PD&IC, Bharat Electronics Limited, Jalahalli, Bangalore 560013, Karnataka
3. Sheshavishnu Prasad D
BSTC/PD&IC, Bharat Electronics Limited, Jalahalli, Bangalore 560013, Karnataka

Specification

DESC:FIELD OF INVENTION
[0001] The present invention relates generally to data processing and specifically to a technique for large data processing, visualization and analysis for higher data rates.
BACKGROUND
[0002] Radars are the most needed technological equipment for the current generation in order to circumvent latest weapons which can pose high threats and cause mass destruction. To track these types of weapons, radars schedule beams at different positions at a very higher rate, typically varying from 3ms to 50ms. Every time a beam is scheduled, a lot of data related to target’s attributes like velocity, position, strength, Noise LJF, filter number, Doppler etc. are available as a response for the beam. To analyze the radar data for functionality and performance, it is necessary to plot this large amount of data and visualize it with respect to different radar attributes.
[0003] While modern day systems and tools are great help in drawing charts, these systems can’t handle data of high rate and are not tailored for specific use cases which the radar data demands because the information of pixels plotted in memory to keep track of it and computing the data point pixels dynamically as and when data is available is complex.
[0004] In a conventional display technique described in EP 0301253 B1, a line generator and a method for determining the individual pixels to be plotted for a line to be drawn in a display system, and to a display system incorporating such a line generator is disclosed. The technique describes pixels drawing line without any performance parameter and not defined at high data rate scenarios.
[0005] In another conventional technique described in US 7006094 B2, an apparatus for efficiently filling an image on a display screen through hardware acceleration is provided. One such device includes a display controller. The display controller includes image generation circuitry configured to generate an address and a color for each pixel of an image to be drawn on a display screen. The image generation circuitry includes pen width selection circuitry configured to identify and select coordinates of adjacent and non-overlapping sectors to an initial footprint of the image on the display screen to be drawn. A system and a method for filling an image on a display screen are also provided. This technique describes pixels drawing image without any performance parameter and is not defined at high data rate scenarios.
[0006] In radar data analysis, when plotting huge data in real-time is of high importance, the time complexity of plotting the data must be as less as possible. A region where time is saved is the computations for filling the pixels on screen. There are many circle filling algorithms available like Bresenham’s circle algorithm, Midpoint circle algorithm etc. which can do this task rightfully in less time. But the algorithmic complexity of these algorithms is non-linear. It’s either quadratic O(n2) or logarithmic - O(nlogn). This is due to the fact that these algorithms compute the pixels that need to be filled at runtime. i.e., If a circle ‘c’ with radius ‘r’ with its center at (x, y) is to be drawn, these algorithms compute the boundaries using operations like multiplication, finding square root etc. This approach provides the flexibility of drawing a circle of any radius, at any given location. However, this approach cannot be used for scenarios of high data rate.
[0007] Thus, there is a need for an improved technique that processes, visualizes, and analyzes data in high data rate scenarios with less computational complexity and high resource efficiency.
SUMMARY
[0008] This summary is provided to introduce concepts related to technique for large data processing, visualization and analysis for higher data rates. This summary is neither intended to identify essential features of the present invention nor is it intended for use in determining or limiting the scope of the present invention.
[0009] In an embodiment of the present invention, a method of visualization of data is provided. The method is implemented by a processor. The method includes determining a fixed reference point (xf, yf) for displaying data on a screen. The processor receives a data point (x1, y1) to be plotted on the screen. The processor calculates x-offset and y-offset for the data point (x1, y1) with respect to the fixed reference point (xf, yf) and plots the data point (x1, y1) on the screen based on the x-offset and y-offset without replotting other data points on the screen.
[0010] In another embodiment of the present invention, a data processing system is provided. The data processing system includes a screen and a processor. The screen is configured to display a plurality of data points (x, y). The processor is configured to determine a fixed reference point (xf, yf) for displaying data on the screen. The processor receives a data point (x1, y1) to be plotted on the screen. The processor calculates x-offset and y-offset for the data point (x1, y1) with respect to the fixed reference point (xf, yf). The processor plots the data point (x1, y1) on the screen based on the aforementioned x-offset and y-offset without replotting other data points on the screen.
[0011] In an exemplary embodiment of the present invention, the processor determines dimensions of a rectangle on the screen. The rectangle is selected by a user. The processor determines an upper bound and a lower bound of the rectangle. The processor converts said upper bound and said lower bound into x-coordinates and y-coordinates to obtain min (x, y) and max (x, y) of the rectangle. The processor determines a plurality of data points (x, y) lying within the range of min (x, y) and max (x, y). The processor displays the plurality of data points (x, y) on the screen without recalculating the x-coordinates and y-coordinates of the plurality of data points (x, y).
[0012] In another exemplary embodiment of the present invention, the data displayed on the screen is a high data rate stream of information.
[0013] In yet another exemplary embodiment of the present invention, the data is displayed on the screen in real-time.

BRIEF DESCRIPTION OF ACCOMPANYING DRAWINGS
[0014] The detailed description is described with reference to the accompanying figures.
[0015] FIG. 1 illustrates a data processing system in accordance with an embodiment of the present invention.
[0016] FIG. 2 illustrates a data processing system in accordance with another embodiment of the present invention
[0017] FIG. 3 illustrates a flow chart depicting an offset plotter technique in accordance with an embodiment of the present invention.
[0018] FIG. 4 illustrates a flow chart depicting an extraction by bounds technique in accordance with an embodiment of the present invention.
[0019] FIG. 5 illustrates a flow chart depicting an offset plotter technique in accordance with another embodiment of the present invention.
[0020] FIG. 6 illustrates a flow chart depicting an extraction by bounds technique in accordance with another embodiment of the present invention.
[0021] 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 invention. Similarly, it will be appreciated that any flow charts, flow diagrams, and the like represent various processes which may be substantially represented in computer readable medium and so executed by a computer or processor, whether or not such computer or processor is explicitly shown.

DETAILED DESCRIPTION
[0022] The various embodiments of the present invention provide a technique for large data processing, visualization and analysis for higher data rates.
[0023] In the following description, for purpose of explanation, specific details are set forth in order to provide an understanding of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced without these details. One skilled in the art will recognize that embodiments of the present invention, some of which are described below, may be incorporated into a number of systems.
[0024] The systems and methods are not limited to the specific embodiments described herein. Further, structures and devices shown in the figures are illustrative of exemplary embodiments of the present invention and are meant to avoid obscuring of the present invention.
[0025] Furthermore, connections between components and/or modules within the figures are not intended to be limited to direct connections. Rather, these components and modules may be modified, re-formatted or otherwise changed by intermediary components and modules.
[0026] References in the present invention to “an embodiment” or “another embodiment” mean that a particular feature, structure, characteristic, or function described in connection with the embodiment is included in at least one embodiment of the invention. The appearances of the phrase “in an embodiment” in various places in the specification are not necessarily all referring to the same embodiment. The phrase “embodiment of the present invention” used in the present invention may refer to various embodiments of the present invention.
[0027] In an embodiment of the present invention, a method of visualization of data is provided. The method is implemented by a processor. The method includes determining a fixed reference point (xf, yf) for displaying data on a screen. The processor receives a data point (x1, y1) to be plotted on the screen. The processor calculates x-offset and y-offset for the data point (x1, y1) with respect to the fixed reference point (xf, yf) and plots the data point (x1, y1) on the screen based on the x-offset and y-offset without replotting other data points on the screen.
[0028] In another embodiment of the present invention, a data processing system is provided. The data processing system includes a screen and a processor. The screen is configured to display a plurality of data points (x, y). The processor is configured to determine a fixed reference point (xf, yf) for displaying data on the screen. The processor receives a data point (x1, y1) to be plotted on the screen. The processor calculates x-offset and y-offset for the data point (x1, y1) with respect to the fixed reference point (xf, yf). The processor plots the data point (x1, y1) on the screen based on the aforementioned x-offset and y-offset without replotting other data points on the screen.
[0029] In an exemplary embodiment of the present invention, the processor determines dimensions of a rectangle on the screen. The rectangle is selected by a user. The processor determines an upper bound and a lower bound of the rectangle. The processor converts said upper bound and said lower bound into x-coordinates and y-coordinates to obtain min (x, y) and max (x, y) of the rectangle. The processor determines a plurality of data points (x, y) lying within the range of min (x, y) and max (x, y). The processor displays the plurality of data points (x, y) on the screen without recalculating the x-coordinates and y-coordinates of the plurality of data points (x, y).
[0030] In another exemplary embodiment of the present invention, the data displayed on the screen is a high data rate stream of information.
[0031] In yet another exemplary embodiment of the present invention, the data is displayed on the screen in real-time.
[0032] In an embodiment, an offset plotter technique and an extraction by bound technique are provided. The offset plotter technique of the present invention along with the extraction by bounds technique changes the way how data is plotted and tracked. In systems handling large amount of data, extraction of information about each particular pixel (which indicates some data) plotted in the graph is essential. For this, it is necessary to store references between the plotted pixels and the data represented thereby. The offset plotter technique of the present invention includes calculating the offsets of the pixels of a point which is to be drawn to represent a data, only once. Simply, the offset plotter resembles a fire and forget tool which does too less computations to draw a circle which represent data. The extraction by bounds technique extracts information about the data represented on a screen without keeping any explicit references between pixels and data.
[0033] In another embodiment, a data processing system is provided. The data processing system is used for plot visualizer with huge data. The data processing system uses the method comprising of the offset Plotter technique and extraction by bounds. The offset plotter technique is a method for faster circle filling; hence helping to reduce plotting time. The extraction by bounds is a method for extracting attributes related to plotted data, when there’s no explicit relationship between plotted pixel and data in the memory. This use case goes hand-in-hand with the offset plotter technique, because, the offset plotter technique just fills the raw pixels on the screen without storing information on what these pixels represent; the extraction by bounds technique is used to find out what these pixels represent. The offset plotter technique and the extraction by bounds technique can be used hand-in-hand in this use-case of huge data plotting.
[0034] The present invention provides a technique for large data processing, visualization and analysis for higher data rates.
[0035] Referring to FIG. 1, a data processing system (100) is shown in accordance with an embodiment of the present invention. The data processing system (100) includes a processor (102), a memory (104), a plurality of input devices (106), a plurality of output devices (108), a communication unit (110), and a bus (112). The bus (112) interconnects various components within the data processing system (100). Examples of the output devices (108) include display screens. In an exemplary embodiment, the output device (108) is a screen.
[0036] The screen is configured to display a plurality of data points (x, y). The processor (102) is configured to determine a fixed reference point (xf, yf) for displaying data on the screen. The processor (102) receives a data point (x1, y1) to be plotted on the screen. The processor (102) calculates x-offset and y-offset for the data point (x1, y1) with respect to the fixed reference point (xf, yf). The processor (102) plots the data point (x1, y1) on the screen based on the aforementioned x-offset and y-offset without replotting other data points on the screen.
[0037] Further, the processor (102) determines dimensions of a rectangle on the screen. The rectangle is selected by a user. The processor (102) determines an upper bound and a lower bound of the rectangle. The processor (102) converts the upper bound and the lower bound into the x-coordinates and the y-coordinates to obtain min (x, y) and max (x, y) of the rectangle. The processor (102) determines a plurality of data points (x, y) lying within the range of min (x, y) and max (x, y). The processor (102) displays the plurality of data points (x, y) on the screen without recalculating the x-coordinates and y-coordinates of the plurality of data points (x, y).
[0038] Referring to FIG. 2, a data processing system (200) is shown in accordance with another embodiment of the present invention. The data processing system (200) includes an offline feed (202), a live radar data feed (204), a player (206), a UDP feed listener (208), an offset plotter (210), and a data visualizer (212).
[0039] The source of data, as shown, are the ‘log files’ or ‘UDP data packets’ UDP data packets can be sent by radar for live data analysis (online analysis). This UDP packet will be received by a UDP listener (208). The ‘log files’ are fed into the log player (206) by the user (214) for offline analysis. These log files are interpreted by the log player (206).
[0040] The UDP listener (208) and the log player (206) filters the data and gives the (x, y) to plot for offset plotter. The offset plotter (210), which knows the offsets of circle of radius ‘r’ to be plotted, displays the pixel on the screen, which can be seen by the user (214), who can interact with the visual display.
[0041] Referring to FIG. 3, a flow chart depicting an offset plotter technique is shown in accordance with an embodiment of the present invention.
[0042] At step 302, the processor (102) determines the fixed reference point (xf, yf) for displaying data on the screen.
[0043] At step 304, The processor (102) receives the data point (x1, y1) to be plotted on the screen.
[0044] At step 306, the processor (102) calculates the x-offset and the y-offset for the data point (x1, y1) with respect to the fixed reference point (xf, yf).
[0045] At step 308, the processor (102) plots the data point (x1, y1) on the screen based on the x-offset and y-offset without replotting other data points on the screen.
[0046] Referring to FIG. 4, a flow chart depicting an extraction by bounds technique is shown in accordance with an embodiment of the present invention.
[0047] At step 402, the processor (102) determines dimensions of the rectangle on the screen.
[0048] At step 404, the processor (102) determines the upper bound and the lower bound of the rectangle.
[0049] At step 406, the processor (102) converts the upper bound and the lower bound into the x-coordinates and the y-coordinates to obtain min (x, y) and max (x, y) of the rectangle.
[0050] At step 408, the processor (102) determines the data points (x, y) lying within the range of min (x, y) and max (x, y).
[0051] At step 410, the processor (102) displays the data points (x, y) on the screen without recalculating the x-coordinates and the y-coordinates of the data points (x, y).
[0052] Referring to FIG. 5, a flow chart depicting an offset plotter technique is shown in accordance with another embodiment of the present invention.
[0053] The offset plotter technique of the present invention along with the extraction by bounds technique of the present invention changes the way how data is plotted and tracked. In systems handling large amount of data, extraction of information about each particular pixel (which indicates some data) plotted in the graph is essential. For this, it is necessary to store references between the plotted pixels and the data represented thereby. The offset plotter technique of the present invention includes calculating the offsets of the pixels of a point which is to be drawn to represent a data, only once. Simply, the offset plotter resembles a fire and forget tool which does too less computations to draw a circle which represent data. The extraction by bounds technique extracts information about the data represented on a screen without keeping any explicit references between pixels and data. The present technique achieves plotting at the rate of 512 data points with periodicity of 5ms or more.
[0054] In an embodiment of the present invention, a method to visualize and analyse huge amount of data by performing least amount of computation is provided. The offset plotter technique is more suitable for applications like radar data plotter and brings down the time complexity to linear time by imposing one restriction: the radius of circles (data points) will be fixed. Whenever any data is received from the radar (or other source) through ethernet, to represent it on the screen at point (x, y) using a circle ‘c’ (or any shape), it is necessary to compute the pixels that belong to c of radius ‘r’, and then fill the pixels with a color to represent the circle. In the offset plotter technique, for any circle ‘c’ of radius ‘r’ assuming (0, 0) as its centre, the pixels that belong to ‘c’ is calculated in prior. This provides pixel offsets. When any data point (x, y) is received from the ethernet, the pixel offsets of x and y are added. This provides the pixels that belong to circle ‘c’ having center at point (x, y). The pixels are filled with desired color. This method saves a large amount of computations. If the points/circles are needed to be re-plotted with a different radius, it’s necessary to calculate the offsets (for once) again, and then re-plot all circles with new pixel offsets. Although calculating pixel offsets has time complexity of O(n2), it’s a one-time operation (for a fixed radius ‘r’) and helps bringing down the plotting time to linear.
[0055] Given below is a demonstration of the math behind Offset plotter:
Finding the Pixel Offsets:
For any radius r>0,
Let pixelXOffsets and pixelYOffsets be list of X and Y offsets respectively.
This gives list of X and Y offsets respectively.
Finding the pixels of a circle given a point (x, y):
Assuming pixelWriter.setColor fills the particular pixel on the screen with given color.
[0056] Referring now to FIG. 6, a flow chart depicting an extraction by bounds technique is shown in accordance with another embodiment of the present invention.
[0057] After the point (x, y) is represented on screen, the user might want to see the attributes associated with that point (like velocity, range etc.). This can be solved by saving in memory explicitly that (x, y) pixel belongs to data ‘d’. But, when there’s huge amount of data, memory consumption might be high to store explicit relationship between each (x, y) of each d. Extraction by bounds solves this use case:
i. User is needed to draw a rectangle on the data ‘d’ of interest.
ii. Calculate the upper-bounds (UB) and lower-bounds (LB) of the drawn rectangle on the screen.
iii. Convert UB and LB to plot coordinates (i.e. with respect to plot’s (x, y)) to calculate UB’ and LB’.
iv. For example, consider there’s a ‘Range vs. Height’ graph at some part of the screen. When user draws a rectangle on the graph, the bounds (min (x, y) and max (x, y)) of the rectangle are captured w.r.t. screen.
v. Convert the bounds captured in above step to chart bounds – UB’ and LB’.
vi. Traverse the list of data points to see which data points fall within bounds UB’ and LB’.
vii. Display the attributes of the data points found.
[0058] The data processing system of the present invention is used for plot visualizer with huge data. The data processing system uses the method comprising of the offset Plotter technique and extraction by bounds. The offset plotter technique is a method for faster circle filling; hence helping to reduce plotting time. The extraction by bounds is a method for extracting attributes related to plotted data, when there’s no explicit relationship between plotted pixel and data in the memory. This use case goes hand-in-hand with the offset plotter technique, because, the offset plotter technique just fills the raw pixels on the screen without storing information on what these pixels represent; the extraction by bounds technique is used to find out what these pixels represent. The offset plotter technique and the extraction by bounds technique can be used hand-in-hand in this use-case of huge data plotting.
[0059] Hence, visualization of large data is necessary to analyse the data patterns and to understand the complex, data intensive systems like C4I, and radar. The tools which are available shall help to visualize, but these tools are not designed to handle huge amount of data in real time. The method of the present invention is a designed to handle large amount of data for rendering in visualization. Large amount of data is plotted in different plots which help to visualize and analyse all the attributes of plots in real time.
[0060] Advantageously, the offset plotting and extraction by bounds techniques of the present invention analyze data in high data rate scenarios without affecting the efficiency of the data processing system. The offset plotting and extraction by bounds techniques of the present invention reduce the number of computations and reduces the time required in the analysis and visualization of the data. The offset plotting and extraction by bounds techniques of the present invention reduce the computing resources required in performing the data analysis in high data rate scenarios, and hence, enhance the efficiency and productivity of the data processing systems. The offset plotting and extraction by bounds techniques of the present invention allow achieving the plotting at the rate of 512 data points with periodicity of 5ms or more. The data processing system of the present invention is more efficient and less complex than the existing data processing systems. The data processing system of the present invention efficiently handles a large volume of data in real-time in high speed.
[0061] The foregoing description of the invention has been set merely to illustrate the invention and is not intended to be limiting. Since modifications of the disclosed embodiments incorporating the spirit and substance of the invention may occur to person skilled in the art, the invention should be construed to include everything within the scope of the invention.
,CLAIMS:
1. A method of visualization of data, comprising:
determining, by a processor, a fixed reference point (xf, yf) for displaying data on a screen;
receiving, by the processor, a data point (x1, y1) to be plotted on the screen;
calculating, by the processor, x-offset and y-offset for the data point (x1, y1) with respect to the fixed reference point (xf, yf); and
plotting, by the processor, the data point (x1,y1) on the screen based on the aforementioned x-offset and y-offset without replotting other data points on the screen.

2. The method as claimed in claim 1, comprising:
determining, by the processor, dimensions of a rectangle on the screen, said rectangle selected by a user;
determining, by the processor, an upper bound and a lower bound of the rectangle;
converting, by the processor, said upper bound and said lower bound into x-coordinates and y-coordinates to obtain min (x, y) and max (x, y) of the rectangle;
determining, by the processor, a plurality of data points (x, y) lying within the range of min (x, y) and max (x, y); and
displaying, by the processor, the plurality of data points (x, y) on the screen without recalculating the x-coordinates and y-coordinates of the plurality of data points (x, y).

3. The method as claimed in claim 1, wherein the data displayed on the screen is a high data rate stream of information.

4. The method as claimed in claim 1, wherein the data is displayed on the screen in real-time.

5. A data processing system, comprising:
a screen configured to display a plurality of data points (x, y); and
a processor configured to:
determine a fixed reference point (xf, yf) for displaying data on the screen,
receive a data point (x1, y1) to be plotted on the screen,
calculate x-offset and y-offset for the data point (x1, y1) with respect to the fixed reference point (xf, yf), and
plotting the data point (x1, y1) on the screen based on the aforementioned x-offset and y-offset without replotting other data points on the screen.

6. The data processing system as claimed in claim 5, wherein the processor is further configured to:
determine dimensions of a rectangle on the screen, said rectangle selected by a user,
determine an upper bound and a lower bound of the rectangle,
convert said upper bound and said lower bound into x-coordinates and y-coordinates to obtain min (x, y) and max (x, y) of the rectangle,
determine a plurality of data points (x, y) lying within the range of min (x, y) and max (x, y), and
display the plurality of data points (x, y) on the screen without recalculating the x-coordinates and y-coordinates of the plurality of data points (x, y).

7. The data processing system as claimed in claim 5, wherein the data displayed on the screen is a high data rate stream of information.

8. The data processing system as claimed in claim 5, wherein the data is displayed on the screen in real-time.

Documents

Application Documents

# Name Date
1 201941001667-FORM 13 [18-02-2025(online)].pdf 2025-02-18
1 201941001667-PROVISIONAL SPECIFICATION [14-01-2019(online)].pdf 2019-01-14
2 201941001667-POA [18-02-2025(online)].pdf 2025-02-18
2 201941001667-FORM 1 [14-01-2019(online)].pdf 2019-01-14
3 201941001667-RELEVANT DOCUMENTS [18-02-2025(online)].pdf 2025-02-18
3 201941001667-DRAWINGS [14-01-2019(online)].pdf 2019-01-14
4 201941001667-FORM 3 [25-04-2019(online)].pdf 2019-04-25
4 201941001667 Reply from Defence.pdf 2023-04-06
5 201941001667-ENDORSEMENT BY INVENTORS [25-04-2019(online)].pdf 2019-04-25
5 201941001667-ABSTRACT [14-09-2022(online)].pdf 2022-09-14
6 201941001667-DRAWING [25-04-2019(online)].pdf 2019-04-25
6 201941001667-CLAIMS [14-09-2022(online)].pdf 2022-09-14
7 201941001667-CORRESPONDENCE-OTHERS [25-04-2019(online)].pdf 2019-04-25
7 201941001667-COMPLETE SPECIFICATION [14-09-2022(online)].pdf 2022-09-14
8 201941001667-DRAWING [14-09-2022(online)].pdf 2022-09-14
8 201941001667-COMPLETE SPECIFICATION [25-04-2019(online)].pdf 2019-04-25
9 201941001667-FORM-26 [04-07-2019(online)].pdf 2019-07-04
9 201941001667-FER_SER_REPLY [14-09-2022(online)].pdf 2022-09-14
10 201941001667-FER.pdf 2022-03-16
10 201941001667-Proof of Right (MANDATORY) [08-07-2019(online)].pdf 2019-07-08
11 201941001667 Correspondence by Office_Defence_18-01-2022.pdf 2022-01-18
11 Correspondence by Agent _Form 26_15-07-2019.pdf 2019-07-15
12 201941001667-FORM 18 [10-02-2021(online)].pdf 2021-02-10
13 201941001667 Correspondence by Office_Defence_18-01-2022.pdf 2022-01-18
13 Correspondence by Agent _Form 26_15-07-2019.pdf 2019-07-15
14 201941001667-FER.pdf 2022-03-16
14 201941001667-Proof of Right (MANDATORY) [08-07-2019(online)].pdf 2019-07-08
15 201941001667-FER_SER_REPLY [14-09-2022(online)].pdf 2022-09-14
15 201941001667-FORM-26 [04-07-2019(online)].pdf 2019-07-04
16 201941001667-COMPLETE SPECIFICATION [25-04-2019(online)].pdf 2019-04-25
16 201941001667-DRAWING [14-09-2022(online)].pdf 2022-09-14
17 201941001667-COMPLETE SPECIFICATION [14-09-2022(online)].pdf 2022-09-14
17 201941001667-CORRESPONDENCE-OTHERS [25-04-2019(online)].pdf 2019-04-25
18 201941001667-CLAIMS [14-09-2022(online)].pdf 2022-09-14
18 201941001667-DRAWING [25-04-2019(online)].pdf 2019-04-25
19 201941001667-ABSTRACT [14-09-2022(online)].pdf 2022-09-14
19 201941001667-ENDORSEMENT BY INVENTORS [25-04-2019(online)].pdf 2019-04-25
20 201941001667-FORM 3 [25-04-2019(online)].pdf 2019-04-25
20 201941001667 Reply from Defence.pdf 2023-04-06
21 201941001667-RELEVANT DOCUMENTS [18-02-2025(online)].pdf 2025-02-18
21 201941001667-DRAWINGS [14-01-2019(online)].pdf 2019-01-14
22 201941001667-POA [18-02-2025(online)].pdf 2025-02-18
22 201941001667-FORM 1 [14-01-2019(online)].pdf 2019-01-14
23 201941001667-PROVISIONAL SPECIFICATION [14-01-2019(online)].pdf 2019-01-14
23 201941001667-FORM 13 [18-02-2025(online)].pdf 2025-02-18

Search Strategy

1 SearchStrategy1667E_17-01-2022.pdf