• Title/Summary/Keyword: Pixel Selection

Search Result 114, Processing Time 0.024 seconds

Evaluation of the Effect of using Fractal Feature on Machine learning based Pancreatic Tumor Classification (기계학습 기반 췌장 종양 분류에서 프랙탈 특징의 유효성 평가)

  • Oh, Seok;Kim, Young Jae;Kim, Kwang Gi
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.12
    • /
    • pp.1614-1623
    • /
    • 2021
  • In this paper, the purpose is evaluation of the effect of using fractal feature in machine learning based pancreatic tumor classification. We used the data that Pancreas CT series 469 case including 1995 slice of benign and 1772 slice of malignant. Feature selection is implemented from 109 feature to 7 feature by Lasso regularization. In Fractal feature, fractal dimension is obtained by box-counting method, and hurst coefficient is calculated range data of pixel value in ROI. As a result, there were significant differences in both benign and malignancies tumor. Additionally, we compared the classification performance between model without fractal feature and model with fractal feature by using support vector machine. The train model with fractal feature showed statistically significant performance in comparison with train model without fractal feature.

Hybrid Algorithm for Interpolation Based on Macro-block Gray Value Gradient under H.264 (H.264하에서 마크로 블록 그레이 값의 미분을 사용한 인터폴레이션)

  • Wang, Shi;Chen, Hongxin;Yoo, Hyeon-Joong;Kim, Hyong-Suk
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.2
    • /
    • pp.274-279
    • /
    • 2009
  • H.264 suggests applying a 2-D 6-tap wiener filter to realize the interpolation for half-pixel positions, followed by a bilinear interpolation to get the data of quarter-pixels precision. This method is comparatively simpler; however, it only considers the affection of 4-connection neighborhood ignoring the influence that comes from the changing rate between respective neighborhoods. As a result, it has the characteristics of a Low-pass filter under the risk of losing high-frequency weights. The Cubic interpolation uses the gray-values within the larger regions of points to be sampled for interpolation. Nevertheless, the cubic interpolation is more complicated and computational. We give a deep analysis on the features while applying both bilinear and cubic interpolation in H.264 presenting a proper selection of interpolation algorithm with respect to specific distribution of gray-value in a certain grand block. The experiments point out that load far motion searching and interpolation are reduced when promoting the precision of interpolation simultaneously.

Accuracy Evaluation of Supervised Classification about IKONOS Imagery using Mixed Pixels (혼합화소를 이용한 IKONOS 영상의 감독분류정확도 평가)

  • Lee, Jong-Sin;Kim, Min-Gyu;Park, Joon-Kyu
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.6
    • /
    • pp.2751-2756
    • /
    • 2012
  • Selection of training set influences the classification accuracy in supervised classification using satellite imagery. Generally, if pure pixels which character of training set is clear were selected, whole accuracy is high while if mixed pixels were selected, accuracy is decreased because of low-resolution imagery or unclear distinguishment. However, it is too difficult to choose the pure pixels as training set actually. Accordingly, this study should be suggested the suitable classification method in case of mixed pixels choice. To achieve this, a few pure pixels were chosen as training set and classification accuracy was calculated which was compared with classification result using an equal number of mixed pixels. As a result, accuracy of SVM was the highest among the classification method using mixed pixels and it was a relatively small difference with the result of classification using pure pixels. Therefore, imagery classification using SVM is most suitable in the mixed area of construction and green because it is high possibility to choose mixed pixels as training set.

Video Indexing and Retrieval of MPEG Video using Motion and DCT Coefficients in Compressed Domain (움직임과 DCT 계수를 이용한 압축영역에서 MPEG 비디오의 인덱싱과 검색)

  • 박한엽;최연성;김무영;강진석;장경훈;송왕철;김장형
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.2
    • /
    • pp.121-132
    • /
    • 2000
  • Most of video indexing applications depend on fast and efficient archiving, browsing, retrieval techniques. A number of techniques have been approached about only pixel domain analysis until now. Those approaches brought about the costly overhead of decompressing because the most of multimedia data is typically stored in compressed format. But with a compressed video data, if we can analyze the compressed data directly. then we avoid the costly overhead such as in pixel domain. In this paper, we analyze the information of compressed video stream directly, and then extract the available features for video indexing. We have derived the technique for cut detection using these features, and the stream is divided into shots. Also we propose a new brief key frame selection technique and an efficient video indexing method using the spatial informations(DT coefficients) and also the temporal informations(motion vectors).

  • PDF

Design of High-Performance Motion Estimation Circuit for H.264/AVC Video CODEC (H.264/AVC 동영상 코덱용 고성능 움직임 추정 회로 설계)

  • Lee, Seon-Young;Cho, Kyeong-Soon
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.7
    • /
    • pp.53-60
    • /
    • 2009
  • Motion estimation for H.264/AVC video CODEC is very complex and requires a huge amount of computational efforts because it uses multiple reference frames and variable block sizes. We propose the architecture of high-performance integer-pixel motion estimation circuit based on fast algorithms for multiple reference frame selection, block matching, block mode decision and motion vector estimation. We also propose the architecture of high-performance interpolation circuit for sub-pixel motion estimation. We described the RTL circuit in Verilog HDL and synthesized the gate-level circuit using 130nm standard cell library. The integer-pixel motion estimation circuit consists of 77,600 logic gates and four $32\times8\times32$-bit dual-port SRAM's. It has tile maximum operating frequency of 161MHz and can process up to 51 D1 (720$\times$480) color in go frames per second. The fractional motion estimation circuit consists of 22,478 logic gates. It has the maximum operating frequency of 200MHz and can process up to 69 1080HD (1,920$\times$1,088) color image frames per second.

Illumination estimation based on valid pixel selection from CCD camera response (CCD카메라 응답으로부터 유효 화소 선택에 기반한 광원 추정)

  • 권오설;조양호;김윤태;송근호;하영호
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.5
    • /
    • pp.251-258
    • /
    • 2004
  • This paper proposes a method for estimating the illuminant chromaticity using the distributions of the camera responses obtained by a CCD camera in a real-world scene. Illuminant estimation using a highlight method is based on the geometric relation between a body and its surface reflection. In general, the pixels in a highlight region are affected by an illuminant geometric difference, camera quantization errors, and the non-uniformity of the CCD sensor. As such, this leads to inaccurate results if an illuminant is estimated using the pixels of a CCD camera without any preprocessing. Accordingly, to solve this problem the proposed method analyzes the distribution of the CCD camera responses and selects pixels using the Mahalanobis distance in highlight regions. The use of the Mahalanobis distance based on the camera responses enables the adaptive selection of valid pixels among the pixels distributed in the highlight regions. Lines are then determined based on the selected pixels with r-g chromaticity coordinates using a principal component analysis(PCA). Thereafter, the illuminant chromaticity is estimated based on the intersection points of the lines. Experimental results using the proposed method demonstrated a reduced estimation error compared with the conventional method.

Reduction of Dynamic False Contours based on Gray Level Selection method in PDP (계조 수 감소를 이용한 PDP내에서 의사 윤곽 제거 기법)

  • Ahn Sang-Jun;Eo Yoon-Phil;Lee Sang-Uk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7C
    • /
    • pp.716-725
    • /
    • 2005
  • In this paper, we propose a new approach for the reduction of the dynamic false contours, which detects and compensates false contour artifacts adaptively. First, we develop a simple but effective method to select the pixels that are likely to cause the motion artifacts, based on the distribution of pixel values. Then, we merge the selected pixels into several regions using tree structure. Next, we reduce number of gray levels within the regions slightly to reduce the false contours. Note that reducing number of gray levels yield the distortion, thus it is applied only to the selected regions, instead of the whole picture. Intensive simulations on real moving image show that the proposed algorithm alleviates the dynamic false contours effectively with tolerable computational complexity.

A Reference Frame Selection Method Using RGB Vector and Object Feature Information of Immersive 360° Media (실감형 360도 미디어의 RGB 벡터 및 객체 특징정보를 이용한 대표 프레임 선정 방법)

  • Park, Byeongchan;Yoo, Injae;Lee, Jaechung;Jang, Seyoung;Kim, Seok-Yoon;Kim, Youngmo
    • Journal of IKEEE
    • /
    • v.24 no.4
    • /
    • pp.1050-1057
    • /
    • 2020
  • Immersive 360-degree media has a problem of slowing down the video recognition speed when the video is processed by the conventional method using a variety of rendering methods, and the video size becomes larger with higher quality and extra-large volume than the existing video. In addition, in most cases, only one scene is captured by fixing the camera in a specific place due to the characteristics of the immersive 360-degree media, it is not necessary to extract feature information from all scenes. In this paper, we propose a reference frame selection method for immersive 360-degree media and describe its application process to copyright protection technology. In the proposed method, three pre-processing processes such as frame extraction of immersive 360 media, frame downsizing, and spherical form rendering are performed. In the rendering process, the video is divided into 16 frames and captured. In the central part where there is much object information, an object is extracted using an RGB vector per pixel and deep learning, and a reference frame is selected using object feature information.

Influence of Two-Dimensional and Three-Dimensional Acquisitions of Radiomic Features for Prediction Accuracy

  • Ryohei Fukui;Ryutarou Matsuura;Katsuhiro Kida;Sachiko Goto
    • Progress in Medical Physics
    • /
    • v.34 no.3
    • /
    • pp.23-32
    • /
    • 2023
  • Purpose: In radiomics analysis, to evaluate features, and predict genetic characteristics and survival time, the pixel values of lesions depicted in computed tomography (CT) and magnetic resonance imaging (MRI) images are used. CT and MRI offer three-dimensional images, thus producing three-dimensional features (Features_3d) as output. However, in reports, the superiority between Features_3d and two-dimensional features (Features_2d) is distinct. In this study, we aimed to investigate whether a difference exists in the prediction accuracy of radiomics analysis of lung cancer using Features_2d and Features_3d. Methods: A total of 38 cases of large cell carcinoma (LCC) and 40 cases of squamous cell carcinoma (SCC) were selected for this study. Two- and three-dimensional lesion segmentations were performed. A total of 774 features were obtained. Using least absolute shrinkage and selection operator regression, seven Features_2d and six Features_3d were obtained. Results: Linear discriminant analysis revealed that the sensitivities of Features_2d and Features_3d to LCC were 86.8% and 89.5%, respectively. The coefficients of determination through multiple regression analysis and the areas under the receiver operating characteristic curve (AUC) were 0.68 and 0.70 and 0.93 and 0.94, respectively. The P-value of the estimated AUC was 0.87. Conclusions: No difference was found in the prediction accuracy for LCC and SCC between Features_2d and Features_3d.

Selectively Partial Encryption of Images in Wavelet Domain (웨이블릿 영역에서의 선택적 부분 영상 암호화)

  • ;Dujit Dey
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.6C
    • /
    • pp.648-658
    • /
    • 2003
  • As the usage of image/video contents increase, a security problem for the payed image data or the ones requiring confidentiality is raised. This paper proposed an image encryption methodology to hide the image information. The target data of it is the result from quantization in wavelet domain. This method encrypts only part of the image data rather than the whole data of the original image, in which three types of data selection methodologies were involved. First, by using the fact that the wavelet transform decomposes the original image into frequency sub-bands, only some of the frequency sub-bands were included in encryption to make the resulting image unrecognizable. In the data to represent each pixel, only MSBs were taken for encryption. Finally, pixels to be encrypted in a specific sub-band were selected randomly by using LFSR(Linear Feedback Shift Register). Part of the key for encryption was used for the seed value of LFSR and in selecting the parallel output bits of the LFSR for random selection so that the strength of encryption algorithm increased. The experiments have been performed with the proposed methods implemented in software for about 500 images, from which the result showed that only about 1/1000 amount of data to the original image can obtain the encryption effect not to recognize the original image. Consequently, we are sure that the proposed are efficient image encryption methods to acquire the high encryption effect with small amount of encryption. Also, in this paper, several encryption scheme according to the selection of the sub-bands and the number of bits from LFSR outputs for pixel selection have been proposed, and it has been shown that there exits a relation of trade-off between the execution time and the effect of the encryption. It means that the proposed methods can be selectively used according to the application areas. Also, because the proposed methods are performed in the application layer, they are expected to be a good solution for the end-to-end security problem, which is appearing as one of the important problems in the networks with both wired and wireless sections.