• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.1
• /
• pp.13-21
• /
• 2019

The content based on image retrieval makes use of features of information within image such as color, texture and share for Retrieval data. we present a novel approach for improving retrieval accuracy based on DCT Filter-Bank. First, we perform DCT on a given image, and generate a Filter-Bank using the DCT coefficients for each color channel. In this step, DC and the limited number of AC coefficients are used. Next, a feature vector is obtained from the histogram of the quantized DC coefficients. Then, AC coefficients in the Filter-Bank are separated into three main groups indicating horizontal, vertical, and diagonal edge directions, respectively, according to their spatial-frequency properties. Each directional group creates its histogram after employing Otsu binarization technique. Finally, we project each histogram on the horizontal and vertical axes, and generate a feature vector for each group. The computed DC and AC feature vectors bins are concatenated, and it is used in the similarity checking procedure. We experimented using 1,000 databases, and as a result, this approach outperformed the old retrieval method which used color information.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.3
• /
• pp.413-420
• /
• 2023

For a long time, researchers have presented excellent results in the field of image retrieval due to many studies on CBIR. However, there is still a semantic gap between these search results for images and human perception. It is still a difficult problem to classify images with a level of human perception using a small number of images. Therefore, this paper proposes an image classification model using deep learning-based transfer learning to minimize the semantic gap between images of people and search systems in image retrieval. As a result of the experiment, the loss rate of the learning model was 0.2451% and the accuracy was 0.8922%. The implementation of the proposed image classification method was able to achieve the desired goal. And in deep learning, it was confirmed that the CNN's transfer learning model method was effective in creating an image database by adding new data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.2007-2012
• /
• 2011

To reduce huge computation in the block matching, this paper proposes a fast block matching algorithm which limits search points in the search area. On the basis of two facts that most motion vectors are located in central part of search area and matching error is monotonic decreasing toward the best similar block, the proposed algorithm moves a matching pattern between steps by the one pixel, predicts the motion direction for the best similar block from similar blocks decided in previous steps, and limits movements of search points to ${\pm}45^{\circ}C$ on it. As a result, it could remove the needless search points and reduce the block matching computation. In comparison with the conventional similar algorithms, the proposed algorithm caused the trivial image degradation in images with fast motion but kept the equivalent image quality in images with normal motion, and it, meanwhile, reduced from about 20% to over 67% of the their block matching computation.

• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1080-1087
• /
• 2005

Significant computations for full search (FS) motion estimation have been a big obstacle in real-time video coding and recent MPEG-4 AVC (advanced video coding) standard requires much more computations than conventional MPEG-2 for motion estimation. To reduce an amount of computation of full search (FS) algorithm for fast motion estimation, we propose a new and fast matching algorithm without any degradation of predicted images like the conventional FS. The computational reduction without any degradation in predicted image comes from fast elimination of impossible candidate motion vectors. We obtain faster elimination of inappropriate motion vectors using efficient matching units from localization of complex area in image data and dithering order based matching scan. Our algorithm reduces about $30\%$ of computations for block matching error compared with the conventional partial distortion elimination (PDE) algorithm, and our algorithm will be useful in real-time video coding applications using MPEG-4 AVC or MPEG-2.

• Archives of design research
• /
• v.13 no.1
• /
• pp.49-58
• /
• 2000

This study is to implement the search system of human sensibility ergonomics in the internet shopping mall, which is a the electronic commerce in the contemporary as a shopping culture on the internet. Instead a category of business, an item, cost & size is using the keyword of a search in a existing shopping mall, the research is accomplished the center of system selecting products by the sensitivity feeling in products. The search system chooses the proper item and makes database with the sensible vocabulary for its image and then searches the item chosen by customers with keywords of the vocabulary after constructing web-server on the internet. This study - systematizes customers' sensible needs with more practical ways. - recognize the customers' sense on items and provides the applied technology conditions tor customers. - gives more opportunities of choice to customers on the internet shopping mall. - supplies various information and approaches to the customers' needs with practice.

• The KIPS Transactions:PartB
• /
• v.9B no.2
• /
• pp.199-204
• /
• 2002

Since motion estimation and motion compensation methods remove the redundant data to employ the temporal redundancy in images, it plays an important role in digital video compression. Because of its high computational complexity, however, it is difficult to apply to high-resolution applications in real time environments. If we have information about the motion of an image block before the motion estimation, the location of a better starting point for the search of an exact motion vector can be determined to expedite the searching process. In this paper, we present an adaptive motion estimation approach bated on temporal correlations of consecutive image frames that defines the search pattern and determines the location of the initial search point adaptively. Through experiments, compared with DS(Diamond Search) algorithm, the proposed algorithm is about 0.1∼0.5(dB) better than DS in terms of PSNR(Peak Signal to Noise Ratio) and improves as high as 50% compared with DS in terms of average number of search point per motion vector estimation.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.11
• /
• pp.521-528
• /
• 2021

Existing image analysis systems in use in the military field are carried out by readers analyzing and identifying images themselves, writing and disseminating related content, and in this process, repetitive tasks are frequent, resulting in workload. In this paper, to solve the previous problem, we proposed an algorithm that can operate the Seq2Seq model on a word basis, which operates on a sentence basis, and applied the Attention technique to improve accuracy. In addition, by applying the Beam Search technique, we would like to recommend various current identification sentences based on the past identification contents of a specific area. It was confirmed through experiments that the Beam Search technique recommends sentences more effectively than the existing greedy Search technique, and confirmed that the accuracy of recommendation increases when the size of Beam is large.

• Journal of Information Technology Applications and Management
• /
• v.10 no.3
• /
• pp.45-54
• /
• 2003

Security system with web camera remarkably has been developed at an Internet era. Using transmitted images from remote camera, the system can recognize current situation and take a proper action through web. Existing motion detection methods use simply difference image, background image techniques or block matching algorithm which establish initial block by set search area and find similar block. But these methods are difficult to detect exact motion because of useless noise. In this paper, the proposed method is updating changed background image as much as $N{\times}M$pixel mask as time goes on after get a difference between imput image and first background image. And checking image pixel can efficiently detect motion by computing fixed distance pixel instead of operate all pixel.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.2
• /
• pp.16-27
• /
• 2011

Embryo is a very early stage of the development of multicellular organism such as animals and plants. It is an important research target for studying ontogeny because the fundamental body system of multicellular organism is determined during an embryo state. Researchers in the developmental biology have a large volume of embryo image databases for studying embryos and they frequently search for an embryo image efficiently from those databases. Thus, it is crucial to organize databases for their efficient search. Hierarchical clustering methods have been widely used for database organization. However, most of previous algorithms tend to produce a highly skewed tree as a result of clustering because they do not simultaneously consider both the size of a cluster and the number of objects within the cluster. The skewed tree requires much time to be traversed in users' search process. In this paper, we propose a method that effectively organizes a large volume of embryo image data in a balanced tree structure. We first represent embryo image data as a similarity-based graph. Next, we identify clusters by performing a graph partitioning algorithm repeatedly. We check constantly the size of a cluster and the number of objects, and partition clusters whose size is too large or whose number of objects is too high, which prevents clusters from growing too large or having too many objects. We show the superiority of the proposed method by extensive experiments. Moreover, we implement the visualization tool to help users quickly and easily navigate the embryo image database.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.28 no.7
• /
• pp.1120-1128
• /
• 2022

In the event of a marine accident, the longer the exposure time to the sea increases, the faster the chance of survival decreases. However, because the search area of the sea is extremely wide compared to that of land, marine object detection technology based on the sensor mounted on a satellite or an aircraft must be applied rather than ship for an efficient search. The purpose of this study was to rapidly detect an object in the ocean using a hyperspectral image sensor mounted on an aircraft. The image captured by this sensor has a spatial resolution of 8,241 × 1,024, and is a large-capacity data comprising 127 spectra and a resolution of 0.7 m per pixel. In this study, a marine object detection model was developed that combines a seawater identification algorithm using DBSCAN and a density-based land removal algorithm to rapidly analyze large data. When the developed detection model was applied to the hyperspectral image, the performance of analyzing a sea area of about 5 km² within 100 s was confirmed. In addition, to evaluate the detection accuracy of the developed model, hyperspectral images of the Mokpo, Gunsan, and Yeosu regions were taken using an aircraft. As a result, ships in the experimental image could be detected with an accuracy of 90 %. The technology developed in this study is expected to be utilized as important information to support the search and rescue activities of small ships and human life.