1. Field
This disclosure relates to providing traffic information including traffic data for a link and using the same.
2. Description of the Related Art
With the advancement in digital signal processing and communication technologies, radio and TV broadcasts are being digitalized. Digital broadcasting enables provision of various information (e.g., news, stock prices, weather, traffic information, etc.) as well as audio and video content.
In one general aspect, a method for identifying traffic information is provided. The method includes receiving traffic data including a first identifier, an amount of time currently taken to traverse a particular link, and information corresponding to a location associated with the particular link. The first identifier enables a determination of a type of the information that is included within the received traffic data. The method also includes determining a type of information included within the received traffic data based on the first identifier and determining current travel time information based on the information included in the received traffic data only if the first identifier enables a determination that the received traffic data includes an amount of time. The method further includes determining location information based on the information that is included in the received traffic data corresponding to the location associated with the particular link and identifying traffic information based on the determined current travel time information and the determined location information.
Implementations may include one or more additional features. For instance, determining current travel time information may include accessing received data corresponding to, among other items, results of measurements made with respect to traffic previously traversing the link, and computing an amount of travel time based on the received data. Determining current travel time information may involve accessing information provided within the received traffic data and recognizing that data as the amount of travel time.
The method may also include receiving information corresponding to a message management structure including information corresponding to a generation time of information reflected in the traffic data. The generation time included within the received message management structure may relate to a plurality of message component structures that correspond to more than one of a predicted or current traffic tendency, a predicted or current amount of traffic, a predicted or current speed, or a predicted or current time to traverse a particular link. Each message component structure may further include an identifier specific to the type of information and the first identifier may be an identifier, in a message component structure, specific to the current travel time amount for the particular link.
Also, in the method, the current travel time information and the location information may be determined in a single step. The location information may be determined before the current travel time information is determined. Receiving traffic data may include decoding the traffic data such that the received traffic data is decoded traffic data. Receiving information corresponding to a current travel time amount may include receiving a value associated with a text description of an amount of travel time, and determining, with the received value, the text description. Receiving information corresponding to a current of travel time amount may include receiving a current amount of travel time for the link including a text descriptor. The amount of time currently taken to traverse a particular link may reflect the current travel time amount.
Further, in the method, the amount of time currently taken to traverse the link may be reflected in a number of seconds. The amount of time currently taken to traverse the link may be reflected in a unit of time that is smaller than a second. The amount of time may be reflected in one or more bytes, each byte including a first portion of the byte which determines a value in terms of minutes and a second portion of the byte, consisting of five or less bits, which determines a number of tens of seconds. Receiving an amount of time may include receiving a flag value that determines whether associated data is in terms of either a first unit or a second unit. The first unit may be minutes and the second unit may be seconds. Receiving an amount of time may include receiving a flag value that determines whether associated data will include one or more additional packets of information. The flag value may indicate that the associated data will be delivered with a single additional byte.
In another general aspect, a method for identifying traffic information is provided. The method includes extracting a traffic information message including message segments and extracting a first component including status information from the extracted traffic information message. The method also includes extracting, from the first component, congestion information for a link from the status information and extracting a second component including status information from the extracted traffic information message. The method further includes extracting, from the second component, speed information for a link from the status information and extracting a third component including status information from the extracted traffic information message. Also, the method further includes extracting, from the third component, travel time information for a link from the status information and identifying, based on the extracted information, congestion information, speed information, and travel time information for the link.
In a further general aspect, an apparatus for identifying traffic information is provided. The apparatus includes an interface configured to receive traffic data including a first identifier, information corresponding to an amount of time currently taken to traverse a particular link, and information corresponding to a location associated with the particular link. The first identifier enables a determination of a type of the information that is included within the received traffic data. The apparatus includes a processor configured to determine a type of information included within the received traffic data based on the first identifier and determining current travel time information based on the information included in the received traffic data only if the first identifier enables a determination that the received traffic data includes an amount of time. The processor is also configured to determine received traffic data includes an amount of time based on the information that is included in the received traffic data corresponding to the location corresponding to the particular link and identify traffic information based on the determined current travel time information and the determined location information.
Implementations may include one or more additional features. For instance, in the apparatus, the processor may be configured to receive traffic data including information corresponding to a version number of information reflected in the traffic data. The version number may be associated with a specific syntax of the data where any one of multiple syntaxes may be used.
Also, in the apparatus, the processor may be configured to receive information corresponding to a message management structure including information corresponding to a generation time of information reflected in the traffic data. The processor may be configured to receive information corresponding to a data length of the received data.
Further, in the apparatus, the processor may be further configured to determine the amount of travel time for a particular link only if the first identifier enables a determination that the traffic data relates to a current travel time for a particular link
The details of one or more implementations are set forth in the accompanying drawings and the description below. Other features will be apparent from the description and drawings, and from the claims.
The accompanying drawings illustrate various implementations.
In the drawings:
a through 4c illustrate average speed on a link, travel time for the link, and syntax for degree of congestion included in the status component of the CTT event container of
a through 5c illustrate structures of a status component delivering average speed on a link;
a through 6e illustrate information structures for travel time for a link;
a and 8b illustrate examples of graphical user interfaces configured to display average speed on a link;
a illustrates an example of a graphical user interface configured to display average speeds on several links with a resolution that is more fine than, e.g., 1.8 km/h; and
b illustrates an example of a graphical user interface configured to display travel times for links.
One such use for digital broadcasts is to satisfy an existing demand for traffic information. Proposals that involve the use of digital broadcasts for this purpose contemplate the use of standardized formatting of traffic information to be broadcast. This approach may be used to enable the use of traffic information receiving terminals made by different manufacturers, which each could be configured to detect and interpret traffic information broadcast in the same way.
As shown in
The message management container 21 may be used for managing date and time information. The time information may include message generation time (e.g., a chronological time indication). The message generation time may be included in every TPEG-CTT message when the corresponding message is transmitted. The CTT event container 22 may include congestion and travel time status and predicted congestion and travel time status of links, i.e., road segments. The congestion and travel time status may include average link speed, link travel time, link delay, or congestion type, etc.
The TPEG-CTT location container 23 may employ various location reference processes. For example, a location reference process using a coordinate system or a location reference process using pre-promised links may be used. When a coordinate system is used, the coordinates (latitudes and longitudes) of the start and end positions of a link for which the TPEG-CTT message is created, may be transmitted. When a reference process using pre-promised links is used, a unique identification for a specific link on a receiving device may be transmitted. For example, a receiving device may include a locally stored network of links, where in each link may be identified by a unique identifier. A link may refer to a road segment which starts and ends at junctions and has no junction in between. The coordinate system may be the WGS 84 model. A text formatted name of the link may be transmitted.
In various implementations, a CTT event container and a TPEG-CTT location container are composed of one or more CTT components. Each of the CTT components may be constructed according to a first syntax if it carries congestion status information while it may be constructed according to a second syntax if the component carries location information.
A CTT event container 22 may be composed of one component or a plurality of CTT components. In various implementations, CTT components including an ID of 80 h (notation ‘h’ means hexadecimal) or 84 h includes one or more status components including basic traffic information such as the average link speed, link travel time, link delay, or congestion type. In the description, specific IDs are described as assignments to structures associated with specific information. The actual value of an assigned ID (e.g., 80 h) is exemplary, and different implementations may assign different values for specific associations or circumstances.
In various implementations, CTT components including an ID of 81 h include one or more status components including predicted CTT status. The predicted CTT status may include predicted average link speed, predicted link travel time, or congestion acceleration tendency. The congestion acceleration tendency may include information indicative of the tendency of congestion status. The congestion acceleration tendency will be described as a type of prediction information as the congestion status in the near future may be predicted from it.
In various implementations, the TPEG-CTT message may comprise CTT components structured to deliver additional information of traffic information. An identifier 8Ah may be assigned to the CTT component carrying additional information, and a language code that is indicative of language used for the additional information may also be included in the CTT component.
Status components may, for example, use 8 bits to transfer average speed on a link, travel time for a link, and/or information about degree of congestion in a format illustrated in FIGS. 4a through 4c. In one implementation, an ID of ‘00’ is assigned to average speed on a link; an ID of ‘01’ is assigned to travel time for a link; and an ID of ‘03’ is assigned to degree of congestion.
A numeric value expressed in units such as, for example, of 0.5 m/s (namely, 1.8 km/h) may be carried in the field 41 for average speed on a link (‘intunti’ denotes size of byte) and a numeric value expressed in units such as, for example, minutes is carried in the field for travel time for a link 42. Information about travel time for a link may be obtained by retrieving the link length from a link information (e.g., link length, linkwidth, etc.) database constructed in the server 100 and dividing the link length by average speed on the corresponding link obtained from traffic information collected from various sources, being provided after further rounding off to the units of minute (e.g., a travel time exceeding 30 seconds is rounded off to one minute).
In one implementation, if average speed on a link is transmitted in the units of 0.5 m/s (1.8 km/h), the allowable range of the speed in 8-bit expression may amount to 0˜459 km/h. Since it may be unnecessary to express the average speed up to a very high value (e.g., beyond 200 km/h), it may be better to consider a very high speed (e.g., average speed higher than 200 km/h) to be resulting from drivers speeding in the corresponding link rather than current traffic condition. Accordingly, from a viewpoint of providing traffic congestion information, it may be useless to provide information indicating up to a very high speed.
On the other hand, in the case of traffic congestion, even 1 km/h difference in the average speed may be an important factor for a driver to choose a particular route. In this respect, a resolution of 1.8 km/h cannot discriminate 1 km/h difference in the average speed. Therefore, when average speed on a link becomes low, the average speed information expressed in units of 0.5 m/s (=1.8 km/h) may not satisfy drivers requirement on the degree of resolution.
Similarly, if travel time for a link is provided in units of minute, round-off error may become large when the length of the link is short. For example, if the link length is 500 meters and average speed on the link is 20 m/s (=72 km/h), travel time for the link will become 25 seconds; if the link length is 1000 meters and average speed on the link is 20 m/s, travel time for the link will become 50 seconds; for another example, if the link length is 2900 meters and average speed on the link is 20 m/s, travel time for the link will be 145 seconds. In these cases, the travel time for the link delivered to the status component corresponds to 0, 1, and 2 minutes, respectively; therefore, the difference between actual travel time and the travel time provided by traffic information amounts to 25, 10, and 25 seconds. These errors may become more prominent in links of short lengths.
Therefore, in various implementations, as to the delivery of information about average speed on a link, the maximum speed is lower than may be introduced to improve resolution in low speed links. Likewise, as to the delivery of information about travel time for a link, information expressed in units of seconds may be permitted an 8 bit representation may be employed for delivering information about travel time for a link expressed in units of seconds; however, additional bits may also be assigned to deliver the information expressed in units second.
As shown in
The unit of 0.25 m/s is, only an arbitrary example; therefore, in order to increase the speed resolution in a link of slow speed, a much lower unit, for example, 0.2 m/s (the maximum allowable speed for representation is 183.6 km/h) or 0.15 m/s (the maximum allowable speed for representation is 137.7 km/h) may be employed. Increasing speed resolution by lowering the speed unit is advantageous for the cases where traffic regulations restrict the maximum speed (e.g., to 110 km/h).
As shown in
The speed resolution may play an important role depending on the magnitude of the average speed on the current link. As described earlier, when the average speed on a link is low, a driver may respond sensitively to a slight change of the average speed, whereas the driver may show lower sensitivity against a slight change of the average speed if the average speed on the link is high. Therefore, in various implementations, a variable speed unit may be employed in accordance with the magnitude of the average speed.
In the implementation of
Specifying the speed resolution with the two different units of 0.5 km/h and 1 km/h in the implementation of
An implementation of a format delivering information about travel time for a link is illustrated in
In the implementation of
In the implementation of
In the implementation of
Additional bits may be assigned through a mechanism such as that shown by
In the implementation of
When the additional one bit does not make up 8 bits in such a way that effective information is carried in the other constituting 7 bits, the 7 bits may be wasted for the sake of simplicity for information processing. Therefore, when effective information is not included in the constituting 7 bits and thus delivered to the status component (ID 0x01), it may be useful to deliver the travel time for a link by 16 bits rather than to additionally deliver the one bit flag only, as shown in
The implementations of
The navigation terminal comprises a tuner 1 for receiving modulated traffic information signals by resonating at the required frequency band, a demodulator 2 for outputting traffic information signals by demodulating the modulated signals from the tuner 1, a TPEG-CTT decoder 3 for obtaining traffic information by decoding the demodulated traffic information signals, a GPS module 8 for calculating the current position (i.e., latitude, longitude, and altitude) by receiving signals from a plurality of satellites, storage structure 4 for storing various graphic data and an electronic map including information on links and nodes, an input unit 9 for receiving user input, a navigation engine 5 for controlling screen display based on the user input, the current position, and obtained traffic information, a memory 5a for storing data temporarily, an LCD panel 7 for displaying data, and an LCD drive 6 for driving the LCD panel 7 according to data to be presented. The input unit 9 may be a touch screen incorporated into the LCD panel 7.
The tuner 1 tunes to the frequency of the signals transmitted by the server 100 and the demodulator 2 demodulates the tuned signals in a predetermined manner. The TPEG-CTT decoder 3 decodes the input demodulated signals into a TPEG message sequence as shown in
The TPEG-CTT decoder 3 extracts data/time and message occurrence time included in the message management container of each TPEG-CTT message and determines if the following container is a CTT event container based on ‘message element’ information (i.e. an identifier). If it is determined that the following container is a CTT event container, the TPEG-CTT decoder 3, by extracting each CTT component and the status component included in the CTT component, provides the navigation engine 5 with the information obtained from the container so that the navigation engine 5 can display congestion and travel time information, which will be described below. Providing the navigation engine 5 with the information may include determining, based on identifiers, that the traffic information includes a message management container including status information within various message components within the message management container. The components may each include different status information associated with different links or locations and identifiers associated with the different status information. The containers and components may each include information associated with a generation time, version number, data length, and identifiers of included information.
The TPEG-CTT decoder 3 then obtains information on the link location about which the previously obtained information is created from the following TPEG-CTT location container. The position information may be, for example, coordinates (i.e., latitudes and longitudes) of the start and end positions or a link ID, depending on the type of the TPEG-CTT location container. If the navigation terminal is equipped with the storage structure 4, the navigation engine 5 finds the link location about which the received information is created with reference to information on each link and node stored in the storage structure 4. The navigation engine 5 may convert the coordinates of the link into the link ID or vice versa.
The navigation engine 5 reads a part of the electronic map centered around the position coordinates received from the GPS module 8 from the storage structure 4 and displays the map on the LCD panel 7 via the LCD drive 6. A particular graphic symbol is displayed at the location corresponding to the current position on the LCD panel 7.
The navigation engine 5 displays the average speed on a link received from the TPEG-CTT decoder 3 at a location corresponding to the coordinates or link ID delivered via the TPEG-CTT location container following the container delivering the average speed information. As shown in
a illustrates an example when average speed on a link is delivered with a resolution finer than 1.8 km/h (e.g., the implementations of
b illustrates an example when travel time for a link is provided along with information expressed in units of seconds (e.g., implementations of
The average speed or travel time for the link may be displayed on the map such as shown in
In the implementations of
According to one implementation for a simplified display, according to the user's choice, average speed on a link may be displayed after throwing away the place values below decimal point. Similarly, as to travel time, only the element in minute may be kept and displayed, the element in second being discarded.
Since the travel time for a link within a decoded status component (ID=01) may have information expressed in units of seconds when the TPEG-CTT decoder 3 delivers the travel time to the navigation engine 5, the TPEG-CTT decoder 3 may deliver two-byte information to the navigation engine 5 either by allocating one byte to each of minute and second or by converting the travel time to seconds. (When 16 bit information expressed in units of seconds is received, the information is delivered as received.) Therefore, when the server 100 also provides travel time for a link as the information expressed in units of seconds (e.g., the implementations of
If the terminal in
The foregoing description has been presented for purposes of illustration. Thus, various implementations with improvements, modifications, substitutions, or additions within the spirit and scope as defined by the following appended claims.
Number | Date | Country | Kind |
---|---|---|---|
10-2005-0086887 | Sep 2005 | KR | national |
10-2005-0097452 | Oct 2005 | KR | national |
The present application claims priority from U.S. provisional application Nos. 60/697,386 filed Jul. 8, 2005, which is titled “Format For Carrying Speed Information Of A Link,” 60/698,481 filed Jul. 13, 2005, which is titled “Format of Link Pass-Time,” and 60/759,963 filed Jan. 19, 2006, which is titled “Traffic Information Providing Method,” the entire contents of which are incorporated herein by reference. The present application also claims priority to Korean application Nos. 10-2005-0086887 filed Sep. 16, 2005 and 10-2005-0097452 filed Oct. 17, 2005 the entire contents of which are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4907159 | Mauge | Mar 1990 | A |
5649297 | Park | Jul 1997 | A |
5662109 | Hutson | Sep 1997 | A |
5933100 | Golding | Aug 1999 | A |
6067499 | Yagyu et al. | May 2000 | A |
6067502 | Hayashida et al. | May 2000 | A |
6075467 | Ninagawa | Jun 2000 | A |
6085137 | Aruga et al. | Jul 2000 | A |
6101443 | Kato et al. | Aug 2000 | A |
6115667 | Nakamura | Sep 2000 | A |
6125323 | Nimura et al. | Sep 2000 | A |
6128571 | Ito et al. | Oct 2000 | A |
6232917 | Baumer | May 2001 | B1 |
6236933 | Lang | May 2001 | B1 |
6324466 | Vieweg | Nov 2001 | B1 |
6401027 | Xu | Jun 2002 | B1 |
6434477 | Goss | Aug 2002 | B1 |
6438490 | Ohta | Aug 2002 | B2 |
6438561 | Israni et al. | Aug 2002 | B1 |
6453230 | Geurts | Sep 2002 | B1 |
6477459 | Wunderlich | Nov 2002 | B1 |
6594576 | Fan | Jul 2003 | B2 |
6597982 | Schmidt | Jul 2003 | B1 |
6610321 | Huang et al. | Aug 2003 | B2 |
6611749 | Berwanger | Aug 2003 | B1 |
6615133 | Boies et al. | Sep 2003 | B2 |
6618667 | Berwanger | Sep 2003 | B1 |
6633808 | Schulz et al. | Oct 2003 | B1 |
6687611 | Hessing et al. | Feb 2004 | B1 |
6741932 | Groth | May 2004 | B1 |
6810321 | Cook | Oct 2004 | B1 |
6873904 | Yamamoto et al. | Mar 2005 | B2 |
6904362 | Nakashima et al. | Jun 2005 | B2 |
6924751 | Hempel et al. | Aug 2005 | B2 |
6970132 | Spilker, Jr. | Nov 2005 | B2 |
6990407 | Mbekeani et al. | Jan 2006 | B1 |
6995769 | Ordentlich et al. | Feb 2006 | B2 |
6996089 | Ruf | Feb 2006 | B1 |
7013983 | Matsumoto et al. | Mar 2006 | B2 |
7047247 | Petzold et al. | May 2006 | B1 |
7106219 | Pearce | Sep 2006 | B2 |
7139467 | Seo et al. | Nov 2006 | B2 |
7139659 | Mbekeani et al. | Nov 2006 | B2 |
7188025 | Hudson | Mar 2007 | B2 |
7251558 | McGrath | Jul 2007 | B1 |
7269503 | McGrath | Sep 2007 | B2 |
7319931 | Uyeki et al. | Jan 2008 | B2 |
7355528 | Yamane et al. | Apr 2008 | B2 |
7373247 | Park | May 2008 | B2 |
7375649 | Gueziec | May 2008 | B2 |
7403852 | Mikuriya et al. | Jul 2008 | B2 |
7609176 | Yamane et al. | Oct 2009 | B2 |
7650227 | Kirk et al. | Jan 2010 | B2 |
7657372 | Adachi et al. | Feb 2010 | B2 |
7668209 | Kim et al. | Feb 2010 | B2 |
7701850 | Kim et al. | Apr 2010 | B2 |
7729335 | Lee et al. | Jun 2010 | B2 |
7739037 | Sumizawa et al. | Jun 2010 | B2 |
7825825 | Park | Nov 2010 | B2 |
7877203 | Mikuriya et al. | Jan 2011 | B2 |
7907590 | Lee et al. | Mar 2011 | B2 |
7940741 | Lee et al. | May 2011 | B2 |
7940742 | Lee et al. | May 2011 | B2 |
20010001848 | Oshizawa et al. | May 2001 | A1 |
20010028314 | Hessing et al. | Oct 2001 | A1 |
20030036824 | Kuroda et al. | Feb 2003 | A1 |
20030083813 | Park | May 2003 | A1 |
20030102986 | Hempel et al. | Jun 2003 | A1 |
20030179110 | Kato | Sep 2003 | A1 |
20040148092 | Kim et al. | Jul 2004 | A1 |
20040198339 | Martin | Oct 2004 | A1 |
20040246888 | Peron | Dec 2004 | A1 |
20040249560 | Kim et al. | Dec 2004 | A1 |
20050027437 | Takenaga et al. | Feb 2005 | A1 |
20050038596 | Yang et al. | Feb 2005 | A1 |
20050081240 | Kim | Apr 2005 | A1 |
20050107944 | Hovestadt et al. | May 2005 | A1 |
20050141428 | Ishikawa | Jun 2005 | A1 |
20050143906 | Ishikawa et al. | Jun 2005 | A1 |
20050198133 | Karaki | Sep 2005 | A1 |
20050206534 | Yamane | Sep 2005 | A1 |
20050209772 | Yoshikawa | Sep 2005 | A1 |
20050231393 | Berger | Oct 2005 | A1 |
20060064233 | Adachi et al. | Mar 2006 | A1 |
20060139234 | Tanaka | Jun 2006 | A1 |
20060143009 | Jost et al. | Jun 2006 | A1 |
20060173841 | Bill | Aug 2006 | A1 |
20060178105 | Kim | Aug 2006 | A1 |
20060178807 | Kato et al. | Aug 2006 | A1 |
20060262662 | Jung et al. | Nov 2006 | A1 |
20060265118 | Lee et al. | Nov 2006 | A1 |
20060268721 | Lee et al. | Nov 2006 | A1 |
20060268736 | Lee et al. | Nov 2006 | A1 |
20060268737 | Lee et al. | Nov 2006 | A1 |
20060271273 | Lee et al. | Nov 2006 | A1 |
20060281444 | Jung et al. | Dec 2006 | A1 |
20070005795 | Gonzalez | Jan 2007 | A1 |
20070019562 | Kim et al. | Jan 2007 | A1 |
20070122116 | Seo et al. | May 2007 | A1 |
20070167172 | Kim et al. | Jul 2007 | A1 |
20080249700 | Kim et al. | Oct 2008 | A1 |
20090125219 | Lee et al. | May 2009 | A1 |
Number | Date | Country |
---|---|---|
197 33 179 | May 1998 | DE |
100 60 599 | Jun 2002 | DE |
101 01 349 | Aug 2002 | DE |
0 725 500 | Aug 1996 | EP |
1 006 684 | Jun 2000 | EP |
1 030 475 | Aug 2000 | EP |
1 041 755 | Oct 2000 | EP |
1 079 353 | Feb 2001 | EP |
1150265 | Jul 2002 | EP |
1 376 512 | Jan 2004 | EP |
1 445 750 | Aug 2004 | EP |
1 460 599 | Sep 2004 | EP |
1587045 | Oct 2005 | EP |
1 049 277 | Feb 2007 | EP |
2 342 260 | Apr 2000 | GB |
09-062884 | Mar 1997 | JP |
11-160081 | Jun 1999 | JP |
2001-082967 | Mar 2001 | JP |
2001-227963 | Aug 2001 | JP |
2001-272246 | Oct 2001 | JP |
2004-164373 | Jun 2004 | JP |
2004-186741 | Jul 2004 | JP |
2004-295736 | Oct 2004 | JP |
2004-355662 | Dec 2004 | JP |
2005-056061 | Mar 2005 | JP |
1998-026123 | Jul 1998 | KR |
10-1999-0025959 | Apr 1999 | KR |
10-2001-0016252 | Mar 2001 | KR |
10-2002-0017535 | Mar 2002 | KR |
2003-009244 | Jan 2003 | KR |
10-2003-0034915 | May 2003 | KR |
10-2003-0037455 | May 2003 | KR |
10-2004-0033141 | Apr 2004 | KR |
10-2004-0084374 | Oct 2004 | KR |
10-2004-0084508 | Oct 2004 | KR |
2004-102056 | Dec 2004 | KR |
10-2005-0037776 | Apr 2005 | KR |
10-2005-0062320 | Jun 2005 | KR |
2005-094879 | Sep 2005 | KR |
10-2006-0002468 | Jan 2006 | KR |
10-0565089 | Mar 2006 | KR |
10-2006-0063563 | Jun 2006 | KR |
10-2006-0063629 | Jun 2006 | KR |
10-2006-0076574 | Jul 2006 | KR |
10-20060129769 | Dec 2006 | KR |
WO 9824079 | Jun 1998 | WO |
WO 9826395 | Jun 1998 | WO |
WO 9826396 | Jun 1998 | WO |
WO 9841959 | Sep 1998 | WO |
WO 0030058 | May 2000 | WO |
WO 0036771 | Jun 2000 | WO |
WO 0039774 | Jul 2000 | WO |
WO 0106478 | Jan 2001 | WO |
WO 0118767 | Mar 2001 | WO |
WO 0118768 | Mar 2001 | WO |
WO 0131497 | May 2001 | WO |
WO 0201532 | Jan 2002 | WO |
WO 0213161 | Feb 2002 | WO |
WO 02082402 | Oct 2002 | WO |
WO2004036545 | Apr 2004 | WO |
WO 2004066239 | Aug 2004 | WO |
WO 2005020576 | Mar 2005 | WO |
Entry |
---|
Tristan Ferne BBC, TPEG C++ Library Documentation (v2.0), Mar. 20, 2002. |
Bev Marks, TPEG-standardized at last, Oct. 2005. |
ISO/TS techincal specification, TTI via TPEG-XML part 1, Apr. 2006. |
TPEG C++ Library Documentation, Mar. 20, 2002. |
International Search Report dated Sep. 6, 2006 for Application No. PCT/KR2006/001834, 1 page. |
International Search Report dated Oct. 19, 2006 for Application No. PCT/KR2006/001835, 2 pages. |
International Search Report dated Aug. 28, 2006 for Application No. PCT/KR2006/001859, 1 page. |
International Search Report dated Sep. 27, 2006 for Application No. PCT/KR2006/001837, 2 pages. |
International Search Report dated Aug. 28, 2006 for Application No. PCT/KR2006/001860, 1 page. |
European Search Report dated Aug. 11, 2008 for Application No. 06747441.1, 8 pages. |
European Search Report dated Sep. 25, 2008 for Application No. 06747435.3, 8 pages. |
European Search Report dated Jun. 30, 2008 for Application No. 06747440.3, 10 pages. |
European Search Report dated Oct. 15, 2008 for Application No. 06747434.6, 8 pages. |
European Search Report dated Aug. 14, 2008 and Jul. 28, 2008 for Application No. 06747433.8, 11 pages. |
Office Action dated Jan. 2, 2009 for U.S. Appl. No. 11/419,095. 32 pages. |
Korean Office Action dated Nov. 15, 2006 for Application No. KR 10-2005-0086890, 3 pages. |
European Search Report dated Sep. 30, 2008 for Application No. 06747474.2, 8 pages. |
International Search Report dated Oct. 19, 2006 for Application No. PCT/KR2006/002068, 1 page. |
European Search Report dated Jul. 30, 2008 for Application No. 06747437.9, 9 pages. |
International Search Report dated Aug. 28, 2006 for Application No. PCT/KR2006/001836, 1 page. |
International Search Report dated Sep. 6, 2006 for Application No. PCT/KR2006/001843, 9 pages. |
International Search Report dated Apr. 25, 2007 for Application No. PCT/KR2007/000324, 7 pages. |
International Search Report dated May 8, 2007 for Application No. PCT/KR2007/000318, 7 pages. |
Office Action dated Feb. 24, 2009 for U.S. Appl. No. 11/419,127, 37 pages. |
Office Action dated Apr. 3, 2009 for U.S. Appl. No. 11/419,164, 44 pages. |
Office Action issued in U.S. Appl. No. 11/419,127 mailed Feb. 24, 2009. |
Office Action issued in U.S. Appl. No. 11/419,164 mailed Apr. 3, 2009. |
U.S. Office Action dated Jul. 22, 2009 for U.S. Appl. No. 11/419,127, 18 pages. |
U.S. Office Action dated Jul. 31, 2009 for U.S. Appl. No. 11/419,095; 30 pages. |
European Search Report dated Nov. 17, 2008 for Application No. 06747441.1, 7 pages. |
European Search Report dated Sep. 4, 2009 for Application No. 09165793.2-2215, 9 pages. |
Office Action issued in U.S. Appl. No. 11/419,164 dated Oct. 1, 2009, 30 pages. |
Office Action issued in U.S. Appl. No. 11/419,178 dated Sep. 3, 2009, 10 pages. |
European Search Report dated Oct. 23, 2009 for Application No. 09170601.0-2215. |
European Search Report dated Oct. 26, 2009 for Application No. 0970878.4.0-2215. |
Notice of Allowance issued in U.S. Appl. No. 11/419,095 dated Dec. 3, 2009. |
Office Action issued in U.S. Appl. No. 11/419,127 dated Dec. 14, 2009. |
European Search Report dated Nov. 4, 2009 issued in European Application No. 09171279.4-2215, 7 pages. |
“TPEG TEC Application Specification,” Working Document, Development Project, Mobile.Info, Mar. 9, 2006, 30 pages. |
European Office Action and Search Report issued in Application No. 09159699.9-2215 dated Jun. 26, 2009. |
European Search Report dated Jun. 20, 2008 for Application No. 06747461.9, 8 pages. |
International Search Report dated Sep. 6, 2006 for Application No. PCT/KR2006/2002012, 2 pages. |
Office Action issued in U.S. Appl. No. 11/419/187 dated Feb. 19, 2010, 30 pages. |
Office Action issued in U.S. Appl. No. 11/419,164 dated Mar. 11, 2010, 32 pages. |
U.S. Office Action dated Jun. 7, 2010 for U.S. Appl. No. 11/419,127, 24 pages. |
U.S. Office Action dated Jul. 1, 2010 for U.S. Appl. No. 11/914,682, 11 pages. |
U.S. Notice of Allowance dated Jul. 21, 2010 for U.S. Appl. No. 11/419,164, 15 pages. |
U.S. Notice of Allowance dated Aug. 9, 2010 for U.S. Appl. No. 11/419,095, 17 pages. |
U.S. Final Office Action dated Aug. 13, 2010 for U.S. Appl. No. 11/419,187, 16 pages. |
U.S. Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/419,127 dated Dec. 13, 2010, 17 pages. |
U.S. Non-Final Office Action dated Feb. 3, 2011 for Application No. 11/419,178, 12 pp. |
U.S. Notice of Allowance for U.S. Appl. No. 11/419,127 dated Aug. 23, 2010 (17 pages). |
U.S. Notice of Allowance for U.S. Appl. No. 11/419,164 dated Sep. 8, 2010 (11 pages). |
U.S. Office Action for U.S. Appl. No. 11/419,187 dated Aug. 13, 2010 (16 pages). |
US Notice of Allowance dated Apr. 8, 2011 for U.S. Appl. No. 11/624,424, 9 pages. |
Korean Notice of Allowance dated Mar. 7, 2013 for Application No. 10-2006-0055870, with English Translation, 3 pages. |
US Notice of Allowance dated Aug. 1, 2011 for U.S. Appl. No. 11/419,178, 11 pages. |
Korean Notice of Allowance dated Jan. 27, 2012 for Application No. 10-2005-0097452, with English Translation, 3 pages. |
Number | Date | Country | |
---|---|---|---|
20070019562 A1 | Jan 2007 | US |
Number | Date | Country | |
---|---|---|---|
60697386 | Jul 2005 | US | |
60698481 | Jul 2005 | US | |
60759963 | Jan 2006 | US |