• Title/Summary/Keyword: Matrix image

Search Result 1,012, Processing Time 0.023 seconds

Registration of the 3D Range Data Using the Curvature Value (곡률 정보를 이용한 3차원 거리 데이터 정합)

  • Kim, Sang-Hoon;Kim, Tae-Eun
    • Convergence Security Journal
    • /
    • v.8 no.4
    • /
    • pp.161-166
    • /
    • 2008
  • This paper proposes a new approach to align 3D data sets by using curvatures of feature surface. We use the Gaussian curvatures and the covariance matrix which imply the physical characteristics of the model to achieve registration of unaligned 3D data sets. First, the physical characteristics of local area are obtained by the Gaussian curvature. And the camera position of 3D range finder system is calculated from by using the projection matrix between 3D data set and 2D image. Then, the physical characteristics of whole area are obtained by the covariance matrix of the model. The corresponding points can be found in the overlapping region with the cross-projection method and it concentrates by removed points of self-occlusion. By the repeatedly the process discussed above, we finally find corrected points of overlapping region and get the optimized registration result.

  • PDF

Illumination Estimation Based on Nonnegative Matrix Factorization with Dominant Chromaticity Analysis (주색도 분석을 적용한 비음수 행렬 분해 기반의 광원 추정)

  • Lee, Ji-Heon;Kim, Dae-Chul;Ha, Yeong-Ho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.8
    • /
    • pp.89-96
    • /
    • 2015
  • Human visual system has chromatic adaptation to determine the color of an object regardless of illumination, whereas digital camera records illumination and reflectance together, giving the color appearance of the scene varied under different illumination. NMFsc(nonnegative matrix factorization with sparseness constraint) was recently introduced to estimate original object color by using sparseness constraint. In NMFsc, low sparseness constraint is used to estimate illumination and high sparseness constraint is used to estimate reflectance. However, NMFsc has an illumination estimation error for images with large uniform area, which is considered as dominant chromaticity. To overcome the defects of NMFsc, illumination estimation via nonnegative matrix factorization with dominant chromaticity image is proposed. First, image is converted to chromaticity color space and analyzed by chromaticity histogram. Chromaticity histogram segments the original image into similar chromaticity images. A segmented region with the lowest standard deviation is determined as dominant chromaticity region. Next, dominant chromaticity is removed in the original image. Then, illumination estimation using nonnegative matrix factorization is performed on the image without dominant chromaticity. To evaluate the proposed method, experimental results are analyzed by average angular error in the real world dataset and it has shown that the proposed method with 5.5 average angular error achieve better illuminant estimation over the previous method with 5.7 average angular error.

Algorithm of Converged Corner Detection-based Segmentation in the Data Matrix Barcode (코너 검출 기반의 융합형 Data Matrix 바코드 분할 알고리즘)

  • Han, Hee-June;Lee, Jong-Yun
    • Journal of the Korea Convergence Society
    • /
    • v.6 no.1
    • /
    • pp.7-16
    • /
    • 2015
  • A segmentation process extracts an interesting area of barcode in an image and gives a crucial impart on the performance of barcode verifier. Previous segmentation methods occurs some issues as follows. First, it is very hard to determine a threshold of length in Hough Line transform because it is sensitive. Second, Morphology transform delays the process when you conduct dilation and erosion operations during the image extraction. Therefore, we proposes a novel Converged Harris Corner detection-based segmentation method to detect an interesting area of barcode in Data Matrix. In order to evaluate the performance of proposed method, we conduct experiments by a dataset of barcode in accordance with size and location in an image. In result, our method solves the problems of delay and surrounding environments, threshold setting, and extracts the barcode area 100% from test images.

The multidimensional subsampling of reverse jacket matrix of wighted hadamard transform for IMT2000 (IMT2000을 위한 하중 hadamard 변환의 다차원 reverse jacket 매트릭스의 서브샘플링)

  • 박주용;이문호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.11
    • /
    • pp.2512-2520
    • /
    • 1997
  • The classes of Reverse Jacket matrix [RJ]$_{N}$ and the corresponding Restclass Reverse Jacket matrix ([RRJ]$_{N}$) are defined;the main property of [RJ]$_{N}$ is that the inverse matrices of them can be obtained very easily and have a special structure. [RJ]$_{N}$ is derived from the weighted hadamard Transform corresponding to hadamard matrix [H]$_{N}$ and a basic symmertric matrix D. the classes of [RJ]$_{2}$ can be used as a generalize Quincunx subsampling matrix and serveral polygonal subsampling matrices. In this paper, we will present in particular the systematical block-wise extending-method for {RJ]$_{N}$. We have deduced a new orthorgonal matrix $M_{1}$.mem.[RRJ]$_{N}$ from a nonorthogonal matrix $M_{O}$.mem.[RJ]$_{N}$. These matrices can be used to develop efficient algorithms in IMT2000 signal processing, multidimensional subsampling, spectrum analyzers, and signal screamblers, as well as in speech and image signal processing.gnal processing.g.

  • PDF

SMOOTH SINGULAR VALUE THRESHOLDING ALGORITHM FOR LOW-RANK MATRIX COMPLETION PROBLEM

  • Geunseop Lee
    • Journal of the Korean Mathematical Society
    • /
    • v.61 no.3
    • /
    • pp.427-444
    • /
    • 2024
  • The matrix completion problem is to predict missing entries of a data matrix using the low-rank approximation of the observed entries. Typical approaches to matrix completion problem often rely on thresholding the singular values of the data matrix. However, these approaches have some limitations. In particular, a discontinuity is present near the thresholding value, and the thresholding value must be manually selected. To overcome these difficulties, we propose a shrinkage and thresholding function that smoothly thresholds the singular values to obtain more accurate and robust estimation of the data matrix. Furthermore, the proposed function is differentiable so that the thresholding values can be adaptively calculated during the iterations using Stein unbiased risk estimate. The experimental results demonstrate that the proposed algorithm yields a more accurate estimation with a faster execution than other matrix completion algorithms in image inpainting problems.

Analysis of Motional Characteristics of Sperm Using Image Processing (영상처리를 이용한 정자의 운동 특성 분석)

  • Shim, Hoon-Sup;Yi, Won-Jin;Park, Kwang-Suk;Paick, Jae-Seung
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.11
    • /
    • pp.109-115
    • /
    • 1994
  • In this paper, we developed an analyzing method of the motional characteristics of sperm, using image processing technology. Without the aid of a dedicated image-processor, this processing of a personal computer(PC) and a simple image processing board. The image processing board is used for acquiring images from a microscopic imaging source. The PC processes the images from the board and computes the parameters of motional characteristics of sperms. The algorithm of the site detection of sperms and the 'Match Matrix Method' is noteworthy. After comparing the results of our method with those of the manual method, and with those of the method using a dedicated image-processor, we concluded that our method is useful and reliable.

  • PDF

EFFICIENT IHS BASED IMAGE FUSION WITH 'COMPENSATIVE' MATRIX CONSTRUCTED BY SIMULATING THE SCALING PROCESS

  • Nguyen, TienCuong;Kim, Dae-Sung;Kim, Yong-Il
    • Proceedings of the KSRS Conference
    • /
    • v.2
    • /
    • pp.639-642
    • /
    • 2006
  • The intensity-hue-saturation (IHS) technique has become a standard procedure in image analysis. It enhances the colour of highly correlated data. Unfortunately, IHS technique is sensitive to the properties of the analyzed area and usually faces colour distortion problems in the fused process. This paper explores the relationship of colour between before and after the fused process and the change in colour space of images. Subsequently, the fused colours are transformed back into the 'simulative' true colours by the following steps: (1) For each pixel of fused image that match with original pixel (of the coarse spectral resolution image) is transformed back to the true colour of original pixel. (2) The value for interpolating pixels is compensated to preserve the DN ratio between the original pixel and it's vicinity. The 'compensative matrix' is constructed by the DN of fused images and simulation of scaling process. An illustrative example of a Landsat and SPOT fused image also demonstrates the simulative true colour fusion methods.

  • PDF

Image Segmentation using Multi-scale Normalized Cut (다중스케일 노멀라이즈 컷을 이용한 영상분할)

  • Lee, Jae-Hyun;Lee, Ji Eun;Park, Rae-Hong
    • Journal of Broadcast Engineering
    • /
    • v.18 no.4
    • /
    • pp.609-618
    • /
    • 2013
  • This paper proposes a fast image segmentation method that gives high segmentation performance as graph-cut based methods. Graph-cut based image segmentation methods show high segmentation performance, however, the computational complexity is high to solve a computationally-intensive eigen-system. This is because solving eigen-system depends on the size of square matrix obtained from similarities between all pairs of pixels in the input image. Therefore, the proposed method uses the small-size square matrix, which is obtained from all the similarities among regions obtained by segmenting locally an image into several regions by graph-based method. Experimental results show that the proposed multi-scale image segmentation method using the algebraic multi-grid shows higher performance than existing methods.

Image-Based Computational Modeling of Porous Matrix Composites and Calculation of Poroelastic Coefficients (다공성 기지를 갖는 복합재의 이미지 기반 전산 모형화 및 기공 탄성 계수 산출)

  • Kim, Sung Jun;Shin, Eui Sup
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.38 no.5
    • /
    • pp.527-534
    • /
    • 2014
  • Poroelastic analyses of fiber-reinforced composites were performed using image-based computational models. The section image of a porous matrix was analyzed in order to investigate the porosity, number of pores, and distribution of pores. The resolution, location, and size of the section image were considered to quantify the effective elastic modulus, poroelastic parameter, and strain energy density using the image-based computational models. The poroelastic parameter was calculated from the effective elastic modulus and pore pressure-induced strain. In addition, the results of the poroelastic analyses were verified through representative volume elements by simplifying various pore configurations and arrangements.

Region of Interest Heterogeneity Assessment for Image using Texture Analysis

  • Park, Yong Sung;Kang, Joo Hyun;Lim, Sang Moo;Woo, Sang-Keun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.11
    • /
    • pp.17-21
    • /
    • 2016
  • Heterogeneity assessment of tumor in oncology is important for diagnosis of cancer and therapy. The aim of this study was performed assess heterogeneity tumor region in PET image using texture analysis. For assessment of heterogeneity tumor in PET image, we inserted sphere phantom in torso phantom. Cu-64 labeled radioisotope was administrated by 156.84 MBq in torso phantom. PET/CT image was acquired by PET/CT scanner (Discovery 710, GE Healthcare, Milwaukee, WI). The texture analysis of PET images was calculated using occurrence probability of gray level co-occurrence matrix. Energy and entropy is one of results of texture analysis. We performed the texture analysis in tumor, liver, and background. Assessment textural features of region-of-interest (ROI) in torso phantom used in-house software. We calculated the textural features of torso phantom in PET image using texture analysis. Calculated entropy in tumor, liver, and background were 5.322, 7.639, and 7.818. The further study will perform assessment of heterogeneity using clinical tumor PET image.