• 한국정보디스플레이학회:학술대회논문집
• /
• 2004.08a
• /
• pp.149-152
• /
• 2004

A new joint source channel coding reduces both input-width and average current consumption to transmit image data to LCD source drivers. As a source coding, it is based on entropy coding of differential pulse code modulation scheme, especially using median edge detector of image predictor. As a channel coding, it is not a simple pulse amplitude modulation, but linked by source entropy to reduce average amplitude. Simulation results show 1/4 width is achievable by 16-valued transmission with keeping conventional current consumption (0.36 to 1.3).

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.73-82
• /
• 2005

This paper proposes a multi-level thresholding method using weighted FCM(Fuzzy C-Means) algorithm in color image. FCM algerian determines a more optimal thresholding value than the existing methods and can extend to multi-level thresholding. But FCM algerian is sensitive to noise because it doesn't include spatial information. To solve the problem, we can remove noise by applying a weight based on entropy that is obtained from neighboring pixels to FCM algerian. And we determine the optimal cluster number by using within-class distance in code image based on the clustered pixels of each color component. In the experiments, we show that the proposed method is more tolerant to noise and is more superior than the existing methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.391-411
• /
• 2023

Aggregates play the skeleton and supporting role in the construction field, high-precision measurement and high-efficiency analysis of aggregates are frequently employed to evaluate the project quality. Aiming at the unbalanced operation time and segmentation accuracy for multi-class segmentation algorithms of aggregate images, a Chaotic Sparrow Search Algorithm (CSSA) is put forward to optimize it. In this algorithm, the chaotic map is combined with the sinusoidal dynamic weight and the elite mutation strategies; and it is firstly proposed to promote the SSA's optimization accuracy and stability without reducing the SSA's speed. The CSSA is utilized to optimize the popular multi-class segmentation algorithm-Multiple Entropy Thresholding (MET). By taking three METs as objective functions, i.e., Kapur Entropy, Minimum-cross Entropy and Renyi Entropy, the CSSA is implemented to quickly and automatically calculate the extreme value of the function and get the corresponding correct thresholds. The image adaptive multi-class segmentation model is called CSSA-MET. In order to comprehensively evaluate it, a new parameter I based on the segmentation accuracy and processing speed is constructed. The results reveal that the CSSA outperforms the other seven methods of optimization performance, as well as the quality evaluation of aggregate images segmented by the CSSA-MET, and the speed and accuracy are balanced. In particular, the highest I value can be obtained when the CSSA is applied to optimize the Renyi Entropy, which indicates that this combination is more suitable for segmenting the aggregate images.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.2
• /
• pp.206-212
• /
• 2006

Many image and video compression algorithms work by splitting the input image into blocks and producing variable-length coded bits for each block data. If variable-length coded data are transmitted consecutively, then the resulting coder is highly sensitive to channel errors. Therefore, most image and video techniques for providing some protection to the stream against channel errors usually involve adding a controlled amount of redundancy back into the stream. Such redundancy might take the form of resynchronization markers, which enable the decoder to restart the decoding process from the known state, in the event of transmission errors. The Error Resilient Entropy Code (EREC) is a well known method which can regain synchronization without any redundant information to convert from variable-length code to fixed-length code. This paper proposes an enhancement to EREC, which greatly improves its transmission ability for the compressed image quality without any redundant bits in the event of errors. The simulation result shows that the both objective and subjective quality of transmitted image is enhanced compared with the existing EREC at the same BER(Bit Error Rate).

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2264-2275
• /
• 1994

In this paper, image compression based on neural networks is presented with block classification and coding. Multilayer neural networks with error back-propagation learning algorithm are used to transform the normalized image date into the compressed hidden values by reducing spatial redundancies. Image compression can basically be achieved with smaller number of hidden neurons than the numbers of input and output neurons. Additionally, the image blocks can be grouped for adaptive compression rates depending on the characteristics of the complexity of the blocks in accordance with the sensitivity of the human visual system(HVS). The quantized output of the hidden neuron can also be entropy coded for an efficient transmission. In computer simulation, this approach lie in the good performances even with images outside the training set and about 25:1 compression rate was achieved using the entropy coding without much degradation of the reconstructed images.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.414-417
• /
• 2007

In this paper we present an adaptive method for accelerating conventional Maximum Entropy Method (MEM) for restoration of Passive Millimeter-Wave (PMMW) image from its blurred and noisy version. MEM is nonlinear and its convergence is very slow. We present a new method to accelerate the MEM by using an exponent on the correction ratio. In this method the exponent is computed adaptively in each iteration, using first-order derivatives of deblurred image in previous two iterations. Using this exponent the accelerated MEM emphasizes speed at the beginning stages and stability at later stages. In accelerated MEM the non-negativity is automatically ensured and also conservation of flux without additional computation. Simulation study shows that the accelerated MEM gives better results in terms of RMSE, SNR, moreover, it takes only about 46% lesser iterations than conventional MEM. This is also confirmed by applying this algorithm on actual PMMW image captured by 94 GHz mechanically scanned radiometer.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.6
• /
• pp.112-122
• /
• 2009

In this paper, we present a novel space-frequency adaptive image restoration approach using vaguelette-wavelet decomposition (VWD). The proposed algorithm classifies a degraded image into flat and edge regions by using spatial information of the wavelet coefficient. For reducing the noise we perform an adaptive wavelet shrinkage process. At edge region candidates, we adopt entropy approach for estimating the noise and remove it by using relative between sub-bands. After shrinking wavelet coefficients process, we restore the degraded image using the VWD. The proposed algorithm can reduce the noise without affecting the sharpness details. Based on the experimental results, the proposed algorithm efficiently proved to be able to restore the degraded image while preserving details.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12C
• /
• pp.995-1003
• /
• 2010

The content-based hashing for authentication and copy protection of image, video and 3D model has to satisfy the robustness and the security. For the security analysis of the hash value, the modelling method based on differential entropy had been presented. But this modelling can be only applied to the image hashing. This paper presents the modelling for the security analysis of the hash feature value in 3D model hashing based on differential entropy. The proposed security analysis modeling design the feature extracting methods of two types and then analyze the security of two feature values by using differential entropy modelling. In our experiment, we evaluated the security of feature extracting methods of two types and discussed about the trade-off relation of the security and the robustness of hash value.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2006.04a
• /
• pp.211-216
• /
• 2006

The Constrained Linear Spectral Unmixing(CLSU) is investigated for sub-pixel image processing, Its result is the abundance map which mean fractions of endmember existing in a mixed pixel. Compared to the Linear Spectral Unmixing using least square method, CLSU uses the NNLS (Non-Negative Least Square) algorithm to guarantee that the estimated fractions are constrained. But, CLSU gets Into difficulty in image processing due to select endmember at a user's disposition. In this study, endmember selection optimization method using entropy in the error-image analysis is proposed. In experiments which is used hyperion image, it is shown that our method can select endmember number than CLSU based on unsupervised endemeber selection.