• Title/Summary/Keyword: pixel matrix

Search Result 194, Processing Time 0.033 seconds

A Study on the Cut Detection System of Video Data using MSE (MSE를 이용한 동영상데이터의 컷 검출시스템에 관한 연구)

  • Kim Dan-Hwan;Joung Ki-Bong;Oh Moo-Song
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.7
    • /
    • pp.1399-1404
    • /
    • 2004
  • The development of computer technology and the advancement of the technology of information and communications spread the technology of multimedia and increased the use of multimedia data with large capacity. Users can grasp the overall video data and they are able to play wanted video back. To grasp the overall video data it is necessary to offer the list of summarized video data information. In order to search video efficiently an index process of video data is essential and it is also indispensable skill. Therefore, this thesis suggested the effective method about the cut detection of frames which will become a basis of an index based on contents of video image data. This suggested method was detected as the unchanging pixel rotor intelligence value, classified into diagonal direction. Pixel value of color detected in each frame of video data is stored as A(i, i) matrix - i is the number of frames, i is an image height of frame. By using the stored pixel value as the method of UE(Mean Square Error) I calculated a specified value difference between frames and detected cut quickly and exactly in case it is bigger than threshold value set in advance. To carry out an experiment on the cut detection of lames comprehensively, 1 experimented on many kinds of video, analyzing and comparing efficiency of the cut detection system.

Evaluation of Dynamic X-ray Imaging Sensor and Detector Composing of Multiple In-Ga-Zn-O Thin Film Transistors in a Pixel (픽셀내 다수의 산화물 박막트랜지스터로 구성된 동영상 엑스레이 영상센서와 디텍터에 대한 평가)

  • Seung Ik Jun;Bong Goo Lee
    • Journal of the Korean Society of Radiology
    • /
    • v.17 no.3
    • /
    • pp.359-365
    • /
    • 2023
  • In order to satisfy the requirements of dynamic X-ray imaging with high frame rate and low image lag, minimizing parasitic capacitance in photodiode and overlapped electrodes in pixels is critically required. This study presents duoPIXTM dynamic X-ray imaging sensor composing of readout thin film transistor, reset thin film transistor and photodiode in a pixel. Furthermore, dynamic X-ray detector using duoPIXTM imaging sensor was manufactured and evaluated its X-ray imaging performances such as frame rate, sensitivity, noise, MTF and image lag. duoPIXTM dynamic X-ray detector has 150 × 150 mm2 imaging area, 73 um pixel pitch, 2048 × 2048 matrix resolution(4.2M pixels) and maximum 50 frames per second. By means of comparison with conventional dynamic X-ray detector, duoPIXTM dynamic X-ray detector showed overall better performances than conventional dynamic X-ray detector as shown in the previous study.

The Influence of Quantization Table in view of Information Hiding Techniques Modifying Coefficients in Frequency Domain (주파수 영역 계수 변경을 이용한 정보은닉기술에서의 양자화 테이블의 영향력)

  • Choi, Yong-Soo;Kim, Hyoung-Joong;Park, Chun-Myoung
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.1
    • /
    • pp.56-63
    • /
    • 2009
  • Nowdays, Most of Internet Contents delivered as a compressed file. It gives many advantages like deduction of communication bandwidth and transmission time etc. In case of JPEG Compression, Quantization is the most important procedure which accomplish the compression. In general signal processing, Quantization is the process which converts continuous analog signal to discrete digital signal. As you known already, Quantization over JPEG compression is to reduce magnitude of pixel value in spatial domain or coefficient in frequency domain. A lot of Data Hiding algorithms also developed to applicable for those compressed files. In this paper, we are going to unveil the influence of quantization table which used in the process of JPEG compression. Even thought most of algorithm modify frequency coefficients with considering image quality, they are ignoring the influence of quantization factor corresponding with the modified frequency coefficient. If existing algorithm adapt this result, they can easily evaluate their performances.

Calculation of Dose Distribution for SBRT Patient Using Geant4 Simulation Code (Geant4 전산모사 코드를 이용한 SBRT 환자의 선량분포 계산)

  • Kang, Jeongku;Lee, Jeongok;Lee, Dong Joon
    • Progress in Medical Physics
    • /
    • v.26 no.1
    • /
    • pp.36-41
    • /
    • 2015
  • The Monte Carlo based dose calculation program for stereotactic body radiotherapy was developed in this study. The Geant4 toolkit widely used in the radiotherapy was used for this study. The photon energy spectrum of the medical linac studied in the previous research was applied for the patient dose calculations. The geometry of the radiation fields defined by multi-leaf collimators were taken into account in the PrimaryGeneratorAction class of the Geant4 code. The total of 8 fields were demonstrated in the patient dose calculations, where rotation matrix as a function of gantry angle was used for the determination of the source positions. The DicomHandler class converted the binary file format of the DICOM data containing the matrix number, pixel size, endian type, HU number, bit size, padding value and high bits order to the ASCII file format. The patient phantom was constructed using the converted ASCII file. The EGSnrc code was used to compare the calculation efficiency of the material data.

Data Hiding Using Sequential Hamming + k with m Overlapped Pixels

  • Kim, Cheonshik;Shin, Dongkyoo;Yang, Ching-Nung;Chen, Yi-Cheng;Wu, Song-Yu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.6159-6174
    • /
    • 2019
  • Recently, Kim et al. introduced the Hamming + k with m overlapped pixels data hiding (Hk_mDH) based on matrix encoding. The embedding rate (ER) of this method is 0.54, which is better than Hamming code HC (n, n - k) and HC (n, n - k) +1 DH (H1DH), but not enough. Hamming code data hiding (HDH) is using a covering function COV(1, n = 2k -1, k) and H1DH has a better embedding efficiency, when compared with HDH. The demerit of this method is that they do not exploit their space of pixels enough to increase ER. In this paper, we increase ER using sequential Hk_mDH (SHk_mDH ) through fully exploiting every pixel in a cover image. In SHk_mDH, a collision maybe happens when the position of two pixels within overlapped two blocks is the same. To solve the collision problem, in this paper, we have devised that the number of modification does not exceed 2 bits even if a collision occurs by using OPAP and LSB. Theoretical estimations of the average mean square error (AMSE) for these schemes demonstrate the advantage of our SHk_mDH scheme. Experimental results show that the proposed method is superior to previous schemes.

Change Area Detection using Color and Edge Gradient Covariance Features (색상과 에지 공분산 특징을 이용한 변화영역 검출)

  • Kim, Dong-Keun;Hwang, Chi-Jung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.1
    • /
    • pp.717-724
    • /
    • 2016
  • This paper proposes a change detection method based on the covariance matrices of color and edge gradient in a color video. The YCbCr color format was used instead of RGB. The color covariance matrix was calculated from the CbCr-channels and the edge gradient covariance matrix was calculated from the Y-channels. The covariance matrices were effectively calculated at each pixel by calculating the sum, squared sum, and sum of two values' multiplication of a rectangle area using the integral images from a background image. The background image was updated by a running the average between the background image and a current frame. The change areas in a current frame image against the background were detected using the Mahalanobis distance, which is a measure of the statistical distance using covariance matrices. The experimental results of an expressway color video showed that the proposed approach can effectively detect change regions for color and edge gradients against the background.

Mutual Information-based Circular Template Matching for Image Registration (영상등록을 위한 Mutual Information 기반의 원형 템플릿 정합)

  • Ye, Chul-Soo
    • Korean Journal of Remote Sensing
    • /
    • v.30 no.5
    • /
    • pp.547-557
    • /
    • 2014
  • This paper presents a method for designing circular template used in similarity measurement for image registration. Circular template has translation and rotation invariant property, which results in correct matching of control points for image registration under the condition of translation and rotation between reference and sensed images. Circular template consisting of the pixels located on the multiple circumferences of the circles whose radii vary from zero to a certain distance, is converted to two-dimensional Discrete Polar Coordinate Matrix (DPCM), whose elements are the pixels of the circular template. For sensed image, the same type of circular template and DPCM are created by rotating the circular template repeatedly by a certain degree in the range between 0 and 360 degrees and then similarity is calculated using mutual information of the two DPCMs. The best match is determined when the mutual information for each rotation angle at each pixel in search area is maximum. The proposed algorithm was tested using KOMPSAT-2 images acquired at two different times and the results indicate high accurate matching performance under image rotation.

NONLINEAR CONTRAST ENHANCEMENT ON SUBTRACTION IMAGES (계수공정영상의 비선형 대조도 증강효과에 관한 연구)

  • Lee Keon-Il;Jin Yeun-Hwa
    • Journal of Korean Academy of Oral and Maxillofacial Radiology
    • /
    • v.27 no.2
    • /
    • pp.83-90
    • /
    • 1997
  • This study was performed to demonstrate the effect of linear or nonlinear contrast enhancement on subtraction images. Three different textures were radiograped on dental film. The first radiograph was taken without the presence of an object. the second, which showed trabucular bone, was taken of the molar area of a human. the third radiograph was taken of the coronal part of molars. Each film was digitized into a 1312 x 1024 pixel x 8 bit depth matrix by means of a Nikon 35 mm film scanner(LS-3510AF, Japan) with fixed gain and internal dark current correction to maintain constant illumination. The scanner was interfaced to a Macintosh Le ill computer(Apple Computer, Charlotte, N.C) This resulted in three pairs of images, including different textures-plain, bone and enamel. Digital regular, linearly and nonlinearly enhanced subtraction was performed. Computer software was ,used to simulate lesions in the shape of a 2D-Gaussian curve on each of a pair of images. The each subtraction images were presented in a random sequence to two groups of 10 observers(students and dentists). ROC analysis was used to compare observer performance. The following results were obtained ; 1. All of LCE subtraction, equalized subtraction and regular subtraction images of plain texture were diagnosed the best by far. 2. The data revealed a siginificant LCE effect in both the student group and the expert group. 3. Clinical expertise was a helphul factor for the observers in this study.

  • PDF

Development of SiPM-based Small-animal PET

  • Lee, Jin Hyung;Lee, Seung-Jae;Chung, Yong Hyun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.5
    • /
    • pp.324-329
    • /
    • 2015
  • A decreased number of readout method is investigated to provide precise pixel information for small-animal positron emission tomography (PET). Small-animal PET consists of eight modules, and each module is composed of a $6{\times}6$ array of $2{\times}2{\times}20mm^3$ lutetium yttrium orthosilicate (LYSO) crystals optically coupled to a $4{\times}4$ array of $3{\times}3mm^2$ silicon photomultipliers (SiPMs). The number of readout channels is reduced by one-quarter that of the conventional method by applying a simplified row and column matrix algorithm. The performance of the PET system and detector module was evaluated with Geant4 Application for Emission Tomography (GATE) 6.1 and DETECT2000 simulations. In the results, all pixels of the $6{\times}6$ LYSO array were decoded well, and the spatial resolution and sensitivity, respectively, of the PET system were 1.75 mm and 4.6% (@ center of field of view, energy window: 350-650 keV).

WAVELET-BASED FOREST AREAS CLASSIFICATION BY USING HIGH RESOLUTION IMAGERY

  • Yoon Bo-Yeol;Kim Choen
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.698-701
    • /
    • 2005
  • This paper examines that is extracted certain information in forest areas within high resolution imagery based on wavelet transformation. First of all, study areas are selected one more species distributed spots refer to forest type map. Next, study area is cut 256 x 256 pixels size because of image processing problem in large volume data. Prior to wavelet transformation, five texture parameters (contrast, dissimilarity, entropy, homogeneity, Angular Second Moment (ASM≫ calculated by using Gray Level Co-occurrence Matrix (GLCM). Five texture images are set that shifting window size is 3x3, distance .is 1 pixel, and angle is 45 degrees used. Wavelet function is selected Daubechies 4 wavelet basis functions. Result is summarized 3 points; First, Wavelet transformation images derived from contrast, dissimilarity (texture parameters) have on effect on edge elements detection and will have probability used forest road detection. Second, Wavelet fusion images derived from texture parameters and original image can apply to forest area classification because of clustering in Homogeneous forest type structure. Third, for grading evaluation in forest fire damaged area, if data fusion of established classification method, GLCM texture extraction concept and wavelet transformation technique effectively applied forest areas (also other areas), will obtain high accuracy result.

  • PDF