• Title/Summary/Keyword: Image pixel

Search Result 2,495, Processing Time 0.031 seconds

Intra residual DPCM for H.264 lossless coding (H.264 무손실 부호화를 위한 Intra residual DPCM)

  • Han Ki-Hun;Lee Yung-Lyul
    • Journal of Broadcast Engineering
    • /
    • v.11 no.2 s.31
    • /
    • pp.174-180
    • /
    • 2006
  • H.264/MPEG-4 AVC is jointly developed by ITU-T and ISO/IEC. It provides efficient coding efficiency compared with previous video standards. It reduced the bit rate by approximately $30%{\sim}70%$ while providing the same or better image quality. And, H.264/MPEG-4 AVC supports not only lossy coding but also lossless coding. In this paper, we suggest a method to improve lossless coding efficiency. Proposed method is based on Intra residual DPCM, it has same effect with the prediction from spatially nearest pixel. Also, proposed method does not broken decoder pipe-line. Experimental results, the method reduced the bit rate by approximately 12% in comparison with the H.264 Intra lossless coding. As a result, it is adopted into the H.264/MPEG-4 AVC Advanced 4:4:4 profile.

Shadow Removal based on Chromaticity and Brightness Distortion for Effective Moving Object Tracking (효과적인 이동물체 추적을 위한 색도와 밝기 왜곡 기반의 그림자 제거)

  • Kim, Yeon-Hee;Kim, Jae-Ho;Kim, Yoon-Ho
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.8 no.4
    • /
    • pp.249-256
    • /
    • 2015
  • Shadow is a common physical phenomenon in natural images and may cause problems in computer vision tasks. Therefore, shadow removal is an essential preprocessing process for effective moving object tracking in video image. In this paper, we proposed the method of shadow removal algorithm using chromaticity, brightness distortion and direction of shadow candidate. The proposed method consists of two steps. First, removal process of primary shadow candidate region by using chromaticity, brightness and distortion. The second stage applies the final shadow candidate region to obtain a direction feature of shadow which is estimated by the thinning algorithm after calculating the lowest pixel position of the moving object. To verify the proposed approach, some experiments are conducted to draw a compare between conventional method and that of proposed. Experimental results showed that proposed methodology is simple, but robust and well adaptive to be need to remove a shadow removal operation.

Zoom Lens Calibration for a Video Measuring System (컴퓨터 비젼을 이용한 정밀 측정 장비의 줌 렌즈 캘리브레이션)

  • Hahn, Kwang-Soo;Choi, Joon-Soo;Choi, Ki-Won
    • Journal of Internet Computing and Services
    • /
    • v.6 no.5
    • /
    • pp.57-71
    • /
    • 2005
  • Precise visual measurement applications, like video measuring system (VMS), use camera systems with motorized zoom lens for fast and efficient measurement. In this paper, we introduce an efficient calibration method for zoom lens of VMS controlled by servo motor. For the automated zoom lens calibration of the VMS, only zoom lens setting needs to be calibrated and parameters calibrated by zoom lens settings are image center and pixel size changed by zoom levels, The extrinsic parameters, like focus and iris, do not need to be calibrated since the parameters are usually fixed, It needs a lot of time and effort to calibrate the camera for ali the different zoom levels. In this paper, we also propose an efficient and fast zoom lens calibration method, which calculates the calibration parameters of the zoom lens settings for the minimum number of zoom levels and estimates other parameters for the uncalculated zoom levels using the interpolation of the calculated parameter values.

  • PDF

Small Target Detection Using 3-dimensional Bilateral Filter (3차원 양방향 필터를 이용한 소형 표적 검출)

  • Bae, Tae-Wuk
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.6
    • /
    • pp.746-755
    • /
    • 2013
  • This paper presents a three dimensional bilateral filter detecting target trajectory, extracting spatial target information using two dimensional bilateral filter and temporal target information using one dimensional bilateral filter. In order to discriminate edge pixel with flat background and target region spatially and temporally, spatial and temporal variance are used for an image and temporal profile. With this procedure, background and background profile are predicted without original target through two dimensional and one dimensional bilateral filter. Finally, using spatially predicted background and temporally predicted background profile, small target can be detected. For comparison of existing target detection methods and the proposed method, the receiver operating characteristics (ROC) is used in experimental results. Experimental results show that the proposed method has superior target detection rate and lower false alarm rate.

An Enhancement of Removing Noise Branches by Detecting Noise Blobs (잡영블랍 검출에 의한 잡영가지 제거 방법의 개선)

  • 김성옥;임은경;김민환
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.3
    • /
    • pp.419-428
    • /
    • 2003
  • Several methods have been studied to prune the parasitic branches that cause unfortunately from thinning a shape to get its skeleton. We found that the symmetric path finding method was most efficient because it followed the boundary pixels of the shape just once. In this paper, its extended method is proposed to apply to removing the noise branches that protrude out of the boundary of a segmented or extracted shape in a given image. The proposed method can remove a noise branch with one-pixel width and also remove the noise branch that includes a round shape called a noise blob. The method uses a 4-8-directional boundary-following technique to determine symmetric paths and finds noise branches with noise blobs by detecting quasi-symmetric paths. Its time complexity is a linear function of the number of boundary pixels. Interactively selectable parameters are used to define various types of noise branches flexibly, which are the branch - size parameter and the blob-size parameter. Experimental results for a practical shape and various artificial shapes showed that the proposed method was very useful for simplifying the shapes.

  • PDF

Automatic Detection of Kidney Tumor from Abdominal CT Scans (복부 CT 영상에서 신장암의 자동추출)

  • 김도연;노승무;조준식;김종철;박종원
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.11
    • /
    • pp.803-808
    • /
    • 2002
  • This paper describes automatic methods for detection of kidney and kidney tumor on abdominal CT scans. The abdominal CT images were digitalized using a film digitizer and a gray-level threshold method was used to segment the kidney. Based on texture analysis results, which were perform on sample images of kidney tumors, SEED region of kidney tumor was selected as result of homogeneity test. The average and standard deviation, which are representative statistical moments, were used to as an acceptance criteria for homogeneous test. Region growing method was used to segment the kidney tumor from the center pixel of selected SEED region using a gray-level value as an acceptance criteria for homogeneity test. These method were applied to 113 images of 9 cases, which were scanned by GE Hispeed Advantage CT scanner and digitalized by Lumisvs LS-40 film digitizer. The sensitivity was 85% and there was no false-positive results.

A Fast Motion Estimation Algorithm with Adjustable Searching Area (적응 탐색 영역을 가지는 고속 움직임 추정 알고리즘)

  • Jeong, Seong-Gyu;Jo, Gyeong-Rok;Jeong, Cha-Geun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.8
    • /
    • pp.966-974
    • /
    • 1999
  • 완전 탐색 블록 정합 알고리즘(FBMA)은 다양한 움직임 추정 알고리즘 중 최상의 움직임 추정을 할 수 있으나, 방대한 계산량이 실시간 처리의 적용에 장애 요소이다. 본 논문에서는 완전 탐색 블록 정합 알고리즘에 비해 더 낮은 계산량과 유사한 화질을 가지는 새로운 고속 움직임 추정 알고리즘을 제안한다. 제안한 방법에서는 공간적인 상관성을 이용함으로써 적절한 탐색 영역의 크기를 예측할 수 있다. 현재 블록의 움직임 추정을 위하여 이웃 블록이 가지고 있는 움직임과 탐색 영역의 크기를 이용하여 현재 블록의 탐색 영역을 적응적으로 변화시키는 방법이다. 이 예측값으로 현재 블록의 탐색 영역 크기를 결정한 후, FBMA와 같이 이 영역 안의 모든 화소점들에 대하여 현재 블록을 정합하여 움직임 벡터를 추정한다. 컴퓨터 모의 실험 결과 계산량 측면에서 제안 방법이 완전 탐색 블록 정합 알고리즘보다 50%정도 감소하였으며, PSNR 측면에서는 0.08dB에서 1.29dB 정도 감소하는 좋은 결과를 얻었다.Abstract Full search block-matching algorithm (FBMA) was shown to be able to produce the best motion compensated images among various motion estimation algorithms. However, huge computational load inhibits its applicability in real applications. A new motion estimation algorithm with lower computational complexity and good image quality when compared to the FBMA will be presented in this paper. In the proposed method, The appropriate search area can be predicted by using the temporal correlation between neighbouring blocks. For motion estimation of the current block, it is the method changing adjustably search area of current block by using motion and search area size of the neighbouring block. After deciding search area size of the current block with this predicted value, we estimate motion vector that matching current block like the FBMA for every pixel in this area. By the computer simulation the computation amount of the proposed method can be greatly decreased about 50% than that of the FBMA and the good result of the PSNR can be attained.

Structural analysis of trabecular bone using Automatic Segmentation in micro-CT images (마이크로 CT 영상에서 자동 분할을 이용한 해면뼈의 형태학적 분석)

  • Kang, Sun-Kyung;Jung, Sung-Tae
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.3
    • /
    • pp.342-352
    • /
    • 2014
  • This paper proposes an automatic segmentation method of cortical bone and trabecular bone and describes an implementation of structural analysis method of trabecular bone in micro-CT images. The proposed segmentation method extract bone region with binarization using a threshold value. Next, it finds adjacent contour lines from outer boundary line into inward direction and sets candidate regions of cortical bone. Next it remove cortical bone region by finding the candidate cortical region of which the average pixel value is maximum. We implemented the method which computes four structural indicators BV/TV, Tb.Th, Tb.Sp, Tb.N by using VTK(Visualization ToolKit) and sphere fitting algorithm. We applied the implemented method to twenty proximal femur of mouses and compared with the manual segmentation method. Experimental result shows that the average error rates between the proposed segmentation method and the manual segmentation method are less than 3% for the four structural indicatiors. This result means that the proposed method can be used instead of the combersome and time consuming manual segmentation method.

A Spatially Adaptive Post-processing Filter to Remove Blocking Artifacts of H.264 Video Coding Standard (H.264 동영상 표준 부호화 방식의 블록화 현상 제거를 위한 적응적 후처리 기법)

  • Choi, Kwon-Yul;Hong, Min-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8C
    • /
    • pp.583-590
    • /
    • 2008
  • In this paper, we present a spatially adaptive post-processing algorithm for H.264 video coding standard to remove blocking artifacts. The loop filter of H.264 increases computational complexity of the encoder. Furthermore it doesn't clearly remove the blocking artifacts, resulting in over-blurring. For overcoming them, we combine the projection method with the Constraint Least Squares(CLS) method to restore the high quality image. To reflect the Human Visual System, we adopt the weight norm CLS method. Particularly pixel location-based local variance and laplacian operator are newly defined for the CLS method. In addition, the fact that correlation among adjoining pixels is high is utilized to constrain the solution space when the projection method is applied. Quantization Index(QP) of H.264 is also used to control the degree of smoothness. The simulation results show that the proposed post-processing filter works better than the loop filter of H.264 and converges more quickly than the CLS method.

DEVELOPMENT OF GOCI/COMS DATA PROCESSING SYSTEM

  • Ahn, Yu-Hwan;Shanmugam, Palanisamy;Han, Hee-Jeong;Ryu, Joo-Hyung
    • Proceedings of the KSRS Conference
    • /
    • v.1
    • /
    • pp.90-93
    • /
    • 2006
  • The first Geostationary Ocean Color Imager (GOCI) onboard its Communication Ocean and Meteorological Satellite (COMS) is scheduled for launch in 2008. GOCI includes the eight visible-to-near-infrared (NIR) bands, 0.5km pixel resolution, and a coverage region of 2500 ${\times}$ 2500km centered at 36N and 130E. GOCI has had the scope of its objectives broadened to understand the role of the oceans and ocean productivity in the climate system, biogeochemical variables, geological and biological response to physical dynamics and to detect and monitor toxic algal blooms of notable extension through observations of ocean color. The special feature with GOCI is that like MODIS, MERIS and GLI, it will include the band triplets 660-680-745 for the measurements of sun-induced chlorophyll-a fluorescence signal from the ocean. The GOCI will provide SeaWiFS quality observations with frequencies of image acquisition 8 times during daytime and 2 times during nighttime. With all the above features, GOCI is considered to be a remote sensing tool with great potential to contribute to better understanding of coastal oceanic ecosystem dynamics and processes by addressing environmental features in a multidisciplinary way. To achieve the objectives of the GOCI mission, we develop the GOCI Data Processing System (GDPS) which integrates all necessary basic and advanced techniques to process the GOCI data and deliver the desired biological and geophysical products to its user community. Several useful ocean parameters estimated by in-water and other optical algorithms included in the GDPS will be used for monitoring the ocean environment of Korea and neighbouring countries and input into the models for climate change prediction.

  • PDF