• Title/Summary/Keyword: Grid pattern

Search Result 396, Processing Time 0.025 seconds

Fabrication of Ag Grid Patterned PET Substrates by Thermal Roll-Imprinting for Flexible Organic Solar Cells (가열롤 임프린팅 방법을 이용한 유연 유기태양전지용 Ag 그리드 패턴 PET 기판 제작)

  • Cho, Jung Min;Jo, Jeongdai;Kim, Taeil;Kim, Dong Soo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.31 no.11
    • /
    • pp.993-998
    • /
    • 2014
  • Silver (Ag) grid patterned PET substrates were manufactured by thermal roll-imprinting methods. We coated highly conductive layer (HCL) as a supply electrode on the Ag grid patterned PET in the three kinds of conditions. One was no-HCL without conductive PEDOT:PSS on the Ag grid patterned PET substrate, another was thin-HCL coated with ~50 nm thickness of conductive PEDOT:PSS on the Ag grid PET, and the other was thick-HCL coated with ~95 nm thickness of conductive PEDOT:PSS. These three HCLs in order showed 73.8%, 71.9%, and 64.7% each in transmittance, while indicating $3.84{\Omega}/{\Box}$, $3.29{\Omega}/{\Box}$, and $2.65{\Omega}/{\Box}$ each in sheet resistance. Fabrication of organic solar cells (OSCs) with HCL Ag grid patterned PET substrates showed high power conversion efficiency (PCE) on the thin-HCL device. The thick-HCL device decreased efficiency due to low open circuit voltage ($V_{OC}$). And the Ag grid pattern device without HCL had the lowest energy efficiency caused by quite low short current density ($J_{SC}$).

An Improved Face Recognition Method Using SIFT-Grid (SIFT-Grid를 사용한 향상된 얼굴 인식 방법)

  • Kim, Sung Hoon;Kim, Hyung Ho;Lee, Hyon Soo
    • Journal of Digital Convergence
    • /
    • v.11 no.2
    • /
    • pp.299-307
    • /
    • 2013
  • The aim of this paper is the improvement of identification performance and the reduction of computational quantities in the face recognition system based on SIFT-Grid. Firstly, we propose a composition method of integrated template by removing similar SIFT keypoints and blending different keypoints in variety training images of one face class. The integrated template is made up of computation of similarity matrix and threshold-based histogram from keypoints in a same sub-region which divided by applying SIFT-Grid of training images. Secondly, we propose a computation method of similarity for identify of test image from composed integrated templates efficiently. The computation of similarity is performed that a test image to compare one-on-one with the integrated template of each face class. Then, a similarity score and a threshold-voting score calculates according to each sub-region. In the experimental results of face recognition tasks, the proposed methods is founded to be more accurate than both two other methods based on SIFT-Grid, also the computational quantities are reduce.

K-means Clustering using a Grid-based Sampling

  • Park, Hee-Chang;Lee, Sun-Myung
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.249-258
    • /
    • 2003
  • K-means clustering has been widely used in many applications, such that pattern analysis or recognition, data analysis, image processing, market research and so on. It can identify dense and sparse regions among data attributes or object attributes. But k-means algorithm requires many hours to get k clusters that we want, because it is more primitive, explorative. In this paper we propose a new method of k-means clustering using the grid-based sample. It is more fast than any traditional clustering method and maintains its accuracy.

  • PDF

Numerical Simulation for Diffusion and Movement of Air Pollutants in Atmospheric Flow Coastal Urban Region (연안도시지역의 대기유동장에서 대기오염물질의 확산과 이동에 관한 수치모의)

  • 이화운;김유근
    • Journal of Environmental Science International
    • /
    • v.6 no.5
    • /
    • pp.437-449
    • /
    • 1997
  • To predict diffusion and movement of k pollutants In coastal urban region a numerical simulation shouts be consider atmospheric flow field with land-sea breeze, mountain-valley wand and urban effects. In this study we used Lagrangian [article dispersion method In the atmospheric flow field of Pusan coastal region to depict diffusion and movement of the Pollutants emoted from particular sources and employed two grid system, one for large scale calculating region with the coarse mesh grid (CMG) and the other for the small region with the One mesh 914 (FMG). It was found that the dispersion pattern of the pollutants followed local circulation system in coastal urban area and wale air pollutants exhausted from Sasang moved Into Baekyang and Jang moutain, air pollutants from Janglim moved into Hwameong-dong region.

  • PDF

Optimal unidirectional grid tied hybrid power system for peak demand management

  • Vineetha, C.P.;Babu, C.A.
    • Advances in Energy Research
    • /
    • v.4 no.1
    • /
    • pp.47-68
    • /
    • 2016
  • A well designed hybrid power system (HPS) can deliver electrical energy in a cost effective way. In this paper, model for HPS consisting of photo voltaic (PV) module and wind mill as renewable energy sources (RES) and solar lead acid battery as storage device connected to unidirectional grid is developed for peak demand reduction. Life time energy cost of the system is evaluated. One year hourly site condition and load pattern are taken into account for analysing the HPS. The optimal HPS is determined for least life time energy cost subject to the constraints like state of charge of the battery bank, dump load, renewable energy (RE) generation etc. Optimal solutions are also found out individually for PV module and wind mill. These three systems are compared to find out the most feasible combination. The results show that the HPS can deliver energy in an acceptable cost with reduced peak consumption from the grid. The proposed optimization algorithm is suitable for determining optimal HPS for desired location and load with least energy cost.

Clustering Algorithm by Grid-based Sampling

  • Park, Hee-Chang;Ryu, Jee-Hyun
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2003.05a
    • /
    • pp.97-108
    • /
    • 2003
  • Cluster analysis has been widely used in many applications, such that pattern analysis or recognition, data analysis, image processing, market research on on-line or off-line and so on. Clustering can identify dense and sparse regions among data attributes or object attributes. But it requires many hours to get clusters that we want, because of clustering is more primitive, explorative and we make many data an object of cluster analysis. In this paper we propose a new method of clustering using sample based on grid. It is more fast than any traditional clustering method and maintains its accuracy. It reduces running time by using grid-based sample. And other clustering applications can be more effective by using this methods with its original methods.

  • PDF

Clustering Algorithm using a Center Of Gravity for Grid-based Sample

  • Park, Hee-Chang;Ryu, Jee-Hyun
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2003.05a
    • /
    • pp.77-88
    • /
    • 2003
  • Cluster analysis has been widely used in many applications, such that data analysis, pattern recognition, image processing, etc. But clustering requires many hours to get clusters that we want, because it is more primitive, explorative and we make many data an object of cluster analysis. In this paper we propose a new clustering method, 'Clustering algorithm using a center of gravity for grid-based sample'. It is more fast than any traditional clustering method and maintains accuracy. It reduces running time by using grid-based sample and keeps accuracy by using representative point, a center of gravity.

  • PDF

K-means Clustering using a Center Of Gravity for grid-based sample

  • Park, Hee-Chang;Lee, Sun-Myung
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2004.04a
    • /
    • pp.51-60
    • /
    • 2004
  • K-means clustering is an iterative algorithm in which items are moved among sets of clusters until the desired set is reached. K-means clustering has been widely used in many applications, such as market research, pattern analysis or recognition, image processing, etc. It can identify dense and sparse regions among data attributes or object attributes. But k-means algorithm requires many hours to get k clusters that we want, because it is more primitive, explorative. In this paper we propose a new method of k-means clustering using a center of gravity for grid-based sample. It is more fast than any traditional clustering method and maintains its accuracy.

  • PDF

Clustering Algorithm Using a Center of Gravity for Grid-based Sample

  • Park, Hee-Chang;Ryu, Jee-Hyun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.16 no.2
    • /
    • pp.217-226
    • /
    • 2005
  • Cluster analysis has been widely used in many applications, such as data analysis, pattern recognition, image processing, etc. But clustering requires many hours to get clusters that we want, because it is more primitive, explorative and we make many data an object of cluster analysis. In this paper we propose a new clustering method, 'Clustering algorithm using a center of gravity for grid-based sample'. It reduces running time by using grid-based sample and keeps accuracy by using representative point, a center of gravity.

  • PDF

Infrastructure of Grid-based Distributed Remotely Sensed Images Processing Environment and its Parallel Intelligence Algorithms

  • ZHENG, Jiang;LUO, Jian-Cheng;Hu, Cheng;CHEN, Qiu-Xiao
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.1284-1286
    • /
    • 2003
  • There is a growing demand on remotely sensed and GIS data services in modern society. However, conventional WEB applications based on client/server pattern can not meet the criteria in the future . Grid computing provides a promising resolution for establishing spatial information system toward future applications. Here, a new architecture of the distributed environment for remotely sensed data processing based on the middleware technology was proposed. In addition, in order to utilize the new environment, a problem had to be algorithmically expressed as comprising a set of concurrently executing sub-problems or tasks. Experiment of the algorithm was implemented, and the results show that the new environmental can achieve high speedups for applications compared with conventional implementation.

  • PDF