• Journal of information and communication convergence engineering
• /
• 제6권4호
• /
• pp.444-447
• /
• 2008

In this paper, we proposed the recognition system of car license plates to mitigate traffic problems. The processing sequence of the proposed algorithm is as follows. At first, a license plate segment is extracted from an acquired car image using morphological features and color information, and noises are eliminated from the extracted license plate segment using line scan algorithm and Grassfire algorithm, and then individual codes are extracted from the license plate segment using edge tracking algorithm. Finally the extracted individual codes are recognized by an FCM algorithm. In order to evaluate performance of segment extraction and code recognition of the proposed method, we used 100 car images for experiment. In the results, we could verify the proposed method is more effective and recognition performance is improved in comparison with conventional car license plate recognition methods.

• 한국통신학회논문지
• /
• 제34권12C호
• /
• pp.1147-1153
• /
• 2009

본 논문에서는 분할 영역기반 스테레오 정합에 있어서 분할 영역 추출시 컬러 외에 깊이 카메라의 초기 깊이, 프레임 간 분할 영역의 움직임 정보를 같이 이용한 분할 영역기반 스테레오 정합 기법을 제안한다. 제안한 기법은 깊이 카메라의 초기 깊이 정보를 이용하여 기준 영상의 객체/배경 분리를 먼저 수행하고, 분리된 객체/배경별로 컬러 영상 분할을 수행하여 분할 영역을 추출한다. 또한 분할 영역기반 깊이 정보 추출에 있어 프레임 간 깊이 정보의 연속성을 유지하기 위해 객체/배경 분리 정보, 분할 영역의 움직임 정보를 이용한다. 실험결과에서, 제안한 기법은 컬러 정보만을 이용한 기존의 분할 영역 추출 및 분할 영역 기반 스테레오 정합 기법에 비해 정적배경 영역에서 특히 분할 영역 추출과 깊이 정확도가 개선된 성능을 보였다.

• 치과방사선
• /
• 제28권2호
• /
• pp.387-413
• /
• 1998

Image resampling is of particular interest in digital radiology. When resampling an image to a new set of coordinate, there appears blocking artifacts and image changes. To enhance image quality, interpolation algorithms have been used. Resampling is used to increase the number of points in an image to improve its appearance for display. The process of interpolation is fitting a continuous function to the discrete points in the digital image. The purpose of this study was to determine the effects of the seven interpolation functions when image resampling in digital periapical images. The images were obtained by Digora, CDR and scanning of Ektaspeed plus periapical radiograms on the dry skull and human subject. The subjects were exposed to intraoral X-ray machine at 60kVp and 70 kVp with exposure time varying between 0.01 and 0.50 second. To determine which interpolation method would provide the better image, seven functions were compared; (1) nearest neighbor (2) linear (3) non-linear (4) facet model (5) cubic convolution (6) cubic spline (7) gray segment expansion. And resampled images were compared in terms of SNR(Signal to Noise Ratio) and MTF(Modulation Transfer Function) coefficient value. The obtained results were as follows ; 1. The highest SNR value(75.96dB) was obtained with cubic convolution method and the lowest SNR value(72.44dB) was obtained with facet model method among seven interpolation methods. 2. There were significant differences of SNR values among CDR, Digora and film scan(P<0.05). 3. There were significant differences of SNR values between 60kVp and 70kVp in seven interpolation methods. There were significant differences of SNR values between facet model method and those of the other methods at 60kVp(P<0.05), but there were not significant differences of SNR values among seven interpolation methods at 70kVp(P>0.05). 4. There were significant differences of MTF coefficient values between linear interpolation method and the other six interpolation methods (P< 0.05). 5. The speed of computation time was the fastest with nearest -neighbor method and the slowest with non-linear method. 6. The better image was obtained with cubic convolution, cubic spline and gray segment method in ROC analysis. 7. The better sharpness of edge was obtained with gray segment expansion method among seven interpolation methods.

• 한국정보전자통신기술학회논문지
• /
• 제6권4호
• /
• pp.232-237
• /
• 2013

This paper presents image database retrieval based on maximum color occurrenceusing Hue, Saturation and Value (HSV) color space. Our system is based on color segmentation. We dividedthe image into n number of areas based on different selected ranges of hue and value, then each area is partitioned into m number of segments based on the number of pixels it contains, after this we calculated the maximumcolor occurrence in each segment and used its HSV value. This is used as a feature vector.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.109-114
• /
• 1987

In this thesis, we work on the curve recognition with real time processing and the Robot tracking method on recognized curve. Image information of segment curve is supplied to computer to run to a Robot so that it is a feedback system. Image coordinate frame to world coordinate transformation represents in this paper and curve matching algorithm subscribes by two method, first transformation matching algorithm, second image coordinate matching algorithm. Also Robot running time to computer image processing time relationships finally includes.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2351-2354
• /
• 2003

A new transform coder for arbitrarily shaped image segments is proposed. In the encoder, a block-based DCT is applied to the resulting image block after shifting pixels within the image segment to block border and padding the mean value of the pixels to empty region. For reducing the transmission bit rate, the transform coefficients located in padded region are truncated and only the remaining transform coefficients are transmitted to the decoder. In the decoder, the transform coefficients truncated in the encoder are recovered using received transform coefficients and a block-based inverse DCT is performed.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 G
• /
• pp.2243-2245
• /
• 1998

In this paper, we treat image segmentation as a graph partitioning problem. and use the normalized cut for segmenting the graph. The normalized cut criterion measures both the total dissimilarity between the different graphs as well as the total similarity within the groups. The minimization of this criterion can formulated as a generalized eigenvalues problem. We have applied this approach to segment static image. This criterion can be shown to be computed efficiently by a generalized eigenvalues problem

• 방송공학회논문지
• /
• 제13권5호
• /
• pp.685-695
• /
• 2008

본 논문은 다시점에서 물체를 촬영한 영상들의 집합, 즉, 다시점 영상 집합(multi-view image set)이 주어진 경우, 적은 사용자 입력을 통해 효율적으로 영상 집합 내 관심 물체의 영역을 추출하는 기법을 제안한다. 제안하는 기법은 사용자가 직접 입력을 통해 영역화한 하나의 영상을 바탕으로, 그 영상의 배경 및 전경과 인접 영상 간의 변형을 각각 근사하여 전경 및 배경에 대응되는 인접 영상의 영역을 파악하고, 이 영역들을 통해 인접 영상을 영역화한 후, 영역화된 영상을 바탕으로 다음 인접 영상을 영역화하는 과정을 순차적으로 반복하여 영상 집합 전체를 영역화한다. 이때 전경 및 배경의 변형은 각각 특징점 기반 레지스트레이션(registration) 기법과 선형성 거리비율 보존(affine) 변형을 가정한 대응점 기반 변형행렬(homography)을 통해 근사되며, 각 대응 영역을 기반으로 하는 화소 색 분포 및 형상 정보(shape prior)를 마르코프 랜덤 장(Markov random field)에서의 에너지 최소화에 기반을 둔 영역화 기법에 적용하여 영역화를 수행한다. 제시하는 실험 결과는 제안하는 기법이 적은 사용자 입력으로 다시점 영상 집합 전체를 효과적으로 영역화한다는 것을 뒷받침한다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.234-237
• /
• 2007

Road networks are important geospatial databases for various GIS (Geographic Information System) applications. Road digital maps may contain geometric spatial errors due to human and scanning errors, but manually updating roads information is time consuming. In this paper, we developed a new road features updating methodology using from multispectral high-resolution satellite image and pre-existing vector map. The approach is based on initial seed point generation using line segment matching and a modified double snake algorithm. Firstly, we conducted line segment matching between the road vector data and the edges of image obtained by Canny operator. Then, the translated road data was used to initialize the seed points of the double snake model in order to refine the updating of road features. The double snake algorithm is composed of two open snake models which are evolving jointly to keep a parallel between them. In the proposed algorithm, a new energy term was added which behaved as a constraint. It forced the snake nodes not to be out of potential road pixels in multispectral image. The experiment was accomplished using a QuickBird pan-sharpened multispectral image and 1:5,000 digital road maps of Daejeon. We showed the feasibility of the approach by presenting results in this urban area.

• Steel and Composite Structures
• /
• 제17권2호
• /
• pp.145-157
• /
• 2014

This study aimed to investigate the fatigue crack growth behavior of a kind of fiber metal laminates (FML) under four different stress levels. The FML specimen consists of three 2024-T3 aluminum alloy sheets and two layers of glass/epoxy composite lamina. Tensile-tensile cyclic fatigue tests were conducted on centrally notched specimen at four stress levels with various maximum values. A digital camera system was used to take photos of the propagating cracks on both sides of the specimens. Image processing software was adopted to accurately measure the length of the cracks on each photo. The test results show that: (1) a-N and da/dN-a curves of FML specimens can be divided into transient crack growth segment, steady state crack growth segment and accelerated crack growth segment; (2) compared to 2024-T3 aluminum alloy, the fatigue properties of FML are much better; (3) da/dN-${\Delta}K$ curves of FML specimens can be divided into fatigue crack growth rate decrease segment and fatigue crack growth rate increase segment; (3) the maximum stress level has a large influence on a-N, da/dN-a and da/dN-${\Delta}K$ curves of FML specimens; (4) the fatigue crack growth rate da/dN presents a nonlinear accelerated increasing trend to the maximum stress level; (5) the maximum stress level has an almost linear relationship with the stress intensity factor ${\Delta}K$.