• Journal of Korea Society of Digital Industry and Information Management
• /
• v.14 no.4
• /
• pp.169-176
• /
• 2018

In this study, we propose a new Fire Flame Region Extraction using Block Homogeneity Segmentation method of the Fire Image with irregular texture and various colors. It is generally assumed that fire flame extraction plays a very important role. The Color Image with fire flame is divided into blocks and edge strength for each block is computed by using modified color histogram intersection method that has been developed to differentiate object boundaries from irregular texture boundaries effectively. The block homogeneity is designed to have the higher value in the center of region with the homeogenous colors or texture while to have lower value near region boundaries. The image represented by the block homogeneity is gray scale image and watershed transformation technique is used to generate closed boundary for each region. As the watershed transform generally results in over-segmentation, region merging based on common boundary strength is followed. The proposed method can be applied quickly and effectively to the initial response of fire.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2326-2345
• /
• 2016

For the compression of color images, a common bitmap usually is generated to replace the three individual bitmaps that originate from block truncation coding (BTC) of the R, G and B channels. However, common bitmaps generated by some traditional schemes are not the best possible because they do not consider the minimized distortion of the entire color image. In this paper, we propose a near-optimized common bitmap scheme for BTC using Binary Ant Colony Optimization (BACO), producing a BACO-BTC scheme. First, the color image is compressed by the BTC algorithm to get three individual bitmaps, and three pairs of quantization values for the R, G, and B channels. Second, a near-optimized common bitmap is generated with minimized distortion of the entire color image based on the idea of BACO. Finally, the color image is reconstructed easily by the corresponding quantization values according to the common bitmap. The experimental results confirmed that reconstructed image of the proposed scheme has better visual quality and less computational complexity than the referenced schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.848-854
• /
• 1996

Many image display devices allow only a limited number of colors to be simultaneously displayed. in disphaying of natural color image using color palette, it is necessary to construct an optimal color palette and the optimal mapping of each pixed of the original image to a color from the palette. In this paper, we proposed the clustering algorithm using local region block centered one color cluster in the prequantized 3-D histogram. Cluster pairs which have the least distortion error are merged by considering distortion measure. The clustering process is continued until to obtain the desired number of colors. The same as the clustering process, original color value. The proposed algorithm incroporated with a spatial activity weighting value which is reflected sensitivity of HVS quantization errors in smoothing region. This method produces high quality display images and considerably reduces computation time.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.81-84
• /
• 2001

In this paper, we proposed a digital watermarking for color still image using the characteristics of human visual system and the achromatic block information. We use a binary watermark signal and insert watermark signal in the chromatic component region of YCrCb color space. In order to extract the watermark signal, we extracted the watermark signal by presuming that modified pattern of chromatic saturation without using original an image. Experimental results show that the proposed watermarking method has a good performance to embed watermark signal and extract one.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.63-66
• /
• 1996

In this paper, we propose a new content-based color image retrieval algorithm. The algorithm makes use of two features; colors as global features and block classification results as local features. More specifically, we obtain R, G, B color histograms and classify nonoverlapping small image blocks into texture, monotone, and various edges, then using these histograms and classification results were make a similarity measure. Experimental results show that retrieval rate of the proposed algorithm is higher than the previous method.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.12
• /
• pp.81-89
• /
• 1997

In this paper, we propose a new image retrieval algorithm using the block classification. More specifically, we classify nonoverlappint small image blocks into texture, monotone, and various edges. Using these classification results and the RGB color histogram, we propose a new similarity measure which considers both local and global fretures. According to our experimental results using 232 color images, the retrieval efficiencies of the proposed and the previous methods were 0.610 and 0.522, respectively, which implies that the proposed algorithm yields better performance.

• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.305-316
• /
• 2003

Recently, an iterative algorithm for finding the interior eigenvalues of a definite matrix by CG-type method has been proposed. This method compares to the inverse power method. The given matrices A, and B are assumed to be large and sparse, and SPD( Symmetric Positive Definite) The CG scheme for the optimization of the Rayleigh quotient has been proven a very attractive and promising technique for large sparse eigenproblems for smallest eigenvalue. Also, it is very amenable to parallel computations, like the CG method for the linear systems. A proper choice of the preconditioner significantly improves the convergence of the CG scheme. But for parallel computations we need to find an efficient parallel preconditioner. Our candidates we ILU(0) in the wave-front order, ILU(0) in the multi-coloring order, Point-SSOR(Symmetric Successive Overrelaxation), and Multi-Color Block SSOR preconditioner. Wavefront order is a simple way to increase parallelism in the natural order, and Multi-coloring realizes a parallelism of order(N), where N is the order of the matrix. Another choice is the Multi-Color Block SSOR(Symmetric Successive OverRelaxation) preconditioning. Block SSOR is a symmetric preconditioner which is expected to minimize the interprocessor communication due to the blocking. We implemented the results on the CRAY-T3E with 128 nodes. The MPI (Message Passing Interface) library was adopted for the interprocessor communications. The test problem was drawn from the discretizations of partial differential equations by finite difference methods. The results show that for small number of processors Multi-Color ILU(0) has the best performance, while for large number of processors Multi-Color Block SSOR performs the best.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1624-1632
• /
• 1996

Wavelet transform is widely used for high compression ratio image compression. It requeires a large memory when it is implemented by a hardware. Therefore, it is efficient to divide the entire image into blocks. Because the wavelet transform for divided blocks causes losses, pixels of the adjacent blocks are used. In the case of color image compression, the image is decomposed into brightness and color components, and then color components are downsampled. When the wavelet transform is performed by using pixels of adjacentblocks, the number of necessary pixels are doubled due to downsampling of color components. In this paper, we propose an efficient block wavelet transform using variablefilter length for brightness and color components. By using the proposed method, the number of pixels of adjacent blocks is optimized. We show the degradation of image quality due to the reduction of filter length for color components is negligible through simulations.

• Journal of Service Research and Studies
• /
• v.5 no.2
• /
• pp.103-110
• /
• 2015

Recently, Classification of characters in a 3D FPS game has emerged as a very significant issue. In this study, We propose the game character Classification method using Image Region Segmentation of the extracting meaningful object in a simple operation. In this method, first used a non-linear RGB color model and octree color quantization scheme. The input image represented a less than 20 quantized color and uses a small number of meaningful color histogram. And then, the image divided into small blocks, calculate the degree of similarity between the color histogram intersection and adjacent block in block units. Because, except for the block boundary according to the texture and to extract only the boundaries of the object block. Set a region by these boundary blocks as a game object and can be used for FPS game play. Through experiment, we obtain accuracy of more than 80% for Classification method using each feature. Thus, using this property, characters could be classified effectively and it draws the game more speed and strategic actions as a result.

• The Journal of the Korea Contents Association
• /
• v.21 no.3
• /
• pp.143-156
• /
• 2021

In this study, the Bookstore Block of Historical and Cultural Street in Kaifeng City is taken as the object, which makes analysis on the landscape color features appearing in the elements of the bookstore block landscape. Through literature, it obtains the contrast list for the landscape composite elements of the historical and cultural street. After mastering the general characteristics of architectural colors and basic analysis methods of landscape colors in the Qing Dynasty, it conducts the site survey on the landscape composition elements and colors of the bookstore block. According to the conclusion, it is found that the landscape color of bookstore block is composed of R series, PB series, Y series and achromatic (N) series, in which the overall color shows relatively high integrity. However, it exists some deficiencies in the use of colors in signs, facilities and modeling objects. Therefore, it is necessity to increase the color plan of landscape elements such as signs, modeling objects and facilities, enhance the recognition possibilities of visual information.