• Title/Summary/Keyword: Color paper

Search Result 4,543, Processing Time 0.031 seconds

Lane Detection in Complex Environment Using Grid-Based Morphology and Directional Edge-link Pairs (복잡한 환경에서 Grid기반 모폴리지와 방향성 에지 연결을 이용한 차선 검출 기법)

  • Lin, Qing;Han, Young-Joon;Hahn, Hern-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.6
    • /
    • pp.786-792
    • /
    • 2010
  • This paper presents a real-time lane detection method which can accurately find the lane-mark boundaries in complex road environment. Unlike many existing methods that pay much attention on the post-processing stage to fit lane-mark position among a great deal of outliers, the proposed method aims at removing those outliers as much as possible at feature extraction stage, so that the searching space at post-processing stage can be greatly reduced. To achieve this goal, a grid-based morphology operation is firstly used to generate the regions of interest (ROI) dynamically, in which a directional edge-linking algorithm with directional edge-gap closing is proposed to link edge-pixels into edge-links which lie in the valid directions, these directional edge-links are then grouped into pairs by checking the valid lane-mark width at certain height of the image. Finally, lane-mark colors are checked inside edge-link pairs in the YUV color space, and lane-mark types are estimated employing a Bayesian probability model. Experimental results show that the proposed method is effective in identifying lane-mark edges among heavy clutter edges in complex road environment, and the whole algorithm can achieve an accuracy rate around 92% at an average speed of 10ms/frame at the image size of $320{\times}240$.

Computation ally Efficient Video Object Segmentation using SOM-Based Hierarchical Clustering (SOM 기반의 계층적 군집 방법을 이용한 계산 효율적 비디오 객체 분할)

  • Jung Chan-Ho;Kim Gyeong-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.4 s.310
    • /
    • pp.74-86
    • /
    • 2006
  • This paper proposes a robust and computationally efficient algorithm for automatic video object segmentation. For implementing the spatio-temporal segmentation, which aims for efficient combination of the motion segmentation and the color segmentation, an SOM-based hierarchical clustering method in which the segmentation process is regarded as clustering of feature vectors is employed. As results, problems of high computational complexity which required for obtaining exact segmentation results in conventional video object segmentation methods, and the performance degradation due to noise are significantly reduced. A measure of motion vector reliability which employs MRF-based MAP estimation scheme has been introduced to minimize the influence from the motion estimation error. In addition, a noise elimination scheme based on the motion reliability histogram and a clustering validity index for automatically identifying the number of objects in the scene have been applied. A cross projection method for effective object tracking and a dynamic memory to maintain temporal coherency have been introduced as well. A set of experiments has been conducted over several video sequences to evaluate the proposed algorithm, and the efficiency in terms of computational complexity, robustness from noise, and higher segmentation accuracy of the proposed algorithm have been proved.

Vehicle License Plate Detection Based on Mathematical Morphology and Symmetry (수리 형태론과 대칭성을 이용한 자동차 번호판 검출)

  • Kim, Jin-Heon;Moon, Je-Hyung;Choi, Tae-Young
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.2
    • /
    • pp.40-47
    • /
    • 2009
  • This paper proposes a method for vehicle license plate detection using mathematical morphology and symmetry. In general, the shape, color, size, and position of license plate are regulated by authorities for a better recognition by human. Among them, the relatively big intensity difference between the letter and the background region of the license plate and the symmetry about the plate are major discriminating factors for the detection. For the first, the opened image is subtracted from the closed image to intensify the region of plate using the rectangular structuring element which has the width of the distance between two characters. Second the subtraction image is average filtered with the mask size of the plate. Third, the column maximum graph of the average filtered image is acquired and the symmetry of the graph is measured at every position. Fourth, the peaks of the average filtered image are searched. Finally, the plate is assumed to be positioned around the one of local maxima nearest to the point of the highest symmetry. About 1,000 images taken by speed regulation camera are used for the experiment. The experimental result shows that the plate detection rate is about 93%.

SOM-Based $R^{*}-Tree$ for Similarity Retrieval (자기 조직화 맵 기반 유사 검색 시스템)

  • O, Chang-Yun;Im, Dong-Ju;O, Gun-Seok;Bae, Sang-Hyeon
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.507-512
    • /
    • 2001
  • Feature-based similarity has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects. the performance of conventional multidimensional data structures tends to deteriorate as the number of dimensions of feature vectors increase. The $R^{*}-Tree$ is the most successful variant of the R-Tree. In this paper, we propose a SOM-based $R^{*}-Tree$ as a new indexing method for high-dimensional feature vectors. The SOM-based $R^{*}-Tree$ combines SOM and $R^{*}-Tree$ to achieve search performance more scalable to high-dimensionalties. Self-Organizingf Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two-dimensional space. The map is called a topological feature map, and preserves the mutual relationships (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. We experimentally compare the retrieval time cost of a SOM-based $R^{*}-Tree$ with of an SOM and $R^{*}-Tree$ using color feature vectors extracted from 40,000 images. The results show that the SOM-based $R^{*}-Tree$ outperform both the SOM and $R^{*}-Tree$ due to reduction of the number of nodes to build $R^{*}-Tree$ and retrieval time cost.

  • PDF

An Evaluation on Use Suitability of Recreation Resource in Natural Parks (자연공원 휴양자원의 이용적합성 평가)

  • 배민기;신원섭
    • Korean Journal of Environment and Ecology
    • /
    • v.17 no.3
    • /
    • pp.285-294
    • /
    • 2003
  • The purpose of this paper is to provide useful knowledge for recreation management in natural park(NP) by evaluating use suitability of recreation resource. We had obtained data through a questionnaire, which surveyed 385 visitors at 6 of the 73 NP in Korea in 2001, based on stratified sampling method. We have analyzed the data using the multiple regression method. We found that 1) in bivariate analysis, the relationships between use suitability and all the recreation resources are fairly high and statistically significant. The higher the degree of recreation resources, the higher the degree of use suitability. 2) in multivariate analysis, topography, social resource(SR), cultural resource(CR), landscape, smell, color and sound(SCS) have been turned out to be statistically significant at one percent level. 3) the direction of relationship between topography, SR, CR, landscape, SCS and use suitability is same. 4) in relative contribution of the use suitability of recreation resource, level of topography has been turned out to have about 1.05, 1.56, 2.16 and 2.70 times more important than that of SCS, SR, landscape, topography, respectively This results will be used for a criterion for recreation resource evaluation and a settlement of management priority and increasing user's satisfaction.

A Polynomial Time Algorithm for Vertex Coloring Problem (정점 색칠 문제의 다항시간 알고리즘)

  • Lee, Sang-Un;Choi, Myeong-Bok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.7
    • /
    • pp.85-93
    • /
    • 2011
  • The Vertex Coloring Problem hasn't been solved in polynomial time, so this problem has been known as NP-complete. This paper suggests linear time algorithm for Vertex Coloring Problem (VCP). The proposed algorithm is based on assumption that we can't know a priori the minimum chromatic number ${\chi}(G)$=k for graph G=(V,E) This algorithm divides Vertices V of graph into two parts as independent sets $\overline{C}$ and cover set C, then assigns the color to $\overline{C}$. The element of independent sets $\overline{C}$ is a vertex ${\upsilon}$ that has minimum degree ${\delta}(G)$ and the elements of cover set C are the vertices ${\upsilon}$ that is adjacent to ${\upsilon}$. The reduced graph is divided into independent sets $\overline{C}$ and cover set C again until no edge is in a cover set C. As a result of experiments, this algorithm finds the ${\chi}(G)$=k perfectly for 26 Graphs that shows the number of selecting ${\upsilon}$ is less than the number of vertices n.

A Euclidean Reconstruction of 3D Face Data Using a One-Shot Absolutely Coded Pattern (단일 투사 절대 코드 패턴을 이용한 3차원 얼굴 데이터의 유클리디안 복원)

  • Kim, Byoung-Woo;Yu, Sun-Jin;Lee, Sang-Youn
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.6
    • /
    • pp.133-140
    • /
    • 2005
  • This paper presents a rapid face shape acquisition system. The system is composed of two cameras and one projector. The technique works by projecting a pattern on the object and capturing two images with two cameras. We use a 'one shot' system which provides 3D data acquired by single image per camera. The system is good for rapid data acquisition as our purpose. We use the 'absolutely coded pattern' using the hue and saturation of pattern lines. In this 'absolutely coded pattern' all patterns have absolute identification numbers. We solve the correspondence problem between the two images by using epipolar geometry and absolute identification numbers. In comparison to the 'relatively coded pattern' which uses relative identification numbers, the 'absolutely coded pattern' helps obtain rapid 3D data by one to one point matching on an epipolar line. Because we use two cameras, we obtain two images which have similar hue and saturation. This enables us to have the same absolute identification numbers in both images, and we can use the absolutely coded pattern for solving the correspondence problem. The proposed technique is applied to face data and the total time for shape acquisition is estimated.

Perceptual Quality Assessment on Display based on Analytic Network Process (Analytic Network Process 기반의 디스플레이 인지화질 평가)

  • Sung, Jung-Min;Choi, Bong-Seok;Choi, Bong-Yeol;Ha, Yeong-Ho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.7
    • /
    • pp.180-189
    • /
    • 2014
  • Display quality assessment has been a long standing issue due to the diversity of display devices and the rapid growth of display technology. The conventional display quality assessment methods are mostly those methods which evaluate qualities of a display by measuring physical quantities, but the results from the methods are not equal to the perceived results which are acquired with subjective experiments. Thus, we need to solve the above contrariety as well as establish the quantitative correlation between physical and perceived results. This paper proposes the systematic method of evaluating relative perceived qualities among various display devices and quantifies these relative perceived qualities. The proposed method is based on Analytic Network Process(ANP), which is one of the most popular decision making methods in the business administration field. We also adopted three evaluation criteria, which consist of color, shape and depth, in order to reflect the human visual system and chose eight sub-criteria related to display characteristics via question investigation. We carried out a subjective experiment and the proposed method which evaluated perceived qualities of two display devices(TFT-LCD, OLED) in order to prove the similarity between their results. As a result, it is proved that the order relationship between perceived qualities was the same as the order of results got through the subjective experiment.

Preparation of Minimally Processed Mulberry (Morus spp.) Juices (최소가공기술을 이용한 오디 과실주스의 제조)

  • Kim, In-Sook;Lee, Jun-Young;Rhee, Soon-Jae;Youn, Kwang-Sup;Choi, Sang-Won
    • Korean Journal of Food Science and Technology
    • /
    • v.36 no.2
    • /
    • pp.321-328
    • /
    • 2004
  • Raw mulberry (Morus spp.) juice was prepared by minimal processing using several filter aids, fining agents, and clarifying enzymes, followed by filtration, centrifugation, and membrane filtration. Control of browning in minimally processed mulberry juices by anti-browning agents, sodium hydrosulfite, L-ascorbic acid, citric acid, and NaCl, was investigated using quantitative measurements of color changes during storage. Clarification of mulberry juice was improved by adding several filter aids, fining agents, and enzymes, followed by filtration and centrifugation. Several fining agents, including chitosan, chitin, PVPP, gelatin, and casein at a concentration of 1%, and combination of ultrafiltration and centrifugation at 8,000 rpm were not suitable for clarification of juice owing to strong adsorption of anthocyanin pigment. Combination of $0.01\;{\mu}m$ membrane filtration and centrifugation at 8,000 rpm was effective for clarification of mulberry juice. Browning of minimally processed mulberry juice was inhibited significantly by adding 200 ppm sodium hydrosulfite, and 0.1% L-ascorbic acid (L-AsA) and 0,1% citric acid (CA) also showed considerable browning inhibition. Combination of L-AsA and CA, which was moderately effective for browning inhibition of juice, may be useful as a sulfite alternative for mulberry juice. Optimum sugar ($^{\circ}Brix$)/acid ratio and commercial sterilization of minimally processed mulberry juice were approximately 40 and 10 min at $85-90^{\circ}C$, respectively.

The comparative analysis of image fusion results by using KOMPSAT-2/3 images (아리랑 2호/3호 영상을 이용한 영상융합 비교 분석)

  • Oh, Kwan Young;Jung, Hyung Sup;Jeong, Nam Ki;Lee, Kwang Jae
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.2
    • /
    • pp.117-132
    • /
    • 2014
  • This paper had a purpose on analyzing result data from pan-sharpening, which have applied on the KOMPSAT-2 and -3 image. Particularly, the study focused on comparing each relative spectral response functions, which considers to cause color distortions of fused image. Two images from same time and location have been collected by KOMPSAT-2 and -3 to apply in the experiment. State-of-the-art algorithms of GIHS, GS1, GSA and GSA-CA were employed for analyzing the results in quantitatively and qualitatively. Following analysis of previous studies, GSA and GSA-CA methods resulted excellent quality in both of KOMPSAT-2/3 results, since they minimize spectral discordances between intensity and PAN image by the linear regression algorithm. It is notable that performances from KOMPSAT-2 and- 3 are not equal under same circumstances because of different spectral characteristics. In fact, KOMPSAT-2 is known as over-injection of low spatial resolution components of blue and green band, are greater than that of the PAN band. KOMPSAT-3, however, has been advanced in most of misperformances and weaknesses comparing from the KOMPSAT-2.