Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shulan Deng

dblp:52/5925 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2002
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Image and video processing · 56% Image and video coding · 44%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing › binary image processing
connected component labeling
0.012002
An Algorithm with Reduced Operations for Connected Components Detection in ITU-T Group 3/4 Coded Images · IEEE Trans. Pattern Anal. Mach. Intell. 2002
Image and video coding › document image compression
facsimile coding
0.012002
An Algorithm with Reduced Operations for Connected Components Detection in ITU-T Group 3/4 Coded Images · IEEE Trans. Pattern Anal. Mach. Intell. 2002

Methods — techniques the papers use, named apart from their topics

MH/MR/MMR decoding · 0.0
YearPublicationVenuePosition
2002 An Algorithm with Reduced Operations for Connected Components Detection in ITU-T Group 3/4 Coded Images
abstract
An algorithm, which performs connected components detection in the course of decoding ITU-T (former CCITT) facsimile Group 3/4, i.e., MH/MR/MMR compressed images is presented. New definitions of mode color and a new transition element are introduced that allow MR/MMR codes to analyze and derive information about connection of black runs in two adjacent scan lines in the course of decoding. The experiments on the standard set of eight CCITT documents have shown that, on the average, the complexity of direct processing of MR/MMR codes is lower by a factor of 20 and 2.5 than that for raster images and MH codes processing respectively. Data structures for image vector description are discussed.
Emma E. Regentova, Shahram Latifi, Shulan Deng, Dongsheng Yao
IEEE Trans. Pattern Anal. Mach. Intell.3
2001 Images similarity estimation by processing compressed data
Emma E. Regentova, Shahram Latifi, Shulan Deng
Image Vis. Comput.3
2001 Document segmentation using polynomial spline wavelets
Shulan Deng, Shahram Latifi, Emma E. Regentova
Pattern Recognit.1
1998 Document Image Analysis Using a New Compression Algorithm
Shulan Deng, Shahram Latifi, Junichi Kanai
Document Analysis Systems1
1998 Manipulation of text documents in the modified Group 4 domain
abstract
This paper presents a novel approach to document image compression that is efficient in both compression and processing flexibility. By proper exploitation of the structural characteristics of compressed data, one may obtain high performance for image operations with low complexity. Based on CCITT Group 4, an improved coding scheme (MG4), which exploits the 2-dimensional correlation between scan lines, is developed. Then such operations as skew detection, skew correction and connected component extraction are investigated and implemented. These operations are shown to run faster in the compressed domain than traditional methods.
Shulan Deng, Shahram Latifi, Junichi Kanai
MMSP1