• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3885-3895
• /
• 2000

The emergence of digital imaging and digital networks has made duplication of original artwork easier. In order to protect these creations, new methods for signing and copyrighting visual data are needed. In the last few years, a large number of schemes have heen proposed for hiding copyright marks and other information in digital image, video, audio and other multimedia objects. In this paper, we propose a technique for embedding the watermark of visually recognizable patterns into the frequency domain of images. The embedded watermark can be retrieved from the decoded sequence witbout knowledge of the original. Because the source image is not required to extract the watermark, one cannot make the fake original that is invertible to watermarking scheme from the waternlarked image. In order to recover the embedded signature data without knowledge of the original, a prediction of the original value of the pixel containing the information is needed. The prediction is based on a averaging of amplitude values in a neighborhood around the pixel itself. Additionally the projxJsed technique could survive several kinds of image processings including JPEG lossy compression.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.726-730
• /
• 2009

The proliferation of the web and digital photography has drastically increased multimedia data and has resulted in the need of the high quality internet service based on the moving picture like user generated contents(UGC). The keyword-based search on large scale images and video collections is too expensive and requires much manual intervention. Therefore the web search engine may provide the content-based retrieval on the multimedia data for search accuracy and customer satisfaction. In this paper, we propose a novel distributed index structure based on multiple length signature files according to data distribution. In addition, we describe how our scalable index technique can be used to find the nearest neighbors in the cluster environments.

• (The) Research of the performance art and culture
• /
• no.37
• /
• pp.5-31
• /
• 2018

The mask dance drama Goseong Ogwangdae's first act, Mundung Bukchum. The story is about a man who was born to the upper class but contracted leprosy, an incurable disease, due to his ancestors' accumulated sin. Although he is suffering, he is able to triumph over the disease through sinmyeong (catharsis) that is expressed through the wordless act of Mundung Bukchum. This thesis focuses on Goseong Ogwangdae's Mundung Bukchum, particularly the meaning, costume, accompanying music, and process of pedagogical transmission. The chronological characteristics of Goseong Ogwangdae's Mundung Bukchum are as follows. First, as time goes on, the number of dance motions in Mundung Bukchum has increased and the motions used have become reified. Second, I address the small barrel drum used in Mundung Bukchum and check how, through the drum, the changed expression of Mundung is shown.In a 1965 video introduced Mundung is grasping the drum and stick and the dance appears to be made up only of humorous motions. Also in a 1969 video, "Mundung Gwangdae," from the start Mundung is grasping the drum and stick. In 1988 in a video we can see the same scene as today, with the drum and stick sitting in the center of the stage at the start of the dance. We can also confirm that the same fourteen dance motions used today are present. Third, we can also confirm the changes in Goseong Ogwangdae's signature motion, baegimsae as time goes on. Observing the video from 1965, baegimsae does not appear in Mundung Bukchum. In 2000 we can clearly see the baegimsae performed once to the left and to the right while Mundung is squatting. Comparing 1969 to 1988, there is no symmetry in the motions, baegimsae is not done to both left and right, but only in one direction. Watching the record from 2000, the baegimsae motion is performed just as it is now, with the body thrown forward with a sharp push off the ground. Fourth I confirmed how the music used to accompany Goseong Ogwangdae's Mundung Bukchum has changed over time. In 1965 according to records of Mundung Bukchum's appearance, the dance was accompanied by the taryeong rhythmic pattern played on the usual four percussion instruments (barrel drum, hourglass drum, large gong, small gong). In the 1969 records of Mundung Bukchum the accompanying music is gutgeori rhythmic pattern performed on the usual four percussion instruments-an obvious difference. In 1988 the music with Mundung Bukchum is gutgeori rhythmic pattern transitioning into jajinmori rhythmic pattern. In 2000 the music with Mundung Bukchum includes the percussion instruments as well as taepyeongso (double reed oboe) playing gutgeori and jajinmori rhythmic patterns.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.1-12
• /
• 2003

Recently, there have been many indexing schemes for multimedia data such as image, video data. But recent database applications, for example data mining and multimedia database, are required to support multi-user environment. In order for indexing schemes to be useful in multi-user environment, a concurrency control algorithm is required to handle it. So we propose a concurrency control algorithm that can be applied to CBF (cell-based filtering method), which uses the signature of the cell for alleviating the dimensional curse problem. In addition, we extend the SHORE storage system of Wisconsin university in order to handle high-dimensional data. This extended SHORE storage system provides conventional storage manager functions, guarantees the integrity of high-dimensional data and is flexible to the large scale of feature vectors for preventing the usage of large main memory. Finally, we implement the web-based image retrieval system by using the extended SHORE storage system. The key feature of this system is platform-independent access to the high-dimensional data as well as functionality of efficient content-based queries. Lastly. We evaluate an average response time of point query, range query and k-nearest query in terms of the number of threads.