• Title/Summary/Keyword: Local mapping

Search Result 370, Processing Time 0.03 seconds

Non-Local Means-based Gradual Super-Resolution via Linear Mappings (비국소적 평균법 기반 점진적 선형 매핑 초해상화 기법)

  • Choi, Jae-Seok;Kim, Munchurl
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2015.07a
    • /
    • pp.75-77
    • /
    • 2015
  • 디스플레이 해상도가 지속적으로 고해상화가 되면서, 기존 저해상도 영상을 고해상도 디스플레이 크기에 맞춰 해상도를 키우는 기법인 초해상화(super-resolution, SR) 기법에 많은 관심이 쏟아지고 있으며 이에 대한 많은 초해상화 논문들이 게재되었다. 이 중 현재 최상 품질의 고해상도 영상을 복원하는 한 초해상화 기법은, 입력 받은 저해상도 영상을 자가 예제(self-examples)로 사용하여 선형 매핑(linear mapping)을 통해 점진적으로 여러 레벨(level)를 거쳐 조금씩 키우는 방법이다. 이때 각 레벨마다 기존 저해상도 영상 크기로 반복적으로 줄여 오차를 줄이는 역투영법(back-projection)을 사용하는데, 이 방법은 처리된 영상에 시각적 품질을 낮추는 링 아티팩트(ringing artifacts)를 생산하며, 이는 매 레벨마다 계속 누적이 되어 고해상도 결과 이미지 품질에 악영향을 미치는 단점이 있다. 이를 보완하기 위해, 본 논문에서는 저해상도 정지 영상을 고해상도 정지 영상으로 점진적으로 키울 때 일반적인 역투영법 대신 비국소적 평균법(non-local means, NLM) 기반 역투영법을 사용하는 초해상화 기법을 제안한다. 제안하는 기법은 매 레벨마다 생기는 링 아티팩트를 효과적으로 제거하여 높은 시각적 품질의 고해상도 영상을 복원할 수 있게 한다. 실험을 통해 제안된 초해상화 기법을 사용 시 기존 초해상화 기법보다 향상된 고품질 고해상도 영상 복원이 가능한 것을 확인하였다.

  • PDF

Distribution Mapping and Local Analysis of Ciliary Beat Frequencies (세포의 섬모 운동 변화 분석을 위한 CBF 분포도 구성 및 국소적 분포 분석에 관한 연구)

  • Yi, W.J.;Park, K.S.;Min, Y.G.;Sung, M.W.;Lee, K.S.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1997 no.11
    • /
    • pp.154-160
    • /
    • 1997
  • By their rapid and periodic actions, the cilia of the human respiratory tract play an important role in clearing inhaled noxious particles. Based on the automated image-processing technique, we studied ciliary beat frequency (CBF) objectively and quantitatively. Microscopic ciliary images were transformed into digitized gray ones through an image-grabber, and from these we extracted signals or CBF. By means of a FFT, maximum peak frequencies were detected as CBFs in each partitioned block or the entire digitized field. With these CBFs, we composed distribution maps visualiy showing the spatial distribution of CBFs. Through distribution maps of CBF, the whole aspects of CBF changes or cells and the difference of CBF of neighboring cells can be easily measured and detected. Histogram statistics calculated from the user-defined polygonal window can show the local dominant frequency presumed to be the CBF of a cell or a crust the region includes.

  • PDF

Gradation Image Processing for Text Recognition in Road Signs Using Image Division and Merging

  • Chong, Kyusoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.13 no.2
    • /
    • pp.27-33
    • /
    • 2014
  • This paper proposes a gradation image processing method for the development of a Road Sign Recognition Platform (RReP), which aims to facilitate the rapid and accurate management and surveying of approximately 160,000 road signs installed along the highways, national roadways, and local roads in the cities, districts (gun), and provinces (do) of Korea. RReP is based on GPS(Global Positioning System), IMU(Inertial Measurement Unit), INS(Inertial Navigation System), DMI(Distance Measurement Instrument), and lasers, and uses an imagery information collection/classification module to allow the automatic recognition of signs, the collection of shapes, pole locations, and sign-type data, and the creation of road sign registers, by extracting basic data related to the shape and sign content, and automated database design. Image division and merging, which were applied in this study, produce superior results compared with local binarization method in terms of speed. At the results, larger texts area were found in images, the accuracy of text recognition was improved when images had been gradated. Multi-threshold values of natural scene images are used to improve the extraction rate of texts and figures based on pattern recognition.

An Edge Detector by Using Perfect Sharpening of Ramps (램프의 완전 선명화를 이용한 에지 검출기)

  • Lee, Jong-Gu;Yoo, Cheol-Jung;Chang, Ok-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.11
    • /
    • pp.961-970
    • /
    • 2007
  • Since the usual conventional edge detectors employ the local differential derivatives, the detected edges are not uniform in their widths or some edges are missed out of the detection on magnified images. We employ a mapping from the exactly monotonic intensity distributions of ramp edges to the simple step functions of intensity, which is referred to as perfect sharpening map of ramp edges. This map is based on the non-local feature of intensity distribution and used to introduce a modified differentiation, in terms of which we can construct an efficient edge detector adaptive to the variation of edge width. By adopting the operator MADD in this paper, we developed an edge detector that works stably against the magnification of image or the variation of edge width. It is shown by comparing to the conventional algorithms that the proposed one is very excellent.

A Locally Adaptive HDR Algorithm Using Integral Image and MSRCR Method (적분 영상과 MSRCR 기법을 이용한 국부적응적 HDR 알고리즘)

  • Han, Kyu-Phil
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.9
    • /
    • pp.1273-1283
    • /
    • 2022
  • This paper presents a locally adaptive HDR algorithm using the integral image and MSRCR for LDR images with inadequate exposure. There are two categories in controlling the dynamic range, which are global and local tone mappings. Since the global ones are relatively simple but have some limitations at considering regional characteristics, the local ones are often utilized and MSRCR is a representative method. MSRCR gives moderate results, but it requires lots of computations for multi-scale surround Gaussian functions and produces the Halo effect around the edges. Therefore, in order to resolve these main problems, the proposed algorithm remarkably reduces the computation of the surrounds due to the use of the integral image. And a set of variable-sized windows is adopted to decrease the Halo effect, according to the type of pixel's region. In addition, an offset controlling function is presented, which is mainly affected to the subjective image quality and based on the global input and the desired output means. As the results, the proposed algorithm no more use Gaussian functions and can reduce the computation amount and the Halo effect.

Detail Enhancement by Spatial Gamut Mapping Based on Local Contrast Compensation (지역적 대비를 보상하는 색역 사상을 통한 상세정보 향상)

  • Song, In-Yong;Ha, Ho-Gun;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.49 no.4
    • /
    • pp.58-66
    • /
    • 2012
  • Currently many devices reproduce electronic images in the various ways. However, the color that is reproduced in any device is different from the original color due to the differences in the gamut between devices. A recent trend in gamut mapping algorithms is the use of spatial information to compute the color transformation of pixels from the input to the output gamut. However, these techniques share the problem of preserving details, and avoiding halos, and hue shift. In this paper, spatial gamut mapping for preserving the details of the input image is proposed. Our approach improves visibility of detail that is not effectively represented with conventional spatial gamut mapping. In proposed method, initially, we gamut map the input image using gamut clipping and obtain a detail layer for both the input and the gamut mapped images. Next, we calculate the difference between the two detail layers, obtaining the details of the out of gamut region. Finally, we add the details of out of gamut region to the gamut mapped image. Since the resulting image has out of gamut colors, we obtain resulting image of proposed method by using a gamut clipping method. Consequently, the printed output image was more consistent with the corresponding monitor image.

DNA Watermarking Method based on Random Codon Circular Code (랜덤 코돈 원형 부호 기반의 DNA 워터마킹)

  • Lee, Suk-Hwan;Kwon, Seong-Geun;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.3
    • /
    • pp.318-329
    • /
    • 2013
  • This paper proposes a DNA watermarking method for the privacy protection and the prevention of illegal copy. The proposed method allocates codons to random circular angles by using random mapping table and selects triplet codons for embedding target with the help of the Lipschitz regularity value of local modulus maxima of codon circular angles. Then the watermark is embedded into circular angles of triplet codons without changing the codes of amino acids in a DNA. The length and location of target triplet codons depend on the random mapping table for 64 codons that includes start and stop codons. This table is used as the watermark key and can be applied on any codon sequence regardless of the length of sequence. If this table is unknown, it is very difficult to detect the length and location of them for extracting the watermark. We evaluated our method and DNA-crypt watermarking of Heider method on the condition of similar capacity. From evaluation results, we verified that our method has lower base changing rate than DNA-crypt and has lower bit error rate on point mutation and insertions/deletions than DNA-crypt. Furthermore, we verified that the entropy of random mapping table and the locaton of triplet codons is high, meaning that the watermark security has high level.

A Spatial Statistical Approach to Residential Differentiation (II): Exploratory Spatial Data Analysis Using a Local Spatial Separation Measure (거주지 분화에 대한 공간통계학적 접근 (II): 국지적 공간 분리성 측도를 이용한 탐색적 공간데이터 분석)

  • Lee, Sang-Il
    • Journal of the Korean Geographical Society
    • /
    • v.43 no.1
    • /
    • pp.134-153
    • /
    • 2008
  • The main purpose of the research is to illustrate the value of the spatial statistical approach to residential differentiation by providing a framework for exploratory spatial data analysis (ESDA) using a local spatial separation measure. ESDA aims, by utilizing a variety of statistical and cartographic visualization techniques, at seeking to detect patterns, to formulate hypotheses, and to assess statistical models for spatial data. The research is driven by a realization that ESDA based on local statistics has a great potential for substantive research. The main results are as follows. First, a local spatial separation measure is correspondingly derived from its global counterpart. Second, a set of significance testing methods based on both total and conditional randomization assumptions is provided for the local measure. Third, two mapping techniques, a 'spatial separation scatterplot map' and a 'spatial separation anomaly map', are devised for ESDA utilizing the local measure and the related significance tests. Fourth, a case study of residential differentiation between the highly educated and the least educated in major Korean metropolitan cities shows that the proposed ESDA techniques are beneficial in identifying bivariate spatial clusters and spatial outliers.

A Mesh Segmentation Reflecting Global and Local Geometric Characteristics (전역 및 국부 기하 특성을 반영한 메쉬 분할)

  • Im, Jeong-Hun;Park, Young-Jin;Seong, Dong-Ook;Ha, Jong-Sung;Yoo, Kwan-Hee
    • The KIPS Transactions:PartA
    • /
    • v.14A no.7
    • /
    • pp.435-442
    • /
    • 2007
  • This paper is concerned with the mesh segmentation problem that can be applied to diverse applications such as texture mapping, simplification, morphing, compression, and shape matching for 3D mesh models. The mesh segmentation is the process of dividing a given mesh into the disjoint set of sub-meshes. We propose a method for segmenting meshes by simultaneously reflecting global and local geometric characteristics of the meshes. First, we extract sharp vertices over mesh vertices by interpreting the curvatures and convexity of a given mesh, which are respectively contained in the local and global geometric characteristics of the mesh. Next, we partition the sharp vertices into the $\kappa$ number of clusters by adopting the $\kappa$-means clustering method [29] based on the Euclidean distances between all pairs of the sharp vertices. Other vertices excluding the sharp vertices are merged into the nearest clusters by Euclidean distances. Also we implement the proposed method and visualize its experimental results on several 3D mesh models.

No-reference Image Blur Assessment Based on Multi-scale Spatial Local Features

  • Sun, Chenchen;Cui, Ziguan;Gan, Zongliang;Liu, Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.10
    • /
    • pp.4060-4079
    • /
    • 2020
  • Blur is an important type of image distortion. How to evaluate the quality of blurred image accurately and efficiently is a research hotspot in the field of image processing in recent years. Inspired by the multi-scale perceptual characteristics of the human visual system (HVS), this paper presents a no-reference image blur/sharpness assessment method based on multi-scale local features in the spatial domain. First, considering various content has different sensitivity to blur distortion, the image is divided into smooth, edge, and texture regions in blocks. Then, the Gaussian scale space of the image is constructed, and the categorized contrast features between the original image and the Gaussian scale space images are calculated to express the blur degree of different image contents. To simulate the impact of viewing distance on blur distortion, the distribution characteristics of local maximum gradient of multi-resolution images were also calculated in the spatial domain. Finally, the image blur assessment model is obtained by fusing all features and learning the mapping from features to quality scores by support vector regression (SVR). Performance of the proposed method is evaluated on four synthetically blurred databases and one real blurred database. The experimental results demonstrate that our method can produce quality scores more consistent with subjective evaluations than other methods, especially for real burred images.