• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.1371-1373
• /
• 1996

A clustering algorithms with dynamic adjustment of learning rate for GBFCM(Gradient Based FCM) is proposed in this paper. This algorithm combines two idea of dynamic K-means algorithms and GBFCM : learning rate variation with entropy concept and continuous membership grade. To evaluate dynamic GBFCM, we made comparisons with Kohonen's Self-Organizing Map over several tutorial examples and image compression. The results show that DGBFCM(Dynamic GBFCM) gives superior performance over Kohonen's algorithm in terms of signal-to-noise.

• Journal of Advanced Navigation Technology
• /
• v.19 no.6
• /
• pp.614-622
• /
• 2015

Binary MQ arithmetic coding is widely used recently as a basic entropy coder in multimedia coding system. MQ coder esteems high in compression efficiency to be used in JBIG2 and JPEG2000. The importance of arithmetic coding is increasing after it is adopted as an unique entropy coder in HEVC standard. In the binary MQ coder, arithmetic approximation without multiplication is used in the process of recursive subdivision of range interval. Because of the MPS/LPS exchange activity happened in MQ coder, output byte tends to increase. This paper proposes an enhanced binary MQ arithmetic coder to make use of a lookup table for AQe using quantization skill in order to reduce the deficiency. Experimental results show that about 4% improvement of compression in case of JBIG2 for bi-level image compression standard. And also, about 1% improvement of compression ratio is obtained in case of lossless JPEG2000 coding. For the lossy JPEG2000 coding, about 1% improvement of PSNR at the same compression ratio. Additionally, computational complexity is not increasing.

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.9
• /
• pp.1112-1118
• /
• 2014

In this paper, we propose a local descriptor and a similarity measure that is robust to radiometic variations. The proposed local descriptor is made up Haar wavelet filter and it can contain frequency informations about the feature point and its surrounding pixels in fixed region, and it is able to describe feature point clearly under ununiform illumination condition. And a proposed similarity measure is combined with conventional entropy-based similarity and another similarities that is generated by local descriptor. It can reflect similarities between image regions accurately under radiometic illumination variations. We validate with experimental results on some images and we confirm that the proposed algorithm is more superior than conventional algorithms.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.1
• /
• pp.59-65
• /
• 1999

In this paper, we design a entorpy encoder of HDTV/DTV encoder blocks on the basis of MPEG-II. The designed entropy encoder outputs its bit stream at 9Mbps bit rate inserting zero-stepping block to protect the depletion of buffer in case that the generated bit stream is stored in buffer and uses not only PROM bit combinational circuit to solve the problem of critical path, and packer block, one of submerge, is designed to packing into 24 bit unit using barrel shifter, and it is constructed to blocks of header information encoder, input information delay, submerge, and buffer control. Designed circuits is verified by VHDL function simulation, as a result of performing P&R with Gate compiler that apply $0.8{\mu}m$ Gate Array specification, pin and gate number of total circuits has been tested to each 235 and about 120,000.

• The KIPS Transactions:PartB
• /
• v.10B no.5
• /
• pp.497-502
• /
• 2003

Fingerprint classification plays a role of reduction of precise joining time and improvement of the accuracy in a large volume of database. Patterns of fingerprint are classified as 5 patterns : left loop, right loop, arch, whorl, and tented arch by numbers and the location of core point and delta point. The existing fingerprint classification is useful in a captured fingerprint image of core point and delta point using paper and ink. However, this system is unapplicable in modern Automatic Fingerprint Identification System (AFIS) because of problems such as size of input and way of input. To solve the problem, this study is to suggest the way of being able to improve accuracy of fingerprint by fingerprint classification based on the entropy of ridges using fingerprint captured mage of core point and prove this through the experiment.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.14 no.6
• /
• pp.7-14
• /
• 2018

Salient information extraction from multi-view videos is a very challenging area because of inter-view, intra-view correlations, and computational complexity. There are several techniques developed for keyframes extraction from multi-view videos with very high computational complexities. In this paper, we present a keyframes extraction approach from multi-view videos using entropy and complexity information present inside frame. In first step, we extract representative shots of the whole video from each view based on structural similarity index measurement (SSIM) difference value between frames. In second step, entropy and complexity scores for all frames of shots in different views are computed. Finally, the frames with highest entropy and complexity scores are considered as keyframes. The proposed system is subjectively evaluated on available office benchmark dataset and the results are convenient in terms of accuracy and time complexity.

• Journal of Digital Contents Society
• /
• v.19 no.9
• /
• pp.1787-1793
• /
• 2018

Shadow is a common phenomenon observed in natural scenes, but it has a negative influence on image analysis such as object recognition, feature detection and scene analysis. Therefore, the process of detecting and removing shadows included in digital images must be considered as a pre-processing process of image analysis. In this paper, the existing methods for acquiring 1D invariant images, one of the feature elements for detecting and removing shadows contained in a single natural image, are described, and a method for obtaining 1D invariant images based on linear regression has been proposed. The proposed method calculates the log of the band-ratio between each channel of the RGB color image, and obtains the grayscale image line by linear regression. The final 1D invariant images were obtained by projecting the log image of the band-ratio onto the estimated grayscale image line. Experimental results show that the proposed method has lower computational complexity than the existing projection method using entropy minimization, and shadow detection and removal based on 1D invariant images are performed effectively.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.3029-3036
• /
• 2000

Image segmentation is one of the important processes in the image information extraction for computer vision systems. The fuzzy clustering methods have been extensively used in the image segmentation because it extracts feature information of the region. Most of fuzzy clustering methods have used the Fuzzy C-means(FCM) algorithm. This algorithm can be misclassified about the different size of cluster because the degree of membership depends on highly the distance between data and the centroids of the clusters. This paper proposes a fuzzy clustering algorithm using the Average Intracluster Distance that classifies data uniformly without regard to the size of data sets. The Average Intracluster Distance takes an average of the vector set belong to each cluster and increases in exact proportion to its size and density. The experimental results demonstrate that the proposed approach has the g

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.5
• /
• pp.11-17
• /
• 2016

In this paper, we propose a method of correcting depth image by the plane modeling and then improving the coding performance. We model a plane by using the least squares method to the horizontal and vertical directions including the target pixel, and then determine that the predicted plane is suitable from the estimate error. After that, we correct the target pixel by the plane mode. The proposed method can correct not only the depth image composed the plane but also the complex depth image. From the simulation result that measures the entropy power, which can estimate the coding performance, we can see that the coding performance by the proposed method is improved up to 80.2%.

• Journal of Korea Multimedia Society
• /
• v.5 no.2
• /
• pp.147-157
• /
• 2002

Noise in image sequences is visually offensive and may mask important image detail. In addition to degradation of visual quality, the noise pattern increases the entropy of the image, and thus hinders effective compression. This paper proposes a spatial and a temporal joint filters to reduce the noise by jointly connecting two adaptive noise reducers with different characteristics, and we also propose an IIR-type 3D noise reduction litter scheme connecting the spatial and the temporal joint filters. The proposed 3D IIR filter not only strongly removes noise in uniform image regions while preserving edges and details but also effectively suppresses temporal flicker caused by noise. Experimental results show that the proposed scheme improves subjective quality as well as objective quality as compared with the various noise filtering techniques.