• Journal of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.573-582
• /
• 1995

J.Milnor[Mi2] has introduced the notion of directional entropy in his study of Cellular Automata. Cellular Automaton map can be considered as a continuous map from a space $K^Z^n$ to itself which commute with the translation of the lattice $Z^n$. Since the space $K^Z^n$ is compact, map S is uniformly continuous. Hence S is a block map(a finite code)[He]. (S is said to have a finite memory.) In the case of n = 1, we have a shift map, T on $K^Z$, and a block map S and they together generate a $Z^2$ action.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.06a
• /
• pp.83-88
• /
• 1999

In this paper, a novel gray-scale lossless image coder combining context-based minimum mean squared error (MMSE) prediction and entropy coding is proposed. To obtain context of prediction, this paper first defines directional difference according to sharpness of edge and gradients of localities of image data. Classification of 4 directional differences forms“geometry context”model which characterizes two-dimensional general image behaviors such as directional edge region, smooth region or texture. Based on this context model, adaptive DPCM prediction coefficients are calculated in MMSE sense and the prediction is performed. The MMSE method on context-by-context basis is more in accord with minimum entropy condition, which is one of the major objectives of the predictive coding. In entropy coding stage, context modeling method also gives useful performance. To reduce the statistical redundancy of the residual image, many contexts are preset to take full advantage of conditional probability in entropy coding and merged into small number of context in efficient way for complexity reduction. The proposed lossless coding scheme slightly outperforms the CALIC, which is the state-of-the-art, in compression ratio.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.2 no.3
• /
• pp.119-127
• /
• 1990

Wave directional spectrum estimation methods for irregular waves were considered in this study. Until now, the Longuet-Higgins Method (LHM) initiated by Longuet-Higgins et al. (1963) has been widely used, but resolutions of the estimation were found to be low. Kobune's Maximum Entropy Method (MEM) for the estimation of wave directional spectrum, bas-ed on the entropy Principle showed higher resolutions comparing with the LHM . If the wave directional spectrum is of Delta functions, the MEM is exact in its estimation. It was also found that for a unimodal spectrum, if the Mitsuyasu's spreading coefficient is above 5, the estimation resolutions were high. In bimodal spectrum, as the angle difference between the two peaks increased, the resolution improved. The energy seems to transfer to the smoother peak in the smoothing of peak's peakedness. LHM has a tendency to estimate bimodal spectrum as a unimodal spectrum ； thus, except for its computational speed, the resolution of LHM falls far below that of MEM.

• Journal of Convergence for Information Technology
• /
• v.11 no.2
• /
• pp.41-46
• /
• 2021

The method of the edge detection algorithm based on grayscale mathematical morphology has the advantage that image noise can be removed and processed in parallel, and the operation speed is fast. However, the method of detecting the edge of an image using a single structural scale element may be affected by image information. The characteristics of grayscale morphology may be limited to the edge information result of the operation result by repeatedly performing expansion, erosion, opening, and containment operations by repeating structural elements. In this paper, we propose an edge detection algorithm that applies a structural element with strong directionality to noise and then applies weighted entropy to each pixel information in the element. The result of applying the multi-scale structural element applied to the image and the result of applying the directional weighted entropy were compared and analyzed, and the simulation result showed that the proposed algorithm is superior in edge detection.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.183-189
• /
• 2013

This paper proposes a novel lossless image compression scheme composed of direction-adaptive prediction and context-based entropy coding. In the prediction stage, we analyze the directional property with respect to the current coding pixel and select an appropriate prediction pixel. In order to further reduce the prediction error, we propose a prediction error compensation technique based on the context model defined by the activities and directional properties of neighboring pixels. The proposed scheme applies a context-based Golomb-Rice coding as the entropy coding since the coding efficiency can be improved by using the conditional entropy from the viewpoint of the information theory. Experimental results indicate that the proposed lossless image compression scheme outperforms the low complexity and high efficient JPEG-LS in terms of the coding efficiency by 1.3% on average for various test images, specifically for the images with a remarkable direction the proposed scheme shows better results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2068-2086
• /
• 2011

Based on the quincunx sub-sampling grid, the New Interleaved Hierarchical INTerpolation (NIHINT) method is recognized as a superior pyramid data structure for the lossless and progressive coding of natural images. In this paper, we propose a new image interpolation algorithm, Edge Adaptive Hierarchical INTerpolation (EAHINT), for a further reduction in the entropy of interpolation errors. We compute the local variance of the causal context to model the strength of a local edge around a target pixel and then apply three statistical decision rules to classify the local edge into a strong edge, a weak edge, or a medium edge. According to these local edge types, we apply an interpolation method to the target pixel using a one-directional interpolator for a strong edge, a multi-directional adaptive weighting interpolator for a medium edge, or a non-directional static weighting linear interpolator for a weak edge. Experimental results show that the proposed algorithm achieves a better compression bit rate than the NIHINT method for lossless image coding. It is shown that the compression bit rate is much better for images that are rich in directional edges and textures. Our algorithm also shows better rate-distortion performance and visual quality for progressive image transmission.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.6
• /
• pp.72-79
• /
• 2017

In this paper, we present a new saliency detection algorithm using the mutual information of wavelet subbands. Our method constructs an intermediate saliency map using the power operation and Gaussian blurring for high-frequency wavelet coefficients. After combining three intermediate saliency maps according to the direction of wavelet subband, we find the main directional components using entropy measure. The amount of mutual information of each subband is obtained centering on the subband having the minimum entropy The final saliency map is detected using Minkowski sum based on weights calculated by the mutual information. As a result of the experiment on CAT2000 and ECSSD databases, our method showed good detection results in terms of ROC and AUC with few computation times compared with the conventional methods.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.11
• /
• pp.1383-1392
• /
• 1995

In this paper, the method to incorporate TCVQ(Trellis Copded Vector Quantizer) into the encoding of the wavelet trans formed(WT) image followed by a variable length coding(VLC) or an entropy coding(EC) is considered. By WT, an original image is separated into 10 bands with various resolutions and directional components. TCVQ used to compress these WT coefficients is a finite state machine that encodes the input source on the basis of the current input and the current state. Wavelet basis used in this paper is designed by orthogonal spline function. A modified set partitioning algorithm to Wang's is also presented. A simple modification to Wang's algorithm gives a highly time-efficient result. Proposed WT-TCVQ encoder shows a very competitive result, giving 37.46dB in PSNR at 1.002bpp when encoding 512$\times$512 LENA.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.6
• /
• pp.70-77
• /
• 2008

This paper proposes a new text candidate region detection method that uses genetic algorithm based on information of the segmented regions. In image segmentation, a classification of the pixels at each color channel and a reclassification of the region-unit for reducing inhomogeneous clusters are performed. EWFCM(Entropy-based Weighted C-Means) algorithm to classify the pixels at each color channel is an improved FCM algorithm added with spatial information, and therefore it removes the meaningless regions like noise. A region-based reclassification based on a similarity between each segmented region of the most inhomogeneous cluster and the other clusters reduces the inhomogeneous clusters more efficiently than pixel- and cluster-based reclassifications. And detecting text candidate regions is performed by genetic algorithm based on energy and variance of the directional edge components, the number, and a size of the segmented regions. The region information-based detection method can singles out semantic text candidate regions more accurately than pixel-based detection method and the detection results will be more useful in recognizing the text regions hereafter. Experiments showed the results of the segmentation and the detection. And it confirmed that the proposed method was superior to the existing methods.

• Korean Journal of Remote Sensing
• /
• v.21 no.2
• /
• pp.121-133
• /
• 2005

Texture imaging, which means texture image creation by co-occurrence relation, has been known as one of the useful image analysis methodologies. For this purpose, most commercial remote sensing software provides texture analysis function named GLCM (Grey Level Co-occurrence Matrix). In this study, texture-imaging program based on GLCM algorithm is newly implemented. As well, texture imaging modules for GLDV (Grey Level Difference Vector) are contained in this program. As for GLCM/GLDV Texture imaging parameters, it composed of six types of second order texture functions such as Homogeneity, Dissimilarity, Energy, Entropy, Angular Second Moment, and Contrast. As for co-occurrence directionality in GLCM/GLDV, two direction modes such as Omni-mode and Circular mode newly implemented in this program are provided with basic eight-direction mode. Omni-mode is to compute all direction to avoid directionality complexity in the practical level, and circular direction is to compute texture parameters by circular direction surrounding a target pixel in a kernel. At the second phase of this study, some case studies with artificial image and actual satellite imagery are carried out to analyze texture images in different parameters and modes by correlation matrix analysis. It is concluded that selection of texture parameters and modes is the critical issues in an application based on texture image fusion.