• Title/Summary/Keyword: Mapping algorithm

Search Result 1,091, Processing Time 0.025 seconds

A Study on the New Gamut Mapping Method for Digital Color Proofing (디지털 컬러 교정인쇄를 위한 새로운 색역사상 방법에 관한 연구)

  • Song, Kyung-Chul;Kang, Sang-Hoon
    • Journal of the Korean Graphic Arts Communication Society
    • /
    • v.20 no.2
    • /
    • pp.119-129
    • /
    • 2002
  • On the process of cross-media color reproduction, a key feature is the use of gamut mapping techniques to adjust the different color gamuts between displays and printers. Even though a nunber of gamut mapping algorithms were published in the past, only limited colorimetric evaluation of them has been carried out to date. In this paper, the multi-anchor points clipping method(MAPC) was proposed as a new gamut mapping algorithm compensating the defects of the current algorithms such as nearest point clipping method(NPC), centroid clipping method(SLIN), straight clipping method(LLIN) and maximum chroma clipping method(CUSP).

  • PDF

Geometric analysis of mobile mapping images sequence

  • Kang, Zhizhong;Zhang, Zuxun
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.183-185
    • /
    • 2003
  • Spatially referenced mobile mapping (MM) images contain rich information of man-made objects , e.g. road centerlines, buildings, light poles, traffic signs ,billboards and line trees etc. Therefore, the applications in transportation, urban 3D reconstruction, utility management are implemented increasingly. It’s a fundamental issue lies in MM image process that how to orient this image in the object space including interior orientation of camera and the exterior orientation of image. In this paper, the algorithm of automatic acquirement of DC (Digital Camera) parameters based on MM images is illustrated. And then, the mapping between image space and object space for MM images is described.

  • PDF

KORAN DIGIT RECOGNITION IN NOISE ENVIRONMENT USING SPECTRAL MAPPING TRAINING

  • Ki Young Lee
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1994.06a
    • /
    • pp.1015-1020
    • /
    • 1994
  • This paper presents the Korean digit recognition method under noise environment using the spectral mapping training based on static supervised adaptation algorithm. In the presented recognition method, as a result of spectral mapping from one space of noisy speech spectrum to another space of speech spectrum without noise, spectral distortion of noisy speech is improved, and the recognition rate is higher than that of the conventional method using VQ and DTW without noise processing, and even when SNR level is 0 dB, the recognition rate is 10 times of that using the conventional method. It has been confirmed that the spectral mapping training has an ability to improve the recognition performance for speech in noise environment.

  • PDF

Gamut Mapping Based on Color Space Division for Enhancement of Lightness Contrast and Chrominance (휘도 대비와 채도 향상을 위한 색 공간 분할 색역 사상)

  • Cho, Yang-Ho;Kim, Yun-Tae;Lee, Cheol-Hee;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.5
    • /
    • pp.513-521
    • /
    • 2002
  • This paper proposes a gamut mapping algorithm based on color space division for cross media color reproduction. As each color device has a limited range of producible colors, reproduced colors on a destination device are different from those of the original device. In order to reduce the color difference, the proposed method divides the whole gamut into parabolic shapes based on intersecting lightness by the just noticeable difference (JND) and the original device gamut boundary. Dividing the gamut with parabolic shapes and piecewise mapping of each region not only considers gamut characteristics but also provides for mapping uniformity. Also the lightness variations are more sensitive to the human visual system and by using lightness JND it can restrict lightness mapping variations that are unperceivable to enhance lightness contrast and chrominance. As a result, the proposed algorithm is able to reproduce high quality images using low-cost color devices.

CHARMS: A Mapping Heuristic to Explore an Optimal Partitioning in HW/SW Co-Design (CHARMS: 하드웨어-소프트웨어 통합설계의 최적 분할 탐색을 위한 매핑 휴리스틱)

  • Adeluyi, Olufemi;Lee, Jeong-A
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.9
    • /
    • pp.1-8
    • /
    • 2010
  • The key challenge in HW/SW co-design is how to choose the appropriate HW/SW partitioning from the vast array of possible options in the mapping set. In this paper we present a unique and efficient approach for addressing this problem known as Customized Heuristic Algorithm for Reducing Mapping Sets(CHARMS). CHARMS uses sensitivity to individual task computational complexity as well the computed weighted values of system performance influencing metrics to streamline the mapping sets and extract the most optimal cases. Using H.263 encoder, we show that CHARMS sieves out 95.17% of the sub-optimal mapping sets, leaving the designer with 4.83% of the best cases to select from for run-time implementation.

Development of CPLD technology mapping control algorithm for Sequential Circuit under Time Constraint (시간제약 조건하에서 순차 회로를 위한 CPLD 기술 매핑 제어 알고리즘 개발)

  • Youn, Chung-Mo;Kim, Jae-Jin
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.36T no.4
    • /
    • pp.71-81
    • /
    • 1999
  • We propose a new CPLD(Complexity Programmable Logic Device) technology mapping algorithm improving run-time under time constraint. In our technology mapping algorithm, a given logic equation is constructed as the DAG(Directed Acyclic Graph) type, then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result, it makes delay time and the number of CLBs, run-time to be minimized. Also, after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within CLB. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB(Configurable Logic Block). In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces run-time and the number of CLBs much more than the TEMPLA.

  • PDF

MPSoC Design Space Exploration Based on Static Analysis of Process Network Model (프로세스 네트워크 모델의 정적 분석에 기반을 둔 다중 프로세서 시스템 온 칩 설계 공간 탐색)

  • Ahn, Yong-Jin;Choi, Ki-Young
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.10
    • /
    • pp.7-16
    • /
    • 2007
  • In this paper, we introduce a new design environment for efficient multiprocessor system-on-chip design space exploration. The design environment takes a process network model as input system specification. The process network model has been widely used for modeling signal processing applications because of its excellent modeling power. However, it has limitation in predictability, which could cause severe problem for real time systems. This paper proposes a new approach that enables static analysis of a process network model by converting it to a hierarchical synchronous dataflow model. For efficient design space exploration in the early design step, mapping application to target architectures has been a crucial part for finding better solution. In this paper, we propose an efficient mapping algorithm. Our mapping algorithm supports both single bus architecture and multiple bus architecture. In the experiments, we show that the automatic conversion approach of the process network model for static analysis is performed successfully for several signal processing applications, and show the effectiveness of our mapping algorithm by comparing it with previous approaches.

Moire' Free Pseudo-Random Method in Digital Halftoning (무아레 억제용 의사 랜덤 망점화)

  • 박희윤
    • Journal of the Korean Graphic Arts Communication Society
    • /
    • v.15 no.2
    • /
    • pp.91-106
    • /
    • 1997
  • The new algorithm for halftone generation for gravure engraving was developed. The basic concept of this algorithm is based on the mapping and equal density expansion methods that we are mapped out. The program was used by the Microsoft Visiul C++2.0 and could be loaded in IBM personal computer.

  • PDF

A Study on the Development of Pavement Crack Recognition Algorithm Using Artificial Neural Network (신경망 학습 기법을 이용한 도로면 크랙 인식 알고리즘 개발에 관한 연구)

  • Yoo Hyun-Seok;Lee Jeong-Ho;Kim Young-suk;Sung Nak-won
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • 2004.11a
    • /
    • pp.561-564
    • /
    • 2004
  • Crack sealing automation machines' have been continually developed since the early 1990's because of the effectiveness of crack sealing that would be able to improve safety, quality and productivity. It has been considered challenging problem to detect crack network in pavement which includes noise (oil marks, skid marks, previously sealed cracks and inherent noise). It is required to develop crack network mapping and modeling algorithm in order to accurately inject sealant along to the middle of cut crack network. The primary objective of this study is to propose a crack network mapping and modeling algorithm using neural network for improving the accuracy of the algorithm used in the APCS. It is anticipated that the effective use of the proposed algorithms would be able to reduce error rate in image processing for detecting, mapping and modeling crack network as well as improving quality and productivity compared to existing vision algorithms.

  • PDF

Development of Automatic Mapping Algorithm using CCTV Information based on Geo-spatial Information (공간정보기반 CCTV 제원정보 자동 매핑 알고리즘 개발)

  • Cho, Myeongheum;Park, Youngjin;Lee, Junwoo;Kim, KyeHyun
    • Journal of the Society of Disaster Information
    • /
    • v.12 no.2
    • /
    • pp.181-188
    • /
    • 2016
  • Database construction of basic elements for displaying CCTV informations(the location, direction, distance, maximum distance, Tele mode angle view, Wide mode angle view, etc.) is conducted by complete survey about CCTV information in model area. Automatic mapping algorithm is suggested to schematize and visualize it on the basic of the investigated CCTV informations. In the result, the CCTV locations in partial areas are duplicated on about 11 percents. Duplicated ones among twelve CCTVs are total five. If the redesign of CCTV location and direction by displaying the CCTV informations based on the suggested algorithm is performed, it can be used as scientific explanations.