Computer Engineering and Applications ›› 2012, Vol. 48 ›› Issue (22): 151-155.
Previous Articles Next Articles
LIU Jinjin, YAN Lin, LI Zhuowen
Online:
Published:
刘金金,闫 林,李卓文
Abstract: Based on an information system, n-order-granule partitions are introduced in this paper, which make the information system achieve different granule’s degrees, so that granular structures are obtained. Furthermore, by arranging elements of the universe with a special way, and after integrating n-order-granule partitions with upper approximation, a data hiding and recognizing method is established, which plays an important role in this area. Moreover, by adjusting the order of the elements of the universe, the data hiding and recognizing are more flexible. Therefore, data hide and recognition can be realized in variable ways.
Key words: n-order-granule partitions, upper approximation, data recognition, data hiding
摘要: 在传统信息系统中引入了n阶粒划分的概念,使信息系统通过n阶粒划分得以粒化,并随着n阶粒划分的变化呈现不同的粒化结构。进而,经对论域对象的特定排序,并通过对上近似和n阶粒划分的融合,确定了一种数据隐含与数据识别的方法,使在数据隐含与数据识别中具有独特的作用。通过调整论域对象的排列顺序,使得数据隐含与数据识别更具灵活性,达到了相同数据隐含及识别的多样性目的。
关键词: n阶粒划分, 上近似, 数据识别, 数据隐含
LIU Jinjin, YAN Lin, LI Zhuowen. Upper approximation and data recognition based on data arranging[J]. Computer Engineering and Applications, 2012, 48(22): 151-155.
刘金金,闫 林,李卓文. 数据排列的上近似与数据识别[J]. 计算机工程与应用, 2012, 48(22): 151-155.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2012/V48/I22/151