• Title/Summary/Keyword: Over-Segmentation

Search Result 347, Processing Time 0.028 seconds

A Study on the Speaker Adaptation of a Continuous Speech Recognition using HMM (HMM을 이용한 연속 음성 인식의 화자적응화에 관한 연구)

  • Kim, Sang-Bum;Lee, Young-Jae;Koh, Si-Young;Hur, Kang-In
    • The Journal of the Acoustical Society of Korea
    • /
    • v.15 no.4
    • /
    • pp.5-11
    • /
    • 1996
  • In this study, the method of speaker adaptation for uttered sentence using syllable unit hmm is proposed. Segmentation of syllable unit for sentence is performed automatically by concatenation of syllable unit hmm and viterbi segmentation. Speaker adaptation is performed using MAPE(Maximum A Posteriori Probabillity Estimation) which can adapt any small amount of adaptation speech data and add one sequentially. For newspaper editorial continuous speech, the recognition rates of adaptation of HMM was 71.8% which is approximately 37% improvement over that of unadapted HMM

  • PDF

Web Page Segmentation

  • Ahmad, Mahmood;Lee, Sungyoung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.11a
    • /
    • pp.1087-1090
    • /
    • 2014
  • This paper describes an overview and research work related to web page segmentation. Over a period of time, various techniques have been used and proposed to extract meaningful information from web pages automatically. Due to voluminous amount of data this extraction demanded state of the art techniques that segment the web pages just like or close to humans. Motivation behind this is to facilitate applications that rely on the meaningful data acquired from multiple web pages. Information extraction, search engines, re-organized web display for small screen devices are few strong candidate areas where web page extraction has adequate potential and utility of usage.

Stereo Matching Using the Adaptive Patch Based on the Watershed (워터쉐드 기반의 적응 패치를 이용한 스테레오 정합 알고리즘에 관한 연구)

  • Woo-Sung Kil;Jong-Whang Jang
    • The Journal of Engineering Research
    • /
    • v.6 no.2
    • /
    • pp.99-107
    • /
    • 2004
  • In stereo matching system, it is efficient using segment patch, which divides the image into homogeneous region in color or similar intensity, because it preserves the disparity boundary and disparity continuity in low textured region. But many miss matching occur in the highly textured region because of the over segmentation that makes patch small and ambiguous. In this paper, in order to solve problems, we propose adaptive patch matching based on the watershed image segmentation. Performance was verified in experimental results.

  • PDF

Blur Detection through Multinomial Logistic Regression based Adaptive Threshold

  • Mahmood, Muhammad Tariq;Siddiqui, Shahbaz Ahmed;Choi, Young Kyu
    • Journal of the Semiconductor & Display Technology
    • /
    • v.18 no.4
    • /
    • pp.110-115
    • /
    • 2019
  • Blur detection and segmentation play vital role in many computer vision applications. Among various methods, local binary pattern based methods provide reasonable blur detection results. However, in conventional local binary pattern based methods, the blur map is computed by using a fixed threshold irrespective of the type and level of blur. It may not be suitable for images with variations in imaging conditions and blur. In this paper we propose an effective method based on local binary pattern with adaptive threshold for blur detection. The adaptive threshold is computed based on the model learned through the multinomial logistic regression. The performance of the proposed method is evaluated using different datasets. The comparative analysis not only demonstrates the effectiveness of the proposed method but also exhibits it superiority over the existing methods.

An Automated Way to Detect Tumor in Liver

  • Meenu Sharma. Rafat Parveen
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.10
    • /
    • pp.209-213
    • /
    • 2023
  • In recent years, the image processing mechanisms are used widely in several medical areas for improving earlier detection and treatment stages, in which the time factor is very important to discover the disease in the patient as possible as fast, especially in various cancer tumors such as the liver cancer. Liver cancer has been attracting the attention of medical and sciatic communities in the latest years because of its high prevalence allied with the difficult treatment. Statistics indicate that liver cancer, throughout world, is the one that attacks the greatest number of people. Over the time, study of MR images related to cancer detection in the liver or abdominal area has been difficult. Early detection of liver cancer is very important for successful treatment. There are few methods available to detect cancerous cells. In this paper, an automatic approach that integrates the intensity-based segmentation and k-means clustering approach for detection of cancer region in MRI scan images of liver.

Precise segmentation of fetal head in ultrasound images using improved U-Net model

  • Vimala Nagabotu;Anupama Namburu
    • ETRI Journal
    • /
    • v.46 no.3
    • /
    • pp.526-537
    • /
    • 2024
  • Monitoring fetal growth in utero is crucial to anomaly diagnosis. However, current computer-vision models struggle to accurately assess the key metrics (i.e., head circumference and occipitofrontal and biparietal diameters) from ultrasound images, largely owing to a lack of training data. Mitigation usually entails image augmentation (e.g., flipping, rotating, scaling, and translating). Nevertheless, the accuracy of our task remains insufficient. Hence, we offer a U-Net fetal head measurement tool that leverages a hybrid Dice and binary cross-entropy loss to compute the similarity between actual and predicted segmented regions. Ellipse-fitted two-dimensional ultrasound images acquired from the HC18 dataset are input, and their lower feature layers are reused for efficiency. During regression, a novel region of interest pooling layer extracts elliptical feature maps, and during segmentation, feature pyramids fuse field-layer data with a new scale attention method to reduce noise. Performance is measured by Dice similarity, mean pixel accuracy, and mean intersection-over-union, giving 97.90%, 99.18%, and 97.81% scores, respectively, which match or outperform the best U-Net models.

Contrast Enhancement based on Gaussian Region Segmentation (가우시안 영역 분리 기반 명암 대비 향상)

  • Shim, Woosung
    • 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.

A Mesh Segmentation Reflecting Global and Local Geometric Characteristics (전역 및 국부 기하 특성을 반영한 메쉬 분할)

  • Im, Jeong-Hun;Park, Young-Jin;Seong, Dong-Ook;Ha, Jong-Sung;Yoo, Kwan-Hee
    • The KIPS Transactions:PartA
    • /
    • v.14A no.7
    • /
    • pp.435-442
    • /
    • 2007
  • This paper is concerned with the mesh segmentation problem that can be applied to diverse applications such as texture mapping, simplification, morphing, compression, and shape matching for 3D mesh models. The mesh segmentation is the process of dividing a given mesh into the disjoint set of sub-meshes. We propose a method for segmenting meshes by simultaneously reflecting global and local geometric characteristics of the meshes. First, we extract sharp vertices over mesh vertices by interpreting the curvatures and convexity of a given mesh, which are respectively contained in the local and global geometric characteristics of the mesh. Next, we partition the sharp vertices into the $\kappa$ number of clusters by adopting the $\kappa$-means clustering method [29] based on the Euclidean distances between all pairs of the sharp vertices. Other vertices excluding the sharp vertices are merged into the nearest clusters by Euclidean distances. Also we implement the proposed method and visualize its experimental results on several 3D mesh models.

A Comparative Study of Different Color Space for Paddy Disease Segmentation (벼 병충해분할을 위한 색채공간의 비교연구)

  • Zahangir, Alom Md.;Lee, Hyo-Jong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.3
    • /
    • pp.90-98
    • /
    • 2011
  • The recognition and classification of paddy rice disease are of major importance to the technical and economical aspect of agricultural industry over the world. Computer vision techniques are used to diagnose rice diseases and to efficiently manage crops. Segmentation of lesions is the most important technique to detect paddy rice disease early and accurately. A new Gaussian Mean (GM) method was proposed to segment paddy rice diseases in various color spaces. Different color spaces produced different results in segmenting paddy diseases. Thus, this empirical study was conducted with the motivation to determine which color space is best for segmentation of rice disease. It included five color spaces; NTSC, CIE, YCbCr, HSV and the normalized RGB(NRGB). The results showed that YCbCr was the best color space for optimal segmentation of the disease lesions with 98.0% of accuracy. Furthermore, the proposed method demonstrated that diseases lesions of paddy rice can be segmented automatically and robustly.

A Study on the Development of Set Menu according to Market Segmentation of Chinese Restaurant (중식당의 시장세분화에 따른 세트메뉴 개발에 관한 연구)

  • Kim, Hyun-Duk
    • Culinary science and hospitality research
    • /
    • v.23 no.5
    • /
    • pp.109-120
    • /
    • 2017
  • This study aimed to develop Chinese restaurant set menu which was proper to tendency of market segmentation by using conjoint analysis. In order to examine tendency of market segmentation, this study investigated the important factors and effective values of whole market and segment market. First, the study found that whole market and segment market seemed to prefer seafood to meat except Cluster 3 (Gentle demand type). Second, regarding efficiency of attribute level, the study found that crap soup is favored over seafood in both whole market and segment market except Cluster 1 (strong demand type). Third, Cluster 1 (strong demand type) showed a high level of efficiency on menu which is mixed with meat and seafood. In Cluster 2 (middle demand type), there was a high level of efficiency in meat menu. In case of Cluster 3 (gentle demand type), seafood menu showed high level of efficiency. Forth, there was a high level of efficacy in rice and western dessert menu on the result of analysis on whole market and segment market. Therefore, this study suggests that the preference of seafood is more higher than the preference of meat. It means that current customers care their health more than they used to be. According to this study, people who want to develop Chinese restaurant menu should focus on seafood more than meat. What's more, marketers of chinese restaurants have to not only present new awareness and fresh atmosphere but also provide typical composition of set menu for target customers.