Earticle

현재 위치 Home 검색결과

결과 내 검색

발행연도

-

학문분야

자료유형

간행물

검색결과

검색조건
검색결과 : 195
No
1

A Novel Fuzzy C-Means based Chameleon Swarm Algorithm for Segmentation and Progressive Neural Architecture Search for Plant Disease Classification

A. Umamageswari, N. Bharathiraja, D. Shiny Irene

[NRF 연계] 한국통신학회 ICT Express Vol.9 No.2 2023.04 pp.160-167

※ 협약을 통해 무료로 제공되는 자료로, 원문이용 방식은 연계기관의 정책을 따르고 있습니다.

원문보기

This study proposed a novel framework for plant leaf disease identification. The proposed model consists of four steps including pre-processing, segmentation, feature extraction, and classification. At first, the unwanted noise and overfitting are removed, and also image contrast level is enhanced. Secondly, the Fuzzy C-Means (FCM) based Chameleon Swarm Algorithm (CSA) named as (FCM-CSA) is used for plant leaf diseased part segmentation. In the third stage, the feature extraction is performed using a fast GLCM feature extraction model. Finally, the Progressive Neural Architecture Search (PNAS) is used for plant leaf disease identification. The experimental investigations are carried out using MATLAB software with the Mendeley database. From this dataset, we have used Apple Cedar Apple Rust (ACAR), Cherry Powdery Mildew (CPM), Corn Common Rust (CCCR), Apple Healthy (AH), Grape Black Rot (GBR), Pepper Bell Bacterial Spot (PBBS), Potato Late Blight (PLB) and Tomato Leaf Mold (TLM) disease images. Different measures such as precision, recall, sensitivity, specificity, and accuracy results are used to validate the performance of the proposed model.

2

4,000원

Regarding high-dimensional heterogeneous data, combined with the existing algorithms' poor mining accuracy and parameter sensitivity, this paper proposes a local outlier mining algorithm based on neighborhood density. Use region segmentation to split high-dimensional data into reasonable sub-regions, reducing the difficulty of processing a large amount of high-dimensional data. The kernel neighborhood density is used to replace the average neighborhood density, so that the density calculation has nothing to do with data heterogeneity. Finally, the neighborhood state and outlier state of the data are further determined on the basis of neighborhood density to improve the accuracy of outlier mining. Through artificial and UCI data set simulation results, it shows that data volume and data dimension are the main factors that affect data outlier mining. The accuracy, coverage, and efficiency of the algorithm proposed in this paper are significantly better than those of the comparison algorithm, and it has better adaptability to different types of data sets.

3

영상 세션화는 기본적으로 이미지를 의미있는 구조로 나누는 것이다. 항상 특정 요구에 따라 이미지를 완전히 분할 한다. 하지만 결과가 원하지 않는 오버세션화가 이루어질 수 있다. 따라서 본 논문에서는 오버세션화를 줄이기 위해 가우시안 혼합 모델(GMM) 기반의 변형된 워터쉐드 알고리즘을 제안한다. 거리 변환 영상은 가우시안 혼합 모델에 의해 처리된다. 그리고 기대 최대화(EM) 알고리즘은 가우시안 혼합모델 데이터에 맞추는 데 사용된다. 이들 평균 의 평균을 최적의 임계값으로 선택하고 획득된 임계값에 기초하여 이진 영상으로 변환한다. 이렇게 얻은 이진 영상 은 적절한 구조 요소의 적용하여 침식화한다. 침식된 영상에서 수행된 워터쉐드 분할은 효과적인 분할 결과를 제공 한다. 제안된 방법이 사용될 때 옥수수, 쌀 및 밀과 같은 다른 커널이 효과적으로 분할된다. 실험 목적으로 38 개의 옥수수 커널, 95 개의 쌀 커널 및 32 개의 밀 커널을 사용한다. 분할 정확도는 옥수수, 쌀 및 밀에 대해 각각 94.7 %, 96.8 % 및 90.6 % 이다.

Image segmentation is basically the division of an image into meaningful structures. It always produces complete division of the image as the specific demand. However, it is prone to over-segmentation which makes the result unfavorable. Therefore, this paper proposes modified watershed algorithm based on Gaussian mixture model(GMM) to reduce the over-segmentation. Distance transformed image is processed by GMM. And expectation maximization(EM) algorithm is used to fit GMM to data. Average of these means is chosen as optimal threshold and the image is converted into binary image based on the obtained threshold value. Binary image thus obtained is eroded with the help of proper structuring element. Watershed segmentation thus carried out on the eroded image gives the effective segmentation results. Different kernels such as corn, rice, and wheat are effectively segmented when the proposed methodology is used. 38 corn kernels, 95 rice kernels, and 32 wheat kernels are used for the experimental purpose. The accuracy of segmentation is as high as 94.7%, 96.8%, and 90.6% for corn, rice, and wheat respectively.

4

4,800원

고령화 사회에 접어들면서 거동이 어려운 장애인과 고령자의 개인 교통수단에 대한 수요가 증가하고 있다. 실제로 2017년 기준 전국 전동보장구 보급수는 9만여 대로 지속해서 증가하는 추세다. 하지만 장애인 및 고령자의 판단 능력과 조정 능력은 정상인보다 상대적으로 차이가 있는 관계로 주행 중 사고 발생의 가능성이 크다. 다양한 사고의 원인 중 하나는 도로 노면 상태의 불균형으로 인해 개인 이동 수단 조향 제어의 간섭이다. 본 논문에서는 이 같은 사고를 예방하고자 도로 노면 상태를 고속으로 인지할 수 있는 암호화 형식 의미론적 분할 알고리즘 을 소개한다. 이를 위하여 도로 노면 파손이 포함된 1,500여 장의 학습용 데이터와 150여 장의 테스트용 데이터를 새롭게 구성하였다. 그리고 이를 활용하여 기존의 Encoder와 Decoder 단계 로 구성된 Auto-encoder 방식과 달리 Encoder 단계로 이루어진 심층 신경망을 제안하였다. 이 심층 신경망은 기존의 방식과 비교했을 때 평균 정확도(Mean Accuracy)는 4.45% 증가하였고 파라미터는 59.2% 감소하였으며 연산 속도는 11.9% 향상되었다. 이 같은 고속 알고리즘을 활 용하여 안전한 개인 이동 수단이 확대 적용되길 기대한다.

As we face an aging society, the demand for personal mobility for disabled and aged people is increasing. In fact, as of 2017, the number of electric wheelchair in the country continues to increase to 90,000. However, people with disabilities and seniors are more likely to have accidents while driving, because their judgment and coordination are inferior to normal people. One of the causes of the accident is the interference of personal vehicle steering control due to unbalanced road surface conditions. In this paper, we introduce a encoder type semantic segmentation algorithm that can recognize road conditions at high speed to prevent such accidents. To this end, more than 1,500 training data and 150 test data including road surface damage were newly secured. With the data, we proposed a deep neural network composed of encoder stages, unlike the Auto-encoding type consisting of encoder and decoder stages. Compared to the conventional method, this deep neural network has a 4.45% increase in mean accuracy, a 59.2% decrease in parameters, and an 11.9% increase in computation speed. It is expected that safe personal transportation will be come soon by utilizing such high speed algorithm.

5

조명변화에 강인한 에지기반의 움직임 객체 추출 기법 KCI 등재후보

도재수

한국융합보안학회 융합보안논문지 제7권 제1호 2007.03 pp.1-10

※ 기관로그인 시 무료 이용이 가능합니다.

4,000원

의미있는 객체를 배경과 분리하는 영상분할기법은 침입자 경보 시스템, 교통 감시 시스템 등에서 중요한 역할을 담당하며, 일반적으로 공간적 동질성이나 시간적 정보를 이용하는 방법으로 나눌 수 있다. 시간적 정보를 이용하는 방법은 프레임간의 화소값이나 에지성분을 이용한다. 화소값 이용은 간단하며 효과적이나 조명 변화 등이 발생할 경우 움직임 검출이 어렵고 에지성분의 이용은 조명의 영향을 받지 않지만 복잡하며 잡음처리에 어려운 점이 있다. 따라서 본 논문은 카메라가 고정된 감시 시스템에서 화소값 비교와 에지 정보를 이용하여 조명 등의 영향을 최소화하는 움직임 객체 추출 방법을 제안한다. 이는 조명변화와 배경영상의 존재여부에 따라 세 가지 움직임 객체 추출 방법을 달리 적용하며, 투영과 형태 처리 연산자를 사용하는 후처리 과정을 거친 후 움직임 객체를 추출한다. 모의실험 결과 제안알고리즘은 조명변화가 발생하더라도 객체 추출의 결과가 우수함을 보이고 있다.

Surveillance system with the fixed field of view generally has an identical background and is easy to extract and segment a moving object. However, it is difficult to extract the object when the gray level of the background is varied due to illumination condition in the real circumstance. In this paper we propose the segmentation to extract effectively the object in spite of the illumination change. In order to minimize the effect of illumination, the proposed algorithm is composed of three modes to the background generation and the illuminational change. Then the object is finally obtained by using projection and the morphological operator in post-processing. A good seg-mentation performance is demonstrated by the simulation result.

6

신규 고객 세분화를 위한 분석 eCRM 알고리즘 KCI 등재

강윤정, 송행숙, 최동운

한국상업경영학회(구 한국상업교육학회) 상업경영연구(구 상업교육연구) 제14권 2006.10 pp.301-318

※ 기관로그인 시 무료 이용이 가능합니다.

5,200원

eCRM 시스템은 운영 및 협동 CRM과 분석 CRM으로 나누어진다. 분석 CRM은 데이터 마이닝 기법을 사용하여 데이터를 분석하는 많은 컴포넌트로 구성되어 있다. CRM의 기본적인 기능 중에 하나는 세분화이다. 이는 고객의 획득, 고객의 유지, 고객의 가치 증대의 중요한 비즈니스 프로세스를 지원하는 중추의 역할을 지원한다. 본 논문에서는 eCRM 데이터를 세분화하여 분석하기 위해 홉필드 네트워크 알고리즘을 이용하여 구현하였다. 이 모듈의 개발은 보다 더 효과적이고, 사용자들이 편리하게 사용할 수 있는 환경을 제공한다.

The eCRM(electronic CRM) system which is divided into two parts such as "operational and collaborative CRM" and "analytical CRM". The analytical CRM which is the major part in this paper is consisted of many components which analyzes data using data mining technology. One of the fundamental functions in CRM is customer segmentation, which plays the pivotal role of supporting the key business processes of customer acquisition, customer retention and customer value extension. This paper was implemented eCRM Segmentation Agent basis of Hopfield network algorithm. Through the development of a module, which helps to use existing data environment more effectively, it supports an environment that users can use easily.

7

평균이동분할과 연결요소를 이용한 도로추출 알고리즘 KCI 등재

이태희, 황보현, 윤종호, 박병수, 최명렬

한국디지털정책학회 디지털융복합연구 제12권 제1호 2014.01 pp.359-364

※ 기관로그인 시 무료 이용이 가능합니다.

4,000원

본 논문은 평균이동방법과 연결요소방법을 이용하여 도로 영역을 추출하는 알고리즘을 제안하였다. 평균 이동 방법은 중심 모드를 찾기 위한 비모수적 통계 방법으로 컬러 영상을 분할하는데 효율적이다. 일반적으로, 영상의 중·하단에 위치하는 정보를 활용하여 도로의 특징점이 추출된다. 이 특징점과 분할된 컬러 영상을 이용하면, 도로의 영역을 추출할 수 있다. 그러나, 도로의 위치정보와 색상정보만으로 도로영역을 추출할 경우, 잡음과 도로 이외의 영역까지 추출되는 단점이 있다. 본 논문에서는 모폴로지 열기·닫기 연산을 이용하여 잡음을 제거하고, 연결요소 방법을 통하여 가장 큰 영역의 부분만을 추출하여 도로 영역으로 결정하는 방법을 제안한다. 제안된 방법은 실험을 통하여 잡음 제거와 보다 정확한 도로 검출됨을 검증한다.

In this paper, we propose a method for extracting a road area by using the mean-shift method and connected-component method. Mean-shift method is very effective to divide the color image by the method of non-parametric statistics to find the center mode. Generally, the feature points of road are extracted by using the information located in the middle and bottom of the road image. And it is possible to extract a road region by using this feature-point and the partitioned color image. However, if a road region is extracted with only the color information and the position information of a road image, it is possible to detect not only noise but also off-road regions. This paper proposes the method to determine the road region by eliminating the noise with the closing / opening operation of the morphology, and by extracting only the portion of the largest area using a connected-components method. The proposed method is simulated and verified by applying the captured road images.

8

영역 분할과 판단 요소를 이용한 표정 인식 알고리즘 KCI 등재

이계정, 정지용, 황보현, 최명렬

한국디지털정책학회 디지털융복합연구 제12권 제12호 2014.12 pp.243-248

※ 기관로그인 시 무료 이용이 가능합니다.

4,000원

본 논문에서는 사람 얼굴의 표정을 인식하기 위하여 판단 요소를 선정하고 판단 요소의 변화 상태를 파악 하여 표정을 인식하는 방법을 제안한다. 판단 요소를 선정하기 위하여 이미지 영역 분할 방법을 사용하며, 판단 요 소의 변화율을 이용하여 표정을 판단한다. 표정을 판단하기 위하여 90명의 표정을 데이터베이스화하여 비교하였고, 4 개의 표정(웃음, 화남, 짜증, 슬픔)을 인식하는 방법을 제안한다. 제안한 방법은 시뮬레이션을 실시하여 판단 요소 검 출 성공률과 표정 인식률을 통해 검증한다.

In this paper, we propose a method to recognize the facial expressions by selecting face elements and finding its status. The face elements are selected by using image area segmentation method and the facial expression is decided by using the normal distribution of the change rate of the face elements. In order to recognize the proper facial expression, we have built database of facial expressions of 90 people and propose a method to decide one of the four expressions (happy, anger, stress, and sad). The proposed method has been simulated and verified by face element detection rate and facial expressions recognition rate.

9

코너 검출 기반의 융합형 Data Matrix 바코드 분할 알고리즘 KCI 등재후보

한희준, 이종연

한국융합학회 한국융합학회논문지 제6권 제1호 2015.02 pp.7-16

※ 기관로그인 시 무료 이용이 가능합니다.

4,000원

바코드 검사기의 성능에 결정적인 영향을 미치는 것은 입력 영상으로부터 바코드 영역을 추출하는 세그먼테이션 과정이며, 기존의 세그먼테이션 기법에는 여러 가지 문제점이 존재한다. 첫째, 허프 직선 변환 방법은 길이 임계값에 매우 민감하여 임계값을 정하는데 어려움이 있다. 둘째, 모폴로지 변환은 영상을 수축, 팽창하는 과정에서 많은 지연시간이 발생한다. 따라서 본 논문에서는 이러한 바코드 검증에서 지연 현상을 해결하고 주변 영향을 적게 받는 해리스 코너 검출 기법 융합형 바코드 영역 검출 기법을 제안한다. 그리고 본 논문에서 제안한 알고리즘을 검증하기 위해 실제 라인과 유사한 실험 환경을 구성하고, 다양한 크기의 바코드 영상과 다양한 위치에서의 바코드 영역 추출실험을 하였다. 결과적으로 제안 기법은 기존의 알고리즘에 비해 주변 환경이나 임계값 설정의 어려움과 영상 처리의 지연 문제를 해결하였고 모든 테스트 영상에 대해 바코드 영역을 100% 추출하는 성능을 보였다.

A segmentation process extracts an interesting area of barcode in an image and gives a crucial impart on the performance of barcode verifier. Previous segmentation methods occurs some issues as follows. First, it is very hard to determine a threshold of length in Hough Line transform because it is sensitive. Second, Morphology transform delays the process when you conduct dilation and erosion operations during the image extraction. Therefore, we proposes a novel Converged Harris Corner detection-based segmentation method to detect an interesting area of barcode in Data Matrix. In order to evaluate the performance of proposed method, we conduct experiments by a dataset of barcode in accordance with size and location in an image. In result, our method solves the problems of delay and surrounding environments, threshold setting, and extracts the barcode area 100% from test images

10

세그멘테이션 알고리즘을 사용한 도로 Sign 인식 모델 KCI 등재

황영, 송정영

국제인공지능학회(구 한국인터넷방송통신학회) 한국인터넷방송통신학회 논문지 제13권 제2호 2013.04 pp.233-237

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

이미지 인식은 패턴인식의 중요한 한 연구 분야이다. 본 논문은 이미지 세그멘테이션 알고리즘을 소개하고, 이의 응용으로 도로 Sign 인식시스템에 적용하여 그 결과를 고찰하였다. 본 논문에서, 우리는 이미지 프로세싱 기술의 도움으로 도로 Sign 의 체계적인 연구를 하였고, 이에 해당하는 알고리즘을 만들었다. 도로 Sign을 인식하기 위하여, 본 논문은 이미지 세그멘테이션 알고리즘 파트와 이미지 인식파트의 두 부분으로 나누어서 기술하였다. 인식실험은 도 로 Sign 인식 알고리즘 모델이 스마트 폰에 유용하게 사용될 것과, 그 외 여러분야에 사용될 수 있음을 보여 준다.

Image recognition is an important research area of pattern recognition. This paper studies that the image segmentation algorithm theory and its application in road signs recognition system. In this paper We studied a systematic study for road signs and we have made the recognition algorithm. This paper is divided in image segmentation part and image recognition part for the road signs recognition. The experimental results show that the road signs recognition model can make effective use in smart phone system, and the model can be used in many other fields.

11

Automated Segmentation and Hybrid Classifier for Identifying Medical Image

Tak-Yee Wong, Ching-Hsue Cheng

보안공학연구지원센터(IJSIP) International Journal of Signal Processing, Image Processing and Pattern Recognition Vol.6 No.1 2013.02 pp.191-202

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

The high prevalence of lung cancer, many researcher concerns about diagnosing pulmo-nary lesions in chest computed tomography (CT). However, specialists would spend a great amount of their time and effort to analysis those CT scans. And the inter-reader variability in the detection of nodules by specialists may exist. Therefore, many automated methods have proposed methods for automatic diagnosis to assist artificial inspection. This study proposes a novel hybrid method to initially classify lungs images. Firstly, adjusting the contrast of chest images can change those images from indistinct to clear, and then use the proposed novel hybrid method to automated identification CT images. From the experiments, this paper can obtain three contributions: (1) Proposed segmentation algorithm can refine the lungs regions and improve the classification performance. (2) The proposed method can be execut-ed before doctor diagnosis or computer-aided system, which can be sure that input CT image need to be detected out the actual positions, shapes or other information of nodules. (3) The results display a higher accuracy in proposed rough classifier based on DWPT-SVD than other classification methods, which verifies that proposed method can reduce time and cost of lung nodule diagnosis.

12

Image Segmentation Algorithm Based on Improved Ant Colony Algorithm

Xumin Liu, Xiaojun Wang, Na Shi, Cailing Li

보안공학연구지원센터(IJSIP) International Journal of Signal Processing, Image Processing and Pattern Recognition Vol.7 No.3 2014.06 pp.433-442

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

13

Segmentation Algorithm for CT Images using Morphological Operation and Artificial Neural Network

C. Karthikeyan, B. Ramadoss, S. Baskar

보안공학연구지원센터(IJSIP) International Journal of Signal Processing, Image Processing and Pattern Recognition Vol.5 No.2 2012.06 pp.115-122

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

Segmentation of pulmonary X-ray computed tomography (CT) images is a precursor to most pulmonary image analysis applications. Digital Image Processing is currently a hot research area in medicine and it is believed that they will receive extensive application to biomedical systems in the next few years. In Digital Image Processing, neural networks are ideal in recognizing diseases using scans since there is no need to provide a specific algorithm on how to identify the disease. This paper describes an algorithm to separate the lung tissue from a Chest CT to reduce the amount of data that needs to be analyzed. Our goal is to have a fully automatic algorithm for segmenting the lung tissue, and to separate the two lung sides as well. Fuzzy c-Means clustering is used to segment the lungs. Cleaning is performed to remove air, noise and airways. Finally, a sequence of morphological operations is used to smooth the irregular boundary. The database used for evaluation is taken from a radiology-teaching file. Our current evaluation shows that the applied segmentation algorithm works on a large number of different cases. The textural features were extracted from the segmented lungs and it was given as input to CFBP. The neural networks are used to identify the various lung diseases.

14

The Skin Color Segmentation Algorithm Based on the Cr*A*B Color Space SCOPUS

Yong qiang Chen, Changdong Wu, Bo Yu

보안공학연구지원센터(IJCA) International Journal of Control and Automation Vol.9 No.5 2016.05 pp.255-262

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

Skin color segmentation plays an important role in the biological feature recognition system. In order to improve the system adaptability to the complex environment, a new model of Cr*a*b by combing the YCbCr with Lab model is proposed. Firstly, establish the three-dimensional coordinate system based on the Cr, a, b axes, the two-two coordinates form the directional vectors by using the origin as the starting point. Then calculate the angles between the three vectors. Finally, realize the purpose of skin color segmentation by reducing the dimensions of angle data. Experimental results show that this algorithm can improve the over sensitive of YCbCr model to red and yellow, the defect of the skin color weak clustering in the Lab model is also overcame. Even if for the image with complex background environment, the percent of average accurate detection is about 87.7%. The proposed algorithm can get the high skin color segmentation rate and has good practicability.

15

A New Parallel Segmentation Algorithm for Medical Image

Sun Yongqian, Xi Liang

보안공학연구지원센터(IJSIP) International Journal of Signal Processing, Image Processing and Pattern Recognition Vol.8 No.2 2015.02 pp.139-146

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

In medical Image analysis, the parallel segmentation is the core technology. As one of the classical methods, regional growth algorithms have some problems: it is hard to confirm the feed points automatically. To solve this defect, a new parallel segmentation algorithm with regional growth and support vector machine (SVM) is proposed. SVMs have a good result in segmentation (classification) but a non-ideal convergence rate which is the advantage of regional growth method. So that, combining them and the idea of the algorithm is: classify by SVM to search the seed points, segment by regional growth method. A curvature flow filter is also used in this algorithm to reduce the noise. The experiments are performed on a parallel environment based on torque. The results show that the algorithm is faster than conventional algorithms and the results are better.

16

A Chinese Character Segmentation Algorithm for Complicated Printed Documents

Yuan Mei, Xinhui Wang, Jin Wang

보안공학연구지원센터(IJSIP) International Journal of Signal Processing, Image Processing and Pattern Recognition Vol.6 No.3 2013.06 pp.91-100

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

The character segmentation technology for printed documents plays an important role in optical character recognition, ticket information identification, postal code identification, automatic license plate recognition and so on. In this paper, a Chinese characters segmentation algorithm for complicated printed documents is proposed for the application in paper watermarking system. In this application, the algorithm aims to achieve high accuracy Chinese character segmentation and high consistent segmentation between the digital version images and print-scanned version images for the same documents. In this method, three main steps are included: connected regions recognition, connected regions merging, and fine-gained segmentation. Experiments show the effectiveness of the proposed algorithm.

17

An efficient Video Segmentation Algorithm with Real time Adaptive Threshold Technique

Yasira Beevi C P, Dr. S. Natarajan

보안공학연구지원센터(IJSIP) International Journal of Signal Processing, Image Processing and Pattern Recognition vol.2 no.4 2009.12 pp.13-28

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

Automatic video segmentation plays an important role in real-time MPEG-4 encoding systems. This paper presents a video segmentation algorithm for MPEG-4 camera system with change detection, background registration techniques and real time adaptive threshold techniques. This algorithm can give satisfying segmentation results with low computation load. Besides, it has shadow cancellation mode, which can deal with light changing effect and shadow effect. Furthermore, this algorithm also implemented real time adaptive threshold techniques by which the parameters can be decided automatically.

18

Construction of Finite Element Segmentation Algorithm Model of Image

Li Han, Pengyuan Wang

보안공학연구지원센터(IJSIP) International Journal of Signal Processing, Image Processing and Pattern Recognition Vol.9 No.11 2016.11 pp.109-116

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

Grading the fruit by using machine vision system, it is hoped by the computer to recognize and understand the image automatically, in order to achieve this objective, the key step is to capture the suitable fruit images so that fruit image information can be effectively decomposed. Therefore, the final result of decomposition is to get some of the characteristics of each image with its own motifs, such as borders, shape and so on. By using these primitives, you can match a certain pattern, so as to determine the quality of the fruit. In this paper, it takes the overview of the finite element segmentation as a starting point, combined with the interpretation of the numerical algorithm and FCM algorithm functional convergence of the sequence, relying on Mumford-Shah function model to investigate the generation of fruit image finite element model.

19

A Novel MRI Image Segmentation Algorithm based on Modified Neural Network Model

Jie Yang, Xiaoling Guo, Xiao Zhang, Jingjing Yang

보안공학연구지원센터(IJSIP) International Journal of Signal Processing, Image Processing and Pattern Recognition Vol.9 No.10 2016.10 pp.227-236

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

With the rapid advancement of the computer assisted medical applications, the MRI image segmentation has been a hottest research topic. In the neural network is used for the image segmentation, we need a lot of training data, because of the large amount of the data, computing speed is quite slow, not suitable for real-time data processing, lead to the low resolution image segmentation, the resolution is not high, this paper proposes a fuzzy image segmentation algorithm of the BP neural network. Fuzzy set theory is used to subtract the characteristics after area of the image segmentation, reduce the dimension of feature vector. We adopt the revised neural network to undertake the experimental simulation compared with the other state-of-the-art approaches. The result proves the effectiveness of our methodology. Our algorithm could segment the regions of interest with the ability of eliminating the out side noise which achieves the better robustness.

20

A Multiple Moving Object Segmentation Algorithm Based on Background Modeling and Adaptive Clustering

Zhengyi Hu, Qingchang Tan, Kun Zhang, Xin Wang

보안공학연구지원센터(IJSIP) International Journal of Signal Processing, Image Processing and Pattern Recognition Vol.8 No.12 2015.12 pp.285-296

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

A multiple moving object segmentation algorithm based on Background Modeling and Adaptive Clustering (named as BMAC) algorithm is proposed in this paper. For moving object segmentation, the algorithm uses Chebyshev inequality and the kernel density estimation method to do background modeling firstly. Then in order to classify image pixels as background points, foreground points and suspicious points, an adaptive threshold algorithm is proposed accordingly. After using background modeling, adaptive clustering is used for multi-object segmentation. It defines pixel space connectivity rate and designs a perpendicular split method, initial cluster adaptive splitting and merging self-organizing the iterative clustering segmentation algorithm, without pre-set number of clustering, completes multi-object segmentation for the foreground image. The segmentation results are consistent with the human visual judgment, the use of space connectivity information improve the accuracy of clustering segmentation, comparison and analysis the experimental results show that the proposed algorithm is feasible, rapid and effective.

 
1 2 3 4 5
페이지 저장