• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.3
• /
• pp.268-274
• /
• 2023

Image mosaicking is one of the basic and important technologies in the field of application using images. The key of image mosaicking is to extract seamlines from a joint image. The method proposed in this paper for image mosaicking is as follows. The feature points of the images to be joined are extracted and the joining form between the two images is identified. A reference position for detection the seamlines were selected according to the joint form, and an image pyramid was created for efficient image processing. The outlines of the image including buildings and roads are extracted from the overlapping area with low resolution, and the seamlines are determined by considering the components of the outlines. Based on this, the seamlines in the high-resolution image was re-searched and finally the seamline for image mosaicking was determined. In addition, in order to minimize color distortion of the image with the determined seamline, a method of improving the quality of the mosaic image by fine correction of the mosaic area was applied. It was confirmed that the quality of the seamline extraction results applying the method proposed was reasonable.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.1078-1099
• /
• 2021

Traditional image steganography hides secret information by embedding, which inevitably leaves modification traces and is easy to be detected by steganography analysis tools. Since coverless steganography can effectively resist steganalysis, it has become a hotspot in information hiding research recently. Most coverless image steganography (CIS) methods are based on mapping rules, which not only exposes the vulnerability to geometric attacks, but also are less secure due to the revelation of mapping rules. To address the above issues, we introduced camouflage images for steganography instead of directly sending stego-image, which further improves the security performance and information hiding ability of steganography scheme. In particular, based on the different sub-features of stego-image and potential camouflage images, we try to find a larger similarity between them so as to achieve the reversible steganography. Specifically, based on the existing CIS mapping algorithm, we first can establish the correlation between stego-image and secret information and then transmit the camouflage images, which are obtained by reversible sub-feature retrieval algorithm. The received camouflage image can be used to reverse retrieve the stego-image in a public image database. Finally, we can use the same mapping rules to restore secret information. Extensive experimental results demonstrate the better robustness and security of the proposed approach in comparison to state-of-art CIS methods, especially in the robustness of geometric attacks.

• Journal of information and communication convergence engineering
• /
• v.12 no.4
• /
• pp.263-270
• /
• 2014

Corner detection and feature extraction are essential aspects of computer vision problems such as object recognition and tracking. Feature detectors such as Scale Invariant Feature Transform (SIFT) yields high quality features but computationally intensive for use in real-time applications. The Features from Accelerated Segment Test (FAST) detector provides faster feature computation by extracting only corner information in recognising an object. In this paper we have analyzed the efficient object detection algorithms with respect to efficiency, quality and robustness by comparing characteristics of image detectors for corner detector and feature extractors. The simulated result shows that compared to conventional SIFT algorithm, the object recognition system based on the FAST corner detector yields increased speed and low performance degradation. The average time to find keypoints in SIFT method is about 0.116 seconds for extracting 2169 keypoints. Similarly the average time to find corner points was 0.651 seconds for detecting 1714 keypoints in FAST methods at threshold 30. Thus the FAST method detects corner points faster with better quality images for object recognition.

• Journal of Biomedical Engineering Research
• /
• v.43 no.6
• /
• pp.441-447
• /
• 2022

In this paper, we propose a pill identification model using engraved text feature and image feature such as shape and color, and compare it with an identification model that does not use engraved text feature to verify the possibility of improving identification performance by improving recognition rate of the engraved text. The data consisted of 100 classes and used 10 images per class. The engraved text feature was acquired through Keras OCR based on deep learning and 1D CNN, and the image feature was acquired through 2D CNN. According to the identification results, the accuracy of the text recognition model was 90%. The accuracy of the comparative model and the proposed model was 91.9% and 97.6%. The accuracy, precision, recall, and F1-score of the proposed model were better than those of the comparative model in terms of statistical significance. As a result, we confirmed that the expansion of the range of feature improved the performance of the identification model.

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

This paper describes the method to reduce the time-cost for depth estimation of an image by learning, on the basis of the Genetic Algorithm, the image's features. The depth information is estimated from the relationship among features such as the energy value of an image and the gradient of the texture etc. The estimation-time increases due to the large dimension of an image's features used in the estimating process. And the use of the features without consideration of their importance can have an adverse effect on the performance. So, it is necessary to reduce the dimension of an image's features based on the significance of each feature. Evaluation of the method proposed in this paper using benchmark data provided by Stanford University found that the time-cost for feature extraction and depth estimation improved by 60% and the accuracy was increased by 0.4% on average and up to 2.5%.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.376-379
• /
• 2008

This paper presents an image retrieval algorithm based on feature vector using color of histogram refinement for a faster and more efficient search in the process of content based image retrieval. First, we segment each of R, G, and B images from RGB color image and extract their respective histograms. Secondly, these histograms of individual R, G and B are divided into sixteen of bins each. Finally, we extract the maximum pixel values in each bins' histogram, which are calculated, compared and analyzed, Now, we can perform image retrieval technique using these maximum pixel value. Hence, the proposed algorithm of this paper effectively extracts features by comparing input and database images, making features from R, G and B into a feature vector table, and prove a batter searching performance than the current algorithm that uses histogram matching and ranks, only.

• Journal of Korea Multimedia Society
• /
• v.13 no.8
• /
• pp.1115-1127
• /
• 2010

In order to increase the productivity in manufacturing TFT-LCD(thin film transistor-liquid crystal display), it is essential to classify defects that occur during the production and make an appropriate decision on whether the product with defects is scrapped or not. The decision mainly depends on classifying the defects accurately. In this paper, we present an effective classification method for film defects acquired in the panel production line by analyzing the intensity distribution and shape feature of the defects. We first generate a binary image for each defect by separating defect regions from background (non-defect) regions. Then, we extract various features from the defect regions such as the linearity of the defect, the intensity distribution, and the shape characteristics considering intensity, and construct a referential image database that stores those feature values. Finally, we determine the type of a defect by matching a defect image with a referential image in the database through the matching cost function between the two images. To verify the effectiveness of our method, we conducted a classification experiment using defect images acquired from real TFT-LCD production lines. Experimental results show that our method has achieved highly effective classification enough to be used in the production line.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.11a
• /
• pp.181-185
• /
• 1998

Recently, research and developmental direction of communication system is concurrent adopting voice data and face image in speaking to provide more higher recognition rate then in the case of only voice data. Therefore, we present a method of lipreading in speech image sequence by using the 3-D facial shape model. The method use a feature information of the face image such as the opening-level of lip, the movement of jaw, and the projection height of lip. At first, we adjust the 3-D face model to speeching face image sequence. Then, to get a feature information we compute variance quantity from adjusted 3-D shape model of image sequence and use the variance quality of the adjusted 3-D model as recognition parameters. We use the intensity inclination values which obtaining from the variance in 3-D feature points as the separation of recognition units from the sequential image. After then, we use discrete HMM algorithm at recognition process, depending on multiple observation sequence which considers the variance of 3-D feature point fully. As a result of recognition experiment with the 8 Korean vowels and 2 Korean consonants, we have about 80% of recognition rate for the plosives and vowels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.7
• /
• pp.459-466
• /
• 2014

In this paper, we suggest an efficient image processing method for fast paper currency counting with pattern recognition. The patterns are consisted of feature data in each note object extracted from full reflection image of notes and a general contact image sensor(CIS) is used to aggregate the feature images. The proposed pattern recognition algorithm can endure image variation when the paper currency is scanned because it is not sensitive to changes of image resulting in successful note recognition. We tested 100 notes per denomination and currency of several countries including Korea, U.S., China, EU, Britain and Turkey. To ensure the reliability of the result, we tested a total of 10 times per each direction of notes. We can conclude that this algorithm will be applicable to commercial product because of its successful recognition rates. The 100% recognition rates are obtained in almost cases with exceptional case of 99.9% in Euro and 99.8% in Turkish Lira.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.724-732
• /
• 2001

In this paper, a new method of feature extraction of major objects to represent an image using Vector Quantization(VQ) is proposed. The principal features of the image, which are used in a content-based image retrieval system, are color, texture, shape and spatial positions of objects. The representative color and texture features are extracted from the given image using VQ(Vector Quantization) clustering algorithm with a general feature extraction method of color and texture. Since these are used for content-based image retrieval and searched by objects, it is possible to search and retrieve some desirable images regardless of the position, rotation and size of objects. The experimental results show that the representative feature extraction time is much reduced by using VQ, and the highest retrieval rate is given as the weighted values of color and texture are set to 0.5 and 0.5, respectively, and the proposed method provides up to 90% precision and recall rate for 'person'query images.