text:
|Publication number
|Publication type
|Application number
|Publication date
|May 3, 2005
|Filing date
|Jun 29, 2004
|Priority date
|Apr 24, 2001
|Fee status
|Also published as
|Publication number
|Ramarathnam Venkatesan, M. Kivanc Mihcak
|Original Assignee
|Microsoft Corporation
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (27), Non-Patent Citations (18), Referenced by (3), Classifications (16), Legal Events (6)
|External Links: USPTO, USPTO Assignment, Espacenet
This application is a continuation of and claims priority to U.S. patent application Ser. No. 09/843,287, filed Apr. 24, 2001, the disclosure of which is incorporated by reference herein.
This invention generally relates to a technology facilitating the protection of rights in the content of a video sequence. This invention further generally relates to a technology facilitating embedding imperceptible, de-synchronization-resistant watermarks in video sequence and facilitating detecting such watermarks.
A "video sequence" is a series of images that typically capture (or simulate) motion, life, action, movement, etc. The video sequences are typically accompanied by audio. Watermarking a video sequence presents a series of significant challenges that are greater than those faced when watermarking other "digital goods."
"Digital goods" is a generic label for electronically stored or transmitted content. Examples of digital videos include images, audio clips, video, digital film, multimedia, software, and data.
A video sequence is a specific type of digital videos. It may also be called a "digital video," "video signal," "video bitstream," "video stream," "streaming video," "video media," "video object," "video," "digital film," "digital movie," and the like. The emerging field of "digital film" is a high-quality form of video.
Digital videos are often distributed to consumers over private and public networks—such as Intranets and the Internet. In particular, they may be "broadcast" via streaming video of a live or recorded event. In addition, these videos are distributed to consumers via fixed computer readable media, such as a compact disc (CD-ROM), digital versatile disc (DVD), soft magnetic tape, soft magnetic diskette, or hard magnetic disk (e.g., a preloaded hard drive).
Digital videos maybe stored in one or many different formats. Some of the more common multimedia file formats include: MPEG, Video of Windows«, QuickTime™, RealVideo™, Shockwave™, and the like.
Unfortunately, it is relatively easy for a person to pirate the pristine digital content of a digital video at the expense and harm of the content owners. Content owners include the content author, artist, publisher, developer, distributor, etc. The content-based industries (e.g., entertainment, music, film, television, etc.) that produce and distribute content are plagued by lost revenues due to digital piracy.
Modern digital pirates effectively rob content owners of their lawful compensation. Unless technology provides a mechanism to protect the rights of content owners, the creative community and culture will be impoverished.
Watermarking is one of the most promising techniques for protecting the content owner's rights of a digital video. Generally, watermarking is a process of altering the digital video such that its perceptual characteristics are preserved. More specifically, a "digital watermark" (or simply "watermark") is a pattern of bits inserted into a digital video that may be used to identify the content owners and/or the protected rights.
Watermarks are designed to be completely invisible or, more precisely, to be imperceptible to humans and statistical analysis tools. Ideally, a watermarked video signal is perceptually identical to the original video signal.
A watermark embedder (i.e., encoder) embeds a watermark into a digital video. It typically uses a secret key to embed the watermark. A watermark detector (i.e., decoder) extracts the watermark from the watermarked digital video.
To detect the watermark, some watermarking techniques require access to the original unmarked digital video or to a pristine specimen of the marked digital video. Some, watermarking techniques are "blind." This means that they do not require access to the original unmarked digital video or to a pristine specimen of the marked digital video. Of course, these "blind" watermarking techniques are desirable when the watermark detector is publicly available.
Before detection, a watermarked signal may undergo many possible changes by users and by the distribution environment. These changes may include unintentional modifications, such as noise and distortions. Moreover, the marked signal is often the subject of malicious attacks particularly aimed at disabling the detection of the watermark.
Ideally, a watermarking technique should embed detectible watermarks that resist modifications and attacks as long as they result in signals that are of perceptually the same quality. A watermarking technique that is resistant to modifications and attacks may be called "robust." Aspects of such techniques are called "robust" if they encourage such resistance.
Generally speaking, a watermarking system should be robust enough to handle unintentional noise introduction into the signal (such noise my be introduced by A/D and D/A conversions, compressions/decompressions, data corruption during transmission, etc.)
Furthermore, a watermarking system should be robust enough and stealthy enough to avoid purposeful and malicious detection, alternation, and/or deletion of the watermark. Such attack may use a "shotgun" approach where no specific watermark is known or detected (but is assumed to exist) or may use "sharp-shooter" approach where the specific watermark is attacked.
Those of ordinary skill in the art are familiar with conventional techniques and technology associated with watermarks, watermark embedding, and watermark detecting. In addition, those of ordinary skill in the art are familiar with the typical problems associated with proper watermark detection after a marked signal has undergone changes (e.g., unintentional noise and malicious attacks).
Herein, such a digital watermark may be simply called a "watermark." Generically, it may be called an "information pattern of discrete values."
Desiderata of Watermarking Technology
Watermarking technology has several highly desirable goals (i.e., desiderata) to facilitate protection of copyrights of video content publishers. Below are listed several of such goals.
Perceptual Invisibility. The embedded information should not induce perceptual changes in the video quality of the resulting watermarked signal. The test of perceptual invisibility is often called the "golden eyes and ears" test.
Statistical Invisibility. The embedded information should be quantitatively imperceptive for any exhaustive, heuristic, or probabilistic attempt to detect or remove the watermark. The complexity of successfully launching such attacks should be well beyond the computation power of publicly available computer systems. Herein, statistical invisibility is expressly included within perceptual invisibility.
Tamperproofness. An attempt to remove the watermark should damage the value of the video well above the hearing threshold.
Cost. The system should be inexpensive to license and implement on both programmable and application-specific platforms.
Non-disclosure of the Original. The watermarking and detection protocols should be such that the process of proving video content copyright both in-situ and in-court, does not involve usage of the original recording.
Enforceability and Flexibility. The watermarking technique should provide strong and undeniable copyright proof. Similarly, it should enable a spectrum of protection levels, which correspond to variable video presentation and compression standards.
Resilience to Common Attacks. Public availability of powerful digital video editing tools imposes that the watermarking and detection process is resilient to attacks spawned from such consoles.
Hard-to-Break. A watermark is "hard-to-break" when it is "extremely hard" for an attacker to break the watermark even though the attacker may know watermarking technique. Here, "breaking" refers to successfully modifying or removing the watermark. In particular, it should be nearly impossible to break the mark under almost all practical situations even if an attacker has a supercomputer.
Watermark Circumvention
In general, there are two common classes of malevolent attacks:
A video is a series of video "frames." Each frame of the video is an image. Since videos are a series of images, one way to watermark a video is to embed a watermark (wholly or partially) in each frame (or a significant number) of the video.
As mentioned earlier, watermarking a video sequence presents a series of significant challenges that are greater than those faced when watermarking other "digital goods." Particular examples of these challenges include perceptual invisibility and resistance to de-synchronization attacks. Although watermarking other types of media (e.g., images and audio) also faces these challenges, the problems of perceptual invisibility and resistance to de-synchronization are particularly acute and specifically unique for videos.
De-Synchronization Attacks
The watermark (or portions thereof) may be embedded into each frame of the video. However, the chances of a digital pirate discovering the watermark increases as the watermark repetition increases. Embedding the watermark (or portions thereof) in each frame is also undesirable because it provides convenient range for the pirate to focus her efforts. In addition, it provides potentially thousands of bounded targets (i.e., frames) containing the same hidden data (i.e., the watermark). With this much bounded information, a digital pirate has a good chance of determining the watermark.
To overcome this problem, watermarks (or portions thereof) may be selectively encoded in individual frames or groups of frames within the video. To find the encoded information later, the detector typically must be synchronized along the temporal axis so that it know where (or when) to look for the watermarks. Digital pirates know this. A de-synchronization attack is one of their most watermark-fatal arrows in their quiver. In addition, de-synching may occur unintentionally particularly when video signal is transmitted.
Resisting de-synchronization is a particularly difficult challenge in the video realm. A pirate may, for example, do any of the following to de-synch a video:
If this de-synch attack splits a series of frames in which the full watermark is encoded, then the watermark may go undetected. If this attack manages to remove the isolated frames including the watermarks, then the watermark may go undetected.
Perceptual Invisibility
As mentioned above, a watermark should be perceptually invisible (which include statistically invisible) within the signal. Achieving perceptual invisibility is a particularly difficult challenge in the video realm.
Typically, a series of successive frames have one or more common sections. These common sections contain the same image data. For example, if the camera capturing the video frames is fixed on relatively stationary objects or people, then the vast majority of each frame will be identical. Typically, if the camera is fixed, the background remains identical in each frame.
If the watermark (or portions thereof) is not encoded in every frame of the video, then some frames will have no portion of the watermark encoded therein. Consequently, there will be a transition between encoded frames and non-encoded frames. Typically, perceptible "flicker" occurs at that transition. Flicker is the perceptible manifestation of the transition. This problem is particular to video.
Flicker may be visible to the human eye. If not, it may be noticeable by statistical analysis tools. Since watermark encoding introduces "noise" into a frame, the transition from "noisy" to "noiseless" frame produces perceptible flicker in the common sections of the frames of that transition.
Armed with the knowledge of flickering, a digital pirate can focus her attack on the frames in and around transitions.
Framework to Thwart Attacks
Accordingly, there is a need for a new framework for hiding and detecting watermarks in digital video signals that is effective against unintentional and intentional modifications. In particular, the framework should be resistant to de-synchronization. The framework should possess several attributes that further the desiderata of watermark technology, described above. In particular, it should be perceptually invisible; thus, it should minimize or eliminate flicker.
Described herein is a technology facilitating the protection of rights in the content of a video sequence. This technology further generally relates to a technology facilitating embedding imperceptible, de-synchronization-resistant watermarks in video sequence and facilitating detecting such watermarks.
One or more implementations, described herein, hide and/or detect stealthy and robust watermarks in digital video signals. These watermarks are resistant against unintentional and intentional modifications. In particular, the watermarks are resistant to de-synchronization. In addition, the watermarks are perceptually invisible. The watermarks are hidden in the video so that flicker is minimized or eliminated.
More specifically, one or more implementations, described herein, hide a watermark (of portions thereof) over one or more regions of successive frames. Each region has a center defined by a hash value. A watermark (of portions thereof) is encoded into the region in a "plateau" manner. The mark (of portions thereof) is filly encoded in the frames surrounding the region's center, but trail off towards the edges of the region.
This summary itself is not intended to limit the scope of this patent. Moreover, the title of this patent is not intended to limit the scope of this patent. For a better understanding of the present invention, please see the following detailed description and appending claims, taken in conjunction with the accompanying drawings. The scope of the present invention is pointed out in the appending claims.
The same numbers are used throughout the drawings to reference like elements and features.
In the following description, for purposes of explanation, specific numbers, materials and configurations are set forth in order to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art that the present invention may be practiced without the specific exemplary details. In other instances, well-known features are omitted or simplified to clarify the description of the exemplary implementations of present invention, thereby better explain the present invention. Furthermore, for ease of understanding, certain method steps are delineated as separate steps; however, these separately delineated steps should not be construed as necessarily order dependent in their performance.
The following description sets forth one or more exemplary implementations of Robust and Stealthy Video Watermarking that incorporate elements recited in the appended claims. These implementations are described with specificity in order to meet statutory written description, enablement, and best-mode requirements. However, the description itself is not intended to limit the scope of this patent.
The inventors intend these exemplary implementations to be examples. The inventors do not intend these exemplary implementations to limit the scope of the present invention. Rather, the inventors have contemplated that the present invention might also be embodied and implemented in other ways, in conjunction with other present or future technologies.
An example of an embodiment of Robust and Stealthy Video Watermarking may be referred to as an "exemplary video watermaker."
Incorporation by Reference
The following co-pending patent applications are incorporated by reference herein (which are all assigned to the Microsoft Corporation):
The one or more exemplary implementations, described herein, of the present invention may be implemented (whole or in part) by a video watermarking architecture 200 and/or by a computing environment like that shown in FIG. 7.
Herein, references to embedding or detecting a watermark expressly includes the embedding or detecting of a portion of a watermark. Portions of the watermark may, for example, be embedded in a single frame. The collection of such frames may constitute the entire watermark. Moreover, references herein to watermarks expressly include any information data patterns.
With the exemplary video watermaker, the watermarks are encoded (e.g., embedded) over regions of successive frames. These regions include successive adjacent frames. These regions may also be called "temporal regions" since the frames typically fall into a specific time sequence in the video signal. Herein, they may also be called "sequence regions" and "neighbor regions."
A marked video includes multiple regions. The centers of each are apparently randomly selected. The watermark is encoded into the region in a "plateau" manner. The region is approximately plateau shaped. This means that the watermark is fully encoded in the frames surrounding the region's center, but trail off towards the edges of the region.
Typically, the watermark detection of the exemplary video watermaker approximately locates the center of each region. Since the watermark is encoded over a region of frames (rather than isolated single frames), the watermark detection system can find the embedded mark anywhere within the region. This is true even when it fails to locate the exact center of the region because of de-synchronization. In context of sequence regions that are approximately plateau shaped, they may be called "plateau regions," "watermark plateaus," and the like.
Described herein, the exemplary video watermaker has at least two approaches: a "fully blind" and "partially blind" approach.
Generally, hashing techniques are used in many areas such as database management, querying, cryptography, and many other fields involving large amounts of raw data.
In general, a hashing technique maps a large block of raw data into relatively small and structured set of identifiers. These identifiers are also referred to as "hash values" or simply "hash." By introducing a specific structure and order into raw data, the hashing function drastically reduces the size of the raw data into short identifiers. It simplifies many data management issues and reduces the computational resources needed for accessing large databases.
Mathematically, a hashing technique includes a hashing function H(•). That function takes a signal x as input and computes a short vector h=H(x). That vector is an apparently random value in some large set. That vector h is a hash value.
Alternatively, the hashing technique may employ a secret key K. This cryptographic hashing technique includes a hashing function HK(.). That function takes a signal x as input and computes a short vector h=HK(x). That vector (i.e., hash value) is an apparently random value in some large set, but it is indexed by a secret key K.
A hash value may be thought of as a binary string given a signal (e.g., an image). This string serves as the signature of the input signal and is approximately invariant under all acceptable modifications on the input signal (i.e., modifications under which the quality of the input image is preserved for all practical purposes). To be more precise, the hash technique used by the exemplary video watermaker operates on frames (i.e., images) of a video signal such that:
Herein, perceptual similarity may be thought of in this manner: If two signals (e.g., images) are perceptually similar, then an observer should be able to say that they are indeed the same signals (e.g., images) for all practical purposes, such that a reasonable amount of perceptual quality is maintained. Such perceptual qualities also applies to statistical analysis of machines as well as humans.
In addition, for the purpose of identifying the location of the watermark in a video signal, an intermediate hash function serves equally well as a final hash function. See the descriptions in the incorporated pending U.S. patent applications (in particular, the ones entitled "Robust Recognizer of Perceptually Similar Content" and "Recognizer of Audio-Content in Digital Signals") for more details on intermediate and final hashing.
When selecting an intermediate hash function, the hash values of perceptually distinct signals are distant from each other (in the sense of d(.,.)) and hash values of perceptually similar signals are close to each other (in the sense of d(.,.)). Herein, d(.,.) refers to normalized Hamming distance.
For more information about hashing techniques that may be employed with the exemplary video watermaker, see the following pending U.S. patent applications (which are incorporated by reference):
As mentioned earlier, watermarking a video sequence presents a series of significant challenges that are greater than those faced when watermarking other digital goods. Particular examples of these challenges include perceptual invisibility and resistance to de-synchronization. Although watermarking other types of media (e.g., images and audio) also faces these challenges, the problems of perceptual invisibility and resistance to de-synchronization are particularly acute and specifically unique for videos.
The watermark (or portions thereof) may be embedded into each frame of the video. However, the chances of a digital pirate discovering the watermark increases as the watermark repetition increases. Embedding the watermark (or portions thereof) in each frame is also undesirable because it provides convenient range for the pirate to focus her efforts. In addition, it provides potentially thousands of bounded targets (i.e., frames) containing the same hidden data (i.e., the watermark) that the pirate may attack. With these narrow targets, a digital pirate has a good chance of determining the watermark.
To overcome this problem, the exemplary video watermaker selectively encodes watermarks (or portions thereof) into sequence regions within the video. To find the encoded information later, the exemplary video watermaker approximately locates the centers of these regions by hashing the video signal.
If a de-synch attack removes, adds, or rearranges frames, the center determined by the detection system of the exemplary video watermaker offset from the true center of the region. Since the multiple frames within that region are encoded with the watermark, the exemplary video watermaker can detect the watermark in a frame offset from the center. The de-synch would need to significantly alter the video signal before the center determined by the detection system of the exemplary video watermaker is offset enough to be miss the region entirely.
Perceptual Invisibility
The exemplary video watermaker encodes a watermark that is perceptually invisible within the signal. It minimizes or eliminates flicker caused by watermark encoding.
The watermark is encoded into the sequence region in a "plateau" manner. This means that the watermark is fully encoded in the frames surrounding the region's center, but trail off towards the edges of the region.
The trailing edges of the plateau give the region boundaries a softer transition between marked frames and unmarked frames. This is significantly less perceptible—statistically and visually—than the "flicker" of traditional video watermarking.
Plateau-Shaped Sequence Regions
Video Sequence Example
Plateau-Shaped Watermarked Region
The frames 140 are indicated by the same xi labeling as FIG. 1A. Dashed horizontal line 142 indicates a baseline of a video signal without watermark encoding. Solid line 144 indicates the actual video signal relative to the baseline 142. A video signal—such as the one indicated by line 144—is typically not perfectly smooth, straight, etc. For the sake of simplicity, video signal 144 is illustrated in
In accordance with the exemplary video watermaker, an information pattern (such as a watermark or a portion thereof) is embedded into the video signal 144. This may be accomplished using traditional or new watermarking techniques. Image watermarking techniques may be used to embed watermarks into the frames of the video signal.
Within a range of frames, the watermark is embedded. That range of frames is called the plateau region 150. The plateau region ranges from frame xj−k to xj+k in
The center frame (e.g., frame 156) is determined by hashing the video signal (or portions thereof). Thus, the locations of the centers of each region are determined by the inherent characteristics of the signal itself.
Alternatively, when embedding the watermark, the center frame 156 might not be the exact frame determined by the hashing. Thus, the region may be offset from the frame determined by the hashing. This may be called "offset centering" of the region. The degree of the offset may be determined pseudorandomly, mathematically, via hashing, and/or it may be fixed. Assuming that the detection system is capably of reliably detecting the watermarks, this offset centering is acceptable and within the scope of the exemplary video watermaker described herein. It is particularly acceptable because it adds the robustness of the exemplary video watermaker.
Full Mark Zone (FMZ) of the Plateau. The watermark is fully encoded in the frames surrounding the center frame 156. Theses surrounding frames form a zone called a full mark zone (FMZ) 152. The FMZ 152 ranges from frame xj−z to xj+z in
Generally, fully encoding the watermark in the FMZ 152 of the plateau region 150 increases the robustness of the watermark encoded by the exemplary video watermaker. Primarily, it reduces (or eliminates) the effect of de-synchronization on a video signal (such as signal 144).
Edges of the Plateau. The plateau region 150 includes gradient edges 154 a and 154 b in FIG. 1B. On the leading side of the FMZ 152 is leading edge 154 a. On the trailing side of the FMZ 152 is trailing edge 154 b. Within these edges the watermark is partially encoded. More precisely, the watermark is gradiently encoded, which is either increasingly or decreasingly encoded.
For leading edge 154 a, the relative intensity with which the mark is encoded increases with successive frames. The leading edge 154 a ranges from frame xj−k to xj−z in
Typically, the trailing edge 154 b is the mirror image of leading edge 154 a. For trailing edge 154 b, the relative intensity with which the mark is encoded decreases with successive frames. The trailing edge 154 b ranges from frame Xj+z to Xj+k in
Alternatively, the values of k and z on either size of the center need not be equivalent. In particular, the value of k−z may differ for the leading and trailing edges (e.g., edges 154 a and 154 b). In this situation, the edges are not mirror images of each other. However, this would make the "center" of the region be off the true center. Assuming that the detection system is capably of reliably detecting the watermarks, this type of approximate centering is acceptable and within the scope of the exemplary video watermaker described herein. It is particularly acceptable because it adds the robustness of the exemplary video watermaker.
As introduced in the Background section, a malicious attacker can easily find abrupt changes in the intensity of consecutive video frames. Such abrupt changes are common in traditional video watermarking. These changes produce a perceptible flicker effect.
The gradient edges (e.g., edges 154 a and 154 b) of the plateau region 150 give the region's boundaries a softer transition between marked frames and unmarked frames. The smooth transition of the gradient edges is significantly less perceptible—statistically and visually—than the "flicker" of traditional video watermarking.
Generally, gradient encoding the watermark in the FMZ 152 of the plateau region 150 increases the robustness of the watermark encoded by the exemplary video watermaker. Primarily, it reduces (or eliminates) the effect of flicker on a video signal (such as signal 144).
Shape of Plateau Regions. The shape of a plateau region is representative of the relative intensity of the watermarking encoding of that region. The shapes of the plateau regions illustrated herein (in particular, in
With respect to the shape of a plateau, it may take nearly any shape. The range of shapes are bounded by characteristics described in the language claimed herein. Examples of such characteristics of a plateau regions generated by the exemplary video watermaker include:
With these characteristics in mind, a plateau region generated by the exemplary video watermaker may be described, for example, with the following shape descriptions: bump, convex, gibbous, bulge, lump, hump, bulbous, mountain-shaped, peak, mound, mesa, hill, knoll, hillock, butte, drumlin, hummock, dune, tussock, molehill, anthill, dome, arch, hemisphere, half-circle, trapezoid, and the like.
Watermark Detection with the Plateau Regions. A watermark detection system of the exemplary video watermaker processes a subject video signal. Typically, before such detection, it is unknown whether such signal includes a watermark. Likewise, it is unknown whether the subject signal has been modified from the original signal. Such modification may be intentional or unintentional.
Using hashing techniques, the watermark detection system approximately locates the center of each plateau region. More precisely, it locates frames that it considers the centers of their regions. These frames are called "detection frames" herein. To find the detection frames, the watermark detection system uses the same technique as the embedding system uses to locate the regions' center frames.
Typically, the subject video signal itself is hashed to find the detection frames. If the subject signal remains unmodified from the original, then the detection system finds the actual center of each region. If the subject signal has been modified, then the "centers" found by the detection systems approximate the centers of the regions.
However, the watermark detection system need not find the actual center of a region to detect a watermark encoded within the region. Since the watermark is encoded in each of the frames of the plateau region, the watermark detection system is likely to find the embedded mark anywhere within the region. However, if the approximate center determined by the detection system falls within a full mark zone (FMZ), then it is more likely to detect the watermark then if the if the approximate center falls within a boundary edge.
For example, assume that video signal 144 of
Frame 162 is just off-center from the center frame 156. Like the center frame and every other frame in the FMZ 152, it is fully encoded with the watermark. Consequently, the detection system is highly likely to detect the encoded watermark within frame 162.
Frame 164 is more off-center from the center frame 156 than frame 162, but it is still within the FMZ 152. Similarly, the detection system is highly likely to detect the encoded watermark within frame 164.
Frame 166 is significantly off-center from the center frame 156. So much so, that it falls outside the FMZ 152. However, it still is within the plateau region 150. Specifically, it is within trailing edge 154 b. Although the watermark is not fully encoded within this edge, it is still partially encoded in frame 166 of edge 156 b. Consequently, there is a possibility that the detection system may detect the encoded watermark within frame 166.
However, since the mark is only partially encoded there is an increased possibility of missing the watermark. In this situation, the video has most likely been de-synched sufficiently to produce a modified video that is perceptually different from the original video.
Conventional watermark detection encodes the marks in isolated frames. With
Multiple Regions
As a consequence of the almost uniform distributed nature of hash values, the plateau regions are distributed throughout the signal in an almost uniform and manner that appears random. Moreover, as illustrated in
Partially and Fully Blind Approaches
The exemplary video watermaker may be implemented via, at least, two approaches: "Partially Blind" and "Fully Blind." Both are broadly shown in
Partially Blind Approach:
In the partially blind approach, the exemplary video watermaker selects multiple frames of the video. These selected frames will be the center frames of plateau regions. To select these center frames, the exemplary video watermaker may randomly or pseudorandomly select them. The center frames define the center of the plateau region for embedding marks.
Once the frames are selected, the exemplary video watermaker hashes those selected frames and stores their hash values. These will be called the "center frame hash values" herein. These values identify the locations of center frames for watermark embedding. These hash values may use a secret key; thus, may be pseudorandom also.
Once these hash values are found, the watermarks are inserted in the plateau regions of the selected center frames. The hash values are stored in a data storage. The locations of the center frames are not stored. Rather, the hash values of those center frames are stored.
The hash values are sent as side information to the watermark detection system. For this approach, it is assumed that the watermark detection system has secure access to the stored hash values of the center frames. The hash values may be cryptographically transmitted to the detection system along with or separate from the video signal being examined by the system. Regardless, this approach assumes that users (and attackers) do not have access to them.
For example, the hash values may be sent to a software video player on a computer (or to a DVD player) secretly and the user does not know what these hash values are. Another example could be cryptographic encryption of these hash values via a secret key and transmitting them secretly or spreading them around video data in a secret manner such that attackers would not be able to find them.
At the detector end, the hash value of each frame is found and compared to the hash values in the stored list of hash values. For the frames whose hash values substantially match an entry in the list, the detector looks for watermark in that frame. Those frames are called the "detection frames." Alternatively, it looks for the watermarks in frames—whose hash values does the match—surrounding a detection frame. This is done for each detection frame. The detection frames effectively "synch" the watermark detection process.
The term partially blind comes from the fact that additional information is needed at the detector side, meaning it is not completely blind. But it is not non-blind as well. A non-blind watermarking scheme requires the original unmarked video to be present at the detector end.
With this approach, an attacker may determine the locations of the detection frames. To find the detection frames, the attacker only needs to determine the hashing function and gain access to the list of hash values (for the center frames).
Fully Blind Approach:
The fully blind approach is the same as the partially blind approach, except that there is no list of center frame hash values. Thus, the watermark detection system has no list of hash values to compare to the hash of the frames of a subject video signal. Instead, the watermark detection system calculates the hash values based upon the subject video signal.
A comparison between the hash values and randomly generated binary vectors is made in order to decide if the watermark is going to be embedded or not. At the decoder side, the same operation is carried out using the same secret key.
By using a secret key, the fully blind approach generates a set of random binary sequence a. This might be, for example, 10 random bits. Then the hash value of each frame within the video sequence is computed, call these hi, where i indexes frame number.
As an example, assume that these hash values are of length 100. Randomly chosen 10 locations from a length 100 vector are used and bits from those locations are collected (for each frame independently) to construct the "symbol" of that frame (in other words, the "symbol" of each frame is generated from the hash value of that frame by random projection, in this particular example the projection ration is 10/100=0.1). Call the symbols si, where i indexes the frames. Once the symbol of each frame is computed, it is compared with the initially randomly found vector (i.e., one compares si with a for all i. Once there is an exact match, the watermark is embedded around it in a plateau manner.
This approach is random in the following aspects: first, vector a is generated randomly; second, each value hi is the hash value of frame i. In addition, by the definition of the hash function, they are also generated randomly, then generation of si from hi are also done in a random manner. Secret key K is used as the seed of the random number generator in all these steps.
At the detector end, it has access to K. It does the same as above to find the frame locations. It generates a; it generates hash values; and applies random projection. It finds the detection frames, which may or may not be identical to the center frames.
The same secret key and hash function is used for hashing the center frame for embedding as is used for hashing the detection frames for detecting. Therefore, if the original unmarked signal and the subject signal are perceptually identical, then the hash values of the frames will be identical or nearly so.
The unmarked signal and subject signal will be perceptually identical is the subject signal if an unmodified version of the marked signal. Furthermore, the unmarked signal and subject signal will be perceptually identical if the subject signal is a modified version (e.g., an attacked version) of the marked signal, but such modification did not perceptually modify the signal.
Thus, to determine where the detection frames are located, an attacker must know the secret key and the hash function. This approach is particularly appropriate when there is great concern about malicious attacks.
In both approaches, the centers of regions around which watermark is going to be embedded are determined. This task may be carried out via using robust image hash functions. In partially blind approach, the hash values are used to determine the locations of the watermarks at the decoder; thus, partially blind approach is termed to be "partially blind".
In fully blind approach, a comparison between the hash values and randomly generated binary vectors is made in order to decide if the watermark is going to be embedded or not. At the decoder side, the same operation is carried out using the same secret key; therefore, the fully blind approach is a completely blind approach.
Exemplary Video Watermarking Architecture
The watermark embedding system 232 applies the watermark to a digital signal (e.g., video signal) from the content storage 230. Typically, the watermark identifies the content producer 222, providing a signature that is embedded in the signal and cannot be cleanly removed.
The content producer/provider 222 has a distribution server 234 that distributes the watermarked content over the network 224 (e.g., the Internet). A signal with a watermark embedded therein represents to a recipient that the signal is being distributed in accordance with the copyright authority of the content producer/provider 222. The server 234 may further compress and/or encrypt the content conventional compression and encryption techniques prior to distributing the content over the network 224.
Typically, the client 226 is equipped with a processor 240, a memory 242, and one or more content output devices 244 (e.g., television, display, sound card, speakers, etc.). The processor 240 runs various tools to process the marked signal, such as tools to decompress the signal, decrypt the date, filter the content, and/or apply signal controls (tone, volume, etc.). The memory 242 stores an operating system 250 (such as a Microsoft« Windows 2000« operating system), which executes on the processor. The client 226 may be embodied in a many different ways, including a computer, a handheld entertainment device, a set-top box, a television, an appliance, and so forth.
The operating system 250 implements a client-side watermark detecting system 252 to detect watermarks in the digital signal and a content loader 254 (e.g., multimedia player, audio player) to facilitate the use of content through the content output device(s) 244. If the watermark is present, the client can identify its copyright and other associated information.
The operating system 250 and/or processor 240 may be configured to enforce certain rules imposed by the content producer/provider (or copyright owner). For instance, the operating system and/or processor may be configured to reject fake or copied content that does not possess a valid watermark. In another example, the system could load unverified content with a reduced level of fidelity.
Exemplary Video Watermarking Embedding System
The watermark embedding system 300 includes a signal obtainer 310, a region locator 320, a region definer 330, and a region marker 340.
The signal obtainer 310 obtains an unmarked video signal 305. It may obtain the signal from nearly any source, such as a storage device or over a network communications link.
The region locator 320 determines the locations of the regions within the signal 305. To determine the region locations, the system may first determine the center frame (such as frame 156 of
The region definer 330 defines the parameters of the regions. Such parameters include region length (2k+1) and FMZ length (2z+1). These parameters may fixed for all regions of all signals. They may be fixed for all regions, but varied per signals. They may be varied for all regions of all signals. Generally speaking, the parameters may be manipulated to adjust several factors including watermark detection probability and robustness.
The region marker 340 watermarks the regions of the signal in a plateau manner. The frames of the FMZ are fully encoded while the frames of the boundary edges are gradiently encoded. The region marker may employ traditional or new watermarking techniques particularly those designed for image watermarking. It may employ spread-spectrum, QIM, or other watermarking techniques. This marked video may be publicly distributed to consumers and clients.
The functions of aforementioned components of the exemplary video watermark embedding system 300 of
Methodological Implementation of the Exemplary Video Watermark Embedder
At 410 of
At 414, the exemplary video watermaker defines the parameters of the regions. At 416, it watermarks the regions of the signal in a plateau manner. At 418, the process ends.
Exemplary Video Watermarking Detecting System
The watermark detecting system 500 includes a signal obtainer 510, a frame locator 520, and a watermark detector 530.
The signal obtainer 510 obtains a subject video signal 505. It may obtain the signal from nearly any source, such as a storage device or over a network communications link. Typically, it is unknown whether the subject video signal 505 is marked and whether it has been modified.
The frame locator 520 determines the locations of the "detection frames" of the subject signal 505. The detection frames are the selected frames of the signal that the system will attempt to detect the watermark. The system may also attempt to locate the watermark in frames surrounding the selected detection frames.
For the both the partially and fully blind approaches, the frame locator 520 uses the same hashing technique (including the same secret key) to find the hash values of frames of the subject signal as the watermark embedding system 300 (specifically, the region locator 320) used for the center frame of a region.
For the partially blind approach, the frame locator 520 compares the just calculated hash values of each frame of the subject video to the stored list of hash values (which was originally generated by the watermark embedding system 300). Each exact or substantial match is designated a "detection frame."
For the fully blind approach, the frame locator 520 selects the detects frames by doing a comparison between the hash values and randomly generated binary vectors is made in order to decide if the watermark is going to be embedded or not.
The watermark detector 530 determines whether watermarks exist in the detection frames. The watermark detector employs the detection technique that corresponds the watermarking technique employed by the watermark embedding system 300. The watermark detector 530 indicates whether the watermark is present.
The functions of aforementioned components of the exemplary video watermark detecting system 500 of
Methodological Implementation of the Exemplary Video Watermark Detection
At 610 of
At 612, it determines the locations of the "detection frames" of the subject signal. At 614, the exemplary video watermaker determines whether watermarks exist in the detection frames. The watermark detector employs the detection technique that corresponds the watermarking technique employed by the watermark embedding methodological implementation of FIG. 4. Typically, it also indicates whether the watermark is present. Such indication may be stored, displayed, printed, etc. The process ends at 616.
Other Implementation Details
The "partially blind" approach is partially blind in the sense that it requires the hash values to be known at the decoder side. The "fully blind" approach is completely blind and relies on the fact that the collision probability of the hash values should be low and approximate uniform distribution should be achieved.
Given the input video {Xi} of length N, the exemplary video watermaker embeds watermarks {wj}, 1≦j≦M, each of length Lw, at M different places. The secret key K is the seed of the pseudorandom number generator in all the randomized tasks in both approaches. Let H(.) denote the hash function to be used that produces a hash of length L. Let a(k) denote the k-th element of an input vector a. Let ƒ be a continuous monotonic even function defined on real numbers such that ƒ(0)=1, ƒ(X)=0 for |X|≧1 and ƒ(|X|)≧ƒ(|X|+|ε|), X, ε∈R. Let {Yi} be an input to the watermark decoder.
Partially Blind Approach
Watermark Encoding: Pseudorandomly pick the frames Xi
Find H(Xi
Find the semi-global statistics {μi
Compute sign vectors si
Pseudorandomly find the watermarking neighborhood widths {Wi
For frame Xi
Watermark Decoding: Given the input video {Yi} of length NY, compute hash values H(Yi) for all i.
Find frames {Yi
For each frame Yi
Given {wD.k
and 0 otherwise. Here round(.) denotes rounding to integer operation and wD.
Declare that the watermark is present if maxjd(wD.
Fully Blind Approach
Watermark Encoding: Generate M random binary vectors hj, 1≦j≦M of length {overscore (L)} where {overscore (L)}<<L.
Find H(Xi), 1≦i≦N.
Find hi X, 1≦i≦N of length {overscore (L)} such that hi X(k) is the lk-th element of H(Xi) for 1≦k≦{overscore (L)} and {l1, l2, . . . , l{overscore (L)}} is a random subset of {1, 2, . . . , L}.
For each j, 1≦j≦M, find frames Xj
For each Xj
For frame Xjk+l
Watermark Decoding: Given the input video {Yi} of length NY, compute hash values H(Yi) for all i.
Find hi Y, 1≦i≦NY of length {overscore (L)} such that hi Y(k) is the lk-th element of H(Yi) for 1≦k≦{overscore (L)} and {l1,l2, . . . , l{overscore (L)}} is the same subset of {1, 2, . . . L}found in above in encoding.
For each j, 1≦j≦M, find frames Yj
For each frame Yj
Given {wD.j
and 0 otherwise. Here round(.) denotes rounding to integer operation and wD.j is the resulting decoded vector that is derived from the neighborhood of Yj
Declare that the watermark is present if maxjd(wD.j,wj)<T; not present otherwise.
Decreasing Visual Artifacts
In both approaches, for a given center frame, the watermark are embedded in a neighborhood around it. This may be done using QIM watermarking. During this process, the sign vectors, that are derived from the center frame, may play a role in terms of decreasing visual artifacts. For a particular statistic, if one quantizes to a higher value for a given frame and if one quantizes to a lower value for a neighboring frame, there will be a slight "flickering effect." In order to minimize this effect, a fixed sign vector may be employed. That vector is used for the whole range of neighborhood.
Exemplary Computing System and Environment
The exemplary computing environment 900 is only one example of a computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the computer and network architectures. Neither should the computing environment 900 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary computing environment 900.
The exemplary video watermaker may be implemented with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use include, but are not limited to, personal computers, server computers, thin clients, thick clients, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The exemplary video watermaker may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The exemplary video watermaker may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
The computing environment 900 includes a general-purpose computing device in the form of a computer 902. The components of computer 902 can include, by are not limited to, one or more processors or processing units 904, a system memory 906, and a system bus 908 that couples various system components including the processor 904 to the system memory 906.
The system bus 908 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, such architectures can include an Industry Standard Architecture (ISA) bus, a Micro Channel Architecture (MCA) bus, an Enhanced ISA (EISA) bus, a Video Electronics Standards Association (VESA) local bus, and a Peripheral Component Interconnects (PCI) bus also known as a Mezzanine bus.
Computer 902 typically includes a variety of computer readable media. Such media can be any available media that is accessible by computer 902 and includes both volatile and non-volatile media, removable and non-removable media.
The system memory 906 includes computer readable media in the form of volatile memory, such as random access memory (RAM) 910, and/or non-volatile memory, such as read only memory (ROM) 912. A basic input/output system (BIOS) 914, containing the basic routines that help to transfer information between elements within computer 902, such as during start-up, is stored in ROM 912. RAM 910 typically contains data and/or program modules that are immediately accessible to and/or presently operated on by the processing unit 904.
Computer 902 may also include other removable/non-removable, volatile/non-volatile computer storage media. By way of example,
The disk drives and their associated computer-readable media provide non-volatile storage of computer readable instructions, data structures, program modules, and other data for computer 902. Although the example illustrates a hard disk 916, a removable magnetic disk 920, and a removable optical disk 924, it is to be appreciated that other types of computer readable media which can store data that is accessible by a computer, such as magnetic cassettes or other magnetic storage devices, flash memory cards, CD-ROM, digital versatile disks (DVD) or other optical storage, random access memories (RAM), read only memories (ROM), electrically erasable programmable read-only memory (EEPROM), and the like, can also be utilized to implement the exemplary computing system and environment.
Any number of program modules can be stored on the hard disk 916, magnetic disk 920, optical disk 924, ROM 912, and/or RAM 910, including by way of example, an operating system 926, one or more application programs 928, other program modules 930, and program data 932. Each of such operating system 926, one or more application programs 928, other program modules 930, and program data 932 (or some combination thereof) may include an embodiment of a signal obtainer, a region locator, a region definer, a region marker, a signal marker, a frame locator, a synchronizer, and a watermark detector.
A user can enter commands and information into computer 902 via input devices such as a keyboard 934 and a pointing device 936 (e.g., a "mouse"). Other input devices 938 (not shown specifically) may include a microphone, joystick, game pad, satellite dish, serial port, scanner, and/or the like. These and other input devices are connected to the processing unit 904 via input/output interfaces 940 that are coupled to the system bus 908, but may be connected by other interface and bus structures, such as a parallel port, game port, or a universal serial bus (USB).
A monitor 942 or other type of display device can also be connected to the system bus 908 via an interface, such as a video adapter 944. In addition to the monitor 942, other output peripheral devices can include components such as speakers (not shown) and a printer 946 which can be connected to computer 902 via the input/output interfaces 940.
Computer 902 can operate in a networked environment using logical connections to one or more remote computers, such as a remote computing device 948. By way of example, the remote computing device 948 can be a personal computer, portable computer, a server, a router, a network computer, a peer device or other common network node, and the like. The remote computing device 948 is illustrated as a portable computer that can include many or all of the elements and features described herein relative to computer 902.
Logical connections between computer 902 and the remote computer 948 are depicted as a local area network (LAN) 950 and a general wide area network (WAN) 952. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet.
When implemented in a LAN networking environment, the computer 902 is connected to a local network 950 via a network interface or adapter 954. When implemented in a WAN networking environment, the computer 902 typically includes a modem 956 or other means for establishing communications over the wide network 952. The modem 956, which can be internal or external to computer 902, can be connected to the system bus 908 via the input/output interfaces 940 or other appropriate mechanisms. It is to be appreciated that the illustrated network connections are exemplary and that other means of establishing communication link(s) between the computers 902 and 948 can be employed.
In a networked environment, such as that illustrated with computing environment 900, program modules depicted relative to the computer 902, or portions thereof, may be stored in a remote memory storage device. By way of example, remote application programs 958 reside on a memory device of remote computer 948. For purposes of illustration, application programs and other executable program components such as the operating system are illustrated herein as discrete blocks, although it is recognized that such programs and components reside at various times in different storage components of the computing device 902, and are executed by the data processor(s) of the computer.
Computer-Executable Instructions
An implementation of an exemplary video watermaker may be described in the general context of computer-executable instructions, such as program modules, executed by one or more computers or other devices. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Typically, the functionality of the program modules may be combined or distributed as desired in various embodiments.
Exemplary Operating Environment
The operating environment is only an example of a suitable operating environment and is not intended to suggest any limitation as to the scope or use of functionality of the exemplary video watermaker(s) described herein. Other well known computing systems, environments, and/or configurations that are suitable for use include, but are not limited to, personal computers (PCs), server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, programmable consumer electronics, wireless phones and equipments, general- and special-purpose appliances, application-specific integrated circuits (ASICs), network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
Computer Readable Media
An implementation of an exemplary video watermaker may be stored on or transmitted across some form of computer readable media. Computer readable media can be any available media that can be accessed by a computer. By way of example, and not limitation, computer readable media may comprise "computer storage media" and "communications media."
"Computer storage media" include volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules, or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer.
"Communication media" typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as carrier wave or other transport mechanism. Communication media also includes any information delivery media.
The term "modulated data signal" means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared, and other wireless media. Combinations of any of the above are also included within the scope of computer readable media.
Although the invention has been described in language specific to structural features and/or methodological steps, it is to be understood that the invention defined in the appended claims is not necessarily limited to the specific features or steps described. Rather, the specific features and steps are disclosed as preferred forms of implementing the invention.
|Cited Patent
|Filing date
|Publication date
|Nov 19, 1985
|Sep 20, 1988
|International Business Machines Corporation
|Information processing system for compaction and replacement of phrases
|Dec 8, 1993
|Sep 27, 1994
|International Business Machines Corporation
|Generalized shape autocorrelation for shape acquisition and recognition
|Apr 1, 1994
|Nov 7, 1995
|Ricoh Company, Ltd.
|Image matching and retrieval by multi-access redundant hashing
|Jun 7, 1995
|Mar 18, 1997
|The Dice Company
|Steganographic method and device
|Oct 17, 1995
|Sep 2, 1997
|Northern Telecom Limited
|Method of building fast MACS from hash functions
|Dec 31, 1996
|Nov 11, 1997
|The Dice Company
|Steganographic method and device
|May 25, 1995
|Nov 18, 1997
|International Business Machines Corporation
|Method and apparatus for updating and transmitting line-oriented data sets
|Jun 7, 1995
|Jun 30, 1998
|United Parcel Service Of America, Inc.
|Method and system for comparing strings with entries of a lexicon
|Sep 19, 1996
|Sep 15, 1998
|Panasonic Technologies, Inc.
|Method of locating a penstroke sequence in a computer
|Sep 30, 1996
|Feb 23, 1999
|Kaman Sciences Corporation
|Pixel hashing image recognition system
|Jun 19, 1997
|Sep 14, 1999
|Xerox Corporation
|Method of indexing words in handwritten document images using image hash tables
|May 28, 1997
|Jun 27, 2000
|Symantec Corporation
|System for supporting secured log-in of multiple users into a plurality of computers using combined presentation of memorized password and transportable passport record
|Dec 8, 1997
|Aug 8, 2000
|The United States Of America As Represented By The Secretary Of The Air Force
|Digital watermarking by adding random, smooth patterns
|May 21, 1998
|Nov 6, 2001
|Massachusetts Institute Of Technology
|System, method, and product for information embedding using an ensemble of non-intersecting embedding generators
|Sep 2, 1999
|Nov 20, 2001
|Xerox Corporation
|Method for creating a geometric hash tree in a document processing system
|Apr 15, 1998
|Mar 26, 2002
|Intel Corporation
|Method and apparatus for protecting flash memory
|Apr 7, 1998
|Apr 9, 2002
|International Business Machines Corporation
|Multiple frame data hiding method and data detection method
|Mar 23, 1998
|Mar 2, 2004
|Fujitsu Limited
|Device for generating, detecting, recording, and reproducing a watermarked moving image having a copy preventing capability and storage medium for storing program or the moving image
|Jun 14, 2000
|Mar 2, 2004
|International Business Machines Corporation
|Method and apparatus for matching slides in video
|Jul 30, 1993
|Feb 2, 1994
|Corbis Corporation
|Method and system for digital image signatures
|Mar 19, 2002
|Oct 30, 2002
|Microsoft Corporation
|Derivation and quantization of robust non-local characteristics for blind watermarking
|Sep 24, 1998
|Apr 8, 1999
|Hewlett-Packard Company
|Watermarking of digital object
|Oct 1, 1998
|Apr 15, 1999
|Macrovision Corporation
|Method and apparatus for a copy-once watermark for video recording
|Mar 18, 1999
|Nov 25, 1999
|Massachusetts Institute Of Technology
|System, method, and product for information embedding using an ensemble of non-intersecting embedding generators
|Aug 1, 2000
|Feb 15, 2001
|Macrovision Corporation
|A scaling independent technique for watermarking images
|Oct 10, 2000
|Apr 19, 2001
|Koninklijke Philips Electronics N.V.
|Method and system for embedding extra information, method and system for decoding
|Oct 19, 2000
|May 10, 2002
|Microsoft Corporation
|System and method for hashing digital images
|Chang et al., "RIME: A Replicated Image Detector for the World-Wide Web" Proceedings of the SPIE vol. 3527, Nov. 2-4, 1998, pp. 58-67.
|Chen et al., "Achievable Performance of Digital Watermarking Systems" IEEE, 1999, pp. 13-18.
|Chen et al., "Quantization Index Modulation Methods for Digital Watermarking and Information Embedding of Multimedia" Journal of VLSI Signal Processing, 27, 2001, pp. 7-33.
|Echizen et al., "General Quality Maintenance Module for Motion Picture Watermarking" IEEE Trans. on Consumer Electronics, vol. 45, No. 4, Nov. 1999, pp 1150-1158.
|Fridrich et al., "Robust Hash Functions for Digital Watermarking" Proc. Int. Conf. on Information Technology: Coding and Computing, Mar. 2000, pp 178-183.
|Kesal et al., "Iteratively Decodable Codes for Watermarking Applications" Proceedings of the Second Symposium on Turbo Codes and Their Applications, France, Sep. 2000, 4 pages.
|Lee et al., "Adaptive Video Watermarking Using Motion Information" Proc SPIE vol. 3971: Security and Watermarking of Multimedia Contents II, Jan. 2000, pp. 209-216.
|Malvar, "A Modulated Complex Lapped Transform and its Applications to Audio Processing" IEEE ICASSP'99, Phoenix, AZ, Mar. 1999, pp. 1-4.
|Mihþak et al., "A Perceptual Audio Hashing Algorithm: A Tool For Robust Audio Identification and Information Hiding" Proceedings of the Information Hiding Workshop, 2001, 15 pages.
|Mihþak et al., "Blind Image Watermarking Via Derivation and Quantization of Robust Semi-Global Statistics" Proceedings of IEEE-ICASSP, Orlando, FL, 2002, 4 pages.
|Mihþak et al., "Cryptanalysis and Discrete-Sequence Spread Spectrum Watermarks" Proceedings of the Information Hiding Workshop, Holland, 2002, 21 pages.
|Mihþak et al., "New Iterative Geometric Methods for Robust Perceptual Image Hashing" Proceedings of the Security and Privacy Digital Rights Management Workshop, 2001, 9 pages.
|Mihþak et al., "Watermarking via Optimization Algorithms for Quantizing Randomized Statistics of Image Regions" Proceedings of the Annual Allerton Conference on Communication Control and Computing, Urbana, IL, 2002, 10 pages.
|Moulin et al., "A Framework for Evaluating the Data-Hiding Capacity of Image Sources" IEEE Transactions on Image Processing vol. 11 No. 9 Sep. 2002 pp. 1-14.
|Moulin et al., "The Parallel-Gaussian Watermarking Game" IEEE Transactions Information Theory, Feb. 2004, pp. 1-36.
|Venkatesan et al., "Image Watermarking with Better Resilience" Proceedings of IEEE-ICIP, Vancouver, BC, Canada, 2000, 4 pages.
|Venkatesan et al., "Robust Image Hashing" Proceedings of the IEEE-ICIP, Vancouver, BC, Canada, 2000, 3 pages.
|Wu et al., Video Access Control Via Multi-Level Data Hiding Proc. IEEE Int. Conf. on Multimedia and Expo, vol. I, Jul./Aug. 2000, pp 381-384.
|Citing Patent
|Filing date
|Publication date
|Sep 14, 2012
|Nov 11, 2014
|Samsung Electronics Co., Ltd.
|Method and apparatus for embedding image-related information in image
|Dec 15, 2006
|Jul 5, 2007
|Mitchell Owen R
|Method, apparatus, and system for encoding and decoding a signal on a viewable portion of a video
|May 2, 2008
|Jul 22, 2014
|Intellectual Ventures Holding 59 Llc
|Television advertising automated billing system
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|Sep 30, 2008
|Fee payment
Year of fee payment: 4
|Oct 4, 2012
|Fee payment
Year of fee payment: 8
|Dec 9, 2014
Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICROSOFT CORPORATION;REEL/FRAME:034541/0477
Effective date: 20141014
|Dec 9, 2016
|Maintenance fee reminder mailed
|May 3, 2017
|Lapse for failure to pay maintenance fees
|Jun 20, 2017
|Expired due to failure to pay maintenance fee
Effective date: 20170503


text:
The Firing Line Forums
The Hide
The Hunt
> .357 handgun & whitetall Deer
View Full Version :
.357 handgun & whitetall Deer
January 25, 2006, 11:25 AM
PA might be adding allowing Handgun hunting for deer. If they do, do you guys think a .357 mag coming out of a 6" revolver barrel can do the job?
January 25, 2006, 11:46 AM
§ 141.41. General.
(a) Permitted acts. It is lawful to take:
(1) Bear or elk with a crossbow with a draw weight of not less than 125 pounds nor more than 200 pounds.
(2) Deer during any firearms season for deer with a crossbow with a draw weight of not less than 125 pounds nor more than 200 pounds.
(3) Deer with a crossbow with a draw weight of not less than 125 pounds nor more than 200 pounds in Wildlife Management Units 2B, 5C and 5D.
(b) It is unlawful to:
(1) Hunt for big game birds or animals with arrows or crossbow bolts other than those tipped with broadheads of a cutting-edge design.
(2) Hunt for deer or bear through the use of any one or more of the following:
(i) A muzzleloading handgun.
(ii) A muzzleloading firearm that is not .44 caliber or larger.
It is already legal to kill deer with a handgun. As for your question, yes a .357 will do the trick for deer, but know your limitations, practice at the distance you intend to shoot at, and use 158 grain soft points or 180 grainers.
p.s.- check out www.huntingpa.com for more info.
Smokey Joe
January 26, 2006, 12:03 PM
It'll do the trick. There are 2 needs, though.
(1) Use a heavy hardcast bullet, going as fast as consistent with safety and accuracy. I use a 180 grain hardcast Beartooth, large meplat, gas-checked, in front of 12.5 grains of AA2400. Work up yr load from a safe starting load. I e-mailed Accurate Arms for load data; couldn't find any for a 180 grain cast bullet when I was looking.
(2) Same way you get to Carnagie Hall: Practice, practice, practice.
Disclaimer: Never depend on anonymous I'net sources for load data. Including me. Get published data, or that from a manufacturer. If you can't find the data you want, contact the powder or bullet maker--they are usually more than glad to help you find a use for their products.
Wild Bill Bucks
January 26, 2006, 12:43 PM
I use a 44 mag Super Red Hawk Ruger, traded in my GP100 .357 magnum,
But either gun will do the trick.
MINIMUM 12" pie plate at 50 yards
GO HUNTING 6" pie plate at 50 yards.
Practice until you get here and you will have no problems, but you will find it pretty hard to do at first.
Most guys that own either one of these guns CAN'T do that, but with practice it is a fun way to hunt.
Garand Guy
January 26, 2006, 08:55 PM
Seems to work in MI. My dad did it for years with 158JHP.
January 28, 2006, 06:43 AM
.357 worked just fine for me. 3rd deer I ever killed was with me SS Colt King cobra with 4" barrel using star fire rounds from about 25yrds. The deer didn't even run. dropped it where it stood.
Jack O'Conner
January 29, 2006, 02:51 PM
I killed a big cow elk with my .357 MAG revolver. Will post a photo if I can figure out how to scan from original. The cow weighed about 550 lbs live weight. First bullet went into the crease directly behind the shoulder from broadside. Distance was about 75 feet. The cow flinched and trotted away at a slight angle. Second bullet went in a little too far back and away she went. Vanished into the aspen forest. I went back to camp and got my brother and our flashlights.
We found the elk dead about 150 yards from my second shot. First bullet broke a rib and smashed up both lungs. Second shot ripped open the diaphram and tore a hole in the liver. Both bullets were mushroomed nicely.
Ammo used: PMC with 158 grain semi-jacketed hollow tip. At the time, this was the cheapest 357 MAG hollw tip ammo I could find!
I'm certain 357 MAG will kill any deer as long as you use open sights and avoid long shots. Put a scope on a 357 and you'll be tempted to take a long shot. Don't do it!
vBulletin® v3.8.7, Copyright ©2000-2017, vBulletin Solutions, Inc.

subset: commoncrawl


text:
Sale at Public Auction The following vehicle will be sold at public auction for towing and storage charges at 2130 S.R. 16 St. Augustine, FL 32095 at 8:00 a.m. JANUARY 5TH, 2003 to the highest bidder for cash. Florida Statute 713.78. Yr. & Make: 1994 MAZDA Vin# JM1EC4357R0308307 Eagle Towing and Recovery Leo Giannini L2837-3 December 19, 2003
Posted from 19-Dec-03 to 19-Dec-03
© 2017. All Rights Reserved. Contact Us


text:
Suzanne Goldenberg
The Guardian
October 23, 2009
[efoods]The number of Americans who believe in global warming has plummeted, falling 20% in two years, a survey said today.
Only 57% of Americans believe there is solid scientific evidence that the Earth's atmosphere is warming, said the poll of 1,500 people by the Pew Research Centre for the People & the Press.
That is a fall of 77% from 2007. The number of people who believe that human activity is causing global warming also fell to just 36%.
The public uncertainty about the evidence behind global warming comes as the Senate prepares to begin debate next week on climate change legislation. Yesterday, 18 scientific organisations wrote Congress to reaffirm the consensus behind global warming.


text:
Sally Fitzgerald, the compiler of O'Connor's letters, notes that when she placed Flannery on the train to return to her Milledgeville, Georgia, home, she was "smiling perhaps a little wanly but wearing her beret at a jaunty angle.†Less then a week later, the Fitzgeralds received the news that Flannery was dying of lupus. The cocky hat of O'Connor's ambitions and hopes now seemed to lie in the shadows of the valley into which her life had been plunged.
As I read the letters that surrounded this time, they resonated with me, fresh from the antiseptic stench of hospital halls myself, where my grandma is fighting the debilitating effects of a massive stroke. Fitzgerald notes, "As she emerged from the crisis…she began to communicate again herself -- chiefly on the subject of her novel, which had never been much out of her mind, even when the lupus attack was most severe.†I can practically see Enoch Emery, his flushed pimply face rising out of an ape suit, regarding Flannery from the foot of her hospital bed. But still, it was he and his "wise blood," as well as every other character and the novel itself, that formed a heavy rope of purpose that pulled Flannery through. Were it not for such gifts of purpose, how would we survive these times of pain? It is such gifts that wrap 75-year-old fingers and hands pierced with IV tubing around the frame of a metal hospital bed with a grip of iron. The gifts of a novel, a character, a grandchild's hands on the forehead, a hymn hummed softly over a gray head, a hat at a jaunty angle, a desire to live.
While she lay recovering in Baldwin Memorial hospital, Flannery wrote to a friend, "I don't believe in time no more much so it's all one to me…†She had passed through a deep place in her life, a river that had not overcome her and a fire that had not burned her. In a darkened ICU ward, these words of Isaiah 43 were shafts of light. I read them softly but they glowed with their own power. "When you walk the waters, I will be with you and when you pass through the rivers they will not overcome you.†The sun tipped through the west-facing windows, setting my grandma's hand holding mine awash in gold. In that second, I sensed the strong ropes that were pulling her back and in Whose hands they ultimately lay. She squeezed my hand, her breathing deep and joyful, and I knew she wasn't pulling alone.


text:
Jonathan Stempel and Dena Aubin
Thursday, Sept 11, 2008
ABC News' Matthew Jaffe reports: Sen. Barack Obama's, D-Ill., vice presidential nominee, Sen. Joe Biden, D-Del., Wednesday said that Sen. Hillary Clinton, D-N.Y., might have been a better pick for the position than him.
At a rally in Nashua, N.H., a man in the audience told Biden how glad he was that Obama picked him over Hillary, "not because she's a woman, but because, look at the things she did in the past."
"Make no mistake about this," Biden responded. "Hillary Clinton is as qualified or more qualified than I am to be vice president of the United States of America. Let's get that straight. She's a truly close personal friend, she is qualified to be president of the United States of America, she's easily qualified to be vice president of the United States of America, and quite frankly, it might have been a better pick than me. But she's first rate, I mean that sincerely, she's first rate, so let's get that straight."
(Article continues below)
Spokesman Ben Porritt offered this response from the McCain camp: "Barack Obama's most important decision of this election, and Biden — the candidate he selects — suggests, himself, that he wasn't the right man for the job, and that Hillary Clinton would have been a better choice. Biden certainly has a credible viewpoint on this."
This article was posted: Thursday, September 11, 2008 at 3:59 am


text:
High interest from local businesses has led to an expansion of the program to Union County College's Plainfield campus at 232 East 2nd St. Please note that all classes are one day in length from 8:30 a.m. to 5 p.m. and can be held at the College's Elizabeth Campus, Kellogg Building, 40 W. Jersey St.; Cranford Campus 1033 Springfield Ave.; or the Plainfield Campus 232 East 2nd St.
The classes are offered through a unique partnership of the New Jersey Business and Industry Association (NJBIA), the New Jersey Community College Consortium, and the New Jersey Department of Labor and Workforce Development. Through the grant-funded NJBIA Project, companies with a minimum class of ten participating employees can bring these classes to their own premises with the Industry-Business Institute's new mobile computer lab.
In addition, Effective Listening, Writing and Speaking for Customer Service, a twelve-hour program is also offered on an open enrollment basis for two days, Sept. 10 and 12 at the Elizabeth campus. To register, go to ucc.edu/go/ibi.
Training is also available in mathematics and measurement, and English as a Second Language on a demand basis. To have employees hone these skills, call 908-965-2359.
For more information visit the Industry-Business Institute's website at ucc.edu/go/ibi (Ongoing Grant Funded Programs) or email email@example.com. Registration is required but simple.


text:
Research is perhaps the best way to experience the excitement of modern biochemistry and to really develop a deeper understanding of the field. All majors are required to do either library or laboratory research. We strongly encourage you to do undergraduate laboratory research, either at CSB/SJU or off campus. Not only will it help you get into graduate/medical schools or gain employment, but it will also develop and solidify your interest in biochemistry. You will also gain the experience of working closely with a professor who will mentor you in your project.
The Biology and Chemistry Departments have many opportunities for undergraduate research. Students may apply for selection into a ten-week summer undergraduate program. Students live on campus and receive a summer stipend as well as board. Students may also continue or start research in the academic year. Below are links for our research active faculty, related to biochemistry.
Students may enroll in research course in either the Biology or Chemistry Departments.
Biology Department
Students may enroll in 372A: Biological Research (1-4), For this course, students will conduct original research under the supervision of a faculty moderator from Biology. Students write a proposal for this course which should include:
If the student's project requires special skills and techniques, e.g. radioactive labeling, histological preps, or electron microscopy, then they must indicate proficiency with these skills or concurrent registration in courses teaching those skills. If this is not possible, the moderator may approve the project if he/she undertakes to teach those skills as part of the research project.
Alternatively, students may enroll in Biology 372B: Special Topics in Biology (1-4). This course traditionally involves readings, discussions or courses in areas of biology not covered in departmental courses. Topics may be selected by students or faculty. The design and content will draw upon texts or current literature, and may include laboratory or field exercises. For this course, students must write an application which includes course design, content, credit justification, reference materials, and staff involved.
Students may do either library (CH350) or laboratory (CH331) research. However, they are strongly encouraged to do laboratory research.
In CH 350 Library Research and Seminar (1-2 credits), students do in-depth library research and reading of primary sources on a single topic. The emphasis of the seminar is on comprehension and criticism. Under the guidance of a faculty moderator the student reads background and primary literature on a topic chosen with the moderator (see note that follows about choosing a moderator). Progress is recorded in the form of a review-type essay. A final paper is required which has evolved through several drafts with constructive criticism from the faculty moderator on each draft. Prerequisites: CHEM 236, 320.
Students planning to do laboratory research (CH331) should take CHEM 350 before starting research or in the Spring of their junior year. Otherwise they may take it in either the Spring of the junior year or the Fall of the senior year. In consult with the CHEM 320/350/351 supervisor (see the List of Faculty Duties to find out who this is), students must choose a faculty moderator before registering for CHEM 350. They must also submit to the supervisor the form "Library Research Proposal" and sign a "Research Contract". These papers should be signed by the third week of the semester in which the credits will be earned. The seminar requirement of this course is described below.
In CHEM 351, 375 Laboratory Research (1-4 credits) students have an independent laboratory research experience using modern techniques and equipment. Under the supervision of a faculty moderator the student investigates a research program in the laboratory. Progress is recorded in a laboratory notebook and a formal paper describing their work. Prerequisites: CHEM 320 and permission of instructor.
Registration for CHEM 351 is by permission of the department. Students wishing to enroll in CHEM 351 must develop a research proposal with the help of a faculty member, normally during the second semester of the junior year. If this proposal is accepted by the department, the student is required to fill out the "Laboratory Research Proposal" form and sign a research contract before registering for CHEM 351. These forms must be submitted to the CH320/350/351 supervisor. These papers should be signed by the third week of the semester in which the credits will be earned.
Each student must write a formal paper describing their library or laboratory research and orally present their research at the annual Senior Chemistry Seminar Symposium held during the Spring semester. The supervisor will be in contact with senior majors to assist them in the preparation of the seminar.
Grading for CH350 and 351
In order to assure a more uniform grading system, the chemistry faculty approved this grading scheme for research projects. The grade will be based on the following components, using the percentages in parentheses.
(30%) Process
This component reflects the student's quality of work and will include the following:
(10%) Seminar Attendance
This component reflects the student's attendance at departmental seminars during the junior and senior year. This grade will be calculated from the number of unexcused absences a student accumulates during this time period.
(30%) Final Paper
This component is determined by the paper written by the student. The student's research advisor will determine this grade based on the following criteria:
(20%) Seminar Presentation
This component, evaluated by the student's research advisor, is based on the student's presentation. The following criteria will be used to determine this grade:
(10%) Deadlines
This component reflects how well the student has met established deadlines for completion of the research project and will be determined by the CHEM 350/351 coordinator. The deadlines, given to students in September of their senior year, apply to the following tasks:


text:
Bangalore, Solar Power Projects Call: +919482276743, www.coronaenergy.co
- City: Bangalore
- Country: India
- Zip/Postal Code: 560024
- Website URL: http://coronaenergy.co/
- Listed: November 13, 2017 11:36 am
- Expires: 22 days, 18 hours
www.coronaenergy.co SOLAR CORONA ENERGY PRIVATE LIMITED one of the leading Solar PV Power & Solar Power Solutions Company based in Bangalore India. Solar Corona Energy has hands-on experience on implementing Solar Energy Plants and Projects for variety of verticals. We are Experts in Solar Power Feasibility Study, Liasoning, Design & Development, Engineering (Mech., Civil, Elec.), Project Management, Installation & Services, Operation & Maintenance etc. To make your Solar Energy Plan and Consultation Call: Ganga – +919482276743, +918022330430, E-mail: firstname.lastname@example.com
27 total views, 1 today


text:
PESHAWAR, Jan 11: Treasury members in Khyber Pakhtunkhwa Assembly on Friday expressed reservations about appointment of retired officers in the provincial ombudsman secretariat and that too without advertising the posts.
During question-answer session, MPA Noor Sahar pointed out that the provincial ombudsman had hired services of retired and aged officers for key posts in the secretariat. She said that these vacant posts had not been advertised.
She said that a large number of qualified people were jobless therefore the government should make fresh appointments instead of hiring services of retired people. MPAs Shazia Tehmas, Shagufta Malik, Nighat Orakzai and Mufti Kifayatullah of Muttahida Majlis-i-Amal supported the mover and demanded to refer the question to the committee concerned.
Law minister Arshad Abdullah explained that the existing law empowered the ombudsman to fill some posts, including that of advisers and consultants, on contract basis. He said that only regular posts could be advertised.
He said that the ombudsman secretariat was enjoying autonomy according to the law and the newly-established secretariat required experienced advisers and consultants at this stage. According to the written reply, the incumbent ombudsman has appointed retired district and sessions judge Shahjee Rehman as advisor-I on a fixed monthly salary of Rs80,000.
Advisor-II Faqir Hussain, retired additional inspector general of police, is also getting Rs80,000 while six more posts of consultants and investigation officers had also been filled on contract basis.
Meanwhile, the lawmakers criticised Muttahida Qaumi Movement chief Altaf Hussain for "ridiculing" Quaid-i-Azam Mohammad Ali Jinnah in his speech and demanded the Supreme Court chief justice to take suo motu notice of the MQM chief's statement.
On a point of order, MMA legislator Mr Kifayatullah said that Altaf Hussain had carried out a "drone strike" on the Founder of the Nation and tried to make his position controversial. He said that the MQM chief had finally unveiled his "Jinnah Pur" plan by warning of division of Sindh province.
He alleged that the MQM had planned to make Jinnah Pur comprising Karachi, Hyderabad and other Urdu speaking areas of Sindh.
He alleged that the MQM had set up a death squad and people of other ethnic groups were being murdered in Karachi and Hyderabad. He demanded of the chief justice to take action against Altaf Hussain.
MPA Nighat Orakzai said that leaders of other political parties, including Benazir Bhutto and Mian Nawaz Sharif, had also adopted self exile abroad, but never applied for passports of other countries. She said that Altaf Hussain had dual nationality and he had tried to defame Quaid-i-Azam. She also demanded a suo motu action against him by the apex court.
Sardar Shamoon Yar of PML-N criticised the electronic media for telecasting the speech of Altaf Hussain, who tried to tarnish the image of Quaid-i-Azam. He asked the British government to take action against the MQM chief.
Information minister Mian Iftikhar Hussain also flayed the statement of Altaf Hussain and said that he had tried to distort history. "Unfortunately history is being distorted and facts are not told to the nation," he said, adding that many leaders who had played a great role in the freedom of sub-continent were declared traitors.
He said that Quaid-i-Azam had British passport because Pakistan was not created at that time and the country remained under the domain of British Empire till 1956. He also termed march of Tehrik-i-Minhajul Quran undemocratic and unconstitutional.
LEGISLATION: A bill concerning child marriages restraints (amendment), 2013 was withdrawn after the information minister said that the proposed law would open up a "Pandora's box". Treasury member Munawar Sultana was introducing the bill.
Moreover, child protection and welfare (amendment) bill 2013 and prevention and control of women trafficking bill, 2013 being introduced by MPAs Noor Sahar and Shazia Tehmas, respectively were kept pending.
Meanwhile, the information minister has become parliamentary leader of Awami National Party. The seat had fallen vacant after assassination of senior minister Bashir Ahmad Bilour.


text:
Don't miss your chance to see Soundgarden in Montreal! Check out the schedule below for the concert date of your choice, then buy your Soundgarden Montreal tickets before they sell out!
Looking for Soundgarden tickets in other cities? View all Soundgarden tickets »
Sorry! We couldn't find any events for Soundgarden in Montreal.
If you were searching to see if Soundgarden is coming to Montreal, then you're in luck! For their latest tour, Soundgarden will indeed hold a concert in Montreal. Have an awesome concert experience when you go to see Soundgarden in Montreal. Get your Soundgarden tickets Montreal and join fellow fans for a concert to remember!


text:
Question: I loved the show St. Elsewhere. Is there any station that carries it? Also, didn't a younger Helen Hunt play on it at one time as one of the doctor's girlfriends or wives?
Televisionary: Yes and yes.
						 						You can catch St. Elsewhere reruns on the heaven-sent TV Land (and I say that without a hint of sarcasm I love that network). There's just one catch: unless you're nocturnal you'll have to set your VCR. The classic drama is on every day, but at 4 am/ET.
Ms. Hunt played recurring character Clancy Williams, the love interest of Dr. Jack Morrison (David Morse) on the show. Also of note in the cast were a young(er) Denzel Washington and ace actor and Screen Actors Guild President William Daniels, whom you'll be seeing a lot more of should that looming SAG strike happen next year.
As for how much younger Helen Hunt was on the show, it depends upon whose model of time you apply: Einstein's or Hollywood's. See, according to the entertainment way of aging people, if she was in her mid-20s when she was on that show (and I'm guessing), which went off the air in 1988, then she'd be about 30 or 31 today. (Let me stress, by the way, that I have no idea how old she says she is she may be perfectly honest about it. It just seems whenever I see a number associated with a star who's been around a while, I've on average aged six years to their two or three. So color me a kneejerk skeptic.)
Since she's over 22, she's already playing romantic leads opposite men of Jack Nicholson's age. Give her five years. They'll cast her as Jack Lemmon's lover and Amanda Peet's grandma.


text:
Toledo's Premier Ballroom Dance Instruction
We are a friendly community of dancers and fitness devotees, meeting in our comfortable, chic studio. Whether your goal is to become a better dancer, get physically fit, have fun with friends, or meet new friends, we're here to help you experience the beauty of body movement as taught by well-trained, professional dancers and instructors.
New Student Ballroom & Latin Dance Introductory Special
If you've never taken a private lesson, you may be surprised at how quickly you can learn at Paulette's Studio of Dance. If you are a beginner, you will learn the foundations of Ballroom and Latin dancing. If you are an intermediate dancer, you can take your skills to the next level. The introductory special includes two private, 45 minute dance sessions with one of our talented instructors; one group dance class; and one Dance Party.
Toledo's Best Dance Parties
Special Event Dance Parties at Paulette's are scheduled to immediately follow our Ballroom group class. Enjoy Ballroom and Latin dancing in our chic studio. Our dance parties are a fun way practice your dance skills and meet new friends. You do not need a partner. Beginners and long-time dancers are welcome. Join us for a fun night of dancing and socializing. View the calendar to see see what's scheduled next.
Paulette's Studio of Dance
Toledo's Best Dance Classes & Parties
Ballroom & Latin Dance Classes
Group Classes Are Held Every Friday
Wedding Dance Lessons
Make Every Dance Perfect on Your Wedding Day
Pole Fitness
Get Fit, Feel Empowered, Exhilarated & Find Your Inner Diva
Aerial Fitness
Get in Shape & Experience the Joy of Weightlessness
Argentine Tango
Learn the World's Ultimate Dance of Passion for Couples
Posture Training
Correct Posture Problems to Improve Your Health & Well-being


text:
A beach resort called Honey!
honey beach postcard 3
Originally uploaded by antondiaz.
Proceed with caution :)
I love beaches and when I got hold a copy of Philmap's beaches of the Philippines, I immediately looked for a beach area that is a driving distance from Manila but still exotic (or unexplored). I fell in love with the pictures of Honey Beach which is located in Sawang,Lobo, Batangas. Finally last Independence Day weekend, we had a chance with my wife's balikbayan friend, Espie. Yes, Lobo batangas beaches are not popular -- I can't find any google info about these beaches and nobody talks about them and I now understand why. Aside from the Philmap's article, which focuses too much on the positive and don't give you the negatives, I intend to give you local travelers, adventurers and beach lover like me what to expect and how to have a fun time in Lobo beaches.
Here are some of the key highlights:
Honey Beach Accomodation is OK for family/friends specially if you have kids! The place is a private resort (recently opened to the public) owned by the Macalintals who shuttles back and forth between the US and their retirement place in Honey Beach. There is a whole article on the background of the place in Philmap's article and I don't intend to replicate it here. There are only 2 airconditioned rooms (suppose to be good for 5 each but from experience one can have 4 and the other 3 persons that could sleep comfortably) and 2 cottages (suppose to be good for 12 there are only two beds and the rest should sleep in a banig or mattress). Resorts should be more truthful on the maximum capacity of the rooms considering that people are not skinny girls and people needs to sleep comfortably. Having said that, since the place is a little private it is ideal for kids because it is not crowded, there is a putting green where the kids can play with the golf balls, and the service is warm + personalized.
You would spend P3,500 for the airconditioned room and P600/person for 3 meals (lunch, dinner, breakfast). Service Charge is not included and they have a song and dance number when you arrive that encourages you to provide the staff tips if you feel happy about their service.
This is definitely a great place to relax and breath fresh air with your family and friends!
There are alot of negatives (consider yourself warned!)
1. The road going to Lobo is terrible (although it has improved alot from a few years ago) -- 20km of rough roads sporadically spread throughout your journey to Lobo. Bring a big car or SUV -- highly recommended.
2. The Lobo beaches sunrise is behind the mountains and sunsets in front of the resorts but still behind the mountains (not the horizon). You have a feeling that there is something wrong with your location and wanted to move the mountains. So this is not an ideal place for sunrise/sunset shots.
3. Although they would say that the beach area in front of the resort is already protected recently (proclaimed as a marine sanctuary)-- the catch is the corals are alread DEAD! It is so sad that the fisherman killed the vast corals and snorkeling is a sad experience. It's like looking through grey dead corals.
4. The beach area in front of honey beach is disappointing. It is definitely not white, lots of rocks, and it is only clear in the morning but looks murky in the afternoon. Don't expect a stretch of white beach along a cove. Although, there are nearby resorts which have the kind of beach (submarine, and lily) -- This would be next on our lists of places to explore.
Some tips on how to make your trip exciting and fun.
1. Since it is a private resort, there are only a few things you can order. We can't even order san mig light, peanuts, and the like. Since there are no corkage anyway, bring the drinks and junk foodies you need to make your stay alot more exciting. Drinking by the beach is definitely a must!
2. There are two ways to go to Lobo, one is via Batangas City and the other one via Rosario which is 30 minutes shorter. Both have a long stretch of rough roads. I would suggest to go via Batangas city (just follow the road going to Ponte Fino which leads all the way to Lobo) and on the way back go via the Rosario Batangas route. I suggest that you make Ponte Fino as a stop over and savor the nice view of the pool in this hotel. If you don't know your way to Ponte Fino, just go via Startoll-- exit batangas city-- turn right after the exit toll-- just go straight past the batangas pier and makro batangas-- turn left going to ponte fino and follow the signs. Email me if you need directions.
3. This is an ideal getaway from all the hussle and bussle of manila. So bring your close friends and family and enjoy the night away.
More Information:
>> Photoset on Honey Beach, Lobo Batangas
>> Honey beach tag on Flickr photo
Click below for the contact info: