SJB INSTITUTE OF TECHNOLOGY

KENGERI, BENGALOORU-560 060

PROJECT ON
“Implementation of Mini- PACS in
healthcare systems”
Under the guidance of
BHASKAR.B
SENIOR LECTURER
by
Deepika.P(1JB06EC026) Sneha Rao(1JB06EC101)
Nethravathy.M.P (1JB06EC066) Pooja.B.R(1JB06EC071)

in
Dept of ECE
On : 9th JUNE, 2010
1
 OVERVIEW OF PRESENTATION

 ABSTRACT
 FLOW-CHART FOR COMPRESSION
 EZW
 HUFFMAN CODING
 ARITHMETIC CODING
 FLOW-CHART FOR DECOMPRESSION
 CONCLUSION
 FUTURE SCOPE
 BIBLIOGRAPHY
2
ABSTRACT
 The project deals with the implementation of PACS which will offer picture
viewing, archiving on media, communications using networks and modality
interfaces to health care facility.

 Advances in digital technologies, have progressed to the point that it is

now possible to acquire medical images in digital form, archive them on
computer systems, and display them in diagnostic quality.

BLOCK DIAGRAM DICOM

Modality Database JPEG 2000 JPIP

compression

Editor Decompression
Internet

3
SJBIT, Dept of ECE
PACS and MINI PACS

 A Picture Archiving and Communications System (PACS) typically comprises of

data storage devices, image display devices, database management software and
links to image and/or image data acquisition devices, connected by computer
networks.

 A “mini-PACS” generally refers to a small-scale PACS, usually limited to one

imaging modality or department.

 Typical mini-PACS installation consists of one or more image acquisition

devices of the same modality and one or two workstations allowing retrieval and
display of stored images.

SJBIT, Dept of ECE 4

DICOM

Digital Imaging and Communications in Medicine (DICOM) is a

standard for handling, storing, printing, and transmitting
information in medical imaging

DICOM enables the integration of scanners, servers,

workstations, printers, and network hardware from multiple
manufacturers into a picture archiving and communication
system (PACS).

5
SJBIT, Dept of ECE
 JPEG 2000

 Wavelet based image compression standard

 Suitable for large data
 Multi resolution facility
 Possibility to store image code blocks in layers
 Random access to bit stream and ROI coding

6
SJBIT, Dept of ECE
FLOWCHART FOR COMPRESSION

STAA
START
AAA

READ IMAGE ARITHMETIC

ENCODE

DISPLAY
UNCOMPRESSED IMAGE
STAA
STOP
AAA

REMOVE DC
COMPONENT OF
IMAGE

FIND WT OF
IMAGE

EZW ENCODE
THE IMAGE

HUFFMAN
CODING

7
EMBEDDED ZERO TREE WAVELET

 This compression technique exploits self similarity

between sub-bands.
E – based on EMBEDDED ENCODING
Z – data structure called ZERO TREE used
W – specially designed for WAVELET TRANSFORM
 It is divided into two parts:
dominant pass
subordinate pass

8
SJBIT, Dept of ECE
EZW ENCODE
START

PERFORM SUB
CALCULATE
ORDINATE PASS
MORTAN SCAN
ORDER

THRESHOLD =
CALCULATE
THRESHOLD/2
INITIAL
THRESHOLD

THRESHOLD N
STOP
>= FINAL
THRESHOLD

Y
PERFORM
DOMINANT
PASS

REARRANGE IN
MORTON SCAN
ORDER

9
DOMINANT PASS

CURRENT
N ROW AND
WRITE ENCODED
COLUMN <
VALUE IN
DIMENTION
SUBORDINATE
/2
START LIST

Y
CREATE MASK AND
SELECT THE CO-EFF
MASK ‘0’ IN
FALLING UNDER THE
WAVELET
NODE
MATRIX
WAVELET
COEFF>
N Y
THRESHOLD
ANY NON-ZERO N
STOP ELEMENT >=
Y THRESHOLD

POSITIVE
N Y
NUMBER ENCODE AS ‘N’
?
ENCODE AS ‘Z’

ENCODE AS ‘P’ ENCODE AS ‘T’

(ISOLATED ZERO)

10
SUBORDINATE PASS
START

IS RE-
CONSTRUCT N
ED VALUE < ADD ‘0’
WAVELET
CO-EFF

Y UPDATE SUBORDINATE
LIST BY SUBTRACTING
THRESHOLD / 4
ADD 1

UPDATE SUBORDINATE
LIST BY ADDING
THRESHOLD / 4

STOP

11
HUFFMAN CODING

 It is an entropy encoding algorithm used for lossless

data compression
 Uses a specific method for choosing the
representation for each symbol resulting in prefix
code
 Huffman was able to design most efficient
compression method
 Application: used because of its simplicity, high
speed

12
SJBIT, Dept of ECE
HUFFMAN CODING
START

GET THE NEXT ELEMENT

IN ROW

N N N
CO- CO- CO-
EFFICIENT = EFFICIENT = EFFICIENT = ENCODE AS ‘1110’
‘T’ ‘Z’ ‘N’

Y Y Y
ENCODE AS ‘0’ ENCODE AS ‘10’ ENCODE AS ‘110’

N
END OF
ROW

Y
N
END OF
INSERT ‘1111’ STRING

Y 13
INSERT ‘11111’

STRING N
LENGTH APPEND ‘0’ UNTIL
MULTIPL STRING LENGTH IS
E OF 8 MULTIPLE OF 8

STOP

14
ARITHMETIC CODING

Is a compression technique that encodes by creating a code string

which represents a fractional value between 0 & 1.

Bypasses the idea of replacing an input symbol with a specific code.

Instead it takes a stream of input symbols and replaces it with a single

floating point output number.

Output of arithmetic coding is a single number less than 1 and greater

than or equal to zero.

So to construct output number the symbols being encoded have to set
probabilities assigned to them.

15
SJBIT, Dept of ECE
ARITHMETIC CODING
START

GET THE NEXT

IS INPUT N
DECODE CHARACTER
ARRAY?

Y
HIGH=LOW+RANGE*HIGHRANGE(SYMBOL)
LOW=LOW+RANGE*LOWRANGE(SYMBOL)
GIVE PROBABILITY VALUE
TO EACH CHARACTER
END OF N
ARRAY?
ASSIGN RANGE TO EACH Y
CHARACTER
OUTPUT
LOW
INITIALIZE HIGH=2^(K-1)
LOW=0
STOP

16
DECOMPRESSION

START

ARITHMETIC
DECODING ADD DC COMPONENT

HUFFMAN SHOW IMAGE

DECODING

STOP
EZW DECODE

INVERSE WAVELET
TRANSFORM

17
 CONCLUSION
The compression ratios obtained when set a threshold of 2048 are:-
Huffman coding - 7281.8
Arithmetic coding – 5041.2

ORIGINAL IMAGE COMPRESSED IMAGE

18
SJBIT, Dept of ECE
 FUTURE SCOPE

The embedded block coding algorithm

achieves excellent compression performance,
usually higher than that of EZW with
arithmetic coding.
The coder offers additional advantages
including memory locality, spatial random
access and ease of geometric manipulation.

19
SJBIT, Dept of ECE
BIBLIOGRAPHY
[1] Jonathan E. Turner, “A Beginner’s Guide to PACS”, 2002

[2] Michael J. Gormish, Daniel Lee, Michael W. Marcellin, “JPEG 2000: OVERVIEW,
ARCHITECTURE, AND APPLICATIONS”, 2002.

[3] M. Boliek, S. Houchin, G. Wu, “JPEG 2000 Next Generation Image Compression System:
Features and Syntax,” Proceedings ICIP-2000, Sept. 2000.

[4] Lecture Notes on Wavelet Transforms, Ambikairajah E., (University of New South Wales,
2000).

[5] G. Kaiser, A Friendly Guide to Wavelets, Birkhauser, Boston, 1994.

[6] Arno Swart, “An introduction to JPEG2000-like compression using MATLAB”, 2003.

[7] Balaji Vasan Srinivasan, “Image Compression Using Embedded Zero-tree WaveletCoding
(EZW)”, 2003.

[8] Thomas Stahlbuhk, Hourieh Fakourfar, “The Embedded Zerotree Wavelet Algorithm”,
2002.
20
21