• Title/Summary/Keyword: Matrix Pattern Image

Search Result 64, Processing Time 0.024 seconds

Heterogeneous Face Recognition Using Texture feature descriptors (텍스처 기술자들을 이용한 이질적 얼굴 인식 시스템)

  • Bae, Han Byeol;Lee, Sangyoun
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.14 no.3
    • /
    • pp.208-214
    • /
    • 2021
  • Recently, much of the intelligent security scenario and criminal investigation demands for matching photo and non-photo. Existing face recognition system can not sufficiently guarantee these needs. In this paper, we propose an algorithm to improve the performance of heterogeneous face recognition systems by reducing the different modality between sketches and photos of the same person. The proposed algorithm extracts each image's texture features through texture descriptors (gray level co-occurrence matrix, multiscale local binary pattern), and based on this, generates a transformation matrix through eigenfeature regularization and extraction techniques. The score value calculated between the vectors generated in this way finally recognizes the identity of the sketch image through the score normalization methods.

Edge Detection Using the Co-occurrence Matrix (co-occurrence 행렬을 이용한 에지 검출)

  • 박덕준;남권문;박래홍
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.11
    • /
    • pp.111-119
    • /
    • 1992
  • In this paper, we propose an edge detection scheme for noisy images based on the co-occurrence matrix. In the proposed scheme based on the step edge model, the gray level information is simply converted into a bit-map, i.e., the uniform and boundary regions of an image are transformed into a binary pattern by using the local mean. In this binary bit-map pattern, 0 and 1 densely distributed near the boundary region while they are randomly distributed in the uniform region. To detect the boundary region, the co-occurrence matrix on the bit-map is introduced. The effectiveness of the proposed scheme is shown via a quantitative performance comparison to the conventional edge detection methods and the simulation results for noisy images are also presented.

  • PDF

A Dye Tracer Study of Infiltration Pattern in a Residual Soil Developed from Granite (화강암 기원 잔적토양에서 염료추적자의 침투 유형에 관한 연구)

  • 전철민;김재곤;이진수;김탁현
    • Economic and Environmental Geology
    • /
    • v.37 no.4
    • /
    • pp.383-389
    • /
    • 2004
  • Understanding flow pattern of water and solute in subsurface is essential for the reduction and prevention of contamination of soil and groundwater and for the investigation and remediation of contaminated site. The objective of this study is to examine the infiltration pattern in a soil developed from the Jurassic granite using (Brilliant Blue FCF $C_{37}H_{34}N_{2}Na_{2}O_{9}S_{3}$), the nonfluorescent and nontoxic food dye. All image processing was conducted using geographic image processing software, ER Mapper, Version 6.2. The dye coverage was determined by counting the stained pixels in the photographs (80${\times}$80cm, 80TEX>${\times}$5cm) for the vertical and horizontal view. A homogeneous matrix flow occurred in the A horizon with weak, medium granular structure and fingering at the interface of finer-textured A horizon and coarser-textured C horizon. Pegmatitic vein originated from the granite and plant root in C horizon induced preferential flow.

Texture Classification Algorithm for Patch-based Image Processing (패치 기반 영상처리를 위한 텍스쳐 분류 알고리즘)

  • Yu, Seung Wan;Song, Byung Cheol
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.11
    • /
    • pp.146-154
    • /
    • 2014
  • The local binary pattern (LBP) scheme that is one of the texture classification methods normally uses the distribution of flat, edge and corner patterns. However, it cannot examine the edge direction and the pixel difference because it is a sort of binary pattern caused by thresholding. Furthermore, since it cannot consider the pixel distribution, it shows lower performance as the image size becomes larger. In order to solve this problem, we propose a sub-classification method using the edge direction distribution and eigen-matrix. The proposed sub-classification is applied to the particular texture patches which cannot be classified by LBP. First, we quantize the edge direction and compute its distribution. Second, we calculate the distribution of the largest value among eigenvalues derived from structure matrix. Simulation results show that the proposed method provides a higher classification performance of about 8 % than the existing method.

A Study of Digital Image Analysis of Chromatin Texture for Discrimination of Thyroid Neoplastic Cells (갑상선 종양세포 식별을 위한 염색질 텍스춰의 디지탈 화상해석에 관한 연구)

  • Juhng, Sang-Woo;Lee, Jae-Hyuk;Bum, Eun-Kyung;Kim, Chang-Won
    • The Korean Journal of Cytopathology
    • /
    • v.7 no.1
    • /
    • pp.23-30
    • /
    • 1996
  • Chromatin texture, which partly reflects nuclear organization, is evolving as an important parameter indicating cell activation or transformation. In this study, chromatin pattern was evaluated by image analysis of the electron micrographs of follicular and papillary carcinoma cells of the thyroid gland and tested for discrimination of the two neoplasms. Digital grey images were converted from the electron micrographs, nuclear images, excluding nucleolus and intranuclear cytoplasmic inclusions, were obtained by segmentation; grey levels were standardized; and grey level histograms were generated. The histograms in follicular carcinoma showed Gaussian or near-Gaussian distribution and had a single peak, whereas those in papillary carcinoma had two peaks(bimodal), one at the black zone and the other at the white zone. In papillary carcinoma, the peak in the black zone represented an increased amount of heterochromatin particles and that at the white zone represented decreased electron density of euchromatin or nuclear matrix. These results indicate that the nuclei of follicular and papillary carcinoma cells differ in their chromatin pattern and the difference may be due to decondensed chromatin and/or matrix substances.

  • PDF

The Effect of the DIC Speckle Patterns for a Microcrack Measurement (미소균열 측정에 대한 DIC 스펙클 형상의 영향)

  • Lee, Jun Hyuk;Kwon, Oh Heon
    • Journal of the Korean Society of Safety
    • /
    • v.34 no.4
    • /
    • pp.15-21
    • /
    • 2019
  • In order to secure the safety of various machinery, it is very important to develop a technique for accurately and quickly measuring the cracks generated in the mechanical equipment and evaluating the mechanical characteristics. The evaluation of the mechanical properties is accompanied by an appropriate strain measurement according to the material and crack occurrence of the target structure. Especially, when micro cracks are generated, the evaluation method is very important. Digital image correlation is an optical full field displacement measuring method which is using currently with speckles in the interested area. However the evaluation method and conditions of image distributions have to be considered carefully to measure the crack occurrence because the images of the speckle patterns affect the quality of displacement results. In this study, the speckle pattern density is characterized to improve the accuracy of the measurement method. And also the micro crack initiation is detected by the measured displacement in the adopted speckle pattern distribution. It is shown that the proposed method is useful to determine the density pattern distribution for the accurate measurement and crack detection.

A New Information Data Hiding Scheme based on Pattern Information of Secret Data (비밀데이터의 패턴정보에 기반한 새로운 정보은닉 기법)

  • Kim, Ki-Jong;Shin, Sang-Ho;Yoo, Kee-Young
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.4
    • /
    • pp.526-539
    • /
    • 2012
  • This paper proposes a high capacity data hiding method using high frequence secret data indexing algorithm. Many novel data hiding methods based on LSB and PVD methods were presented to enlarge hiding capacity and provide an imperceptible quality. In this paper, first, calculating data iteration frequency of the secret message and make up the high frequency data index matrix (HFDT) using high frequence data's location information. Next, HFDT uses to that data hiding process on the cover image and recovering process on the stego image. The experimental results demonstrate the efficiency of the proposed high frequency secret data indexing method. For the data hiding method, experiments are conducted for four cases: 2 pattern secret data (2PD), 4 pattern secret data (4PD), 8 pattern secret data (8PD) and higher pattern secret data (HPD). When comparing the proposed method with other data hiding methods, for the HPD case, the results show that the proposed method has a good PSNR and more capacity, and for the other case, the results show that the proposed method has a higher PSNR and larger capacity.

Detection of Junctions via Accumulation of Connectivity-based Weight in Image Space : Applications for Locating 2D Barcode (영상 공간에서의 연결성 기반 가중치 누적을 통한 코너점 검출: 이차원 바코드 검출에의 응용)

  • Kim, Jeong-Tae;Song, Jin-Young
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.10
    • /
    • pp.1865-1867
    • /
    • 2007
  • We propse a novel corner detection algorithm for locating 2D Data Matrix barcode in an image. The proposed method accumulates weight for each cross point defined by every combination of edge points in the image, and detects the corner point of the barcode L-pattern by determining the location of the highest accumulated weight. By designing the weight considering the connectivity of two lines around the cross point, we were able to detect the corner of L-pattern even for the cases that the lines of L-patterns are short. In the experiments, the proposed method showed improved performance compared with the conventional Hough transform based method in terms of detectability and computation time.

A Comparison of Classification Techniques in Hyperspectral Image (하이퍼스펙트럴 영상의 분류 기법 비교)

  • 가칠오;김대성;변영기;김용일
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2004.11a
    • /
    • pp.251-256
    • /
    • 2004
  • The image classification is one of the most important studies in the remote sensing. In general, the MLC(Maximum Likelihood Classification) classification that in consideration of distribution of training information is the most effective way but it produces a bad result when we apply it to actual hyperspectral image with the same classification technique. The purpose of this research is to reveal that which one is the most effective and suitable way of the classification algorithms iii the hyperspectral image classification. To confirm this matter, we apply the MLC classification algorithm which has distribution information and SAM(Spectral Angle Mapper), SFF(Spectral Feature Fitting) algorithm which use average information of the training class to both multispectral image and hyperspectral image. I conclude this result through quantitative and visual analysis using confusion matrix could confirm that SAM and SFF algorithm using of spectral pattern in vector domain is more effective way in the hyperspectral image classification than MLC which considered distribution.

  • PDF

Implementation of the Squared-Error Pattern Clustering Processor Using the Residue Number System (剩餘數體系를 이용한 자승오차 패턴 클러스터링 프로세서의 실현)

  • Kim, Hyeong-Min;Cho, Won-Kyung
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.2
    • /
    • pp.87-93
    • /
    • 1989
  • Squared-error Pattern Clustering algorithm used in unsupervised pattern recognition and image processing application demands substantial processing time for operation of feature vector matrix. So, this paper propose the fast squared-error Pattern Clustering Processor using the Residue Number System which have been the nature of parallel processing and pipeline. The proposed Squared-error Pattern Clustering Processor illustrate satisfiable error rate for Cluster number which can be divide meaningful region and about 200 times faster than 80287 coprocessor from experiments result of image segmentation. In this result, it is useful to real-time processing application for large data.

  • PDF