• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3790-3803
• /
• 2018

Content-based image retrieval is an approach used to query images based on their semantics. Semantic based retrieval has its application in all fields including medicine, space, computing etc. Semantically generated binary hash codes can improve content-based image retrieval. These semantic labels / binary hash codes can be generated from unlabeled data using convolutional autoencoders. Proposed approach uses semi-supervised deep hashing with semantic learning and binary code generation by minimizing the objective function. Convolutional autoencoders are basis to extract semantic features due to its property of image generation from low level semantic representations. These representations of images are more effective than simple feature extraction and can preserve better semantic information. Proposed activation and loss functions helped to minimize classification error and produce better hash codes. Most widely used datasets have been used for verification of this approach that outperforms the existing methods.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.39-42
• /
• 2000

In our study, by observing and analyzing normal liver in abdominal CT image, we estimated gray value range and generated binary image. In the binary image, we achieved the number of hole which is located between pixels. Depending on the ratio, we processed the input image to 4 kinds of mesh images to remove the noise part that has the different ratio. With the Union image of 4 kinds of mesh images, we generated the template representing general outline of liver and subtracted from the binary image so the we can represent the organ boundary to be minute. With results of proposed method, processing time is reduced compared with existing method and we compared the result image to manual image of medical specialists.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.24 no.1
• /
• pp.1-11
• /
• 2021

Detection of surface water features including river, wetland, reservoir from the satellite imagery can be utilized for sustainable management and survey of water resources. This research compared the water indices derived from the multispectral bands and the machine learning technique for detecting the surface water features from he Landsat-8 satellite image acquired in Daegu through the following steps. First, the NDWI(Normalized Difference Water Index) image and the MNDWI(Modified Normalized Difference Water Index) image were separately generated using the multispectral bands of the given Landsat-8 satellite image, and the two binary images were generated from these NDWI and MNDWI images, respectively. Then SVM(Support Vector Machine), the widely used machine learning techniques, were employed to generate the land cover image and the binary image was also generated from the generated land cover image. Finally the error matrices were used for measuring the accuracy of the three binary images for detecting the surface water features. The statistical results showed that the binary image generated from the MNDWI image(84%) had the relatively low accuracy than the binary image generated from the NDWI image(94%) and generated by SVM(96%). And some misclassification errors occurred in all three binary images where the land features were misclassified as the surface water features because of the shadow effects.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.10
• /
• pp.6317-6321
• /
• 2014

Multimedia documents can be transferred quickly and easily across the Internet, and has attracted considerable interest in multimedia security and multimedia copyright protection. This paper proposes an animage watermarking scheme embedding a binary watermark image using Discrete Wavelet Transform (DWT) coefficients. The original image is transformed to the wavelet domain and decomposed in subbands. The binary watermark image, as a sequence of bits, is embedded into the middle frequency subbands. The original image is not needed to detect the watermark image. The proposed method detected fewer watermark bits but produced an approximately 10dB higher PSNR than the max/min method.

• Journal of the Optical Society of Korea
• /
• v.19 no.2
• /
• pp.149-153
• /
• 2015

A digital micro-mirror device (DMD) has the potential to modulate an incident wave with high speed, and the application for holographic display has been studied by many researchers. However, the quality of reconstructed image isn't good in comparison with that from a gray-scale amplitude-only hologram since it is a binary amplitude-only spatial light modulator (SLM). In this paper, we suggest a method generating a set of binary holograms to improve the quality of the reconstructed image. Here, we are concerned with the case for which the object plane is positioned at the Fourier domain of the plane of the SLM. In this case, any point in the Fourier plane is related to all points in the hologram. So there is a chance to generate a set of binary holograms illuminated by incident wave with constant optical power. Moreover, we find an interesting fact that the quality of reconstructed image is improved when the spatial frequency bandwidth of the binary hologram is limited. Therefore, we propose an iterative segmentation algorithm generating a set of binary holograms that are designed to be illuminated by the wave with constant optical power. The feasibility of our method is experimentally confirmed with a DMD.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.7
• /
• pp.453-457
• /
• 2005

With the expansion of Internet, a variety of image databases are widely used and it is needed to select the part of an image what he wants. In contents-based image retrieval system, Zernikie moment and ART Descriptors are used fur shape descriptors in MPEC-7. This paper presents a fast computation method to determine the radius of a bounding circle that encloses an object in a binary image. With conventional methods, the whole area of the image should be scanned first and the distance from every pixel to the center point be computed. The proposed 4-directional scan method and fast circle-drawing algorithm is utilized to minimize the scanning area and reduce the number of operations fur computing the distance. Experimental results show that proposed method saves the computation time to determine the radius of a bounding circle efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5C
• /
• pp.514-520
• /
• 2009

This paper proposes a new deinterlacing algorithm which improves the performance of the spatial filter. Extracting exact edges is very important element of deinterlacing performance. So the proposed algorithm has interpolated locally adaptive-thresholded binary image, and extracted exact edges from the interpolated binary image. The values of pixels on edges extracted from binary image are interpolated using neighborhood lines on the same edge. With computer simulations for a variety of images, it is shown that the proposed algorithm is much better than traditional methods.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1375-1378
• /
• 1987

In this paper, an efficient data compression algorithm for binary image is proposed. This algorithm makes use of the fact that boundaries contain all the information about such images. The compression efficiency is then further increased by efficient coding of Boundary Information Matrix. The comparison of performance with modified Huffman coding was made by a computer simulation with some images. The results of simulation showed that the proposed algorithm was more efficient than modified Huffman code.

• The Journal of Information Technology
• /
• v.6 no.1
• /
• pp.71-84
• /
• 2003

In this paper, it is presented the efficient system for data recognition using the proposed binary code images. The proposed algorithm finds the position of binary image. Through the process of the block region classification, it is classified each block with the edge region using the value of gray level only. Each block region is divided horizontal and vertical edge region. If horizontal edge region blocks are classified over six blocks in any region, the proposed algorithm should search the vertical edge region in the start point of the horizontal edge region. If vertical edge region blocks were found over ten blocks in vertical region, the code image would found. Practical code region is acquired from the rate of the total edge region that is computed from the binary image that is processed with the average value. In case of the wrong rate, it is restarted the code search in the point after start point and the total process is followed. It has a short time than the before process time because it had classified block information. The block processing is faster thant the total process. The proposed system acquires the image from the digital camera and makes binary image from the acquired image. Finally, the proposed system extracts various characters from the binary image.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.814-817
• /
• 2005

Fast binary dilation and erosion algorithms using run-length encoding (RLE) are proposed. RLE is an alternative way of representing a binary image using a run, which is a sequence of '1' pixels. First, we derive the run-based representation of dilation and erosion and then present the full steps of the proposed algorithms in detail.