• Communications for Statistical Applications and Methods
• /
• v.16 no.3
• /
• pp.409-419
• /
• 2009

In this article, an explicit solution of the EM algorithm for the image deburring is presented. To obtain the restore image from the strictly iterative EM algorithm is quite time-consumed and impractical in particular when the underlying observed image is not small and the number of iterations required to converge is large. The explicit solution provides a quite reasonable restore image although it exploits the approximation in the outside of the valid area of image, and also allows to obtain the effective EM solutions without iteration process in real-time in practice by using the discrete finite Fourier transformation.

• The Journal of Information Technology
• /
• v.2 no.2
• /
• pp.89-105
• /
• 1999

In this paper, we present a countermeasure for a various trouble occurred in secure communication of document image. We Propose a security system for transmission of document image using mixing algorithm that the third party cannot conceive secure transmission of information instead of existing scheme which depend on crypto-degree of security algorithm, itself. For this, RM, DM and RDM algorithm for mixing of secure bits are proposed and applied to digital signature for mixing for secure document and mixing for non-secure document by secure document. Security system for document image involves not only security scheme for document image transmission itself, but also digital signature scheme. The transmitter embeds secretly the signatures onto secure document, embeds it to non-secure document and transfers it to the receiver. The receiver makes a check of any forgery on the signature and the document. Because the total amount of transmitted data and the image quality are about the same to those of the original document image, respectively, the third party cannot notice the fact that signatures and secure document are embedded on the document image. Thus, the probability of attack will be reduced.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.6017-6037
• /
• 2017

In a multi-resolution image encoding system, the image is encoded into a single file as a layer of bit streams, and then it is transmitted layer by layer progressively to reduce the transmission time across a low bandwidth connection. This encoding scheme is also suitable for multiple decoders, each with different capabilities ranging from a handheld device to a PC. In our previous work, we proposed an edge adaptive hierarchical interpolation algorithm for multi-resolution image coding system. In this paper, we enhanced its compression efficiency by adding three major components. First, its prediction accuracy is improved using context adaptive error modeling as a feedback. Second, the conditional probability of prediction errors is sharpened by removing the sign redundancy among local prediction errors by applying sign flipping. Third, the conditional probability is sharpened further by reducing the number of distinct error symbols using error remapping function. Experimental results on benchmark data sets reveal that the enhanced algorithm achieves a better compression bit rate than our previous algorithm and other algorithms. It is shown that compression bit rate is much better for images that are rich in directional edges and textures. The enhanced algorithm also shows better rate-distortion performance and visual quality at the intermediate stages of progressive image transmission.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3642-3667
• /
• 2021

Texture synthesis technology has the advantages of repairing texture and structure at the same time. However, during the filling process, the size of the patch is fixed, and the content of the filling is not fully considered. In order to be able to adaptively change the patch size, we used the exemplar-based inpainting technique as the test algorithm, considering the image structure and texture, calculated the image structure patch size and texture patch size, and comprehensively determined the image patch size. This can adaptively change the patch size according to the filling content. In addition, we use multi-layer images to calculate the priority, so that the order of image repair was more stable. The proposed repair algorithm is compared with other image repair algorithms. The experimental results showed that the proposed adaptive image repair algorithm can better repair the texture and structure of the image, which proved the effectiveness of the proposed algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.139-143
• /
• 2023

In this paper, compared to the RT algorithm that constitutes CT images, the TPSM algorithm available in the conical CB-CT system was applied to enable 3D CT image configuration faster than the existing RT, and the image speeds of the two algorithms were compared and analyzed. To this end, the TPSM algorithm available in the conical CB-CT system was applied to enable real-time processing in 3D CT image composition. As a result of the experiment, it was found that the cross-sectional image constructed using TPSM decreases the quality of the image slightly by empty pixels as the distance from the center point increases, but in the case of TPSM rotation-based methods, the image composition speed is far superior to that of the RT algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.10
• /
• pp.1189-1195
• /
• 2014

In this study we propose an image denoising algorithm which manipulates the information obtained from multiple images in the same environment for mobile smart phones. We also envisage a multiple images registration method for mobile smart phone cameras equipped with limited computing ability and present an effective image denoising algorithm combining and manipulating the information obtained from multiple images. We proved that the proposed algorithm has much better PSNR value than the method applying single image. We verified that the propose approach has good denoising quality and can be utilized in the feasible level speed on Android smart phones.

• Journal of Korea Multimedia Society
• /
• v.15 no.11
• /
• pp.1292-1304
• /
• 2012

Recently, digital images are extremely forged by editors or advertisers. Also, amateurs can modify images throughout easy editing programs. In this study, we propose identification and analytical methods for the modified images to figure out those problems. In modified image analysis, we classify two parts; a filtering change and a geometric change. Those changes have an algorithm based on interpolation so that we propose the algorithm which is able to analyze a trace on a modified area. With this algorithm, we implement a detection map of interpolation using minimum filter, laplacian algorithm, and maximum filter. We apply the proposed algorithm to modified image and are able to analyze its modified trace using the detection map.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.4
• /
• pp.371-376
• /
• 2007

This paper presents an emotion recognition and its expression system of an intelligent robot like a home robot or a service robot. Emotion recognition method in the robot is used by a facial image. We use a motion and a position of many facial features. apply a tracking algorithm to recognize a moving user in the mobile robot and eliminate a skin color of a hand and a background without a facial region by using the facial region detecting algorithm in objecting user image. After normalizer operations are the image enlarge or reduction by distance of the detecting facial region and the image revolution transformation by an angel of a face, the mobile robot can object the facial image of a fixing size. And materialize a multi feature selection algorithm to enable robot to recognize an emotion of user. In this paper, used a multi layer perceptron of Artificial Neural Network(ANN) as a pattern recognition art, and a Back Propagation(BP) algorithm as a learning algorithm. Emotion of user that robot recognized is expressed as a graphic LCD. At this time, change two coordinates as the number of times of emotion expressed in ANN, and change a parameter of facial elements(eyes, eyebrows, mouth) as the change of two coordinates. By materializing the system, expressed the complex emotion of human as the avatar of LCD.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.1 s.307
• /
• pp.1-8
• /
• 2006

This paper presents a fast full search algorithm for motion estimation applicable to multiple reference images. The proposed method is an extended version of the rate constrained successive elimination algorithm (RSEA) for multiple reference frame applications. We will show that motion estimation for the reference images temporally preceding the first reference image can be less intensive in computation compared with that for the first reference image. for computational reduction, we will drive a new condition to lead the smaller number of candidate blocks for the best matched block. Simulation results explain that our method reduces computation complexity although it has the same quality as RSEA.

• Journal of Broadcast Engineering
• /
• v.1 no.1
• /
• pp.74-83
• /
• 1996

In this paper, an effective color image retrieval algorithm is proposed based on the graph representation. Also we propose a color constancy algorithm to remove the effect of illumination change. Illumination condition of an image can be transformed to that of reference image using the proposed color constancy algorithm, so that the effect of dirrerent lighting is significantly alleviated. Then, we represent a color image as a graph with several nodes and edges in the histogram space, and finally two images are matched by compared two graphs representing them. The simulation results show that the proposed 3-step algorithm performs well for various conditions, including different lighting, translation, rotation, and scaling of the object in the image. In addition, the proposed algorithm is very fast compared to the geometry-based matching technique.