• Title/Summary/Keyword: preserve

Search Result 2,252, Processing Time 0.026 seconds

Linear operators that preserve spanning column ranks of nonnegative matrices

  • Hwang, Suk-Geun;Kim, Si-Ju;Song, Seok-Zun
    • Journal of the Korean Mathematical Society
    • /
    • v.31 no.4
    • /
    • pp.645-657
    • /
    • 1994
  • If S is a semiring of nonnegative reals, which linear operators T on the space of $m \times n$ matrices over S preserve the column rank of each matrix\ulcorner Evidently if P and Q are invertible matrices whose inverses have entries in S, then $T : X \longrightarrow PXQ$ is a column rank preserving, linear operator. Beasley and Song obtained some characterizations of column rank preserving linear operators on the space of $m \times n$ matrices over $Z_+$, the semiring of nonnegative integers in [1] and over the binary Boolean algebra in [7] and [8]. In [4], Beasley, Gregory and Pullman obtained characterizations of semiring rank-1 matrices and semiring rank preserving operators over certain semirings of the nonnegative reals. We considers over certain semirings of the nonnegative reals. We consider some results in [4] in view of a certain column rank instead of semiring rank.

  • PDF

Iterative SAR Segmentation by Fuzzy Hit-or-Miss and Homogeneity Index

  • Intajag Sathit;Chitwong Sakreya;Tipsuwanporn Vittaya
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.111-114
    • /
    • 2004
  • Object-based segmentation is the first essential step for image processing applications. Recently, SAR (Synthetic Aperture Radar) segmentation techniques have been developed, however not enough to preserve the significant information contained in the small regions of the images. The proposed method is to partition an SAR image into homogeneous regions by using a fuzzy hit-or-miss operator with an inherent spatial transformation, which endows to preserve the small regions. In our algorithm, an iterative segmentation technique is formulated as a consequential process. Then, each time in iterating, hypothesis testing is used to evaluate the quality of the segmented regions with a homogeneity index. The segmentation algorithm is unsupervised and employed few parameters, most of which can be calculated from the input data. This comparative study indicates that the new iterative segmentation algorithm provides acceptable results as seen in the tested examples of satellite images.

  • PDF

The Study on Removing Random-valued Impulse Noise

  • Yinyu, Gao;Kim, Nam-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.05a
    • /
    • pp.333-335
    • /
    • 2011
  • In the transmitting process of image processing system, images always be corrupted by impulse noise, especially random-valued impulse noise. So removing the random-valued impulse noise is very important, but it is also one of the most difficult case in image processing. The most famous method is the standard median filter, but at edge, the filter has a special feature which has a tendency to decrease the preserve. As a result, we proposed a filter that detection random-valued impulse noise firstly, next to use efficient method to remove the noise and preserve the details. And through the simulation, we compared with the algorithms and indicated that proposed method significant improvement over many other existing algorithms.

  • PDF

A Plans for Preservation and Distribution of Ilex cornuta Community Mt. Keumsung (Naju, Chollanamdo)

  • Kim, Ha-Song
    • Plant Resources
    • /
    • v.1 no.2
    • /
    • pp.105-108
    • /
    • 1998
  • These studies had performed a plans for preservation and distribution of Ilex cormuta community Mt. Keumsung($35^{\circ}05'\;N,\;126^{\circ}04'\;E$) in Naju, Chonnam from Arpil, 1997 to October by Braun-Blanquet' method(1964). According to the vegetation table of community, the plant communities of the investigated sites were classified Ilex corunta-Trachelospermum asiaticum var. intermedium commnity. Now there still remains the natural environment to be developed in coast district around the riverside distributing Ilex cornuta Lindl., so it has scientifically high value to predict change of the ecosystem and preserve the community distribution. It needs plan for preservation high value to predict change of the ecosystem and preserve the community distribution. It needs plan for preservation

  • PDF

ISOLATION NUMBERS OF INTEGER MATRICES AND THEIR PRESERVERS

  • Beasley, LeRoy B.;Kang, Kyung-Tae;Song, Seok-Zun
    • Bulletin of the Korean Mathematical Society
    • /
    • v.57 no.3
    • /
    • pp.535-545
    • /
    • 2020
  • Let A be an m × n matrix over nonnegative integers. The isolation number of A is the maximum number of isolated entries in A. We investigate linear operators that preserve the isolation number of matrices over nonnegative integers. We obtain that T is a linear operator that strongly preserve isolation number k for 1 ≤ k ≤ min{m, n} if and only if T is a (P, Q)-operator, that is, for fixed permutation matrices P and Q, T(A) = P AQ or, m = n and T(A) = P AtQ for any m × n matrix A, where At is the transpose of A.

LINEAR OPERATORS THAT PRESERVE PERIMETERS OF MATRICES OVER SEMIRINGS

  • Song, Seok-Zun;Kang, Kyung-Tae;Beasley, Leroy B.
    • Journal of the Korean Mathematical Society
    • /
    • v.46 no.1
    • /
    • pp.113-123
    • /
    • 2009
  • A rank one matrix can be factored as $\mathbf{u}^t\mathbf{v}$ for vectors $\mathbf{u}$ and $\mathbf{v}$ of appropriate orders. The perimeter of this rank one matrix is the number of nonzero entries in $\mathbf{u}$ plus the number of nonzero entries in $\mathbf{v}$. A matrix of rank k is the sum of k rank one matrices. The perimeter of a matrix of rank k is the minimum of the sums of perimeters of the rank one matrices. In this article we characterize the linear operators that preserve perimeters of matrices over semirings.

CHARACTERIZATIONS OF BOOLEAN RANK PRESERVERS OVER BOOLEAN MATRICES

  • Beasley, Leroy B.;Kang, Kyung-Tae;Song, Seok-Zun
    • The Pure and Applied Mathematics
    • /
    • v.21 no.2
    • /
    • pp.121-128
    • /
    • 2014
  • The Boolean rank of a nonzero m $m{\times}n$ Boolean matrix A is the least integer k such that there are an $m{\times}k$ Boolean matrix B and a $k{\times}n$ Boolean matrix C with A = BC. In 1984, Beasley and Pullman showed that a linear operator preserves the Boolean rank of any Boolean matrix if and only if it preserves Boolean ranks 1 and 2. In this paper, we extend this characterization of linear operators that preserve the Boolean ranks of Boolean matrices. We show that a linear operator preserves all Boolean ranks if and only if it preserves two consecutive Boolean ranks if and only if it strongly preserves a Boolean rank k with $1{\leq}k{\leq}min\{m,n\}$.

Directions of Military Structure Improvement Preparing for Future Warfare (미래전쟁에 대비한 군 구조 개선방향)

  • Kim, Yong-Hyeon
    • Journal of National Security and Military Science
    • /
    • s.2
    • /
    • pp.91-119
    • /
    • 2004
  • Development of science technology, computer network and software technology has not only changed various areas of the society, but also brought rapid change in the condition and the way of performing war. Historical lessons learned from the war in Iraq tells that military capabilities corresponding to the new paradigms of war needs to be assured in order to preserve national interest and take victory in future warfare. Thus, the performance in the latest war in Iraq, the estimated performance in future war and the performance of war in the Korean Peninsula has been put together and analyzed to indicate the direction our force should be built and the structure to be improved. Under all circumstances and threats the military must defend our nation and territory. When war breaks out the military must perform it's basic duty to end war by decisive operations. As the saying is "To preserve peace, prepare for war," continuous increase of military strength and improvement of military structure corresponding to the change of national security environment and weapon system is necessary.

  • PDF

Sub-1.2-V 1-Gb Mobile DRAM with Ultra-low Leakage Current (극저 누설전류를 가지는 1.2V 모바일 DRAM)

  • Park, Sang-Kyun;Seo, Dong-Il;Jun, Young-Hyun;Kong, Bai-Sun
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.433-434
    • /
    • 2007
  • This paper describes a low-voltage dynamic random-access memory (DRAM) focusing on subthreshold leakage reduction during self-refresh (sleep) mode. By sharing a power switch, multiple iterative circuits such as row and column decoders have a significantly reduced subthreshold leakage current. To reduce the leakage current of complex logic gates, dual channel length scheme and input vector control method are used. Because all node voltages during the standby mode are deterministic, zigzag super-cutoff CMOS is used, allowing to Preserve internal data. MTCMOS technique Is also used in the circuits having no need to preserve internal data. Sub-1.2-V 1-Gb mobile DDR DRAM employing all these low-power techniques was designed in a 60 nm CMOS technology and achieved over 77% reduction of overall leakage current during the self-refresh mode.

  • PDF

Mixed Weighted Filter for Removing Gaussian and Impulse Noise

  • Yinyu, Gao;Kim, Nam-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.379-381
    • /
    • 2011
  • The image signal is often affected by the existence of noise, noise can occur during image capture, transmission or processing phases. noises caused the degradation phenomenon and demage the original signal information. Many studies are being accomplished to restore those signals which corrupted by mixed noise. In this paper, we proposed mixed weighted filter for removing Gaussian and impulse noise. we first charge the noise type, then, Gaussian is removed by a weighted mean filter and impulse noise is removed by self-adaptive weighted median filter that can not only remove mixed noise but also preserve the details. And through the simulation, we compared with the conventional algorithms and indicated that proposed method significant improvement over many other existing algorithms and can preserve image details efficiently.

  • PDF