US20140314234A1 - Recoverable digital content degradation - Google Patents
Recoverable digital content degradation Download PDFInfo
- Publication number
- US20140314234A1 US20140314234A1 US14/224,469 US201414224469A US2014314234A1 US 20140314234 A1 US20140314234 A1 US 20140314234A1 US 201414224469 A US201414224469 A US 201414224469A US 2014314234 A1 US2014314234 A1 US 2014314234A1
- Authority
- US
- United States
- Prior art keywords
- media signal
- degradation
- key
- data
- embedded
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client
- H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
- H04N21/647—Control signaling between network components and server or clients; Network processes for video distribution between server and clients, e.g. controlling the quality of the video stream, by dropping packets, protecting content from unauthorised alteration within the network, monitoring of network load, bridging between two different networks, e.g. between IP and wireless
- H04N21/64715—Protecting content from unauthorized alteration within the network
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00086—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/234—Processing of video elementary streams, e.g. splicing of video streams, manipulating MPEG-4 scene graphs
- H04N21/23406—Processing of video elementary streams, e.g. splicing of video streams, manipulating MPEG-4 scene graphs involving management of server-side video buffer
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/234—Processing of video elementary streams, e.g. splicing of video streams, manipulating MPEG-4 scene graphs
- H04N21/2347—Processing of video elementary streams, e.g. splicing of video streams, manipulating MPEG-4 scene graphs involving video stream encryption
- H04N21/23476—Processing of video elementary streams, e.g. splicing of video streams, manipulating MPEG-4 scene graphs involving video stream encryption by partially encrypting, e.g. encrypting the ending portion of a movie
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99951—File or database maintenance
- Y10S707/99952—Coherency, e.g. same view to multiple users
- Y10S707/99953—Recoverability
Definitions
- This disclosure discusses degrading digital signals and recovering them using a method and corresponding apparatus that is extremely simple and efficient to implement.
- most configurations of the invented method and apparatus allow self-synchronization, which means the digital content can be recovered when accessed at any random part of the content.
- the invented process also has configurations where the original digital data can be recovered from the degraded digital data with or without the need for a key.
- the degradation level can be controlled such that the digital content can either be previewed in lower quality before buying, or made totally useless.
- the invented degradation process involves searching through the original digital data for detection criteria and then adjusting neighboring points to degrade the content, either without affecting the location of the detection criteria or affecting it in a known fashion so that the original signal may be recovered.
- the detection criteria may include the relationship between several points, or be as simple as a threshold crossing or include every M th point.
- the adjustment of the neighboring points may be as simple as multiplying the point after the threshold crossing by N. It is advantageous if N is less than one but not equal to zero so saturation and data points equal to zero are not a problem, and if the threshold is positive and the data is decreasing towards zero during the threshold crossing.
- the invented recovery process includes searching through the data for the detection criteria and then re-adjusting neighboring points to their original value. For example, if the adjustment in the degradation process uses multiplication by N, the recovery process multiplies by 1/N.
- the corresponding apparatus includes a logical processor and memory unit.
- the logical processor is used to search for the detection criteria, then either adjust to degrade or re-adjust to recover the original data point(s).
- the memory unit is used to hold the previous point(s) necessary to find the criteria location, and the buffer, if using buffered data.
- FIG. 1 is an overview of the degradation and recovery process.
- FIG. 2 is the pseudocode for the degradation and recovery process.
- FIG. 3 is a simple and efficient example of the degradation and recovery process using a threshold crossing and adjusting only the next point.
- FIG. 4 is the pseudocode for the simple and efficient example of the degradation and recovery process.
- FIG. 5 is an overview of the apparatus required to implement the invented process.
- Digital content refers to digital data representing a perceived physical item, including but not limited to audio, video, and images.
- Digital data refers to the grouping of bits (1's or 0's) that represent a sample of the original digital content at an instant in time. Each bit group is equivalently referred to as a data point or sample.
- the data points are arranged in an order, many times representing a sequence versus time or frequency.
- the data points may be grouped again to form a subgroup, possibly used to represent a sequence versus frequency versus time, as is the case in MPEG standard compressed digital audio and video.
- the digital data has an order, with a beginning and end, such that searching the data is possible, and neighboring points can be defined as points close to each other.
- point(s) refer to one or several points.
- FIG. 1 displays an overview of the degradation and recovery process
- FIG. 2 displays the corresponding pseudocode to be implemented by the apparatus.
- the samples are searched for the detection criteria (boxes 200 , 210 and 220 ).
- the searching stops after the last data point in the buffer has been examined (box 210 ), and a new buffer may be presented if available.
- data values must be saved between buffers and properly initialized for the first buffer so as the initial points are properly searched.
- the neighboring data point(s) are adjusted so as to cause content degradation (box 230 ).
- the adjustment of these points should not change the location of the detection criteria or change it in a known fashion; otherwise, the detection of the correct location to re-adjust the data to its original value (recovery) is not easy.
- the degraded data is searched for the detection criteria defined by the degradation process (box 200 , 210 , and 220 ). If the degradation process has changed the detection criteria in a known fashion, then the detection criteria in box 220 for recovery is different than that used in degradation. When the criteria location is found, the neighboring data point(s) are re-adjusted by the inverse of the method used in the degradation process (box 230 ).
- the detection criterion is a threshold crossing (using c-notation: x[n-1]>thr && x[n] ⁇ thr) with a positive threshold (thr>0) while the data goes towards zero (boxes 400 , 410 and 420 ).
- the neighboring point(s) include only the point after the threshold crossing (box 430 ).
- the adjustment involves multiplying the data point after the threshold crossing (x[n]) by N, where N is less than 1 (box 430 ). By reducing the value of this data point, the detection criteria location is not changed.
- synchronization for recovery may require scanning the data for M points until the correct degraded locations are found.
- peak values could be used, and the point after the peak could be reduced in value. As desired, this will not affect the detection criteria for the recovery process.
- threshold crossings with a negative threshold and the data moving towards zero are viable. Again, the data point after the threshold is reduced in absolute value towards but not equal to zero. For these last two cases, synchronization for recovery automatically occurs when searching the data.
- the detection criteria do not change between degrading and recovering the original digital data, this is not an absolute requirement.
- the detection criteria may change, if in a known fashion, such that the recovery process uses a different but known detection criteria than the degradation process. In other words, box 420 (or 220 , as discussed above) would be different for the degradation and recovery process.
- the original content need not be represented by digital samples versus time, as one may have assumed.
- the digital samples represent subgroups of frequencies versus time.
- the data may be searched across frequency for each subgroup, or across time for each frequency, or in any other but well-defined combination.
- the data may also represent either the frequency magnitude or corresponding scaling factors.
- pseudo-random sequences (a.k.a. a key) to set the detection criteria (box 220 ) or the adjustment or re-adjustment of the data (box 230 ).
- This randomness increases the difficulty to illegally recover the data.
- a pseudo-random number greater than zero but less than one could be used as the scaling value N (box 430 ).
- a pseudo-random number between minimum and maximum threshold could be used for the threshold (box 420 ). All that matters is that the degradation and recovery process use the same pseudo-random sequence.
- this configuration requires sending a key along with the data.
- the key may be embedded within the data using known techniques, such that the original data is still recoverable from the degraded data.
- FIG. 5 shows the hardware apparatus required to implement the invented degradation and recovery processes.
- the hardware includes a logic processor 500 and a storage unit 510 .
- the logic processor 500 may be defined as the equivalent of a digital signal processor (DSP), general-purpose central processing unit (CPU), or a specialized CPU, including but not limited to media processors.
- DSP digital signal processor
- CPU general-purpose central processing unit
- a specialized CPU including but not limited to media processors.
- a likely DSP chip is one of the Texas Instruments TMS320 product line.
- a CPU could include one of Intel's Pentium line or Motorola/IBM's PowerPC product line.
- the design of code for controlling logic processor 500 is simple for someone familiar with the state of the art given the above pseudo-code and description.
- the storage unit 510 includes RAM when using a digital processor, and is required to store the current buffer and/or previous point(s) for the detection criteria.
- analog and digital circuitry could include any combination of the following devices: digital-to-analog converters (D/A), comparators, sample-and-hold circuits, delay elements, analog-to-digital converters (A/D), and programmable logic controllers (PLC).
- D/A digital-to-analog converters
- comparators comparators
- sample-and-hold circuits delay elements
- A/D analog-to-digital converters
- PLC programmable logic controllers
- the main advantage of this technology is that it is an extremely simple and efficient method and apparatus to protect content as compared to prior-art scrambling and encryption methods.
Abstract
The disclosure relates generally to processing audio and video signals. One claim recites an apparatus comprising: electronic memory for storing a media signal, the media signal comprising degradation introduced through use of a key, in which the key corresponds to detection criteria in the media signal, and in which the degradation comprises human perceptible degradation, the media signal further comprising the key embedded therein; and a processor programmed for: analyzing the media signal to obtain the key; and removing some of the degradation through use of the key, in which said removing utilizes different detection criteria relative to a process that introduced the degradation into the media signal. Of course, other claims and combinations are provided too.
Description
- This application is a continuation of Ser. No. 13/013,447, filed Jan. 25, 2011 (now U.S. Pat. No. 8,681,980) which is a continuation of Ser. No. 11/096,225, filed Mar. 30, 2005(now U.S. Pat. No. 7,876,899), which is a continuation of U.S. patent application Ser. No. 09/522,678, filed Mar. 10, 2000(now U.S. Pat. No. 6,963,884), which claims the benefit of U.S. Provisional Patent Application No. 60/123,581, filed Mar. 10, 1999. Each of the above patent documents is herein incorporated by reference.
- It is desirable to degrade digital signals in many situations so as to restrict access. For instance, pay-TV broadcasts are degraded so those who haven't paid for the program cannot watch it because the picture is unclear, while those who have paid for the program see a clear picture because their recovery apparatus has been enabled. Most recently, as a result of the digital audio revolution, it is desirable to restrict MP3 (a standard bit-rate compressed audio file format) access. It is also desirable to produce inexpensive portable MP3 players, which in turn require that recovery of the original signal be simple.
- There are numerous existing methods of degrading digital content, a.k.a. scrambling. Some methods require a key to de-scramble the content, whereas others do not. Most scrambling or degrading methods are based upon either adding an interference signal to the digital content, or moving the bits around. Other methods use encryption, but this is very computationally intense.
- This disclosure discusses degrading digital signals and recovering them using a method and corresponding apparatus that is extremely simple and efficient to implement. In addition, most configurations of the invented method and apparatus allow self-synchronization, which means the digital content can be recovered when accessed at any random part of the content. The invented process also has configurations where the original digital data can be recovered from the degraded digital data with or without the need for a key. Finally, the degradation level can be controlled such that the digital content can either be previewed in lower quality before buying, or made totally useless.
- The invented degradation process involves searching through the original digital data for detection criteria and then adjusting neighboring points to degrade the content, either without affecting the location of the detection criteria or affecting it in a known fashion so that the original signal may be recovered. The detection criteria may include the relationship between several points, or be as simple as a threshold crossing or include every Mth point. The adjustment of the neighboring points may be as simple as multiplying the point after the threshold crossing by N. It is advantageous if N is less than one but not equal to zero so saturation and data points equal to zero are not a problem, and if the threshold is positive and the data is decreasing towards zero during the threshold crossing.
- The invented recovery process includes searching through the data for the detection criteria and then re-adjusting neighboring points to their original value. For example, if the adjustment in the degradation process uses multiplication by N, the recovery process multiplies by 1/N.
- The corresponding apparatus includes a logical processor and memory unit. The logical processor is used to search for the detection criteria, then either adjust to degrade or re-adjust to recover the original data point(s). The memory unit is used to hold the previous point(s) necessary to find the criteria location, and the buffer, if using buffered data.
-
FIG. 1 is an overview of the degradation and recovery process. -
FIG. 2 is the pseudocode for the degradation and recovery process. -
FIG. 3 is a simple and efficient example of the degradation and recovery process using a threshold crossing and adjusting only the next point. -
FIG. 4 is the pseudocode for the simple and efficient example of the degradation and recovery process. -
FIG. 5 is an overview of the apparatus required to implement the invented process. - Below please find the definitions to terms and concepts that are used throughout this document. Digital content refers to digital data representing a perceived physical item, including but not limited to audio, video, and images. Digital data refers to the grouping of bits (1's or 0's) that represent a sample of the original digital content at an instant in time. Each bit group is equivalently referred to as a data point or sample. The data points are arranged in an order, many times representing a sequence versus time or frequency. In addition, the data points may be grouped again to form a subgroup, possibly used to represent a sequence versus frequency versus time, as is the case in MPEG standard compressed digital audio and video. Most importantly, the digital data has an order, with a beginning and end, such that searching the data is possible, and neighboring points can be defined as points close to each other. Finally, point(s) refer to one or several points.
-
FIG. 1 displays an overview of the degradation and recovery process, andFIG. 2 displays the corresponding pseudocode to be implemented by the apparatus. - To degrade the digital content (box 100), the samples are searched for the detection criteria (
boxes - When the detection criteria are found, the neighboring data point(s) are adjusted so as to cause content degradation (box 230). The adjustment of these points should not change the location of the detection criteria or change it in a known fashion; otherwise, the detection of the correct location to re-adjust the data to its original value (recovery) is not easy. In addition, it is desirable to prevent the adjustment from causing saturation or resulting in a value of zero, because then the original data point(s) will not be easily recoverable.
- To recover the original digital content (box 110), the degraded data is searched for the detection criteria defined by the degradation process (
box box 220 for recovery is different than that used in degradation. When the criteria location is found, the neighboring data point(s) are re-adjusted by the inverse of the method used in the degradation process (box 230). - An example of this process is shown in
FIGS. 3 and 4 . In this case (boxes 300 and 310), the detection criterion is a threshold crossing (using c-notation: x[n-1]>thr && x[n]<thr) with a positive threshold (thr>0) while the data goes towards zero (boxes - There are additional simplistic detection criteria that can be used. For example, every Mth data point may be degraded. In this case, synchronization for recovery may require scanning the data for M points until the correct degraded locations are found. In addition, peak values could be used, and the point after the peak could be reduced in value. As desired, this will not affect the detection criteria for the recovery process. Alternatively, threshold crossings with a negative threshold and the data moving towards zero are viable. Again, the data point after the threshold is reduced in absolute value towards but not equal to zero. For these last two cases, synchronization for recovery automatically occurs when searching the data.
- Although, in this preferred configuration, the detection criteria do not change between degrading and recovering the original digital data, this is not an absolute requirement. The detection criteria may change, if in a known fashion, such that the recovery process uses a different but known detection criteria than the degradation process. In other words, box 420 (or 220, as discussed above) would be different for the degradation and recovery process.
- The original content need not be represented by digital samples versus time, as one may have assumed. In many cases, such as using MPEG compression (i.e. MP3 audio), the digital samples represent subgroups of frequencies versus time. In this case the data may be searched across frequency for each subgroup, or across time for each frequency, or in any other but well-defined combination. The data may also represent either the frequency magnitude or corresponding scaling factors.
- It is important to note that there are alternative ways to recover the content while removing most of the perceptual degradation caused by this degradation technique. For example, a pirate could use a low-pass filter to render reasonable content from the degraded content. The recovered digital data will not exactly match the original digital data, but its perception may be acceptable. As well know by one familiar with the state of the art in DSP, filter characteristics such as type and order will affect the recovered data.
- Alternatively, one could use pseudo-random sequences (a.k.a. a key) to set the detection criteria (box 220) or the adjustment or re-adjustment of the data (box 230). This randomness increases the difficulty to illegally recover the data. For example, a pseudo-random number greater than zero but less than one could be used as the scaling value N (box 430). Or, a pseudo-random number between minimum and maximum threshold could be used for the threshold (box 420). All that matters is that the degradation and recovery process use the same pseudo-random sequence. However, this configuration requires sending a key along with the data. The key may be embedded within the data using known techniques, such that the original data is still recoverable from the degraded data.
-
FIG. 5 shows the hardware apparatus required to implement the invented degradation and recovery processes. The hardware includes alogic processor 500 and astorage unit 510. Thelogic processor 500 may be defined as the equivalent of a digital signal processor (DSP), general-purpose central processing unit (CPU), or a specialized CPU, including but not limited to media processors. A likely DSP chip is one of the Texas Instruments TMS320 product line. A CPU could include one of Intel's Pentium line or Motorola/IBM's PowerPC product line. The design of code for controllinglogic processor 500 is simple for someone familiar with the state of the art given the above pseudo-code and description. Thestorage unit 510 includes RAM when using a digital processor, and is required to store the current buffer and/or previous point(s) for the detection criteria. - In addition, a person familiar with the state of the art could implement the
logic processor 500 with analog and digital circuitry, either separately or in an application specific integrated circuit (ASIC). The analog and digital circuitry could include any combination of the following devices: digital-to-analog converters (D/A), comparators, sample-and-hold circuits, delay elements, analog-to-digital converters (A/D), and programmable logic controllers (PLC). - In summary, the main advantage of this technology is that it is an extremely simple and efficient method and apparatus to protect content as compared to prior-art scrambling and encryption methods.
- The foregoing descriptions of the preferred embodiments of the technology have been presented to teach those skilled in the art how to best utilize the invention. Many modifications and variations are possible in light of the above teaching. For example, as discussed, there are many detection criteria and adjustment schemes that are similar to those described. To this end, the following claims define the scope and spirit of the currently claimed invention.
Claims (8)
1. An apparatus comprising:
electronic memory for storing a media signal, the media signal comprising embedded degradation data therein, the degradation data having a signal level that is perceptible to a human observer of the media signal when rendered unless removed, in which the media signal remains perceptibly discernable to the human observer despite embedded degradation data,
an input to receive a specific key, the specific key providing self-synchronization allowing for removal of the degradation data including removal when the media signal is accessed randomly;
a processor programmed for removing the embedded degradation data using the specific key to reduce the perceptibility of the degradation data at rendering.
2. The apparatus of claim 1 in which the media signal comprises audio or video.
3. The apparatus of claim 1 in which the removing the embedded degradation data restores the media signal to an original form prior to embedding of the degradation data.
4. The apparatus of claim 1 in which said processor is programmed for controlling rendering of the media signal.
5. An apparatus comprising:
electronic memory for storing a media signal, the media signal comprising degradation introduced through use of a key, in which the key corresponds to detection criteria in the media signal, and in which the degradation comprises human perceptible degradation, the media signal further comprising the key embedded therein;
a processor programmed for:
analyzing the media signal to obtain the key;
removing some of the degradation through use of the key, in which said removing utilizes different detection criteria relative to a process that introduced the degradation into the media signal.
6. The apparatus of claim 5 in which the media signal comprises audio or video.
7. The apparatus of claim 5 in which said processor is programmed for controlling rendering of the media signal.
8. The apparatus of claim 5 in which the media signal including the degradation comprises a signal suitable as a preview of the media signal.
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/224,469 US20140314234A1 (en) | 1999-03-10 | 2014-03-25 | Recoverable digital content degradation |
US15/179,717 US20160293167A1 (en) | 2013-10-10 | 2016-06-10 | Speaker recognition using neural networks |
Applications Claiming Priority (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12358199P | 1999-03-10 | 1999-03-10 | |
US09/522,678 US6963884B1 (en) | 1999-03-10 | 2000-03-10 | Recoverable digital content degradation: method and apparatus |
US11/096,225 US7876899B2 (en) | 1999-03-10 | 2005-03-30 | Recoverable digital content degradation: method and apparatus |
US13/013,447 US8681980B2 (en) | 1999-03-10 | 2011-01-25 | Recoverable digital content degradation |
US14/224,469 US20140314234A1 (en) | 1999-03-10 | 2014-03-25 | Recoverable digital content degradation |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/013,447 Continuation US8681980B2 (en) | 1999-03-10 | 2011-01-25 | Recoverable digital content degradation |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/179,717 Continuation-In-Part US20160293167A1 (en) | 2013-10-10 | 2016-06-10 | Speaker recognition using neural networks |
Publications (1)
Publication Number | Publication Date |
---|---|
US20140314234A1 true US20140314234A1 (en) | 2014-10-23 |
Family
ID=35207110
Family Applications (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/522,678 Expired - Fee Related US6963884B1 (en) | 1999-03-10 | 2000-03-10 | Recoverable digital content degradation: method and apparatus |
US11/096,225 Expired - Fee Related US7876899B2 (en) | 1999-03-10 | 2005-03-30 | Recoverable digital content degradation: method and apparatus |
US13/013,447 Expired - Fee Related US8681980B2 (en) | 1999-03-10 | 2011-01-25 | Recoverable digital content degradation |
US14/224,469 Abandoned US20140314234A1 (en) | 1999-03-10 | 2014-03-25 | Recoverable digital content degradation |
Family Applications Before (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/522,678 Expired - Fee Related US6963884B1 (en) | 1999-03-10 | 2000-03-10 | Recoverable digital content degradation: method and apparatus |
US11/096,225 Expired - Fee Related US7876899B2 (en) | 1999-03-10 | 2005-03-30 | Recoverable digital content degradation: method and apparatus |
US13/013,447 Expired - Fee Related US8681980B2 (en) | 1999-03-10 | 2011-01-25 | Recoverable digital content degradation |
Country Status (1)
Country | Link |
---|---|
US (4) | US6963884B1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114611164A (en) * | 2022-03-18 | 2022-06-10 | 广州威创信息技术有限公司 | Information security management system based on big data |
Families Citing this family (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5748763A (en) * | 1993-11-18 | 1998-05-05 | Digimarc Corporation | Image steganography system featuring perceptually adaptive and globally scalable signal embedding |
US6560349B1 (en) | 1994-10-21 | 2003-05-06 | Digimarc Corporation | Audio monitoring using steganographic information |
US6963884B1 (en) * | 1999-03-10 | 2005-11-08 | Digimarc Corporation | Recoverable digital content degradation: method and apparatus |
US7657064B1 (en) * | 2000-09-26 | 2010-02-02 | Digimarc Corporation | Methods of processing text found in images |
US7779004B1 (en) | 2006-02-22 | 2010-08-17 | Qurio Holdings, Inc. | Methods, systems, and products for characterizing target systems |
US7764701B1 (en) | 2006-02-22 | 2010-07-27 | Qurio Holdings, Inc. | Methods, systems, and products for classifying peer systems |
US7992171B2 (en) * | 2006-09-06 | 2011-08-02 | Qurio Holdings, Inc. | System and method for controlled viral distribution of digital content in a social network |
US7873988B1 (en) | 2006-09-06 | 2011-01-18 | Qurio Holdings, Inc. | System and method for rights propagation and license management in conjunction with distribution of digital content in a social network |
US7801971B1 (en) | 2006-09-26 | 2010-09-21 | Qurio Holdings, Inc. | Systems and methods for discovering, creating, using, and managing social network circuits |
US7925592B1 (en) | 2006-09-27 | 2011-04-12 | Qurio Holdings, Inc. | System and method of using a proxy server to manage lazy content distribution in a social network |
US7782866B1 (en) | 2006-09-29 | 2010-08-24 | Qurio Holdings, Inc. | Virtual peer in a peer-to-peer network |
US8554827B2 (en) | 2006-09-29 | 2013-10-08 | Qurio Holdings, Inc. | Virtual peer for a content sharing system |
US7886334B1 (en) | 2006-12-11 | 2011-02-08 | Qurio Holdings, Inc. | System and method for social network trust assessment |
US7730216B1 (en) | 2006-12-14 | 2010-06-01 | Qurio Holdings, Inc. | System and method of sharing content among multiple social network nodes using an aggregation node |
US8548918B1 (en) | 2006-12-18 | 2013-10-01 | Qurio Holdings, Inc. | Methods and systems for automated content distribution |
JP5140888B2 (en) * | 2007-11-05 | 2013-02-13 | Kddi株式会社 | Digital data playback device |
Family Cites Families (63)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3478166A (en) | 1963-09-09 | 1969-11-11 | Intern Telemeter Corp | Cryptographic subscription television system with grey sync and dual mode augmenting signals |
JPH0266727A (en) * | 1988-08-31 | 1990-03-06 | Toshiba Corp | Electronic equipment |
US5010405A (en) | 1989-02-02 | 1991-04-23 | Massachusetts Institute Of Technology | Receiver-compatible enhanced definition television system |
US5161191A (en) * | 1990-11-27 | 1992-11-03 | Gupta Shanti S | Encryption system for time division multiplexed networks |
US5515451A (en) | 1992-01-08 | 1996-05-07 | Fuji Xerox Co., Ltd. | Image processing system for selectively reproducing documents |
US5721788A (en) | 1992-07-31 | 1998-02-24 | Corbis Corporation | Method and system for digital image signatures |
JPH0827733B2 (en) * | 1993-07-06 | 1996-03-21 | 日本電気株式会社 | Fault handling system |
JPH07212712A (en) | 1993-10-29 | 1995-08-11 | Eastman Kodak Co | Method and equipment for adding and deleting digital watermark in hierarchical picture memory and fetch system |
US5748763A (en) * | 1993-11-18 | 1998-05-05 | Digimarc Corporation | Image steganography system featuring perceptually adaptive and globally scalable signal embedding |
US5636292C1 (en) | 1995-05-08 | 2002-06-18 | Digimarc Corp | Steganography methods employing embedded calibration data |
US5768426A (en) * | 1993-11-18 | 1998-06-16 | Digimarc Corporation | Graphics processing system employing embedded code signals |
US5627885A (en) * | 1994-02-14 | 1997-05-06 | Brooktree Corporation | System for, and method of, transmitting and receiving through telephone lines signals representing data |
US5463351A (en) * | 1994-09-29 | 1995-10-31 | Motorola, Inc. | Nested digital phase lock loop |
US5568570A (en) | 1994-09-30 | 1996-10-22 | Eastman Kodak Company | Method and apparatus for reducing quantization artifacts in a hierarchical image storage and retrieval system |
US6560349B1 (en) | 1994-10-21 | 2003-05-06 | Digimarc Corporation | Audio monitoring using steganographic information |
US5617339A (en) * | 1994-12-02 | 1997-04-01 | International Business Machines Corpoation | Method and apparatus for detecting degradation in data storage system spindle motor performance |
KR0136458B1 (en) * | 1994-12-08 | 1998-05-15 | 구자홍 | Copy protection apparatus of digital magnetic recording and reproducing system |
US5646997A (en) | 1994-12-14 | 1997-07-08 | Barton; James M. | Method and apparatus for embedding authentication information within digital data |
US5612845A (en) * | 1994-12-27 | 1997-03-18 | International Business Machines Corporation | Method and apparatus for in-situ detection of data storage system spindle motor performance degradation |
US5530759A (en) | 1995-02-01 | 1996-06-25 | International Business Machines Corporation | Color correct digital watermarking of images |
US5553142A (en) * | 1995-02-08 | 1996-09-03 | Zenith Electronics Corporation | Audio recovery from scrambled video in a cable compatible television receiver |
US5943422A (en) | 1996-08-12 | 1999-08-24 | Intertrust Technologies Corp. | Steganographic techniques for securely delivering electronic digital rights management control information over insecure communication channels |
US6577746B1 (en) | 1999-12-28 | 2003-06-10 | Digimarc Corporation | Watermark-based object linking and embedding |
US6311214B1 (en) | 1995-07-27 | 2001-10-30 | Digimarc Corporation | Linking of computers based on optical sensing of digital data |
US5644637A (en) * | 1995-09-27 | 1997-07-01 | General Instrument Corporation Of Delaware | Method and apparatus for recovering synchronizing signals in scrambled television pictures |
EP0766468B1 (en) | 1995-09-28 | 2006-05-03 | Nec Corporation | Method and system for inserting a spread spectrum watermark into multimedia data |
US5859920A (en) | 1995-11-30 | 1999-01-12 | Eastman Kodak Company | Method for embedding digital information in an image |
US5719937A (en) | 1995-12-06 | 1998-02-17 | Solana Technology Develpment Corporation | Multi-media copy management system |
US7177429B2 (en) | 2000-12-07 | 2007-02-13 | Blue Spike, Inc. | System and methods for permitting open access to data objects and for securing data within the data objects |
US6061793A (en) | 1996-08-30 | 2000-05-09 | Regents Of The University Of Minnesota | Method and apparatus for embedding data, including watermarks, in human perceptible sounds |
US5870762A (en) * | 1996-09-26 | 1999-02-09 | Lee; Paul | Error detection and recovery of database files |
US5805700A (en) * | 1996-10-15 | 1998-09-08 | Intel Corporation | Policy based selective encryption of compressed video data |
US5875249A (en) | 1997-01-08 | 1999-02-23 | International Business Machines Corporation | Invisible image watermark for image verification |
US6359983B1 (en) * | 1997-04-22 | 2002-03-19 | Silicon Laboratories, Inc. | Digital isolation system with data scrambling |
US6049627A (en) | 1997-05-28 | 2000-04-11 | Thomason Information Services, Inc. | Covert digital identifying indicia for digital image |
JP3269015B2 (en) | 1997-09-18 | 2002-03-25 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Digital watermark system |
JPH11112782A (en) | 1997-09-30 | 1999-04-23 | Canon Inc | Picture processor, its method and computer readable storage medium |
US6021391A (en) * | 1998-03-03 | 2000-02-01 | Winbond Electronics Corp. | Method and system for dynamic data encryption |
JPH11275339A (en) | 1998-03-19 | 1999-10-08 | Ricoh Co Ltd | Image forming device |
US6888943B1 (en) * | 1998-04-21 | 2005-05-03 | Verance Corporation | Multimedia adaptive scrambling system (MASS) |
US6278791B1 (en) | 1998-05-07 | 2001-08-21 | Eastman Kodak Company | Lossless recovery of an original image containing embedded data |
US6021196A (en) | 1998-05-26 | 2000-02-01 | The Regents University Of California | Reference palette embedding |
US6523113B1 (en) | 1998-06-09 | 2003-02-18 | Apple Computer, Inc. | Method and apparatus for copy protection |
US6314433B1 (en) * | 1998-06-12 | 2001-11-06 | Hewlett-Packard Company | Frame-based heroic data recovery |
US6266412B1 (en) * | 1998-06-15 | 2001-07-24 | Lucent Technologies Inc. | Encrypting speech coder |
US6611812B2 (en) | 1998-08-13 | 2003-08-26 | International Business Machines Corporation | Secure electronic content distribution on CDS and DVDs |
US6449623B1 (en) * | 1998-09-04 | 2002-09-10 | Lucent Technologies Inc, | Method and apparatus for detecting and recovering from data corruption of a database via read logging |
GB2363300B (en) | 1998-12-29 | 2003-10-01 | Kent Ridge Digital Labs | Digital audio watermarking using content-adaptive multiple echo hopping |
GB9901522D0 (en) | 1999-01-26 | 1999-03-17 | Bank Of England | Substrates for printing |
US6963884B1 (en) | 1999-03-10 | 2005-11-08 | Digimarc Corporation | Recoverable digital content degradation: method and apparatus |
KR100333163B1 (en) | 1999-03-29 | 2002-04-18 | 최종욱 | Digital watermarking method and apparatus |
JP2002082917A (en) | 2000-07-04 | 2002-03-22 | Sony Computer Entertainment Inc | Contents distribution method, contents distribution server, and client terminal in contents distribution infrastructure |
AU2000260709A1 (en) | 2000-07-05 | 2002-01-14 | Scott A. Moskowitz | Copy protection of digital data combining steganographic and cryptographic techniques |
JP2002062888A (en) | 2000-08-21 | 2002-02-28 | Matsushita Electric Ind Co Ltd | Electronic music processor, electronic music reproducer, and electronic music distribution system |
US20020040323A1 (en) | 2000-09-21 | 2002-04-04 | Hsin-Chin Lee | Method and system for distributing electronic files on a network |
DE10046986A1 (en) * | 2000-09-22 | 2002-04-11 | Bosch Gmbh Robert | Method and device for controlling a vehicle |
JP3587152B2 (en) | 2000-09-25 | 2004-11-10 | 日本電気株式会社 | Image transmission system and method, and recording medium |
GB0027581D0 (en) | 2000-11-10 | 2000-12-27 | Rue De Int Ltd | Image output apparatus an method |
JP3784635B2 (en) | 2000-11-10 | 2006-06-14 | 富士通株式会社 | Data operation method |
EP1215907A3 (en) | 2000-12-07 | 2006-04-26 | Sony United Kingdom Limited | Watermarking material and transferring watermarked material |
JP3596604B2 (en) | 2000-12-07 | 2004-12-02 | 日本電気株式会社 | Output device controller |
JP2002262254A (en) | 2001-03-06 | 2002-09-13 | Nec Microsystems Ltd | Moving picture reproducing device and its method |
US7020775B2 (en) | 2001-04-24 | 2006-03-28 | Microsoft Corporation | Derivation and quantization of robust non-local characteristics for blind watermarking |
-
2000
- 2000-03-10 US US09/522,678 patent/US6963884B1/en not_active Expired - Fee Related
-
2005
- 2005-03-30 US US11/096,225 patent/US7876899B2/en not_active Expired - Fee Related
-
2011
- 2011-01-25 US US13/013,447 patent/US8681980B2/en not_active Expired - Fee Related
-
2014
- 2014-03-25 US US14/224,469 patent/US20140314234A1/en not_active Abandoned
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114611164A (en) * | 2022-03-18 | 2022-06-10 | 广州威创信息技术有限公司 | Information security management system based on big data |
Also Published As
Publication number | Publication date |
---|---|
US7876899B2 (en) | 2011-01-25 |
US20050262162A1 (en) | 2005-11-24 |
US20110182564A1 (en) | 2011-07-28 |
US6963884B1 (en) | 2005-11-08 |
US8681980B2 (en) | 2014-03-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8681980B2 (en) | Recoverable digital content degradation | |
US6298142B1 (en) | Image data encoding system and image inputting apparatus | |
Tian | Reversible watermarking by difference expansion | |
US5778102A (en) | Compression embedding | |
Thodi et al. | Prediction-error based reversible watermarking | |
US7197156B1 (en) | Method and apparatus for embedding auxiliary information within original data | |
US8037311B2 (en) | Digital watermark systems and methods | |
US6748362B1 (en) | Process, system, and apparatus for embedding data in compressed audio, image video and other media files and the like | |
US6208745B1 (en) | Method and apparatus for imbedding a watermark into a bitstream representation of a digital image sequence | |
RU2222114C2 (en) | Hidden character detection | |
US8942416B2 (en) | Method and apparatus for embedding auxiliary information within original data | |
JPH10155151A (en) | Image data processing unit | |
WO2009046438A1 (en) | Media fingerprints that reliably correspond to media content | |
WO1996036935A1 (en) | Compression embedding | |
CA2364433C (en) | Signal processing methods, devices, and applications for digital rights management | |
KR20010034802A (en) | Multimedia adaptive scrambling system | |
EP1001604A2 (en) | Information processing apparatus and method | |
JP3055672B2 (en) | Image data encoding system and image input device | |
JP2004005349A (en) | Signal processor | |
US6963655B1 (en) | Alteration detection apparatus and method thereof | |
US20020176496A1 (en) | Embedding data in material | |
US11308572B1 (en) | Method and system for invisible watermarking of images and video | |
KR100280953B1 (en) | An image data processing apparatus and a program storage recording medium for processing the image data | |
Sanoj | Embedding Audio Message in Images Using Integer Wavelet Transform-A Detailed Survey |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |