• Journal of Intelligence and Information Systems
• /
• v.15 no.2
• /
• pp.49-59
• /
• 2009

Contents-based image retrieval methods are in general more objective and effective than text-based image retrieval algorithms since they use color and texture in search and avoid annotating all images for search. SIM(Self-organizing Image browsing Map) is one of contents-based image retrieval algorithms that uses only browsable mapping results obtained by SOM(Self Organizing Map). However, SOM may have an error in selecting the right BMU in learning phase if there are similar nodes with distorted color information due to the intensity of light or objects' movements in the image. Such images may be mapped into other grouping nodes thus the search rate could be decreased by this effect. In this paper, we propose an improved SIM that uses HSV color model in extracting image features with color quantization. In order to avoid unexpected learning error mentioned above, our SOM consists of two layers. In learning phase, SOM layer 1 has the color feature vectors as input. After learning SOM Layer 1, the connection weights of this layer become the input of SOM Layer 2 and re-learning occurs. With this multi-layered SOM learning, we can avoid mapping errors among similar nodes of different color information. In search, we put the query image vector into SOM layer 2 and select nodes of SOM layer 1 that connects with chosen BMU of SOM layer 2. In experiment, we verified that the proposed SIM was better than the original SIM and avoid mapping error effectively.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.3
• /
• pp.91-101
• /
• 2011

Internet is becoming increasingly popular due to the rapid development of information and communication technology. There has been a convenient social activities such as the mutual exchange of information, e-commerce, internet banking, etc. through cyberspace on a computer. However, by using the convenience of the internet, the personal IDs(identity card, driving license, passport, student ID, etc.) represented by the electronic media are exposed on the internet frequently. Therefore, this study propose a feature extraction method to analyze the characteristics of image files containing personal information and a image retrieval method to find the images using the extracted features. The proposed method selects the feature information from color, texture, and shape of the images, and the images as searched by similarity analysis between feature information. The result which it experiments from the image which it acquires from the web-based image DB and correct image retrieval rate is 89%, the computing time per frame is 0.17 seconds. The proposed method can be efficiently apply a system to search the image files containing personal information and to determine the criteria of exposure of personal information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7C
• /
• pp.719-725
• /
• 2003

The content-based image retrieval system extracts features of color, shape and texture from raw images, and builds the database with those features in the indexing process. The search in the whole retrieval system is defined as a process which finds images that have large similarity to query image using the feature database. This paper proposes a new two-stage search method in the content-based image retrieval system. The method is that the features are condensed and stored by the property of Cauchy-Schwartz inequality in order to reduce the similarity computation time which takes a mostly response time from entering a query to getting retrieval results. By the extensive computer simulations, we have observed that the proposed two-stage search method successfully reduces the similarity computation time while maintaining the same retrieval relevance as the conventional exhaustive search method. We also have observed that the method is more effective as the number of images and dimensions of the feature space increase.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.8
• /
• pp.1859-1866
• /
• 2015

This paper presents a novel makeup simulation method for powder application. We propose a color appearance model for powder coated skin that is simple but yet capable of producing realistic visual results. From the photos of several artificial skins before and after powder application, the translucency and thickness parameters are achieved by fitting the color model to the photos. Thickness patterns of powder application on actual human face skin is also extracted, and used in makeup simulations on photos of different human face to give more visually appealing results. From experiments, we found that the simulation results are quite realistic, and expect that the proposed makeup simulation can be used as a virtual coloring test in the cosmetic labs.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2020.11a
• /
• pp.220-223
• /
• 2020

초해상화란, 저해상도의 영상으로부터 고해상도 영상을 복원하는 이미지 처리 기법이다. 최근 영상 출력 장치의 발전으로 고해상도의 영상을 출력할 장치는 많아지는 한편, 이에 맞는 고해상도 영상을 찍을 영상 기록 장치의 보급은 이에 비해 부족한 실정이다. 따라서 저해상도의 영상을 고해상도 영상으로 변환하는 초해상화 연구는 많은 분야에서 활용되고 있다. 문화재 영상에서의 초해상화는 특히 기존 문화재의 질감, 무늬 등을 보존해야하기 때문에 정교한 초해상화 과정이 요구된다. 본 논문에서는 문화재 영상의 초해상화 과정에 집중해, 기존 문화재의 질감, 무늬 등을 잘 보존하면서 영상 데이터의 양이 상대적으로 적은 경우에도 활용 가능한 기계학습 기범, GLM-SI를 이용한 문화재 영상 초해상화 방법을 제안한다. GLM-SI 를 사용한 초해상화 결과, 문화재 영상에서 선행 방법인 SI 에 비하여 4 배 초해상화에서 PSNR 0.12dB, SSIM 0.017, 8 배 초해상화에서 PSNR 0.23dB, 0.033 의 성능적 향상을 얻을 수 있었다.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.281-289
• /
• 2002

Few studies have been systematically pursued on a multimedia data mining in despite of the over-whelming amounts of multimedia data by the development of computer capacity, storage technology and Internet. Based on the preliminary image processing and content-based image retrieval technology, this paper presents the methods for discovering association rules from recurrent items with spatial relationships in huge data repositories. Furthermore, multimedia mining algorithm is proposed to find implicit association rules among objects of which content-based descriptors such as color, texture, shape and etc. are recurrent and of which descriptors have spatial relationships. The algorithm with recurrent items in images shows high efficiency to find set of frequent items as compared to the Apriori algorithm. The multimedia association-rules algorithm is specially effective when the collection of images is homogeneous and it can be applied to many multimedia-related application fields.

• Journal of Broadcast Engineering
• /
• v.5 no.1
• /
• pp.50-60
• /
• 2000

In this paper, we propose a new composite feature consists of both color and shape information that are suitable for the task of character image retrieval. This approach extracts shape-based information using Zernike moments from Y image in YCbCr color space. Zernike moments can extract shape-based features that are invariant to rotation, translation, and scaling. We also extract color-based information from the DCT coefficients of Cr and Cb image. This approach is good method reflecting human visual property and is suitable for web application such as large image database system and animation because higher retrieval rate has been achieved using only 36 features. In experiment, this method is applied to 3,834 character images. We confirmed that this approach brought about excellent effect by ANMRR(Average of Normalized, Modified Retrieval Rank), which is used in the evaluation measure of MPEG-7 color descriptor and BEP(Bull's Eye Performance), which is used in evaluation measure of shape descriptor in character image retrieval.

• The KIPS Transactions:PartD
• /
• v.9D no.1
• /
• pp.57-64
• /
• 2002

Few studies have been systematically pursued on a multimedia data mining in despite of the overwhelming amounts of multimedia data by the development of computer capacity, storage technology and Internet. Based on the preliminary image processing and content-based image retrieval technology, this paper presents the methods for discovering association rules from recurrent items with spatial relationships in huge data repositories. Furthermore, multimedia mining algorithm is proposed to find implicit association rules among objects of which content-based descriptors such as color, texture, shape and etc. are recurrent and of which descriptors have spatial relationships. The algorithm with recurrent items in images shows high efficiency to find set of frequent items as compared to the Apriori algorithm. The multimedia association-rules algorithm is specially effective when the collection of images is homogeneous and it can be applied to many multimedia-related application fields.

• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.39-48
• /
• 2009

This study reviews the limit of image search by considering on the image search methods related to content-based image retrieval and suggests a user interface for more efficient content-based image retrieval and the ways to utilize image properties. For now, most studies on image search are being performed focusing on content-based image retrieval; they try to search based on the image's colors, texture, shapes, and the overall form of the image. However, the results are not satisfactory because there are various technological limits. Accordingly, this study suggests a new retrieval system which adapts content-based image retrieval and the conventional keyword search method. This is about a way to attribute properties to images using texts and a fast way to search images by expressing the attribute of images as keywords and utilizing them to search images. Also, the study focuses on a simulation for a user interface to make query language on the Internet and a search for clothes in an online shopping mall as an application of the retrieval system based on image attribute. This study will contribute to adding a new purchase pattern in online shopping malls and to the development of the area of similar image search.

• Journal of Broadcast Engineering
• /
• v.23 no.4
• /
• pp.503-510
• /
• 2018

Restoring of damaged images is a fundamental problem that was attempted before digital image processing technology appeared. Various algorithms for reconstructing damaged images have been introduced. However, the results show inferior restoration results compared with manual restoration. Recent developments of DNN (Deep Neural Network) have introduced various studies that apply it to image restoration. However, if the wide area is damaged, it can not be solved by a general interpolation method. In this case, it is necessary to reconstruct the damaged area through contextual information of surrounding images. In this paper, we propose an image restoration network using a generative adversarial network (GAN). The proposed system consists of image generation network and discriminator network. The proposed network is verified through experiments that it is possible to recover not only the natural image but also the texture of the original image through the inference of the damaged area in restoring various types of images.