• Journal of Information Processing Systems
• /
• v.8 no.3
• /
• pp.389-398
• /
• 2012

Texture is an important visual feature for image analysis. Many approaches have been proposed to model and analyze texture features. Although these approaches significantly contribute to various image-based applications, most of these methods are sensitive to the changes in the scale and orientation of the texture pattern. Because textures vary in scale and orientations frequently, this easily leads to pattern mismatching if the features are compared to each other without considering the scale and/or orientation of textures. This paper suggests an Orientation Matching Scheme (OMS) to ease the problem of mismatching rotated patterns. In OMS, a pair of texture features will be compared to each other at various orientations to identify the best matched direction for comparison. A database including rotated texture images was generated for experiments. A synthetic retrieving experiment was conducted on the generated database to examine the performance of the proposed scheme. We also applied OMS to the similarity computation in a K-means clustering algorithm. The purpose of using K-means is to examine the scheme exhaustively in unpromising conditions, where initialized seeds are randomly selected and algorithms work heuristically. Results from both types of experiments show that the proposed OMS can help improve the performance when dealing with rotated patterns.

• Journal of the Semiconductor & Display Technology
• /
• v.10 no.2
• /
• pp.31-38
• /
• 2011

This paper introduces a video based traffic monitoring system for detecting vehicles and obstacles on the road. To segment moving objects from image sequence, we adopt the background subtraction algorithm based on the local binary patterns (LBP). Recently, LBP based texture analysis techniques are becoming popular tools for various machine vision applications such as face recognition, object classification and so on. In this paper, we adopt an extension of LBP, called the Diagonal LBP (DLBP), to handle the background subtraction problem arise in vision-based autonomous parking systems. It reduces the code length of LBP by half and improves the computation complexity drastically. An edge based shadow removal and blob merging procedure are also applied to the foreground blobs, and a pose estimation technique is utilized for calculating the position and heading angle of the moving object precisely. Experimental results revealed that our system works well for real-time vehicle localization and tracking applications.

• International Journal of Computer Science & Network Security
• /
• v.23 no.9
• /
• pp.141-149
• /
• 2023

Repacked mobile apps constitute about 78% of all malware of Android, and it greatly affects the technical ecosystem of Android. Although many methods exist for repacked app detection, most of them suffer from performance issues. In this manuscript, a novel method using the Constant Key Point Selection and Limited Binary Pattern (CKPS: LBP) Feature extraction-based Hashing is proposed for the identification of repacked android applications through the visual similarity, which is a notable feature of repacked applications. The results from the experiment prove that the proposed method can effectively detect the apps that are similar visually even that are even under the double fold content manipulations. From the experimental analysis, it proved that the proposed CKPS: LBP method has a better efficiency of detecting 1354 similar applications from a repository of 95124 applications and also the computational time was 0.91 seconds within which a user could get the decision of whether the app repacked. The overall efficiency of the proposed algorithm is 41% greater than the average of other methods, and the time complexity is found to have been reduced by 31%. The collision probability of the Hashes was 41% better than the average value of the other state of the art methods.

• Korean Journal of Radiology
• /
• v.22 no.11
• /
• pp.1797-1808
• /
• 2021

Objective: To determine whether volumetric CT texture analysis (CTTA) using fully automatic tumor segmentation can help predict recurrence-free survival (RFS) in patients with intrahepatic mass-forming cholangiocarcinomas (IMCCs) after surgical resection. Materials and Methods: This retrospective study analyzed the preoperative CT scans of 89 patients with IMCCs (64 male; 25 female; mean age, 62.1 years; range, 38-78 years) who underwent surgical resection between January 2005 and December 2016. Volumetric CTTA of IMCCs was performed in late arterial phase images using both fully automatic and semi-automatic liver tumor segmentation techniques. The time spent on segmentation and texture analysis was compared, and the first-order and second-order texture parameters and shape features were extracted. The reliability of CTTA parameters between the techniques was evaluated using intraclass correlation coefficients (ICCs). Intra- and interobserver reproducibility of volumetric CTTAs were also obtained using ICCs. Cox proportional hazard regression were used to predict RFS using CTTA parameters and clinicopathological parameters. Results: The time spent on fully automatic tumor segmentation and CTTA was significantly shorter than that for semi-automatic segmentation: mean ± standard deviation of 1 minutes 37 seconds ± 50 seconds vs. 10 minutes 48 seconds ± 13 minutes 44 seconds (p < 0.001). ICCs of the texture features between the two techniques ranged from 0.215 to 0.980. ICCs for the intraobserver and interobserver reproducibility using fully automatic segmentation were 0.601-0.997 and 0.177-0.984, respectively. Multivariable analysis identified lower first-order mean (hazard ratio [HR], 0.982; p = 0.010), larger pathologic tumor size (HR, 1.171; p < 0.001), and positive lymph node involvement (HR, 2.193; p = 0.014) as significant parameters for shorter RFS using fully automatic segmentation. Conclusion: Volumetric CTTA parameters obtained using fully automatic segmentation could be utilized as prognostic markers in patients with IMCC, with comparable reproducibility in significantly less time compared with semi-automatic segmentation.

• Korean Journal of Radiology
• /
• v.21 no.7
• /
• pp.779-792
• /
• 2020

Recent advances in computer technology have generated a new area of research known as radiomics. Radiomics is defined as the high throughput extraction and analysis of quantitative features from imaging data. Radiomic features provide information on the gray-scale patterns, inter-pixel relationships, as well as shape and spectral properties of radiological images. Moreover, these features can be used to develop computational models that may serve as a tool for personalized diagnosis and treatment guidance. Although radiomics is becoming popular and widely used in oncology, many problems such as overfitting and reproducibility issues remain unresolved. In this review, we will outline the steps of radiomics used for oncology, specifically addressing applications for breast cancer patients and focusing on technical issues.

• Journal of the Korean Society of Radiology
• /
• v.10 no.8
• /
• pp.645-652
• /
• 2016

In this study, based on the analysis of texture feature values of statistical properties. And we examined the normal and the applicability of the computer-aided diagnosis of cerebral infarction in the brain computed tomography images. The experiment was analyzed to evaluate the ROC curve recognition rate of disease using six parameters representing the feature values of the texture. As a result, it showed average mean 88%, variance 92%, relative smoothness 94%, uniformity of 88%, a high disease recognition rate of entropy 84%. However, it showed a slightly lower disease recognition rate and 58% for skewness. In the analysis using ROC curve, the area under the curve for each parameter indicates 0.886 (p = 0.0001) or more, resulted in a meaningful recognition of the disease. Further, to determine the cut-off values for each parameter are determined to be the prediction of disease through the computer-aided diagnosis.

• Journal of the Korea Computer Graphics Society
• /
• v.13 no.3
• /
• pp.7-10
• /
• 2007

We propose an image filtering technique that removes various image styles. To destylize a given image, we define image styles as repeated patterns existing in the image. For dll pixels of the image, we compute image styles as style vectors. We remove image styles by using bilateral filtering based on these style vectors. Destylization results show well smoothed images while preserving feature boundaries. Our method effectively removes image styles and reveals image structures clearly, and results can be applied to several applications such as texture transfer.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.4
• /
• pp.35-43
• /
• 2013

As texture images have become prevalent throughout a variety of industrial applications, copyright protection of these images has become important issues. For this reason, this paper proposes a color-texture image watermarking algorithm utilizing texture properties inherent in the image. The proposed algorithm selects suitable blocks to embed a watermark using the energy and homogeneity properties of the grey level co-occurrence matrices as inputs for the fuzzy c-means clustering algorithm. To embed the watermark, we first perform a discrete wavelet transform (DWT) on the selected blocks and choose one of DWT subbands. Then, we embed the watermark into discrete cosine transformed blocks with a gain factor. In this study, we also explore the effects of the DWT subbands and gain factors with respect to the imperceptibility and robustness against various watermarking attacks. Experimental results show that the proposed algorithm achieves higher peak signal-to-noise ratio values (47.66 dB to 48.04 dB) and lower M-SVD values (8.84 to 15.6) when we embedded a watermark into the HH band with a gain factor of 42, which means the proposed algorithm is good enough in terms of imperceptibility. In addition, the proposed algorithm guarantees robustness against various image processing attacks, such as noise addition, filtering, cropping, and JPEG compression yielding higher normalized correlation values (0.7193 to 1).

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.2
• /
• pp.111-119
• /
• 2013

Face recognition has recently become one of the most popular research areas in the fields of computer vision, machine learning, and pattern recognition because it spans numerous applications, such as access control, surveillance, security, credit-card verification, and criminal identification. In this paper, we propose a simple descriptor called an ECSP(Extended Center-Symmetric Pattern) for illumination-robust face recognition. The ECSP operator encodes the texture information of a local face region by emphasizing diagonal components of a previous CS-LBP(Center-Symmetric Local Binary Pattern). Here, the diagonal components are emphasized because facial textures along the diagonal direction contain much more information than those of other directions. The facial texture information of the ECSP operator is then used as the input image of an image covariance-based feature extraction algorithm such as 2D-PCA(Two-Dimensional Principal Component Analysis). Performance evaluation of the proposed approach was carried out using various binary pattern operators and recognition algorithms on the Yale B database. The experimental results demonstrated that the proposed approach achieved better recognition accuracy than other approaches, and we confirmed that the proposed approach is effective against illumination variation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3806-3825
• /
• 2016

This paper brings out a neoteric frame of reference for visual semantic based 3d video search and retrieval applications. Newfangled 3D retrieval application spotlight on shape analysis like object matching, classification and retrieval not only sticking up entirely with video retrieval. In this ambit, we delve into 3D-CBVR (Content Based Video Retrieval) concept for the first time. For this purpose we intent to hitch on BOVW and Mapreduce in 3D framework. Here, we tried to coalesce shape, color and texture for feature extraction. For this purpose, we have used combination of geometric & topological features for shape and 3D co-occurrence matrix for color and texture. After thriving extraction of local descriptors, TB-PCT (Threshold Based- Predictive Clustering Tree) algorithm is used to generate visual codebook. Further, matching is performed using soft weighting scheme with L₂ distance function. As a final step, retrieved results are ranked according to the Index value and produce results .In order to handle prodigious amount of data and Efficacious retrieval, we have incorporated HDFS in our Intellection. Using 3D video dataset, we fiture the performance of our proposed system which can pan out that the proposed work gives meticulous result and also reduce the time intricacy.