• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.1
• /
• pp.33-42
• /
• 2001

Recently, the interests in the 3D image, generated from the range data and CAD, have exceedingly increased, accordingly a various 3D image database is being constructed. The efficient and fast scheme to access the desired image data is the important issue in the application area of the Internet and digital library. However, it is difficult to manage the 3D image database because of its huge size. Therefore, a proper descriptor is necessary to manage the data efficiently, including the content-based search. In this paper, the proposed shape descriptor is based on the voxelization of the 3D image. The medial axis transform, stemming from the mathematical morphology, is performed on the voxelized 3D image and the graph, which is composed of node and edge, is generated from skeletons. The generated graph is adequate to the novel shape descriptor due to no loss of geometric information and the similarity of the insight of the human. Therefore the proposed shape descriptor would be useful for the recognition of 3D object, compression, and content-based search.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.201-204
• /
• 2007

In this paper, we research the content-based analysis and classification according to the composition of the feature parameters pool for the auditory signals to implement the auditory indexing and searching system. Auditory data is classified to the primitive various auditory types. we described the analysis and feature extraction method for the feature parameters available to the auditory data classification. And we compose the feature parameters pool in the indexing group unit, then compare and analysis the auditory data centering around the including level and indexing criterion into the audio categories. Based on this result, we composit feature vectors of audio data according to the classification categories, then experiment the classification using discrimination function.

• International Journal of Knowledge Content Development & Technology
• /
• v.8 no.2
• /
• pp.49-65
• /
• 2018

Are the benefits derived from ICT based reference and information service worth the financial and other commitments devoted to it? In an attempt to answer this, this study delved into finding out the perceived benefits; the rational for ICT based reference services in Nigerian university libraries. The main objectives were to find out the purposes for using ICT facilities in reference services delivery and the perceived benefits derived from using ICT resources in reference and information services. Being a survey, questionnaire was used to collect data from the librarians of twelve (12) universities; two (2) each sampled from the six geopolitical zones of Nigeria. Data was analyzed using frequencies, mean scores and standard deviations. ANOVA statistical analysis was used to test the hypothesis of no significance difference in the benefits derived from ICT based reference services using p-value of 0.05 to calculate the level of significance. Findings showed that librarians and library users made use of ICT facilities for different reference purposes especially to obtain information they need using the internet. Other reference needs for which patrons used the ICT facilities included: - access to current e-books and e - journals, user education and access to global information in other libraries. Provision of current awareness services (CAS) and selective dissemination of information services (SDI), on-line searching using workstations in the library, provision of on-line public access catalogue (OPAC) services, keeping statistics of users of the reference section and compilation of bibliographies. Further findings showed that the librarians and library users derive a lot of benefits from their use of ICT facilities in reference services. The results showed that easy retrieval and dissemination of information to patrons were ranked highest by the librarians amongst others.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.24-27
• /
• 2008

As shown in Wikipedia, tagging or cross-linking through major key-words improves the readability of documents. Recently, the Semantic Web rises the importance of social tagging as a key feature of the Web 2.0 and Tag Cloud has emerged as its crucial phenotype. In this paper we provides an efficient method of automated keyword tagging based on controlled term collection, where the computational complexity of O(mN) - if pattern matching algorithm is used - can be reduced to O(mlogN) - if Information Retrieval is adopted - while m is the length of target document and N is the total number of candidate terms to be tagged. The result shows that IR-based tagging speeds up 5.6 times compared with fast pattern matching algorithm.

• Journal of Digital Convergence
• /
• v.20 no.1
• /
• pp.179-184
• /
• 2022

With the development of information and communication technology, the production and distribution of digital contents is rapidly increasing, and the distribution of illegally copied contents also increases, causing various problems. In order to prevent illegal distribution of contents, a DRM (Digital Rights Management)-based approach can be used, but in a situation where the contents are already copied and distributed, a method of searching and detecting the duplicated contents is required. In this paper, a duplication detection method based on the contents of video content is proposed. The proposed method divides the video into scene units using the visual rhythm extracted from the video, and hierarchically applies the playback time and color feature values of each divided scene to quickly and efficiently detect duplicate videos in a large database. Through experiments, it was shown that the proposed method can reliably detect various replication modifications.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.315-322
• /
• 2008

Searching a location of the copied video in video database, signatures should be robust to video reediting, channel noise, time variation of frame rate. Several kinds of signatures has been proposed. Ordinal signature, one of them, is difficult to describe the spatial characteristics of frame due to the site of fixed window, $N{\times}N$, which is compute the average gray value. In this paper, I studied an algorithm of sequence matching in video copy detection for the copyright protection, employing the R-tree index method for retrieval and suggesting a robust ordinal signatures for the original video clips and the same signatures of the pirated video. Robust ordinal has a 2-dimensional vector structures that has a strong to the noise and the variation of the frame rate. Also, it express as MBR form in search space of R-tree. Moreover, I focus on building a video copy detection method into which content publishers register their valuable digital content. The video copy detection algorithms compares the web content to the registered content and notifies the content owners of illegal copies. Experimental results show the proposed method is improve the video matching rate and it has a characteristics of signature suitable to the large video databases.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.1
• /
• pp.9-20
• /
• 2005

Recently, the MPEG-7 standard a multimedia content description standard is wide]y used for content based image/video retrieval systems. However, since the descriptors standardized in MPEG-7 are usually multidimensional and the problem called 'Curse of dimensionality', previously proposed indexing methods(for example, multidimensional indexing methods, dimensionality reduction methods, filtering methods, and so on) could not be used to effectively index the multimedia database represented in MPEG-7. This paper proposes an efficient multimedia data indexing mechanism reflecting the characteristics of MPEG-7 visual descriptors. In the proposed indexing mechanism, the descriptor is transformed into a histogram of some attributes. By representing the value of each bin as a binary number, the histogram itself that is a visual descriptor for the object in multimedia database could be represented as a bit string. Bit strings for all objects in multimedia database are collected to form an index file, bitmap index, in the proposed indexing mechanism. By XORing them with the descriptors for query object, the candidate solutions for similarity search could be computed easily and they are checked again with query object to precisely compute the similarity with exact metric such as Ll-norm. These indexing and searching mechanisms are efficient because the filtering process is performed by simple bit-operation and it reduces the search space dramatically. Upon experimental results with more than 100,000 real images, the proposed indexing and searching mechanisms are about IS times faster than the sequential searching with more than 90% accuracy.

• Journal of Biosystems Engineering
• /
• v.27 no.2
• /
• pp.151-160
• /
• 2002

Cow image processing technique would be useful not only for recognizing an individual but also for establishing the image database and analyzing the shape of cows. A cow (Holstein) has usually the unique speckle pattern. In this study, the individual recognition of cow was carried out using the speckle pattern and the content-based image retrieval technique. Sixty cow images of 16 heads were captured under outdoor illumination, which were complicated images due to shadow, obstacles and walking posture of cow. Sixteen images were selected as the reference image for each cow and 44 query images were used for evaluating the efficiency of individual recognition by matching to each reference image. Run-lengths and positions of runs across speckle area were calculated from 40 horizontal line profiles for ROI (region of interest) in a cow body image after 3 passes of 5$\times$5 median filtering. A similarity measure for recognizing cow individuals was calculated using Euclidean distance of normalized G-frame histogram (GH). normalized speckle run-length (BRL), normalized x and y positions (BRX, BRY) of speckle runs. This study evaluated the efficiency of individual recognition of cow using Recall(Success rate) and AVRR(Average rank of relevant images). Success rate of individual recognition was 100% when GH, BRL, BRX and BRY were used as image query indices. It was concluded that the histogram as global property and the information of speckle runs as local properties were good image features for individual recognition and the developed system of individual recognition was reliable.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.3
• /
• pp.43-48
• /
• 2019

While reading text-only documents and finding unknown words, readers will become the focus disturbed and not be able to understand the content of the documents. Because children have little experience, it is difficult to understand correctly if the description in context is unfamiliar or ambiguous. In this paper, in order to help understand the text and increase the interest of the readers, we analyze the texts of documents and select the contents that are considered important, and implement a system that displays the most relevant images automatically from the web and links the texts and the images together. The implementation of the system divides the article into paragraphs, analyzes the text, selects important sentences for each paragraph and the important words that best represent the meaning of the important sentences, searches for images related to the words on the web, and then links the images to each of the previous paragraphs. Experiments have shown how to select important sentences and how to select important words in the sentences. As a result of the experiment, we could get 60% performance by evaluating the accuracy of the relation between three selected images and corresponding important sentences.

• Korean Journal of Soil Science and Fertilizer
• /
• v.45 no.2
• /
• pp.127-134
• /
• 2012

Microwave remote sensing can help monitor the land surface water cycle, crop growth and soil moisture. A ground-based polarimetric scatterometer has an advantage for continuous crop using multi-polarization and multi-frequencies and various incident angles have been used extensively in a frequency range expanding from L-band to Ka-band. In this study, we analyzed the relationships between L-, C- and X-band signatures and soil moisture content over the whole soybean growth period. Polarimetric backscatter data at L-, C- and X-bands were acquired every 10 minutes. L-band backscattering coefficients were higher than those observed using C- or X-band over the period. Backscattering coefficients for all frequencies and polarizations increased until Day Of Year (DOY) 271 and then decreased until harvesting stage (DOY 294). Time serious of soil moisture content was not a corresponding with backscattering over the whole growth stage, although it increased relatively until early August (R2, DOY 224). We conducted the relationship between the backscattering coefficients of each band and soil moisture content. Backscattering coefficients for all frequencies were not correlated with soil moisture content when considered over the entire stage ($r{\leq}0.50$). However, we found that L-band HH polarization was correlated with soil moisture content (r=0.90) when Leaf Area Index (LAI)<2. Retrieval equations were developed for estimating soil moisture content using L-band HH polarization. Relation between L-HH and soil moisture shows exponential pattern and highly related with soil moisture content ($R^2=0.92$). Results from this study show that backscattering coefficients of radar scatterometer appear effective to estimate soil moisture content.