• 반도체디스플레이기술학회지
• /
• 제19권3호
• /
• pp.7-11
• /
• 2020

Enormous methods have been proposed for the detection and segmentation of blur and non-blur regions of the images. Due to the limited available information about the blur type, scenario and the level of blurriness, detection and segmentation is a challenging task. Hence, the performance of the blur measure operators is an essential factor and needs improvement to attain perfection. In this paper, we propose an effective blur measure based on the local binary pattern (LBP) with the adaptive threshold for blur detection. The sharpness metric developed based on LBP uses a fixed threshold irrespective of the blur type and level which may not be suitable for images with large variations in imaging conditions and blur type and level. Contradictory, the proposed measure uses an adaptive threshold for each image based on the image and the blur properties to generate an improved sharpness metric. The adaptive threshold is computed based on the model learned through the support vector machine (SVM). The performance of the proposed method is evaluated using a well-known dataset and compared with five state-of-the-art methods. The comparative analysis reveals that the proposed method performs significantly better qualitatively and quantitatively against all the methods.

• 정보처리학회논문지B
• /
• 제15B권6호
• /
• pp.533-542
• /
• 2008

동영상에서의 배경제거는 다양한 실시간 머신 비젼 응용에서 매우 중요한 단계이다. 본 논문에서는 이러한 배경제거를 위한 육각화소 기반의 새로운 접근 방법을 제안한다. 일반적으로 육각형 샘플링 영상은 양자화 오차가 적으며, 이웃화소의 연결성 정의를 크게 개선한다고 알려져 있는데, 제안된 방법은 비매개변수형 배경제거 방법의 하나인 지역적 이진패턴 기반 알고리즘에 이러한 육각 샘플링 영상을 적용하는 것을 특징으로 한다. 이를 통해, 지역적 이진패턴의 추출과정에서 필요한 쌍선형 보간을 없애고 계산량을 줄일 수 있었다. 실험을 통해 이러한 육각화소의 적용이 배경제거 분야에 매우 효율적으로 적용될 수 있음을 확인할 수 있었다.

• International Journal of Computer Science & Network Security
• /
• 제23권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.

• 한국멀티미디어학회논문지
• /
• 제2권2호
• /
• pp.137-144
• /
• 1999

오차확산법은 계조화상을 이진화상으로 재현하는 것이 우수하지만 이진화상에 상관패턴이 생긴다. 본 논문에서는 오차확산계수의 주파수 분석을 통해서 상관패턴을 제거하고 경계를 강조하는 새로운 오차확산계수를 제안한다. 주목화소의 앞줄은 경계를 강조하도록 확산계수를 정하고 주목화소의 앞화소의 확산계수를 계수들이 대칭이 되도록 정한다. 그리고 제안하는 오차확산계수는 1,2로 구성되어 있기 때문에 계산량이 작다. 실험을 통해서 제안하는 확산계수를 이용한 이진화상의 화질이 기존의 확산계수를 이용한 이진화상보다 우수한 것을 보인다.

• International Journal of Computer Science & Network Security
• /
• 제21권8호
• /
• pp.196-202
• /
• 2021

DNA sequencing provides fundamental data in genomics, bioinformatics, biology and many other research areas. With the emergent evolution in DNA sequencing technology, a massive amount of genomic data is produced every day, mainly DNA sequences, craving for more storage and bandwidth. Unfortunately, managing, analyzing and specifically storing these large amounts of data become a major scientific challenge for bioinformatics. Those large volumes of data also require a fast transmission, effective storage, superior functionality and provision of quick access to any record. Data storage costs have a considerable proportion of total cost in the formation and analysis of DNA sequences. In particular, there is a need of highly control of disk storage capacity of DNA sequences but the standard compression techniques unsuccessful to compress these sequences. Several specialized techniques were introduced for this purpose. Therefore, to overcome all these above challenges, lossless compression techniques have become necessary. In this paper, it is described a new DNA compression mechanism of pattern matching extended Compression algorithm that read the input sequence as segments and find the matching pattern and store it in a permanent or temporary table based on number of bases. The remaining unmatched sequence is been converted into the binary form and then it is been grouped into binary bits i.e. of seven bits and gain these bits are been converted into an ASCII form. Finally, the proposed algorithm dynamically calculates the compression ratio. Thus the results show that pattern matching extended Compression algorithm outperforms cutting-edge compressors and proves its efficiency in terms of compression ratio regardless of the file size of the data.

• 산업기술연구
• /
• 제17권
• /
• pp.331-338
• /
• 1997

In this paper, we propose a new neural pattern recognition from wavelet transform. We first analysis in BFT(Binary Field Transform) in character image. The proposed neural network and wavelet transform is able to improve learning time and scaling. The ability and effectiveness of identifying image using the proposed wavelet transform will be demonstrated by computer simulation.

• 전자공학회논문지A
• /
• 제29A권8호
• /
• pp.10-17
• /
• 1992

A new line code design technique based on the BUDA(Binary Unit DSV and ASV) concept is introduced. The new line code called MB34 and designed by this new technique is of the minimum bandwidth, dc-free, and runlength limited. To confirm the performance of the new code, its power spectrum and eye pattern are obtained, wherein spectral nulls at dc(f=0) and Nyguist frequency (f=1/2Ts) are clearly identified. It is also discussed how the transmission errors can be detected by monitoring the DSV, the ASV, and the runlength.

• 디지털산업정보학회논문지
• /
• 제8권2호
• /
• pp.31-40
• /
• 2012

Face recognition refers to the process of identifying individuals based on their facial features. It 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 consumer applications, such as access control, surveillance, security, credit-card verification, and criminal identification. However, illumination variation on face generally cause performance degradation of face recognition systems under practical environments. Thus, this paper proposes an novel face recognition system using a fusion approach based on local binary pattern and two-dimensional principal component analysis. To minimize illumination effects, the face image undergoes the local binary pattern operation, and the resultant image are divided into two sub-images. Then, two-dimensional principal component analysis algorithm is separately applied to each sub-images. The individual scores obtained from two sub-images are integrated using a weighted-summation rule, and the fused-score is utilized to classify the unknown user. The performance evaluation of the proposed system was performed using the Yale B database and CMU-PIE database, and the proposed method shows the better recognition results in comparison with existing face recognition techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1390-1403
• /
• 2016

Facial expression recognition (FER) plays a very significant role in computer vision, pattern recognition, and image processing applications such as human computer interaction as it provides sufficient information about emotions of people. For video-based facial expression recognition, depth cameras can be better candidates over RGB cameras as a person's face cannot be easily recognized from distance-based depth videos hence depth cameras also resolve some privacy issues that can arise using RGB faces. A good FER system is very much reliant on the extraction of robust features as well as recognition engine. In this work, an efficient novel approach is proposed to recognize some facial expressions from time-sequential depth videos. First of all, efficient Local Binary Pattern (LBP) features are obtained from the time-sequential depth faces that are further classified by Generalized Discriminant Analysis (GDA) to make the features more robust and finally, the LBP-GDA features are fed into Hidden Markov Models (HMMs) to train and recognize different facial expressions successfully. The depth information-based proposed facial expression recognition approach is compared to the conventional approaches such as Principal Component Analysis (PCA), Independent Component Analysis (ICA), and Linear Discriminant Analysis (LDA) where the proposed one outperforms others by obtaining better recognition rates.

• Journal of Biosystems Engineering
• /
• 제21권3호
• /
• pp.315-324
• /
• 1996

This study was one of a series of studies on application of machine vision and image processing to extract the geometrical features of plants and to analyze plant growth. Several algorithms were developed to measure morphological properties of plants and describing the growth development of in-situ lettuce(Lactuca sativa L.). Canopy, centroid, leaf density and fractal dimension of plant were measured from a top viewed binary image. It was capable of identifying plants by a thinning top viewed image. Overlapping the thinning side viewed image with a side viewed binary image of plant was very effective to auto-detect meaningful nodes associated with canopy components such as stem, branch, petiole and leaf. And, plant height, stem diameter, number and angle of branches, and internode length and so on were analyzed by using meaningful nodes extracted from overlapped side viewed images. Canopy, leaf density and fractal dimension showed high relation with fresh weight or growth pattern of in-situ lettuces. It was concluded that machine vision system and image processing techniques are very useful in extracting geometrical features and monitoring plant growth, although interactive methods, for some applications, were required.