• Title/Summary/Keyword: high pixel density

Search Result 58, Processing Time 0.019 seconds

A Study of Usefulness for Megavoltage Computed Tomography on the Radiation Treatment Planning (메가볼트 에너지 전산화 단층 촬영을 이용한 치료계획의 유용성 연구)

  • Cho, Jeong-Hee;Kim, Joo-Ho;Khang, Hyun-Soo;Lee, Jong-Seok;Yoo, Beong-Gyu
    • Journal of radiological science and technology
    • /
    • v.33 no.4
    • /
    • pp.369-378
    • /
    • 2010
  • The purpose of this study was to investigate image differences between KVCT vs MVCT depending on a high densities metal included in the phantom and to analyze the r values for the purpose of the dose differences between each methods. We verified the possibilities for clinical indications that using MVCT is available for the radiation therapy treatment planning. Cheese phantom was used to get a density table for each CT and CT sinogram data was transferred to radiation planning computer through DICOM_RT. Using this data, the treatment dose plan has been calculated in RTP system. We compared the differences of r values between calculated and measured values, and then applied this data to the real patient's treatment planning. The contrast of MVCT image was superior to KVCT. In KVCT, each pixel which has more than 3.0 of density was difficult to be differentiated, but in MVCT, more than 5.0 density of pixels were distinguished clearly. With the normal phantom, the percentage of the case which has less than 1($r\leq1$, acceptable criteria) of gamma value, was 94.92% for KVCT and 93.87% for MVCT. But with the cheese phantom, which has high density plug, the percentage was 88.25% for KVCT and 93.77% for MVCT respectively. MVCT has many advantages than KVCT. Especially, when the patient has high density metal, such as total hip arthroplasty, MVCT is more efficient to define the anatomical structure around the high density implants without any artifacts. MVCT helps to calculate the treatment dose more accurately.

Parallel Design and Implementation of Shot Boundary Detection Algorithm (샷 경계 탐지 알고리즘의 병렬 설계와 구현)

  • Lee, Joon-Goo;Kim, SeungHyun;You, Byoung-Moon;Hwang, DooSung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.2
    • /
    • pp.76-84
    • /
    • 2014
  • As the number of high-density videos increase, parallel processing approaches are necessary to process a large-scale of video data. When a processing method of video data requires thousands of simple operations, GPU-based parallel processing is preferred to CPU-based parallel processing by way of reducing the time and space complexities of a given computation problem. This paper studies the parallel design and implementation of a shot-boundary detection algorithm. The proposed shot-boundary detection algorithm uses pixel brightness comparisons and global histogram data among the blocks of frames, and the computation of these data is characterized with the high parallelism for the related operations. In order to maximize these operations in parallel, the computations of the pixel brightness and histogram are designed in parallel and implemented in NVIDIA GPU. The GPU-based shot detection method is tested with 10 videos from the set of videos in National Archive of Korea. In experiments, the detection rate is similar but the computation time is about 10 time faster to that of the CPU-based algorithm.

Comparison of Digital Radiometric Features between Radicular Cysts and Periapical Granulomas (치근단낭과 육아종의 디지털방사선학적 비교연구)

  • Jin Yeon-Hwa;Lee Keon-Il
    • Journal of Korean Academy of Oral and Maxillofacial Radiology
    • /
    • v.29 no.1
    • /
    • pp.241-254
    • /
    • 1999
  • The purpose of this study was to investigate whether a radiometric analysis of radicular cysts and periapical granulomas is useful in the differential diagnosis. In this experiment, twenty-nine periapical radiographs of the radicular cyst and those periapical granuloma were used. The periapical radiography was taken by intraoral paralleling device. The X-ray film was digitized and digitally filtered to reduce film-grain noise. We estimated density difference of the inner/outer area, roundness or circularity, bone profile or scan line of the margin and cumulative percentage frequency curve of radicular cyst & periapical granuloma. The obtained results were as follows; 1. The differences in density between ROIs of inner and outer area of radicular cysts were smaller than those of periapical granulomas. 2. The equivalent circular diameter was over 6.3mm, there was significant difference between periapical cyst and periapical granuloma. 3. In differential diagnosis of radicular cyst and periapical granuloma using bone profile. sensitivity. specificity and accuracy were considerably high(0.83. 0.86. 0.86) respectively. 4. Cumulative percentage frequency curve of the radicular cyst was closer to the pseudo-pixel value of 50 than average curve, whereas periapical granuloma was closer to that of 0. Hence we conclude that digital radiometric features might be useful in the differential diagnosis between radicular cyst and periapical granuloma.

  • PDF

A Study on the Development of the System for Inspecting Cracks in the Inner Wall for Structures (구조물 내벽의 균열 검사를 위한 시스템 개발에 관한 연구)

  • 이상호;신동익;손영갑;이강문;마상준
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1997.10a
    • /
    • pp.480-483
    • /
    • 1997
  • In this paper, we have proposed an automatic inspection system for cracks on the surface of a structure. The proposed system consists of the imaging system and the veh~cle system. The imaging system. a set of optical sensor, lens, illuminator, storage and their configuration, images the scene and store it on the hard disk. We adopted a linescan camera of 5000 pixel density to achieve high resolution without loss of simplicity. The vehicle system that moves the optical system IS ~mplemented by an AGV. The AGV moves forward at constant velocity and avoid obstacles to acquire a stable image. We have cmplemented an experimental system and have acquired images of the wall of hallway. The image is of 0.1-mmipixel resolution and the scanning time IS about 1 mlsec. The allow able scan.

  • PDF

Application of an Iterative 2D Equalizer to Holographic Data Storage Systems (반복 2차 등화기의 홀로그래픽 데이터 저장 장치 적용)

  • Kim, Sun-Ho;Im, Sung-Bin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.7
    • /
    • pp.1-5
    • /
    • 2012
  • At the present time when the limits of the magnetic storage systems appear, the holographic data storage (HDS) devices with high data transfer rate and high recording density are emerging as attractive candidates for next-generation optical storage devices. In this paper, to effectively improve the detection performance that is degraded by the two-dimensional inter-symbol interference under the HDS channel environment and the pixel misalignment, an iterative two-dimensional equalization scheme is proposed based on the contraction mapping theorem. In order to evaluate the performance of the proposed scheme, for various holographic channel environments we measure the BER performance using computer simulation and compare the proposed one with the conventional threshold detection scheme, which verifies the superiority of the proposed scheme.

Salt and Pepper Noise Removal using 2-Dimensional Spline Interpolation (2차원 스플라인 보간법을 이용한 Salt and Pepper 잡음 제거)

  • Kwon, Se-Ik;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.6
    • /
    • pp.1167-1173
    • /
    • 2017
  • As the society increasingly embraces the high - tech digital information age, the field of image processing becomes progressively more branched out and becoming an imperative field. However, image data is deteriorated due to various causes during transmission and salt and pepper noise is typical. Typical methods for removing salt and pepper noise include CWMF, SWMF, and A-TMF. However, existing methods are somewhat insufficient in their ability to remove noise in salt and pepper noise environments. Therefore, in this paper, after it is determined whether noise removal is needed, the following measures were taken. If the center pixel was non-noise, the original pixel was preserved, If it was noise, we proposed a two - dimensional spline interpolation method and a median filter depending on the noise density of the local mask. For the purpose of objective judgment, we compared the results with that of existing methods and used PSNR (peak signal to noise ratio) as a judgment criterion.

A Study on Edge Detection using Directional Mask in Impulse Noise Image (임펄스 잡음 영상에서 방향성 마스크를 이용한 에지 검출에 관한 연구)

  • Lee, Chang-Young;Kim, Nam-Ho
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.15 no.4
    • /
    • pp.135-140
    • /
    • 2014
  • As the digital image devices are widely used, interests in the software- and the hardware-related image processing become higher and the image processing techniques are applied in various fields such as object recognition, object detection, fingerprint recognition, and etc. For the edge detections Sobel, Prewitt, Laplacian, Roberts and Canny detectors are used and these existing methods can excellently detect the edges of the images without noise. However, in the images corrupted by the impulse noise, these methods are insufficent in noise elimination characteristics, showing unsatisfactory edge detection. Therefore in this paper, in order to obtain excellent edge detection characteristics in the corrupted image by the impulse noise, an detection algorithm is porposed, which uses the central pixel of mask divided by four regions along the axis, calculates the estimated mask according to the representing pixel values in each regions, and detects the final edges by applying the estimates mask and the new directional one.

Salt and Pepper Noise Removal using Cubic Spline Interpolation (3차 스플라인 보간법을 이용한 Salt and Pepper 잡음 제거)

  • Kwon, Se-Ik;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.10
    • /
    • pp.1955-1960
    • /
    • 2016
  • Currently, with the rapid development in digital era, the image equipment related to multi-media is becoming commercialized. However, in the process of transmitting image data, deterioration occurs due to various causes, and the most representative deterioration is salt and pepper noise. There are many methods of eliminating salt and pepper noise such as SWMF, RSIF, MNRF, which are rather insufficient in eliminating noise in high-density slat and pepper noise environment. Therefore, in order to eliminate salt and pepper noise, this thesis proposes an algorithm by first judging the noise, and when the center pixel value is non-noise, the original pixel is preserved, and when it is noise, the partial mask is subdivided into 4 directions to apply cubic spline interpolation to the direction with most non-noise pixels. Also, for the objective judgement, it was compared to existing methods, and the PSNR(peak signal to nise ratio) was set as the judgement standard.

High Density Impulse Noise Reduction Filter Algorithm using Effective Pixels (유효 화소를 이용한 고밀도 임펄스 잡음 제거 필터 알고리즘)

  • Cheon, Bong-Won;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.10
    • /
    • pp.1320-1326
    • /
    • 2018
  • Digital video equipment is important in the 4th industrial revolution and is widely used in different fields for various purpose. Data of digital video equipment is exposed to noise due to different reasons including user environment and processing and such noise affect output and processing method. This can even cause error, resulting in decreased reliability of the equipment. In this research, it offers algorithm to effectively recover video by removing noise and impulse noise occurring during the process of channel delivery. This proposed algorithm recovers video by exploring valid pixel using directional local mask and noise determination. Then, valid pixel calculated goes through the final output calculation through comparative analysis on estimation. For comparing suggested method and algorithm, simulation is carried out. For checking the function of it, PSNR and profile are analyzed.

S&P Noise Removal Filter Algorithm using Plane Equations (평면 방정식을 이용한 S&P 잡음제거 필터 알고리즘)

  • Young-Su, Chung;Nam-Ho, Kim
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.27 no.1
    • /
    • pp.47-53
    • /
    • 2023
  • Devices such as X-Ray, CT, MRI, scanners, etc. can generate S&P noise from several sources during the image acquisition process. Since S&P noise appearing in the image degrades the image quality, it is essential to use noise reduction technology in the image processing process. Various methods have already been proposed in research on S&P noise removal, but all of them have a problem of generating residual noise in an environment with high noise density. Therefore, this paper proposes a filtering algorithm based on a three-dimensional plane equation by setting the grayscale value of the image as a new axis. The proposed algorithm subdivides the local mask to design the three closest non-noisy pixels as effective pixels, and applies cosine similarity to a region with a plurality of pixels. In addition, even when the input pixel cannot form a plane, it is classified as an exception pixel to achieve excellent restoration without residual noise.