• Title/Summary/Keyword: Non-separable Processing

Search Result 8, Processing Time 0.024 seconds

Digital Image Processing Using Non-separable High Density Discrete Wavelet Transformation (비분리 고밀도 이산 웨이브렛 변환을 이용한 디지털 영상처리)

  • Shin, Jong Hong
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.1
    • /
    • pp.165-176
    • /
    • 2013
  • This paper introduces the high density discrete wavelet transform using quincunx sampling, which is a discrete wavelet transformation that combines the high density discrete transformation and non-separable processing method, each of which has its own characteristics and advantages. The high density discrete wavelet transformation is one that expands an N point signal to M transform coefficients with M > N. The high density discrete wavelet transformation is a new set of dyadic wavelet transformation with two generators. The construction provides a higher sampling in both time and frequency. This new transform is approximately shift-invariant and has intermediate scales. In two dimensions, this transform outperforms the standard discrete wavelet transformation in terms of shift-invariant. Although the transformation utilizes more wavelets, sampling rates are high costs and some lack a dominant spatial orientation, which prevents them from being able to isolate those directions. A solution to this problem is a non separable method. The quincunx lattice is a non-separable sampling method in image processing. It treats the different directions more homogeneously than the separable two dimensional schemes. Proposed wavelet transformation can generate sub-images of multiple degrees rotated versions. Therefore, This method services good performance in image processing fields.

A Study on Enhancement of Digital Image Performance Using Dual Tree Wavelet Transformation in Non-separable Image Processing (비분리 영상처리에서 이중 트리 웨이브렛 변환을 사용한 디지털 영상 성능 개선에 관한 연구)

  • Lim, Joong-Hee;Jee, Inn-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.1
    • /
    • pp.65-74
    • /
    • 2012
  • In this paper, we explore the application of 2-D dual-tree discrete wavelet transform (DDWT), which is a directional and redundant transform, for image coding. DDWT introduces limited redundancy and allows the transform to provide approximate shift invariance and directionally selective filters while preserving the usual properties of perfect reconstruction and computational efficiency with good well-balanced frequency responses. Also, quincunx lattice yields a non separable 2D-wavelet transform, which is also symmetric in both horizontal and vertical direction. And non-separable wavelet transformation can generate sub-images of multiple degrees rotated versions. The proposed 2-D non-separable DDWT can provide efficient approximation for directional features of images schemes, such as edges and contours in images that are not aligned with the horizontal or vertical direction. Finally, non-separable image processing using DDWT services good performance.

Dual-tree Wavelet Discrete Transformation Using Quincunx Sampling For Image Processing (디지털 영상 처리를 위한 Quincunx 표본화가 사용된 이중 트리 이산 웨이브렛 변환)

  • Shin, Jong Hong
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.7 no.4
    • /
    • pp.119-131
    • /
    • 2011
  • In this paper, we explore the application of 2-D dual-tree discrete wavelet transform (DDWT), which is a directional and redundant transform, for image coding. DDWT main property is a more computationally efficient approach to shift invariance. Also, the DDWT gives much better directional selectivity when filtering multidimensional signals. The dual-tree DWT of a signal is implemented using two critically-sampled DWTs in parallel on the same data. The transform is 2-times expansive because for an N-point signal it gives 2N DWT coefficients. If the filters are designed is a specific way, then the sub-band signals of the upper DWT can be interpreted as the real part of a complex wavelet transform, and sub-band signals of the lower DWT can be interpreted as the imaginary part. The quincunx lattice is a sampling method in image processing. It treats the different directions more homogeneously than the separable two dimensional schemes. Quincunx lattice yields a non separable 2D-wavelet transform, which is also symmetric in both horizontal and vertical direction. And non-separable wavelet transformation can generate sub-images of multiple degrees rotated versions. Therefore, non-separable image processing using DDWT services good performance.

Quincunx Sampling Method for Performance Improvement of 2D High-Density Wavelet Transformation (2차원 고밀도 이산 웨이브렛 변환의 성능 향상을 위한 Quincunx 표본화 기법)

  • Lim, Joong-Hee;Shin, Jong-Hong;Jee, Inn-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.4
    • /
    • pp.179-191
    • /
    • 2013
  • The quincunx lattice is a non-separable sampling method in image processing. It treats the different directions more homogeneously and good frequency property than the separable two dimensional schemes. The high density discrete wavelet transformation is one that expands an N point signal to M transform coefficients with M > N. In two dimensions, this transform outperforms the standard discrete wavelet transformation in terms of shift-invariant. Although the transformation utilizes more wavelets, sampling rates are high costs. This paper proposed the high density discrete wavelet transform using quincunx sampling, which is a discrete wavelet transformation that combines the high density discrete transformation and non-separable processing method, each of which has its own characteristics and advantages. Proposed wavelet transformation can service good performance in image processing fields.

The study of New Compression method using Contourlet transform (Contourlet 변환을 이용한 새로운 압축방법에 대한 연구)

  • Chong, Hyun-Jin;Jang, Jun-Ho;Kim, Young-Seop
    • Journal of the Semiconductor & Display Technology
    • /
    • v.6 no.3
    • /
    • pp.55-59
    • /
    • 2007
  • Wavelet Transform is amenable to efficient algorithms. So wavelet transform was adopted many signal processing and communication applications. For example, the wavelet transform was adopted as the transform for JPEG2000. However, Wavelet has weakness about smoothness along the contours and limited directional information. Hence, recently, some new transforms have been introduced to take advantage of this property. So we use to other transform, called contourlet transform in compression. In this paper, we propose a new method for image compression based on the contourlet transform, which has been recently introduced. Contourlet transform has a good result about images with smooth contours. Moreover, Contourlet is feasible multiresolution and multidirection expansion using non-separable filter bank. This treatise shows a good image representation after compressing using contourlet transform.

  • PDF

Optimal Design of Nonsequential Batch-Storage Network (비순차 회분식 공정-저장조 망구조 최적 설계)

  • 이경범;이의수
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.5
    • /
    • pp.407-412
    • /
    • 2003
  • An effective methodology is .reported for determining the optimal capacity (lot-size) of batch processing and storage networks which include material recycle or reprocessing streams. We assume that any given storage unit can store one material type which can be purchased from suppliers, be internally produced, internally consumed and/or sold to customers. We further assume that a storage unit is connected to all processing stages that use or produce the material to which that storage unit is dedicated. Each processing stage transforms a set of feedstock materials or intermediates into a set of products with constant conversion factors. The objective for optimization is to minimize the total cost composed of raw material procurement, setup and inventory holding costs as well as the capital costs of processing stages and storage units. A novel production and inventory analysis formulation, the PSW(Periodic Square Wave) model, provides useful expressions for the upper/lower bounds and average level of the storage inventory hold-up. The expressions for the Kuhn-Tucker conditions of the optimization problem can be reduced to two subproblems. The first yields analytical solutions for determining batch sizes while the second is a separable concave minimization network flow subproblem whose solution yields the average material flow rates through the networks. For the special case in which the number of storage is equal to the number of process stages and raw materials storage units, a complete analytical solution for average flow rates can be derived. The analytical solution for the multistage, strictly sequential batch-storage network case can also be obtained via this approach. The principal contribution of this study is thus the generalization and the extension to non-sequential networks with recycle streams. An illustrative example is presented to demonstrate the results obtainable using this approach.

A Study on the Performance Improvement of Over-sampled Discrete Wavelet Transform (과표본화된 이산 웨이브렛 변환의 성능 향상에 관한 연구)

  • Jee, Innho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.1
    • /
    • pp.77-83
    • /
    • 2014
  • Over-sampled discrete wavelet transformation is one way to overcome the disadvantages of the standard wavelet transform of shift invariance even though it increases the number of subband signals. Non-separable based discrete wavelet transform is efficient that it satisfies shift invariance and directional selectivity. In this paper, since efficient over-sampled wavelet transform is possible in a two-dimensional image processing, we show that the proposed method is well applied with performance improvement of digital image and noise removal.

Corporate Bond Rating Using Various Multiclass Support Vector Machines (다양한 다분류 SVM을 적용한 기업채권평가)

  • Ahn, Hyun-Chul;Kim, Kyoung-Jae
    • Asia pacific journal of information systems
    • /
    • v.19 no.2
    • /
    • pp.157-178
    • /
    • 2009
  • Corporate credit rating is a very important factor in the market for corporate debt. Information concerning corporate operations is often disseminated to market participants through the changes in credit ratings that are published by professional rating agencies, such as Standard and Poor's (S&P) and Moody's Investor Service. Since these agencies generally require a large fee for the service, and the periodically provided ratings sometimes do not reflect the default risk of the company at the time, it may be advantageous for bond-market participants to be able to classify credit ratings before the agencies actually publish them. As a result, it is very important for companies (especially, financial companies) to develop a proper model of credit rating. From a technical perspective, the credit rating constitutes a typical, multiclass, classification problem because rating agencies generally have ten or more categories of ratings. For example, S&P's ratings range from AAA for the highest-quality bonds to D for the lowest-quality bonds. The professional rating agencies emphasize the importance of analysts' subjective judgments in the determination of credit ratings. However, in practice, a mathematical model that uses the financial variables of companies plays an important role in determining credit ratings, since it is convenient to apply and cost efficient. These financial variables include the ratios that represent a company's leverage status, liquidity status, and profitability status. Several statistical and artificial intelligence (AI) techniques have been applied as tools for predicting credit ratings. Among them, artificial neural networks are most prevalent in the area of finance because of their broad applicability to many business problems and their preeminent ability to adapt. However, artificial neural networks also have many defects, including the difficulty in determining the values of the control parameters and the number of processing elements in the layer as well as the risk of over-fitting. Of late, because of their robustness and high accuracy, support vector machines (SVMs) have become popular as a solution for problems with generating accurate prediction. An SVM's solution may be globally optimal because SVMs seek to minimize structural risk. On the other hand, artificial neural network models may tend to find locally optimal solutions because they seek to minimize empirical risk. In addition, no parameters need to be tuned in SVMs, barring the upper bound for non-separable cases in linear SVMs. Since SVMs were originally devised for binary classification, however they are not intrinsically geared for multiclass classifications as in credit ratings. Thus, researchers have tried to extend the original SVM to multiclass classification. Hitherto, a variety of techniques to extend standard SVMs to multiclass SVMs (MSVMs) has been proposed in the literature Only a few types of MSVM are, however, tested using prior studies that apply MSVMs to credit ratings studies. In this study, we examined six different techniques of MSVMs: (1) One-Against-One, (2) One-Against-AIL (3) DAGSVM, (4) ECOC, (5) Method of Weston and Watkins, and (6) Method of Crammer and Singer. In addition, we examined the prediction accuracy of some modified version of conventional MSVM techniques. To find the most appropriate technique of MSVMs for corporate bond rating, we applied all the techniques of MSVMs to a real-world case of credit rating in Korea. The best application is in corporate bond rating, which is the most frequently studied area of credit rating for specific debt issues or other financial obligations. For our study the research data were collected from National Information and Credit Evaluation, Inc., a major bond-rating company in Korea. The data set is comprised of the bond-ratings for the year 2002 and various financial variables for 1,295 companies from the manufacturing industry in Korea. We compared the results of these techniques with one another, and with those of traditional methods for credit ratings, such as multiple discriminant analysis (MDA), multinomial logistic regression (MLOGIT), and artificial neural networks (ANNs). As a result, we found that DAGSVM with an ordered list was the best approach for the prediction of bond rating. In addition, we found that the modified version of ECOC approach can yield higher prediction accuracy for the cases showing clear patterns.