• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.630-635
• /
• 2007

In this paper, we propose a system for multiple people tracking using fragment based histogram matching. Appearance model is based on IHLS color histogram which can be calculated efficiently using integral histogram representation. Since histograms will loss all spatial information, we define a fragment based region representation which retain spatial information, robust against occlusion and scale issue by using disparity information. Multiple people labeling is maintained by creating online appearance representation for each people detected in scene and calculating fragment vote map. Initialization is performed automatically from background segmentation step.

• Journal of Broadcast Engineering
• /
• v.22 no.5
• /
• pp.608-617
• /
• 2017

Methods of contrast enhancement have problem such as side effect of over-enhancement with non-gaussian histogram distribution, tradeoff enhancement efficiency against brightness preserving. In order to enhance contrast at various histogram distribution, segmentation to region with gaussian distribution and then enhance contrast each region. First, we segment an image into several regions using GMM(Gaussian Mixture Model)fitting by that k-mean clustering and EM(Expectation-Maximization) in $L^*a^*b^*$ color space. As a result region segmentation, we get the region map and probability map. Then we apply local contrast enhancement algorithm that mean shift to minimum overlapping of each region and preserve brightness histogram equalization. Experiment result show that proposed region based contrast enhancement method compare to the conventional method as AMBE(AbsoluteMean Brightness Error) and AE(Average Entropy), brightness is maintained and represented detail information.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.453-456
• /
• 2003

Compared with other features of the image, color features are less sensitive to noise and background complication. Besides, this adding to object segmentation has more accuracy of image retrieval. This paper presents object segmentation and HAQ(Histogram Analysis and Quantization) algorithm approach to extract features(the object information and the characteristic colors) of an image. The empirical results shows that this method presents exactly spatial and color information of an image as image retrieval's feature.

• International Journal of Contents
• /
• v.8 no.1
• /
• pp.39-46
• /
• 2012

Character segmentation is a preprocessing step in many offline handwriting recognition systems. In this paper, Chinese characters are categorized into seven different structures. In each structure, the character size with the range of variations is estimated considering typical handwritten samples. The component removal and merge criteria are presented to remove punctuation symbols or to merge small components which are part of a character. Finally, the criteria for segmenting the adjacent characters concerning each other or overlapped are proposed.

• Journal of Information Processing Systems
• /
• v.9 no.1
• /
• pp.117-140
• /
• 2013

Hindi is the most widely spoken language in India, with more than 300 million speakers. As there is no separation between the characters of texts written in Hindi as there is in English, the Optical Character Recognition (OCR) systems developed for the Hindi language carry a very poor recognition rate. In this paper we propose an OCR for printed Hindi text in Devanagari script, using Artificial Neural Network (ANN), which improves its efficiency. One of the major reasons for the poor recognition rate is error in character segmentation. The presence of touching characters in the scanned documents further complicates the segmentation process, creating a major problem when designing an effective character segmentation technique. Preprocessing, character segmentation, feature extraction, and finally, classification and recognition are the major steps which are followed by a general OCR. The preprocessing tasks considered in the paper are conversion of gray scaled images to binary images, image rectification, and segmentation of the document's textual contents into paragraphs, lines, words, and then at the level of basic symbols. The basic symbols, obtained as the fundamental unit from the segmentation process, are recognized by the neural classifier. In this work, three feature extraction techniques-: histogram of projection based on mean distance, histogram of projection based on pixel value, and vertical zero crossing, have been used to improve the rate of recognition. These feature extraction techniques are powerful enough to extract features of even distorted characters/symbols. For development of the neural classifier, a back-propagation neural network with two hidden layers is used. The classifier is trained and tested for printed Hindi texts. A performance of approximately 90% correct recognition rate is achieved.

• Proceedings of the KOSOMBE Conference
• /
• v.1994 no.12
• /
• pp.39-42
• /
• 1994

An automatic multi-threshold algorithm for segmentation of 2D ultrasound images based on average filtering and the characteristics of speckle noise in 2D ultrasound image is proposed. To do this, we investigate the histogram of difference between $7{\times}7$ averaging histogram and $3{\times}3$ averaging histogram. And, we find zero crossing points in the positive portion of the differenced histogram and select middle points of the zero crossing points. We assign these selected points to characteristic points. The thresholds are the center of two characteristic points. Then we segment 2D ultrasound image by using these thresholds and extract edges from applying edge operator to optimal segmented image. Experimental results show that the segmented regions are devided accurately around the homogeneous region.

• Journal of Biomedical Engineering Research
• /
• v.22 no.3
• /
• pp.231-239
• /
• 2001

This paper proposes a region segmenting method for the Pap-smear image. The proposed method uses a pixel classifier based on neural network, which consists of four stages : preprocessing, feature extraction, region segmentation and postprocessing. In the preprocessing stage, brightness value is normalized by histogram stretching. In the feature extraction stage, total 36 features are extracted from $3{\times}3$ or $5{\times}5$ window. In the region segmentation stage, each pixel which is associated with 36 features, is classified into 3 groups : nucleus, cytoplasm and background. The backpropagation network is used for classification. In the postprocessing stage, the pixel, which have been rejected by the above classifier, are re-classified by the relaxation algorithm. It has been shown experimentally that the proposed method finds the nucleus region accurately and it can find the cytoplasm region too.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.5
• /
• pp.1-11
• /
• 2007

As the availability of an image information has been significantly increasing, necessity of system that can manage an image information is increasing. Accordingly, we proposed the region-based content retrieval(CBIR) algorithm based on an efficient combination of an image segmentation, an image texture, a color feature and an image's shape and position information. As a color feature, a HSI color histogram is chosen which is known to measure spatial of colors well. We used active contour and CWT(complex wavelet transform) to perform an image segmentation and extracting an image texture. And shape and position information are obtained using Hu invariant moments in the luminance of HSI model. For efficient similarity computation, the extracted features(color histogram, Hu invariant moments, and complex wavelet transform) are combined and then precision and recall are measured. As a experimental result using DB that was supported by www.freefoto.com. the proposed image retrieval engine have 94.8% precision, 82.7% recall and can apply successfully image retrieval system.

• International Journal of Contents
• /
• v.8 no.1
• /
• pp.30-38
• /
• 2012

Text extraction and binarization are the important pre-processing steps for text recognition. The performance of text binarization strongly related to the accuracy of recognition stage. In our proposed method, the first stage based on line detection and shape feature analysis applied to locate the position of a business card and detect the shape from the complex environment. In the second stage, several local regions contained the possible text components are separated based on the projection histogram. In each local region, the pixels grouped into several connected components based on the connected component labeling and projection histogram. Then, classify each connect component into text region and reject the non-text region based on the feature information analysis such as size of connected component and stroke width estimation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.10
• /
• pp.707-716
• /
• 2017

The advances in image display devices necessitate display images suitable for the user's purpose. The display devices should be able to provide object-based image information when a depthmap is required. In this paper, we represent the algorithm using a histogram-based image segmentation method for depthmap generation. In the conventional K-means clustering algorithm, the number of centroids is parameterized, so existing K-means algorithms cannot adaptively determine the number of clusters. Further, the problem of K-means algorithm tends to sink into the local minima, which causes over-segmentation. On the other hand, the proposed algorithm is adaptively able to select centroids and can stand on the basis of the histogram-based algorithm considering the amount of computational complexity. It is designed to show object-based results by preventing the existing algorithm from falling into the local minimum point. Finally, we remove the over-segmentation components through connected-component labeling algorithm. The results of proposed algorithm show object-based results and better segmentation results of 0.017 and 0.051, compared to the benchmark method in terms of Probabilistic Rand Index(PRI) and Segmentation Covering(SC), respectively.