• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.3
• /
• pp.383-391
• /
• 2017

In image processing, image segmentation has been studied by various methods in a long time. Image segmentation is the process of partitioning a digital image into multiple objects and face detection is a typical image segmentation field being used in a variety of applications that identifies human faces in digital images. In this paper, we propose a method for extracting the contours of faces included in images. Using the Viola-Jones algorithm, to do this, we detect the approximate locations of faces from images. But, the Viola-Jones algorithm could detected the approximate location of face not the correct position. In order to extract a more accurate face region from image, we use skin color in this paper. In details, face region would be extracted using the analysis of horizontal and vertical histograms on the skin area. Finally, the face contour is extracted using snake algorithm for the extracted face area. In this paperr, a modified snake energy function is proposed for face contour extraction based snake algorithm proposed by Williams et al.[7]

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2615-2628
• /
• 1997

In this paper, a new codebook design algorithm is proposed. It uses a DCT map based on two-dimensional discrete cosine of transform (2D DCT) and finite state vector quantizer (FSVQ) when the vector quantizer is designed for image transmission. We make the map by dividing input image according to edge quantity, then by the map, the significant features of training image are extracted by using the 2D DCT. A master codebook of FSVQ is generated by partitioning the training set using binary tree based on tree-structure. The state codebook is constructed from the master codebook, and then the index of input image is searched at not master codebook but state codebook. And, because the coding of index is important part for high speed digital transmission, it converts fixed length codes to variable length codes in terms of entropy coding rule. The huffman coding assigns transmission codes to codes of codebook. This paper proposes single-side growing huffman tree to speed up huffman code generation process of huffman tree. Compared with the pairwise nearest neighbor (PNN) and classified VQ (CVQ) algorithm, about Einstein and Bridge image, the new algorithm shows better picture quality with 2.04 dB and 2.48 dB differences as to PNN, 1.75 dB and 0.99 dB differences as to CVQ respectively.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.2
• /
• pp.16-27
• /
• 2011

Embryo is a very early stage of the development of multicellular organism such as animals and plants. It is an important research target for studying ontogeny because the fundamental body system of multicellular organism is determined during an embryo state. Researchers in the developmental biology have a large volume of embryo image databases for studying embryos and they frequently search for an embryo image efficiently from those databases. Thus, it is crucial to organize databases for their efficient search. Hierarchical clustering methods have been widely used for database organization. However, most of previous algorithms tend to produce a highly skewed tree as a result of clustering because they do not simultaneously consider both the size of a cluster and the number of objects within the cluster. The skewed tree requires much time to be traversed in users' search process. In this paper, we propose a method that effectively organizes a large volume of embryo image data in a balanced tree structure. We first represent embryo image data as a similarity-based graph. Next, we identify clusters by performing a graph partitioning algorithm repeatedly. We check constantly the size of a cluster and the number of objects, and partition clusters whose size is too large or whose number of objects is too high, which prevents clusters from growing too large or having too many objects. We show the superiority of the proposed method by extensive experiments. Moreover, we implement the visualization tool to help users quickly and easily navigate the embryo image database.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.687-695
• /
• 2003

In this paper, we present a document image compression system based on segmentation, Quincunx downsampling, (5/3) wavelet lifting and subband-oriented SPIHT coding. We reduced the coding time by the adaptation of subband-oriented SPIHT coding and Quincunx downsampling. And to increase compression rate further, we applied arithmetic coding to the bitstream of SPIHT coding output. Finally, we present the reconstructed images for visual comparison and also present the compression rates and PSNR values under various scalar quantization methods.

• Journal of IKEEE
• /
• v.6 no.1 s.10
• /
• pp.80-86
• /
• 2002

This paper presents a fast hardware architecture to implement a 2-D DWT(Discrete Wavelet Transform) computed by lifting scheme framework. The conventional 2-D DWT hardware architecture has problem in internal memory, hardware resource, and latency. The proposed architecture was based on the 4-way partitioned data set. This architecture is configured with a pipelining parallel architecture for 4-way partitioning method. Due to the use of this architecture, total latency was improved by 50%, and memory size was reduced by using lifting scheme.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.6
• /
• pp.72-80
• /
• 1998

A method is proposed for directional vector quantization using the wavelet packets. After partitioning the wavelet packet coefficients into 9 edges according to the corresponding directions, it encodes and transmits locally dominant edges. The directions of the edges are encoded with a variable length coding and conditional switching of codebooks, while the contents of them with the vector quantization followed by the variable length index coding. The proposed algorithm is superior to various conventional image coding algorithms in the sense of PSNR, which is relatively more significant at very low bit rate such as 0.1~0.3 bpp. As the proposed algorithm preserves the edges which is the most important for the human visual system, it also provides the reconstructed images of good subjective quality even at very low bit rate.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.117-124
• /
• 2003

The system implemented in this paper partitions and stores specimen data captured by a light microscope on distributed or parallel systems. Users ran observe images on computers as we use a physical microscope. Based on the client-server computing model, the system consists of client, coordinator, and data manager. Three components communicate messages. For retrieving images, we implemented the client program with necessary functions for educational applications such at image mark and text annotation, and defined the communication protocol. We performed the experiment for introducing a tape storage which stores a large volume of data. The experiment results showed performance improvement by data partitioning and indexing technique.

• The Journal of Natural Sciences
• /
• v.7
• /
• pp.27-35
• /
• 1995

This paper introduces a VLSI (Very Large Scale Integrated Circuit) implementation of the 2-D Discrete Cosine Transform (DCT) with an application to image and video coding. This implementation, which is based upon a state space model, uses both algorithm and data partitioning to achieve high efficiency. With this implementation, the amount of data transfers between the processing elements (PEs) are reduced and all the data transfers are limitted to be local. This system accepts the input as a progressively scanned data stream which reduces the hardware required for the input data control module. With proper ordering of computations, a matrix transposition between two matrix by matrix multiplications, which is required in many 2-D DCT systems based upon a row-column decomposition, can be also removed. The new implementation scheme makes it feasible to implement a single 2-D DCT VLSI chip which can be easily expanded for a larger 2-D DCT by cascading these chips.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.2
• /
• pp.13-19
• /
• 1998

The Median of a set of number is a number which partitions the given set. The specified numbers of a set partitions in one subset and in another subset. In Image Processing, The Sorting method of numbers of one subset equal to the previous Median Filtering. but The Sorting method of numbers of another subset not equal to in the other. In this paper, a fast two-dimentional Median Filtering Algorithm is proposed. The Algorithm designed in such a during the partitioning of the previous window are used. Test results obtained by running the Algorithm on IBM PC(586) are presented and its filtering. It is shown that the proposed Algorithm's processing time is faster and independent of the number of bits used to represent the data values.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.3
• /
• pp.1-10
• /
• 2000

This paper proposes a novel video coding system with rate control based on fractal algorithm To overcome the demerits of excessive amounts of coded bit generated by previous fractal coding methodology. the proposed system classifies the Image into three classes such as background, motion compensation, and fractal coding area. The motion vector for motion compensation, and the fractal offset value that is difference value between the predicted offset and the least-square approximated value are coded with variable length code The decision method which determines threshold value of partitioning quadtree is applied to the bit-rate control algorithm considering the quantity of currently generated bits and fixed channel bandwidth Experimental result shows that the proposed system enhances compression ratio 1.8 times higher than previous method for the same image quality, and performs efficient rate control for fixed channel bandwidth.