text:
Official Jellybean 4.1.2 XXAMH2 firmware Update for Galaxy W I8150
We have applied Jellybean 4.1.2 on Samsung Galaxy W I8150 unofficially but now here is the manual official update available for the device. The user who didn't received or able to update through OTA can go for manual update. Since it is an official update which will revoke the root access and user have to root their device again. Well, this Jellybean update is dubbed as XXAMH2 and rolls the fixation of camera and over heating of battery. Anyways check out the article for procedure, downloads and requirements for the update.
Caution: Pamandroid will not take any responsibility of damage or loss of data. The entire risk is on user.
- Galaxy W I8150 rooted or unrooted
- Computer with data connectivity to download the required from here to computer
- Original USB cable
- Charge your device before going through this process or maintain at least 60% power to make sure that the phone does not get turned off during the process.
- Back up your phone data such as SMS, MMS, contacts, call logs, multimedia etc with KIES or through any medium, so that they don't get wiped out during procedure.
- Disable the security in your computer and uninstall them in your phone to avoid unnecessary interruption.
- Enable the USB Debugging by tapping on Settings-> Applications-> Development-> tick the USB debugging. Don't forget to untick USB Debugging after everything is completed.
Official Jellybean 4.1.2 XXAMH2 firmware pack (cf2.me/1rZp)
ODIN (cf.ly/1mu7)
Steps to Update Galaxy W I8150 with Official Jellybean 4.1.2 XXAMH2 firmware
Step 1: First check the model number by settings-> about phone-> model number and then go for the download of Jellybean 4.1.2 package zip and odin from above given link into your computer.
Step 2: Extract both the files using software and place them in desktop.
Step 3: Double click on Odin to launch it and check out few things are enabled or not like Auto Reboot and F.Reset Time. But uncheck the Re-partition box.
Step 4: In the meanwhile switch off the Galaxy smarphone and put it in download mode by pressing the Volume down key+ home+ power button. Now connect it to computer via USB cable.
Step 5: As soon as it is connected, in the odin panel the ID:COM box turns yellow and the flashing can be done.
Step 6: Click on PDA and select the tar file and hit the Start button. It will take around 4 minutes to complete the flashing of firmware pack on Galaxy W. When it is done detach the cable.
Step 7: The device is updated and now enable the internet and sign in into Google account and use the way you want.
Voila! You have successfully learned the procedure to Update Galaxy W I8150 with Official Jellybean 4.1.2 XXAMH2 firmware. Check the firmware by settings->about phone->firmware. Do like our Facebook and Google+ page and stay connected for more updates.
Related Posts


text:
Dear Customer!
Thank you for visiting our website! We are looking forward to serving you!
We are a well-known grocery delivery company in Outer Banks, NC. We have been serving visitors of Outer Banks since 2005. The main purpose of our company is to be your personal shopper while you are enjoying your time-off in this beautiful seashore. Leave the grocery store visit to us, so you can spend your time some place that's more fun and less-stressful.
Hours of Operation:
We operate year around, 7 days a week. Delivery time: 9 am – 9 pm
Delivery Fee:

subset: commoncrawl


text:
Seven small businesses from across the U.S. have been awarded a Multiple Award Task Order Contract, Indefinite Delivery/Indefinite Quantity contract with a program-based capacity of $200 million to support worldwide Access Control Point Design-Build construction and equipment installation projects by the Engineering and Support Center, Huntsville.
Under the contract awarded Oct. 7, the seven small businesses are being awarded task orders to provide a range of efforts to include entire ACP design and construction, ACP construction from completed designs, and specific ACP infrastructure or equipment upgrades at various Army and other Department of Defense bases throughout the world. Specific work to be performed is defined at the task order level.
Sharing the contract over its five-year duration are: Akima Construction Services LLC of Laurel, Md.; Ayuda Management Corporation, Broomfield, Colo.; FutureNet Group Inc. , Detroit, Mich.; Ma-Chis Kawv III, LLC, Kinston, Ala; North Wind Neu Security Services LLC, Idaho Falls, Idaho; Security Construction Services Inc., Hudson, Mass.; and Zieson Construction Co. LLC, Topeka, Kan. Each contract includes a base year and four one-year optional years.
To date, no task orders have been awarded. Work being performed includes roadway and traffic island construction; lighting and guard booth installation; canopy, passive barrier, gatehouse, search area and visitor control center construction; and active vehicle barrier, closed circuit television, and electronic security systems installation to increase the security and safety of our military and civilian workforce worldwide.


text:
Hi there, I am just sitting down to have a look at my plan for next week. It looks like we are going to have a really busy week. We always love the little ones when they come to our home for trick or treat we like to have very special bags of treats for them and their parents. I will be announcing the winner of the Texas Star Chili Cook Off bright and early Monday morning. There is still time to enter see the link at the bottom of this post. Americans I encourage you to exercise your freedom as an American and vote on Tuesday!The Feature Recipe This Week on Thursday
All The Recipes Today
From Miz Helen's Kitchen Table Cookbook
Bar B Que Brisket
Garlic Cheese Grit's
Cole Slaw
Fresh Fruit Cobbler
Left Over From Sunday
Bar B Que Brisket Sandwiches
Sweet Potato Chip's
Trick or Treat
For the Children
Carmel Covered Apples
For The Adults
Hot Pepper Pop Corn Balls
The Big Winner
Texas Star Chili Cook-Off 2010
Brownies With Fruit Sauce
Election Day
Don't Forget To Vote
Democrat Grilled Chili Burger Sliders
Republican Seasoned Oven Fries
All American Apple Pie
Rosemary Chicken
Steamed Broccoli
Baked Sweet Potato
Whole Grain Roll
Left Over From Tuesday
All American Apple Pie
Feature Recipe
Slow Cooker
Feature Recipe
Slow Cooker
Smothered Ribs
Carrot and Raisin Salad
Carrot and Raisin Salad
Corn Bread
Spice Cupcakes
Make Your Own Taco Bar
Chocolate Swirl Pie
Chocolate Swirl Pie
Slow Cooker Smothered Ribs
Slow Cooker Smothered Ribs
4 or 5 large country style ribs
1 1/2 teaspoons salt
1 1/2 teaspoons pepper
2 1/2 teaspoons rubbed sage
2 teaspoons thyme leaves
1 teaspoon allspice ground
2 teaspoons cinnamon
1/4 teaspoon fresh nutmeg
2 teaspoons cinnamon
1/4 teaspoon fresh nutmeg
2 teaspoons paprika
Optional ( 1 tablespoon brown sugar or sugar substitute)
Optional ( 1 tablespoon brown sugar or sugar substitute)
1 tablespoon olive extra virgin olive oil
3 pods garlic minced
3 pods garlic minced
1/2 medium size cabbage sliced in 1 1/2 inch slices
1 large yellow onion sliced in 1 inch slices
2 medium size red apples (I used Honeycrisp) sliced in 1 1/2 inch slices
1 medium size Granny Smith apple sliced in 1 1/2 inch slices
1 cups apple juice or apple cider
Mix all the spices together and sprinkle on both sides of the ribs. Heat the olive oil in a very hot skillet and sear the ribs. Layer 1/2 of the cabbage and all of the sliced onion on the bottom of the slow cooker. Next place the seared ribs and top with the rest of the cabbage and minced garlic. Add the apples to the top of the cabbage sprinkle any left over seasoning and pour in the apple juice or cider.
Cook on low for 4 to 5 hours. Enjoy!
It will be a great week here at the cottage. You still have time to bring your chili over for the Texas Star Chili Cook Off you could be the 2010 winner and if you are you will receive one of my cookbooks. If you want to enter just follow this link Texas Star Chili Cook Off
It has been so good to chat with you today, I always look forward to your visit. Please come back soon!
Peace and Joy
Miz Helen
This Post is Linked to:
Whatcha Makin Wednesday's
Crock Pot Wednesday
Slightly Indulgent Tuesday
Hearth and Soul Hop
Tuesday At The Table
Tasty Tuesday
Temp My Tummy Tuesday
Menu Plan Monday
Hunk of Meat Monday
Peace and Joy
Miz Helen
This Post is Linked to:
Whatcha Makin Wednesday's
Crock Pot Wednesday
Slightly Indulgent Tuesday
Hearth and Soul Hop
Tuesday At The Table
Tasty Tuesday
Temp My Tummy Tuesday
Menu Plan Monday
Hunk of Meat Monday


text:
Carolina, Let's Get Organized! in Fayetteville, NC is a locally owned, licensed, bonded and insured company that provides professional organizing solutions, estate sale services, packing and relocation services and concierge services. Carolina, Let's Get Organized! is dedicated to providing superior services to senior citizens and is a member of the National Association of Senior Move Managers. Since 2005, Carolina, Let's Get Organized! has been ready to help you with jobs large and small.
Whether you're a busy parent, business owner, or a retired senior citizen we can and greatly desire to help you get things done. We are here to relieve you of the stress and logistics from the overwhelming or time-consuming projects that occur in life. No task is too big for the motivated, professional and experienced team at Carolina, Let's Get Organized!
Hire Carolina, Let's Get Organized! for the best concierge services.
"I first met Pam Warren at the suggestion of a friend who knew I was looking for someone to help me organize my mother's house to make it safer and more efficient. I must mention that my mother thought this was totally unnecessary and therefore was not a very receptive client. Pam took this in stride, went to work, and showed such sincere understanding of my mother's reluctance to part with any of her possessions that my mother's attitude improved drastically. Pam takes a logical approach to the task at hand and works steadily until the objective is accomplished. She has an amazing ability to encourage a client to donate items in order for others to benefit from them, while at the same time acknowledging the importance of keeping certain sentimental items. She frequently thinks "out of the box" for organizing suggestions and storage solutions. She is a person of the utmost integrity, has an amazing work ethic, shows genuine courtesy, concern and compassion for others, and has a positive and pleasant attitude. She turns what could be drudgery into a logical approach that results in not only an orderly environment, but a refreshing and rejuvenating feeling of accomplishment. I give her the highest recommendation possible! What started as a short term project has evolved into seven years of wonderful service - and friendship! "
Karen Curlee January 18. 2013
Pam Warren
Fayetteville, NC
Moore County, NC
Hoke County, NC
Harrnet County, NC
Phone: (910) 321-0016
Phone: (910) 578-6399
Monday to Saturday
We're There when you need us!!
Upon Request


text:
We have always respected our Mother Earth.
We seek the wisdom of our elders - we pray
to Almighty God, our Grandfather of spiritual
ways. We believe He send His Son to show us all
how to perceive and to believe. We are all a
little different, so we need not do each and
every thing the same way. We need only
believe the words of God. His wisdom and love
will guide us each and every day.


text:
At long last, it's time for the Masters, the most wonderful time of the year for golf fans.
This week, all of the best golfers in the world—with one very notable exception—will gather on the greens of the Augusta National Golf Club and battle for the chance to walk away with the famous green jacket.
Even with Tiger Woods on the sidelines, there will be plenty of familiar faces coming around Amen Corner beginning Thursday. Phil Mickelson is trying to win his fourth title at Augusta, Adam Scott is looking for the rare jacket defense, and Rory McIlroy is seeking his first Masters title.
Here's everything you need to know about the 2014 Masters.


text: Singer Miley Cyrus who is currently in the Philippines on tour has told reporters there that contrary to what people may think, she is not an aggressive person. The 18 year old former "Hannah Montana" star told the media that there is a lot of stuff that people make up about her, adding that "the greatest is that I'm someone who goes for attention. Truth is I don't believe in shock value." Miley was also reportedly asked about her tweeting to which she said "I find the Internet scary because everybody gets to have an access on what you say and you always have to stand by what you're saying. I believe you don't have to tweet everything. People won't care about what I'm doing 24/7."


text:
First off, I need to put something out there: I've never seen "Star Wars." (My Alive co-workers heard me mention "that dude who was Luke's father" last week.) I've never bought a comic book that wasn't "Archie" circa 1992, and I couldn't tell you anything about "Star Trek" except that William Shatner was once a cast member.
I'm not the most logical comic con attendee, but I couldn't pass up the opportunity to attend this past weekend's Mid-Ohio Comic Con, put on by esteemed convention production company Wizard World, once I found out that James Marsters – aka Spike from "Buffy the Vampire Slayer" – was one of the guest celebrities. ("Oh, so you are a dweeb," you say. Perhaps. Or maybe I just have good taste in television.)
Before I arrived on Saturday, I worried that I might be the only person there not in costume, but I figured my Audrey Hepburn-inspired Halloween costume wouldn't help me fit in any better. Luckily, it turns out only about a quarter of comic con-goers dress up for the occasion, and those in costume proudly pose for photos.
Wanting to make sure I was correct in my assumption, I asked my photo buddy in The Joker's face paint (see above) who he was supposed to be. Looking at me like I was an idiot, he responded, "Steampunk Joker." Silly me.
It turns out there is one rule for comic-con costumes, though: They should be homemade. Store-bought costumes will incite whispers of, "Ugh, store-bought," from the con elite.
This guy, dressed as War Machine from "Iron Man 2," said he spent four months working on his gear. Everyone I talked with agreed that he had the best costume of the event:
The convention was fairly small, with one medium-sized trade room (which held a "Back to the Future" Delorean, a bunch of Stormtroopers and lots of comic book vendors) and one room for programming. Unfortunately that room was too small to fit all of the participants. My guess is that Wizard World, who was hosting the Columbus event for the first time, will grow the programming side next year.
I caught comic book artist and writer Michael Golden's discussion of what constitutes good storytelling on Saturday, and I stood in a very long line for a very long time to catch James Marster's Q&A session Sunday morning. Marsters wooed the crowd with his hip sense of humor and frequent rock-on hand gestures. The highlights of the convention for me were Marsters' impromptu performance of a song off his soon-to-be-released album and his biting (har har) remarks about the "Twilight" vampires.
Here's the one problem with the comic con: You have to come armed with cash. To get a photo with any of the special guests costs some serious moolah, as does an autograph. I waited in line to get Marsters to sign something, but was turned away when I didn't have $40 I wanted to part with.
But all in all, it was a fun experience. And even though some of the costumes were a little overwhelming to those of us comic-con newbies, few things could be more amusing than seeing superheroes and very evil-looking villains in the vicinity of hundreds of little, makeup-covered girls with sprayed-stiff hairdos from the neighboring cheerleading convention.


text:
Skip to comments.Letter: What Mr. Obamas nuclear cuts portend
Posted on 09/07/2012 11:14:07 PM PDT by 2ndDivisionVet
The Sept. 1 editorial Loose talk on nuclear weapons missed the true significance of President Obamas breach of his nuclear weapons funding commitments. His proposed $370 million cuts with billions more to come are not just a minor dip. They go to the heart of the program to refurbish aging warheads and infrastructure.
Ironically, the cut will delay or prevent achievement of one of the goals of the presidents 2010 Nuclear Posture Review: reducing the number of hedge warheads in our stockpile.
Moreover, the president abandoned commitments he made to win support for New START. In his letter to senators referenced in the editorial, he promised to request full funding for and accelerate to the extent possible construction of the Chemistry and Metallurgy Research Replacement Nuclear Facility (CMRR-NF). The presidents own Nuclear Posture Review concluded that CMRR-NF was required in 2021, but funding cuts have delayed construction to 2028 at the earliest (some nuclear experts believe that the delay is tantamount to cancellation). This is all an unnecessary risk, because alternative funding sources have been proposed to the administration...
(Excerpt) Read more at washingtonpost.com ...
I know this was written by a couple of Republican political figures, but when the WP starts posting editorial responses that reveal Obama's weaknesses to this degree, it is noteworthy.
The voters of this nation better put their thinking caps on, because if they were to put Obama back in office, this nation would wind up looking more like Mexico than I care to think.
So the only way to get the WashPost to print the OTHER side of a major side is to send them a letter to the editor?
It would seem so. And you have to be a member of congress, to boot.
Yes, I don't doubt it for a second. I bet those guy can hardly wait for their Letter column editor to retire.
Disclaimer: Opinions posted on Free Republic are those of the individual posters and do not necessarily represent the opinion of Free Republic or its management. All materials posted herein are protected by copyright law and the exemption for fair use of copyrighted works.


text:
Kelly McGuire is getting bored with revenue management. And when the executive director of hospitality and travel global practice at SAS, who also holds a PhD in revenue management from the Cornell School of Hotel Administration, talks revenue management trends, people tend to listen. Her research has been published in The Cornell Hospitality Quarterly, Journal of Pricing and Revenue Management and the Journal of Service Management. Prior to her gig at SAS, McGuire consulted with Harrah's Entertainment on restaurant revenue management strategies for major markets and worked for Restaurant Revenue Management Solutions providing menu pricing recommendations to major chain restaurants.
What's got this intensely immersed, multi-industry revenue management expert and noted pundit so bored? Her answer may sound like a familiar one for multifamily revenue and asset managers. "All of our conferences and blogs are going in circles," McGuire says in this fantastic post over on SAS's "The Analytic Hospitality Executive" website. "We need disruptive change in the way we think and talk about revenue management in hospitality and travel."
Like multifamily, the hospitality space has expanded the position of revenue managers to a more strategic role in the organization with broader responsibilities that encompass a marketing, sales, and channel approach. The problem, McGuire says, is that no one is recognizing the strategic, corporate importance of that role. "We've changed the role of our revenue managers," McGuire says, "but no one is recognizing it. We've stalled out."
So what's a revenue-minded executive to do? "Don't assume that the big players have it right, or that you need to stand back and see what happens next," McGuire says. "Ask good questions of your marketing counterparts, your executive team, your colleagues at conferences. Challenge your vendors to actually solve your pricing problems in new and innovative ways, rather than rebuilding a tired user interface or writing a new report based on the same analytics."
Luckily for multifamily executives, marketing specialists, asset managers and revenue managers alike, all of those objectives can be accomplished in one place: at the 2013 Apartment Revenue Management Conference.
We invite you to join us September 22-25 at the Turnberry Isle Resort in shaping the course of revenue management in the apartment industry not just in the years to come, but in the here and now of immediate applications to improve your operations and your business. The 2013 Apartment Revenue Management Conference features expanded education and networking events that cover the gamut from secret shopping to renewal analytics to gaming algorithms and our first ever Owner's Only Revenue Management Roundtable.
As McGuire puts it, "let's dig in and figure this stuff out in a practical and actionable way."


text:
.20 linear feet.
Catalog Number: M299
Agency History / Biographical Note:
William Whitney Rice, son of the Reverend Benjamin and Lucy (Whitney) Rice, was born March 7, 1826, at Deerfield, Massachusetts. He prepared for college at Gorham Academy, Maine, and was graduated from Bowdoin College in 1846. At Bowdoin he was a member of the Peucinian Society, Psi Upsilon, and Phi Beta Kappa. After graduating he taught at Leicester Academy for four years, then studied law and was admitted to the bar in 1854. A public life followed as a judge in Worcester, Massachusetts, mayor of Worcester, and Massachusetts district attorney and congressman. Rice served as a Bowdoin overseer from 1870-1896 and received an honorary Doctor of Laws from Bowdoin in 1886. He died on March 1, 1896, in Worcester, Massachusetts.
Scope and Content:
Seven holograph orations by William Whitney Rice, the bulk delivered in Maine and several delivered while a student at Bowdoin College, including an address for the 40th anniversary of the Peucinian Society in 1846.
Cite as: William Whitney Rice Orations, George J. Mitchell Department of Special Collections & Archives, Bowdoin College Library, Brunswick, Maine
Access Restrictions: No restrictions.


text:
Except for one fantastic addition to the group, everyone there was a repeat from last year's brainstorming plus Festival times. Over the year we have stayed in touch nearly daily. We have our Yahoo group, FaceBook, Twitter and private emails. The group is very international, writes across all genres, and stands ready to pitch in for each of us. With all of our contact, we didn't need much "getting to know you" time. It allowed the work to began within minutes.
Granted, we did have long lunches and late dinners, but I would guess that nearly 90% of the time focused on writing and publishing. There is something to be said about time that is not crazy with running to meeting after meeting in a large hotel but rather a concentrated effort to help each other move to the next level.


text:
I saw "The Nativity Story" the weekend it was released (On Sunday, December 3) and enjoyed it. It was a uplifting and inspirational film. However, it didn't blow me away like "Passion of the Christ". It is a more "worldly" film and does not have that ethereal quality to it, that "The Passion" did. When I viewed "The Passion of the Christ" I felt as if the Holy Spirit had inspired Mel and was guiding him to tell the story just as he had the authors of the Bible.
"The Nativity" is Hollywood's version of how the birth of Christ took place and it is indeed a beautiful story. I particularly liked the way St. Joseph (Oscar Issac) is portrayed - as a kind, thoughtful, loving, and obedient man - who is the strong protector of his family. He was quite admirable in the film.
It was also interesting to see the shepherds' and the wisemen's stories in this movie - something that is unique to Hollywood films.
"The Nativity Story" presents a very human, down - to - earth version of Christ's birth with non - Caucasian actors speaking in mideastern accents. However, it is not authentically Catholic and that is obvious in its portrayal of Our Blessed Virgin Mary. Although I thought the actress (Keisha Castle - Hughs, Whale Rider) did a fine job as acting as an ordinary Jewish girl, I have a problem in viewing Our Blessed Mother as ordinary. Our Blessed Mother was immaculately conceived - she had no stain of original sin on her soul and she was without blemish. She was extremely beautiful inside and out. For her to look and act the way she did (imperfectly) in the film is not exactly as we would expect based on our beliefs. Also, in the film, Mary is shown struggling with labor pains when giving birth to Jesus, which is not in line with Catholic beliefs.
I suspect that the film-makers purposely did not include these aspects of Catholic teachings and traditions, in order to make the film more appealing to people of various faiths. It is truly an ecumenical film in that sense. It is a beautiful and simple story of Christ's birth.
I recommend you see it - it's one of the most inspiring and spiritually upflifting Christian films I have seen since "The Passion of the Christ". (Chronicles of Narnia: The Lion, Witch, and the Wardrobe not included.)
I give it three of four stars - very good. ***
Saturday, December 16, 2006
No comments:
Subscribe to: Post Comments (Atom)


text:
Caravel's Gumbs - WDEL Female HS Athlete of the Week
By Sean Greene Friday, March 2, 2012 - 12:10am
VIDEO: Profile of Olivia Gumbs
Caravel basketball's Olivia Gumbs is this week's WDEL Female High School Athlete of the Week.
The Buccaneers' freshman has basketball in her DNA, her brother Erique currently starts for Towson, and Olivia says he keeps in touch with her.
"We talk a lot. We talk usually at night when he's free. He tells me because he went through it that we'll be okay. We're going to have some good years, and there's a lot to expect and it will be great.
I asked Olivia to give us a scoring a self-scouting report.
"Aggressive, definitely. She's going to be all over the place grabbing rebounds, that's what she likes to do."
Caravel's success is due in part to coach Kristen Mills-Caldwell, the school and state scoring leader, and Olivia says her experience is rubbing off on her team.
"She pushes us a lot. She knows a lot of the things we're going through and how we feel about certain situations so she can relate to us."
As for athletic role models, Olivia looks at both a NBA and a WNBA player.
"Dwight Howard, I love the way he plays defense and he's very aggressive when it comes to rebounding. Lisa Leslie was very diverse in her playing, she wasn't one-dimensional."
Copyright © Mar 2, 2012, WDEL/Delmarva Broadcasting Company. All Rights Reserved.
This material may not be published, broadcast, rewritten, or redistributed.
Do you know a student athlete who deserves to recognized as a WDEL
Athlete of the Week? Tell us about him or her via the form below...
This material may not be published, broadcast, rewritten, or redistributed.


text:
|Publication number
|Publication type
|Application number
|Publication date
|Sep 1, 1992
|Filing date
|Mar 23, 1990
|Priority date
|Mar 23, 1990
|Fee status
|Also published as
|Publication number
|Alan C. Bovir, Dapang Chen
|Original Assignee
|Board Of Regents, The University Of Texas System
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (7), Non-Patent Citations (6), Referenced by (49), Classifications (16), Legal Events (6)
|External Links: USPTO, USPTO Assignment, Espacenet
A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
This invention relates to an improved method and apparatus for coding and decoding digital images. More particularly, the present invention is directed towards visual pattern image coding which partitions an image into image blocks, each image block being reducible into mean intensity value, image code, and gradient magnitude. These three indicia represent a more efficient method of coding complex digital images. Furthermore, the invention represents a substantial improvement in terms of the trade offs between image quality, computational speed, and data compression over conventional image coding and decoding techniques.
There are numerous methods presently used to code and decode digital images. Most methods require substantial amounts of computation and are not practical for real-time use. To transmit a digital image, enormous amounts of information must be handled. Conventional coding and decoding techniques often require that digital images be stored in memory and then manipulated in accordance with code and decode algorithms. In a typical 4 MHz television signal with 8 bits per pixel (BPP) of gray-level resolution with a 512�512 pixel array, approximately 2.09 million bits are required to transmit and store a single picture frame. Such a voluminous bit requirement quickly fills most modern computer storage media. With the advent of digital images and the means by which those images can be coded prior to transmission and storage, bit manipulation can be minimized. Two influential and relevant image coding schemes are presently used, Block Truncation Coding (BTC) and Vector Quantization (VQ), and have achieved great notoriety. Both conventional methods are designed to reduce the BPP rate to a level below 1.0. Furthermore, these methods also strive to maintain the quality of the original image with little image distortion.
BTC uses a partitioning scheme whereby an image is truncated into blocks of subimages. Operations are performed upon each individual block so that the end result is a binary bit stream or code representing that particular block. After each block is coded, the code is transmitted along a conventional transmission media to its target or destination. Upon arriving at the destination, the code is received by a decoder which arranges the decoded image in the same location as the original image.
BTC is fairly simple and fast. Coding is achieved by three basic steps. The first step is computing an average mean intensity value from among all the digital intensity numbers for each partitioned block. Once the mean intensity is computed, the mean is subtracted from each pixel intensity value to obtain a deviation. Deviation is representative of the number of pixels that have intensity values above and below the mean intensity and the standard deviation amount above and below the mean intensity. Thus, the third step involves transmitting a binary code corresponding to the mean intensity, pixel intensity values that are above or below that mean and standard deviation of each pixel value. These three indicia represent all the information needed for each partitioned block. Once the coded indicia are transmitted, the decoder functions merely to decode and reconstruct a decoded image from each set of indicia.
The essence of the BTC technique is the ease by which all three indicia can be represented in either a first or second moment. Each moment, commonly referred to as A or B moments, combine the essence of all three indicia by simple mathematical calculation. For a detailed explanation of calculations of first and second moments n BTC coding see D. J. Healy and Robert Mitchell, "Digital Video Band Width Compression Using Block Truncation Coding," I.E.E.E. Trans. Commun., Vol. Com-29, No. 12, pp. 1809-1817, Dec. 1981. Although BTC methods provide simple and fast coding, BPP rates are fairly high. BPP rates are recorded, on the average, to be around 1.3. Because compression ratios are generally inversely proportional to BPP rates, BTC methods prove inadequate in applications requiring high compression ratios. Using 8 bit pixel intensity values, BTC generally can only achieve compression ratios that are less than 8:1.
The second coding technique that has gained popularity along with BTC, is VQ coding. VQ coding is a relatively new image coding method that has recently attracted much attention. Like BTC, VQ partitions an image into numerous image blocks. Each image block must be mapped into an average or mean image block representative of all the blocks contained within a block cluster. See, e.g., Y. Linde, A. Buzo and R. M. Gray, "An Algorithm for Vector Analyzer Design," I.E.E.E. Trans. Common., Vol. Com-28, pp. 84-95, Jan. 1983. The clustering algorithm collects a large number of blocks drawn throughout the same sample images. Thus, each coded block is compared with code vectors in a codebook predefined in memory media. Each block is coded by transmitting a code of the closest block to it in the codebook. Decoding is fast and is achieved by a simple look-up in the codebook of the image vector having the specific target code. Since the coder and decoder employ the same codebook, only the index of the code vectors need be transmitted.
The advantage of VQ coding is its inherent ability to achieve lower BPP rates, or conversely, higher compression ratios. By coding a relatively small set of codes rather than the details of each block, VQ coding can achieve compression ratios of approximately 10:1 to 15:1.
Although compression rates are high, a major problem encountered in VQ coding is the time required to perform the block search when coding. VQ must decide upon a centroid image block for each cluster and match blocks to be placed within that cluster to the centroid image block value. This process requires a great deal of time-consuming computation. Along with the complexity and time-consumption problem, VQ coding also presents problems such as redundancy in the code vectors and low-quality image reproduction if there are an insufficient number of code vectors. Many redundant image blocks must be mapped and compared to the centroid block thereby unnecessarily adding time to the vector search operation. Furthermore, if the centroid block of a given cluster has a substantially different intensity value than the centroid block of another cluster, the transmitted code vectors corresponding to the widespread intensity values will produce low quality, low resolution decoded images.
The present invention overcomes the shortcomings of conventional coding and decoding techniques, and more particularly overcomes the problems associated with the BTC and VQ coding schemes. The present coding invention, Visual Pattern Image Coding (VPIC), comprises a method and apparatus for transmitting a digital image according to visually significant responses of the human eye. A digital image is processed by partitioning each image into a plurality of image blocks. After blocks are partitioned from the image, mean intensity value is calculated for each block, and the mean intensity value is subtracted from the actual intensity values of each block to produce a residual image block. Each residual image block is then conditioned by calculating intensity gradients, and it is concluded whether the residual image block is visually continuous (i.e., substantially uniform, or containing only high frequency spatial intensity variations), or visually discontinuous (i.e., containing a visually perceivable edge). If the block is concluded to be visually continuous, only the mean intensity value is transmitted for that block. If the block is concluded to be visually discontinuous, the intensity gradient information for the block is used to select a visual image code, corresponding to predetermined visual images, for that block, and the visual image code and mean intensity value for the block are transmitted. In addition, information regarding the intensity gradient of the block can also be transmitted if the block is concluded to be visually discontinuous.
At the receiver, the visual image code, mean intensity value and intensity gradient magnitude are decoded for each block and assembled in an orientation substantially similar to the original digital image.
The VPIC transmission scheme of the present invention combines the advantages of both the BTC and VQ methods. The present invention can achieve compression ratios of between 10:1 to 20:1. Furthermore, the invention does not require timely block search, and therefore, VPIC is inherently faster than VQ techniques and is comparable in speed to BTC. The invention also inherently removes visually redundant blocks or code vectors as they are called in VQ, while inducing very little visual distortion. The invention perceives certain visual discontinuities as being visually significant and can quickly decide which one of those should be coded. If a discontinuity is insignificant, it is not coded thereby saving significant processing time and increasing the compression ratio. The invention thus utilizes visually significant and uniquely meaningful image blocks gathered from normal human visual perception.
Mean intensity is calculated in the present invention by binary adding intensity values represented as digital numbers of each pixel contained within a block, and then dividing the binary added number by the total number of pixels in the block. After the mean intensity value is calculated, it is then subtracted from the digital number of each pixel contained within the corresponding block to produce a residual image block. In addition, gradient magnitude and orientation is calculated by quantizing the difference between digital numbers on opposing sides of each edge contained within all blocks containing a single edge, and then, assigning a polarity to each side of the edge. The differences are calculated as the property of digital numbers within each block. Gradient magnitude and orientation are used to select a visual image code for the block. The visual image code and binary mean intensity value are sent. Gradient magnitude can also be sent, however, good results are obtained when the decoder simply uses a predetermined gradient magnitude. The primary purpose of gradient magnitude and image code is to provide information to the decoder as to the difference in intensity on each side of the edge and the orientation of that intensity difference.
Once mean intensity value is obtained and that value subtracted from each digital number of pixels within the block, a residual number is produced for each pixel within a resulting residual block. Visual discontinuity location is then determined in certain blocks, wherein residual numbers within a block vary substantially above and below a zero value. The discontinuity or break occurs at the specific location where an edge is detected. It is the orientation of the edge or visual pattern that is coded and transmitted along with binary representations of mean intensity and gradient magnitude.
Included within the processing steps of the invention, along with coding, is a series of decoding steps to be incorporated within the VPIC system. VPIC decoding is much faster than coding and can decode at a reduced BPP rate in comparison to the higher BPP rate of BTC. Decoding comprises receiving a plurality digitally coded image blocks, each block including a mean intensity value and a visual pattern code. Gradient magnitude information can also be included in the received block, or can be presumed by the decoder. A uniform image block is then created having a fixed number of image pixels with each pixel having a digital number equal to the mean intensity value. A predetermined visual pattern is then located corresponding to the transmitted visual pattern code. Next, the digital number of each pixel contained within the visual pattern is multiplied by the gradient magnitude (either transmitted or predetermined) to produce a scaled visual pattern. The scaled visual pattern is then added to the uniform image block to produce a decoded image block. Finally, the decoded image blocks are assembled in proper sequence to yield a decoded image.
The decoding technique of the present invention is fairly simple in operation because it merely involves a table lookup of a small, finite number of visual patterns which correspond to transmitted visual pattern codes. The visual pattern is relevant only to the edge location and orientation, and therefore, contains a relatively small set of different combinations. This set of combinations is so small that the locating step is very fast allowing for rapid coding and decoding operations. Each visual pattern code can be rapidly decoded with proper edge location and orientation in only those blocks having a single visually significant intensity gradient. Blocks not having intensity gradients that are significant are generally not perceivable by the human eye, and therefore, are not coded/decoded under the VPIC system. Those blocks having visually insignificant gradients are merely coded as a uniform block rather than an edge block. The advantage in having uniform blocks, is that uniform blocks need not be coded and decoded according to a visual pattern code. The uniform block can be adequately represented by mean intensity value. Visual pattern codes and gradient magnitude need not be coded and transmitted in those uniform blocks having insignificant visual gradients.
By coding uniform blocks and edge blocks differently, redundant blocks such as uniform blocks can be coded very rapidly since those uniform blocks need not carry visual pattern and gradient indicia. Thus, coding operations can be minimized and concentrated in areas where greater detail is needed, i.e., in visually significant areas. The majority of coding and decoding operations thereby involves the most important areas of the digital image: those areas where disjunctive intensities occur. The human eye is sensitive to areas where intensity varies, provided the number of intensity changes do not exceed a set amount per set distance.
In one embodiment of the present invention monochromatic images can be digitally coded and decoded. Edge blocks are extracted from those image areas having a visually significant variance between monochromatic shades. When a visually perceivable variance is discovered, that image area is partitioned as an edge block and thereby coded in accordance with a visual pattern code. Conversely, uniform blocks are derived from those image areas having visually insignificant or not visually perceivable black-white variances
In another embodiment of the present invention, digital color images can be coded and decoded by using the steps used in monochromatic coding and decoding for color separated images. More particularly, coding of digital color images requires coding and decoding shades of red, green and blue colors separately and then superimposing those colors in an end result. It has been determined that pattern information is highly spatially correlated between the different color components. Thus, color image processing requires that monochromatic pattern processing be performed once on one of the color components, for example, green. Decoding proceeds simply as well. The green image is decoded exactly like a monochromatic image, and the red and blue images are decoded using the red and blue mean intensities, and the pattern information from the green image.
The present invention therefore provides a method for quickly and easily coding either monochromatic or color digital images. The invention represents a substantial improvement in computational time and complexity over conventional image decoding methods such as BTC and VQ techniques. VPIC enables real-time coding and decoding of digital images because of its inherent speed of operation and substantially small BPP rate. The speed and computational simplicity of VPIC allows modern digital computers to access and process digital images in either hardware or software in real-time and without requiring enormous amounts of memory media. These are but a few of the advantages of this invention. These and other advantages of the present invention will be further appreciated from the following drawings and the detailed description.
FIG. 1 is a visual pattern image coding apparatus according to the present invention.
FIG. 2 is a flow diagram of the coding and decoding operations of the present invention.
FIG. 3a is a graph showing spatial frequencies versus sensitivity of a human eye.
FIG. 3b is a graph showing spatial frequencies versus response time of a human eye.
FIG. 4 is a diagram showing visually significant image block derived from optimal viewing angle of a human eye.
FIGS. 5a-5d show various orientations of the simple visual patterns used in coding an image block according to the present invention.
FIG. 6 is a table showing required total bits, total BPP and compression ratios for various block types and algorithms of the present invention.
FIGS. 7a, 7b, 8a, 8b, 8c and 9a, 9b, 9c show comparisons between original images and those original images coded and then decoded using algorithm I and algorithm II of the present invention.
FIG. 1 is a block diagram of an apparatus for visual pattern image coding, transmitting, receiving and decoding, according to the present invention.
Original images are obtained by, for example, television camera 11 which can be a Panasonic type WVCD50 camera which provides an analog video signal to video digitizer 12. Digitizer 12 can be any commercially available hardware or software controlled digitizer, for example, a commercially available "frame-grab" board that can be installed in microcomputers or work stations, such as a PCVISION brand board available from Imaging Technology. Digitizer 12 produces an array of pixels, with the intensity of each pixel being represented by a binary number. For example, the PCVISION digitizer produces a 512�512 pixel array with each pixel represented by an 8-bit grey scale number, resulting in 256 grey scale levels per pixel.
Alteratively, and as illustrated schematically by switch 13, digitized images can be provided directly from storage medium 14 which can be, for example, semiconductor memory, magnetic memory such a floppy disk, or optical memory such as a compact disk.
Digitized images from digitizer 13 or storage medium 14 are applied to microprocessor 16 wherein the digitized image is encoded in accordance with the steps shown schematically in FIG. 2, and in detail in the source code program included at the end of this specification.
Microprocessor 16 can be any commercially available microcomputer or work station, such as a IBM RTPC Engineering Work Station, a Sun work station, a Digital Equipment VAX work station, an Apple MacIntosh Mac II, or compatible microcomputers or work stations. In addition, microprocessor 16 can be a dedicated programmable signal processing chip, such as a TMS type signal processing integrated circuit available from Texas Instruments.
The coded video image is applied to transmitter 17 for transmission to receiver 18. Transmitter 17 and receiver 18 can be any type of well known telecommunications network, such as, for example, radio frequency, microwave, telephone, optical, as well as equivalent types of communications networks. At the receiving end of the present invention, the encoded video image is decoded by microprocessor 19 which can be any of the above-mentioned types of microprocessors, programmed according to the flow chart shown in FIG. 2, and in detail in the source code program listing included at the end of this specification.
The decoded video images then displayed on CRT display 21, and/or printed, stored, or otherwise used.
FIG. 2 illustrates a flow diagram of various steps required to code and decode a visual image according to the present invention. The original image can be either monochromatic or color and can be either analog or digital. The method of the present invention includes coding steps 22 and decoding steps 23. Each digitized incoming image is applied to block 24 where the digital image is partitioned into a plurality of sub-images or image blocks. Each image block is of predetermined size determined by the assumed viewing angle of the human eye. The viewing angle is discussed later and is shown in FIG. 2. In the preferred embodiment, the image block is 4�4 pixel locations in size for the assumed viewing angle. Thus, each image block in the preferred embodiment has 16 pixels arranged in an array within the block's boundary. However, it is important to note that the size of the image block can vary depending upon the type of images to be coded. If the images are of low resolution type, then 5�5, or 6�6, etc. pixel arrays may be preferred for the image block. In addition, blocks other than square image, blocks can be used. Any block size or shape is feasible provided the size and shape are optimally fixed as determined by the viewing geometry of the human eye. For simplicity, and for the purposes of illustration, the following discussion will be directed to image blocks fixed in 4�4 pixel array.
After image blocks are obtained, a mean block intensity calculation step 26 is be performed on each image block. Mean block intensity is computed by binary adding the digital number for each pixel contained in an image block, and by dividing the sum by the total number of pixels in the block. In the present example, the total number of pixels is fixed at 16. As shown in FIG. 2, mean block intensity is used for two purposes, 1) to derive a residual image block in step 28 and, 2) to be quantized and coded for transmission purposes in step 29. The residual image block is produced in step 27 by subtracting mean block intensity from each pixel digital value in the image block. After mean intensity is subtracted, residual pixels are produced having digital values distributed about zero. Those residual pixels having intensity values greater than zero are represented with positive polarity, and those pixels having intensity values less than zero are represented by negative polarity. As explained below in more detail with reference to FIG. 5, the positive and negative polarity patterns define various configurations corresponding to the location and orientation of visual discontinuities within each image block. The number of different patterns is fairly small, for example, four or eight in number. The entire set of visual patterns are stored in library 30 of computer memory and are used to match against each residual image block in matching step 31. Visual pattern matching can be performed rapidly since the number of predetermined visual patterns stored in library 30 is fairly small.
Before determining whether a pattern stored in memory 30 matches the residual image block under analysis, matching step 31 performs image gradient calculations on the residual image block to determine whether the residual image block contains any visually significant discontinuities, or edges. If matching block 31 determines that the residual image block under analysis contains no visually significant discontinuities, the residual image block is concluded to be a uniform image block, and only mean block intensity is transmitted for that block. If, on the other hand, matching step 31 determines that the residual image block contains a visually significant discontinuity, the image gradient of the residual image block is used to select the proper pattern from visual pattern library 30. Then, a code corresponding to the matching visual pattern is transmitted along with the mean block intensity.
In addition, matching block 31 can calculate a gradient magnitude for the residual image block, which is an indication of the difference in intensity on either side of the visually significant discontinuity contained within the residual image block. If desired, gradient magnitude can also be, transmitted with mean block intensity and visual pattern code.
Once the coded images are received at their final destination, they are decoded by decoding steps 23. As shown in FIG. 2, decoding steps 23 comprise visual pattern look-up step 33 which locates the visual pattern from the visual pattern library 34 using the received visual pattern code. Gradient magnitude, if transmitted, and the selected visual pattern are multiplied to produce a scaled visual pattern. The scaled pattern is then added to a uniform image block which consists of pixel values equal to received quantized mean block intensity. The sum of the scaled pattern and uniform image block represents the decoded version of the original image block. Each decoded image block is then assembled in proper sequence in block 36 to yield a decoded image that closely visually approximates the incoming image.
An important aspect of the present invention is the ability to distinguish between visually significant and visually insignificant image blocks. The human eye, being an efficient image processing tool, can be analyzed as a processing center that processes images into sub-images or blocks having visually significant indica. Human eyes have photoreceptive cells in the retina which convert incoming light into electrical signals that are relayed and processed by the post-retinal ganglion cells and later, in the visual cortex. Ganglion and cortical cells have receptive fields that respond to the spatial structure of incoming stimuli. Certain receptive fields are not sensitive to the absolute light intensity but they are quite sensitive to the difference of the light intensity following any excitatory and inhibitory regions. These receptive fields have different shapes and are sensitive to stimuli of specific shapes and sizes. Accordingly, cortical cells have simple cells which appear to be sensitive to bar or edge-like structures. See, L. Kaufman, Perception, Oxford University Press, pp 135-146 1979.
The composition of images into low frequency blocks or blocks containing a single visual pattern (edge) suggest that an image can be adequately represented by localized block description of smooth (continuous) regions and disjunctive (edge) regions. Recent work in this area has led researchers to conclude that retinal cells of human eyes are sensitive to a spatial frequency range shown in FIG. 3a. See, e.g., L. Kaufman, Perception, Oxford University Press, pp 135-146 1979; N. D. Levine, Vision in Man and Machine, McGraw-Hill, chapters 2 and 6, 1985. As demonstrated in FIG. 3a, normal eyes are sensitive to the spatial frequency in the range of 1-10 cycles/degree. Thus, the human observer can optimally detect between 1 to 10 edges or cycles per viewing degree. In addition, as the spatial frequency or number of edges per degrees increases, the digital response time of the human observer increased accordingly. As shown in FIG. 3b, if there are numerous visual discontinuities visible in a given viewing angle, response time can be fairly slow. For example, if the viewing angle is one degree and there are five discontinuities or cycles shown in that viewing angle, then response time is approximately 250 milliseconds.
The spatial frequency response curve and latency response curve of FIG. 3a and 3b respectively, combine to form the spatial frequency constraint that is exploited by this invention. Image blocks are sized in accordance with the spatial frequency constraint. Due to the limitations of visual frequency response, a coding algorithm need only code image structures within a certain spatial frequency range. Anything outside that range can be omitted without causing visual distortion. In other words, only visually perceivable or significant edge and contrast information need be coded. Since the overall passband on the receptive field of the normal human eye is in a range of 1-10 cycles/degree, image frequencies exceeding 10 cycles/degree contribute very little to perception due to the lower frequency response and greater increased latency. The present invention functions to constrain the pattern size for the image block based upon this overall passband characteristic of the receptive fields in conjunction with a reasonable viewing geometry. The present invention uses a coding scheme whereby an image is broken into either uniform blocks or edge blocks. Uniform blocks are of low spatial frequency or high spatial frequency and are visually continuous while edge blocks are visually discontinuous. Uniform blocks can be represented by quantized mean block intensity. Conversely, edge blocks require visual pattern code, gradient magnitude, and quantized mean block intensity for full representation of the edge location, orientation and intensity contrast on opposite sides of the discontinuity.
The strategy adopted in the present invention is that the size of the image block is chosen to contain at most one visible discontinuity. This constraint can be supported by reference to FIG. 4. Assume that image 37 to be coded is of N�N pixel geometry and that image block dimensions are M�M pixels. If monitor 39 is used to display N�N pixels, and the size of monitor 39 is L�L cm, and D is the viewing distance between viewer 41 and monitor in cm, then if D is much larger than L, the viewing angle alpha (α) subtending an image block is approximately: ##EQU1## For typical values where N=512, M=4, L=21.5 cm and D=200 cm, the viewing angle α is approximately 0.15�. Referring back to FIG. 3a, if the visual passband is maximized between 3-6 cycles/degree, then approximately 1 cycle or edge can occur within the 0.15 degree view angle. Under a standard viewing distance of 200 cm., 0.15� viewing angle generally corresponds to a 4�4 image block array. Thus the image block may be advantageously fixed at a 4�4 pixel size. Although this example results in 4�4 pixel blocks, other block sizes are feasible provided they satisfy the necessary conditions imposed by the viewing geometry. Preferably, 4�4 pixel image blocks are used, which serve to demonstrate the power of the decoding algorithm, and which also simplifies pattern design. It should be observed, however, that the range of frequencies processed biologically is divided into several different channels: this suggests that multi-scale modifications of VPIC can be designed that define a set of spatial frequency constraints derived from the various passbands, and that operate over a hierarchy of resolutions. At each scale of processing, the size of the image blocks or visual patterns used can be varied without changing the number of patterns, by varying the resolution of coded blocks.
Since the predetermined visual patterns are used to represent natural images as perceived by a human observer, the selected visual patterns must be visually significant and give a quality representation to the original image while satisfying the visual constraints described above. This is accomplished, according to the present invention, by using small patterns or image blocks of such a size that edges contained in one or more of these blocks activate cortical neurons. Also, image blocks should not be repetitive.
As mentioned earlier, uniform blocks are coded using a single indicia (i.e., mean block intensity) so as to reduce the amount of coding needed for substantially redundant patterns associated with uniform image blocks. It is the edge image block that receives additional coding operations since accurate discontinuity location is crucial for achieving high definition image processing.
In choosing the predetermined visual patterns stored in visual pattern libraries 30 and 34 (FIG. 2), the image to be coded is first denoted as an array I=Ii,j that is a union of disjoint 4�4 image blocks, each of the form:
bi,j =[In,m :4i≦n≦4i+3,4j≦m≦4j+3].
Prior to assigning patterns to image blocks (step 31, FIG. 2), the mean intensities of the image blocks are coded separately (blocks 26 and 29, FIG. 2), and the mean intensity is subtracted from the individual pixel values of the image block (step 27, FIG. 2), to produce a residual image block (step 28, FIG. 2), having mean zero mean intensity. This allows for the design of predetermined visual patterns independent of the average intensity differences that occur between image blocks, hence reducing the number of required predetermined patterns.
In determining visual patterns which accurately represent visually discontinuous image blocks, a measure of the intensity variation, and specifically the edge or discontinuity content of the image I, is the discrete gradient I=(Δx I, Δy I), where the directional derivative approximations Δx I=Δx bi,j and Δy I=Δy bi,j are computed as oriented differences between weighted averages of contiguous average neighborhoods lying within each image block. Computationally convenient definitions of the directional variations within each image block are: ##EQU2##
The gradient magnitude (a measure of the intensity change from one side of the edge to the other), and the gradient orientation (a measure of the angle of the edge within the image block) within each image block are given respectively by: ##EQU3## The computed gradient magnitude and gradient orientation correspond to the contrast and orientation of the intensity change occurring within the image block bi,j. These quantities have continuous ranges that, according to the present invention, are quantized to simplify coding for transmission. Since small image blocks are used, gradient orientation is quantized in 45� increments, yielding four basic edge patterns with respective orientations of 90�, 45�, 0� and -45�. The remaining orientations, 135�, 180�, 225�, and 270�, have the same orientation as the four basic edge patterns, but have opposite contrast. These are coded, according to the present invention, by separately coding and transmitting a polarity bit along with the pattern code.
It should be noted that the arctangent function (a computationally inefficient function) is not actually used to calculate gradient orientation. Rather, since the gradient orientations are quantized, constants can be stored for simple comparison with the directional variations.
FIGS. 5a-5d illustrate possible combinations of visual patterns used for detecting a single discontinuity within each image block. There are 14 visual patterns that depict a set of possible edge locations and orientations within a 4�4 pixel array or image block. The break between positive and negative polarity represent the location and orientation of the edge. In a boundary or edge between a lighter and darker disjunctive region, positive and negative polarity represent that disjunctive region. The visual patterns shown in FIGS. 5a-5d may be represented by four basic edge patterns with respective orientation of 90�, 45�, 0� and -45�. However, any number of patterns may be used without departing from the scope of the invention. Choosing a set of patterns (for example, 4 patterns or all 14 patterns) allows the predetermined image blocks to be centered at a variety of distances from the edge at any orientation. Using only P2, P6, P9 and P12 allows for a smaller BPP ratio and conversely, greater compression ratio than when all visual patterns P1 -P14 are used with little degradation in image quality. As demonstrated below, a surprisingly small number of patterns selected from FIG. 5 can code images with remarkable quality.
In one embodiment of the invention, transmitted along with coded representations of the matched visual pattern is gradient magnitude. Gradient magnitude is a quantized value assigned to each pixel location in accordance with binary coded representation of that quantized value. If the intensity difference between difference is rather substantial, i.e., the difference between white and black, then the gradient magnitude will be quite large. However, if the difference is small, such as that found between different shades of gray, blue, red or green, then gradient magnitude is fairly small. Along with magnitude, gradient polarity is also transmitted digitally to indicate which side of the edge has the higher gradient intensity value. As will be shown later, the gradient intensity range can be limited without severely limiting intensity contrast of the decoded image. In addition, gradient magnitude need not be transmitted at all, and the decoder can use a predetermined gradient magnitude without significant degradation of image quality.
It has been observed that image blocks having a zero or very low gradient magnitude are usual, and the frequency of gradient magnitude decreases quickly beyond some high value. In the present invention, two thresholds are set that constrain the range of image gradient magnitudes to be coded. The low threshold, | I|min, represents the minimum perceivable gradient magnitude that can occur in an image. As mentioned above, if the calculated gradient magnitude for a particular residual image block is less than the low threshold, the image is concluded to be a uniform block, and only mean intensity for that block is transmitted, and edge orientation need not be computed. Thus, | I|min, effectively determines the number of edge blocks present in the image, the remaining image blocks being coded as uniform patterns. Although there is considerable flexibility in the choice of the minimum gradient threshold, it is not a function of the image to be coded. Moreover, the speed of the coding algorithm is independent of the minimum threshold.
A second threshold, | I|max, denotes the maximum gradient magnitude that is coded distinctly, with all gradient values above this being truncated to the value, | I|max. In selecting the second threshold, it is to be noted that large gradient values occur infrequently and that the human eye is not very sensitive to the magnitude of edge gradients. Of much greater visual significance is the simple presence of edges, and the average image intensities near the edges. The difference between the high and low thresholds for gradient magnitude determine the range of gradient magnitudes that are actually coded.
It should be emphasized that gradient magnitude need not be coded and transmitted, and that a predetermined gradient magnitude can be presumed by the decoding portion of the invention without significant degradation of image quality.
Referring to the Table in FIG. 6, total bits required to code uniform block and edge block using the two embodiments of the present invention (denoted algorithm I and algorithm II) are shown. Four basic patterns P2, P6, P9 and P12 (FIG. 5) are used in algorithm I, while 8 basic patterns P1, P3, 5, P6, P8, P10, P12 and P13 (FIG. 5) are used algorithm II. In algorithm I, gradient magnitude minimum and maximum are not transmitted and are set at 30 (out of 256), whereas in algorithm II, gradient magnitude minimum and maximum are 10 and 90 (out of 256). Thus, the number of gradient magnitudes (M) for algorithm I is 1, and for algorithm II is 8 (the gradient range being quantized in equal increments of 10). Having a lower threshold gradient magnitude of 10, shown in algorithm II rather than 30 in algorithm I, means that minor differences in edge details can be coded in algorithm II in areas where contrast changes are significant. Conversely, larger gradient magnitude maximums will smooth very fine edge details. Since M in algorithm I is 1, the bit value representation, or gradient index, is not required in algorithm I. However, the bit value representation for M=8 in algorithm II is 3 since 3 bits are required represent numbers 1-8. Thus, an additional 3 bits are required for the gradient index of algorithm II.
Also shown in FIG. 6 is block type indicator bit which is a single bit to indicate whether or not the block is a uniform block or an edge block. Mean intensity represents the number of bits required to characterize mean block intensity. If the block is uniform, higher resolution of mean intensity can be achieved by assigning more bits to uniform blocks than to edge blocks, if desired. The number of bits shown in FIG. 6 which represent mean intensity are found to produce adequate coverage of all possible mean intensity values. However, these numbers, as with all of the bit numbers provided in FIG. 6, are merely illustrative, and should not be considered to limit the invention. The number of bits assigned to each indicia can be changed substantially depending upon the application and desired outcome. Also shown in FIG. 6, is a pattern index representing the number of bits needed to characterize the various orientations of the predetermined visual patterns. Since algorithm I uses only four basic patterns, P2, P6, P9 and P12, only two bits are needed to represent all four combinations. However, three bits are needed to represent the 8 basic patterns (P1, P3, P5, P6, P8, P10, P12 and P13) of algorithm II. The end result or total for all of the bits needed to convey adequate representation of each image block is shown in FIG. 6, and is dependent upon the application (i.e., whether or not algorithm I or algorithm II is chosen and whether or not the block type is uniform or edge). Note that in all cases, compression ratios exceed 10--best-case estimate for VQ coding and much better than BTC methods. In addition, the present invention is two orders of magnitude faster than VQ coding.
Image decoding is very simple using the present invention. The coded image blocks are represented either as uniform blocks or as edge blocks, the decoding of the present invention can be easily achieved through one of two simple methods. Edge block decoding only requires simple table look-ups, a single multiplication, and a single addition. Thus, image decoding is no more complex than VQ. Moreover, uniform blocks can be more easily decoded than either VQ or BTC since decoding of uniform blocks according to the present invention avoids redundancy inherent in BTC and VQ schemes.
At very high compression ratios, the predominant distortion that occurs in the present invention are block effects arising from coarse quantization of the average intensities in uniform (non-edge) blocks. Block effects are manifested as visual false contours occurring between blocks of similar average gray level. To correct this problem, simple block smoothing algorithms may be applied to the mean block intensity, without degrading the image details (edges). An efficient smoothing technique is to apply a smoothing filter to the mean intensity before the edges are superimposed. It is found that a simple 3�1 moving average filter applied along each dimension of the mean intensity subimage prior to adding the edge block, decreases the visual distortion. The moving average filter is simply the weighted average of three adjacent points. TABLE I shows the computation complexity of a 4�4 decoding and smoothing operation when both equal weight and nonequal weights are used:
TABLE I______________________________________ Equal Weights Non-Equal Weights______________________________________Pattern addition 16 add. 16 add.Post-filtering 96 add. 32 mul. 320 add.Operation/Pixel 7 add., 2 mul. 21 add.______________________________________
Simulation results of the present invention are shown in FIGS. 7, 8 and 9. Algorithms I and II described in coding and equal weights described in decoding are used on "Lena", "Mandrill" and "Pepper" images to provide examples of the present invention in operation. FIG. 7a is the original Lena image, FIG. 7b is the coded Lena using algorithm I of the present invention, and FIG. 7c is the coded Lena image using algorithm II of the present invention. Shown in FIG. 8a is the original Mandrill image, FIG. 8b is the coded Mandrill using algorithm I, and FIG. 8c is the coded Mandrill using algorithm II. Finally, FIG. 9a is the original Pepper image, FIG. 9b is the coded Pepper using algorithm I, and FIG 9c is the coded Pepper image using algorithm II. The following TABLE II illustrates the simulation results for all three images:
TABLE II______________________________________Image Lena Mandrill PepperAlgorithm I II I II I II______________________________________Uniform Blocks 14890 12413 12496 69311 50361 3061Edge Blocks 1494 3971 3888 9453 1321 3323BPP 0.38 0.49 0.39 0.56 0.38 0.48Compression 21.06 16.44 20.61 13.89 21.09 16.74______________________________________
An alternative preferred embodiment of the present invention involves digital coding of color images. Perception in color by the three elementary colors, red, green and blue, is commonly known as trichromacy. Any color can be matched by a proper linear combination of these three colors. The luminance of the color mixture is equal to the sum of luminance of three individuals, red, green and blue (RGB) colors. Consequently, a straightforward way of color representation is the RGB representation that is most dominant in modern color sensing devices. In the RGB representation, a color image is composed of three different single color images: red, green and blue components. The equally weighted sum of the RGB images yield the full color image. Moreover, in color television broadcasting, YIQ color representation can be made according to NTSC standards, wherein YIQ relates to RGB linearly by:
The Y signal is called the luminance signal that appears white or no color. The I and Q signals are called the hue and saturation signals.
It has been shown experimentally that chromatic information in the different color components using either the RGB or YIQ representation is highly spatially correlated. Thus, a single visual pattern can be used to code a block taken at the same resolution and from the same point in the image for each of the three color components. In addition, pattern gradient magnitudes can still be coarsely quantized, and used to represent the pattern gradient of all three color components.
In RGB images, the green image component is used for the extraction of pattern information, since the human eye is most sensitive to this component. The present invention is applied to the green color separated image to obtain the mean intensities and edge pattern of each green image block. The red and blue color separated components are simply assessed for mean intensity, but no pattern information is extracted or coded from these. Decoding proceeds simply as well. The green image is decoded as described above for the monochromatic image, and the red and blue images are decoded using the transmitted red and blue mean intensities, and the edge patterns obtained from the green image. Thus, considerable savings in the BPP rate and in the coding complexity are achieved.
Similarly, in YIQ images, the luminance is used to obtain mean luminance intensities and edge patterns for each luminance image block, and the hue and saturation signals are assessed only to determine the mean image block intensities. The luminance image is decoded using the transmitted mean intensity and pattern information for the luminance blocks, and the hue and saturation images are decoded using the transmitted hue and saturation mean intensities, and the edge patterns obtained from the luminance image.
The foregoing description of the invention has been directed to a particular preferred and alternative embodiments of the present invention. It will be apparent, however, to those skilled in the art that modifications and changes in method may be made without departing from the scope and spirit of the invention. For example, instead of using 4�4 pixel arrays, any size of pixel arrays may be used providing the size of the array is of satisfactory viewing geometry as dictated by the physiological visual response curve described earlier. Also, the size of visual pattern library can be varied depending upon the number of visual patterns necessary for the given application. It is preferred, however, that four is the minimum number of visual pattern. Still further, it is important to note that either monochromatic or color images can be coded and decoded without deviating from the invention. Thereefore,it is the applicants' intention in the following claims to cover all equivalent modifications and variations, including those described herein, which fall within the true spirit and scope of the invention.
The following are source code listings, written in Clanguage, for: the program used to generate the library or codebook of visual patterns; the algorithm I coding program, including the edge subroutine; the algorithm I decoding program; the algorithm II coding program (also calling the edge subroutine); and the algorithm II decoding program. Copyright, 1990, The University of Texas System. ##SPC1##
|Cited Patent
|Filing date
|Publication date
|Nov 4, 1975
|Jul 28, 1981
|Massachusetts Institute Of Technology
|System to effect digital encoding of an image
|Jun 27, 1985
|Jan 28, 1986
|U.S. Philips Corporation
|System for decoding and displaying encoded television pictures
|Jun 10, 1983
|Aug 12, 1986
|At&T Bell Laboratories
|Apparatus and method for compression of facsimile information by pattern matching
|May 7, 1986
|May 26, 1987
|Dainippon Screen Mfg. Co., Ltd.
|Method and apparatus for generating halftone dots
|May 4, 1987
|Nov 8, 1988
|The General Electric Company P.L.C.
|Data compression
|Aug 10, 1987
|Mar 21, 1989
|Deutsche Thomson-Brandt Gmbh
|Method for the transmission of a video signal
|Jun 7, 1988
|May 16, 1989
|Hitachi, Ltd.
|Method for image data coding
|Kaufman; "Perception The World Transformed", Oxford University Press (1979) pp. 135-146.
|Kaufman; Perception The World Transformed , Oxford University Press (1979) pp. 135 146.
|Levine, M., "Vision in Man and Machine", McGraw-Hill (1985) pp. 25-57.
|Levine, M., Vision in Man and Machine , McGraw Hill (1985) pp. 25 57.
|Rosenfeld et al., "Digital Picture Processing", Academic Press (1982) pp. 84-112.
|Rosenfeld et al., Digital Picture Processing , Academic Press (1982) pp. 84 112.
|Citing Patent
|Filing date
|Publication date
|Oct 22, 1991
|Sep 21, 1993
|Mitsubishi Denki Kabushiki Kaisha
|Signal encoding and decoding system
|Jun 17, 1991
|Jan 25, 1994
|Board Of Regents, The University Of Texas System
|Method and apparatus for processing both still and moving visual pattern images
|May 15, 1992
|Oct 18, 1994
|Minolta Camera Kabushiki Kaisha
|Image forming apparatus
|Jun 26, 1992
|Mar 14, 1995
|Minolta Camera Kabushiki Kaisha
|Image processor
|May 28, 1993
|Aug 8, 1995
|Intel Corporation
|Method and apparatus for encoding selected blocks of a residual image signal
|Nov 28, 1994
|Jul 2, 1996
|U.S. Philips Corporation
|System for transmitting and/or storing signals corresponding to textured pictures
|May 4, 1995
|Dec 2, 1997
|Daewoo Electronics Co., Ltd.
|Method and apparatus for determining feature points
|Dec 9, 1996
|May 19, 1998
|Fuji Xerox Co., Ltd.
|Image signal encoding device having first and second encoding means
|Jun 5, 1995
|Jun 16, 1998
|Apple Computer, Inc.
|Method and apparatus for compression of digitized image data using a dynamic band recompression scheme
|Oct 26, 1993
|Aug 4, 1998
|Bell Communications Research Inc.
|Apparatus and method for predicting subjective quality of compressed images
|Nov 13, 1997
|Sep 8, 1998
|Apple Computer, Inc.
|Method and apparatus for compression of digitized image data using variable color fidelity
|Jul 3, 1997
|Nov 3, 1998
|Fuji Xerox Co., Ltd.
|Picture signal encoding and decoding apparatus
|Oct 3, 1996
|Mar 16, 1999
|Silicon Integrated Systems Corp.
|Method and apparatus for contrast enhancement of color images
|Oct 1, 1997
|Nov 2, 1999
|Kabushiki Kaisha Toshiba
|Image data coding and decoding system for efficiently compressing information using the shape and position of the image content
|Jun 18, 1996
|Nov 16, 1999
|Minolta Co., Ltd.
|Image processing device
|Aug 26, 1997
|Dec 14, 1999
|The Trustees Of Columbia University The City Of New York
|Encoding and decoding of color digital image using wavelet and fractal encoding
|Apr 29, 1996
|Jan 16, 2001
|Fondazione Centro S. Raffaele Del Monte Tabor
|Device for automatically positioning and centering a microscope optical head
|Dec 23, 1997
|Jun 26, 2001
|Board Of The Regents, The University Of Texas System
|Foveated image coding system and method for image bandwidth reduction
|Jan 28, 1999
|Dec 4, 2001
|Sharp Laboratories Of America, Inc.
|Method of visual progressive coding
|Aug 3, 1999
|Jan 15, 2002
|Kabushiki Kaisha Toshiba
|Image compression of a facial region by adaptive quantization based on resolution
|Dec 10, 2001
|Jun 24, 2003
|Kabushiki Kaisha Toshiba
|Image decoding of image content within a boundary based on a map resolution transformed signal
|Feb 25, 2000
|Jun 24, 2003
|Eastman Kodak Company
|Method and system for search and retrieval of similar patterns
|Dec 10, 2001
|Sep 2, 2003
|Kabushiki Kaisha Toshiba
|Image compression with orthogonal transform of blocks within a bounded shape
|Dec 10, 2001
|Oct 28, 2003
|Kabushiki Kaisha Toshiba
|Image decoding using a shape map
|Apr 25, 2003
|Feb 24, 2004
|Kabushiki Kaisha Toshiba
|Image coding and decoding using a position and shape map
|Jan 28, 1999
|Mar 30, 2004
|Canon Kabushiki Kaisha
|Image processing device and method and memory medium
|Nov 5, 2002
|Mar 30, 2004
|Kabushiki Kaisha Toshiba
|Subband image compression of blocks within a bounded shape using a resolution transform
|Apr 25, 2003
|Nov 30, 2004
|Kabushiki Kaisha Toshiba
|Method and apparatus for image encoding and decoding using a shape and position map
|Jul 6, 2001
|Feb 22, 2005
|Eastman Kodak Company
|Method for representing a digital color image using a set of palette colors based on detected important colors
|Apr 25, 2003
|Mar 15, 2005
|Kabushiki Kaisha Toshiba
|Method and apparatus for image coding and/or decoding using a position and shape map
|Jul 6, 2001
|Dec 27, 2005
|Eastman Kodak Company
|Method for representing a digital color image using a set of palette colors
|May 17, 2004
|Mar 14, 2006
|Eastman Kodak Company
|Method for representing a digital color image using a set of palette colors based on detected important colors
|Jan 21, 2005
|May 30, 2006
|Kabushiki Kaisha Toshiba
|Image data coding and/or decoding system capable of high-efficient coding
|Dec 22, 2004
|Jan 27, 2009
|Himax Technologies Limited
|Frame-varying addressing method of color sequential display
|Apr 3, 2008
|Dec 27, 2011
|Miranda Technologies Inc.
|Method and apparatus for providing an indication of a level of distortion created by blocking artifacts
|Oct 19, 2011
|Jun 23, 2015
|Dolby Laboratories Licensing Corporation
|Error resilient rate distortion optimization for image and video encoding
|Jul 6, 2001
|Jan 16, 2003
|Eastman Kodak Company
|Method for representing a digital color image using a set of palette colors based on detected important colors
|Apr 25, 2003
|Oct 23, 2003
|Kabushiki Kaisha Toshiba
|Image data coding and/or decoding system capable of high-efficient coding
|May 17, 2004
|Feb 24, 2005
|Jiebo Luo
|Method for representing a digital color image using a set of palette colors based on detected important colors
|Jan 21, 2005
|Jun 16, 2005
|Kabushiki Kaisha Toshiba
|Image data coding and/or decoding system capable of high-efficient coding
|Dec 22, 2004
|Jun 22, 2006
|Shwang-Shi Bai
|Frame-varying addressing method of color sequential display
|Apr 3, 2008
|Oct 8, 2009
|Miranda Technologies Inc.
|Method and apparatus for providing an indication of a level of distortion created by blocking artifacts
|Aug 20, 1993
|Mar 2, 1994
|Fuji Xerox Co., Ltd.
|Image signal encoding device
|May 5, 1995
|Sep 25, 1996
|Daewoo Electronics Co., Ltd
|Method and apparatus for determining feature points
|May 13, 1997
|Nov 19, 1997
|Daewoo Electronics Co., Ltd
|Methods and apparatus for removing blocking effect in a motion picture decoder
|May 13, 1997
|Oct 20, 2004
|Daewoo Electronics Corporation
|Method and apparatus for removing blocking effects in a motion picture decoder
|Oct 6, 1994
|May 4, 1995
|Bell Communications Research, Inc.
|Apparatus and method for predicting subjective quality of compressed images
|Jul 30, 2004
|Mar 9, 2006
|Pascale Loiseau
|Method for reducing size of a digital audio, image or video file
|Apr 3, 2009
|Oct 8, 2009
|Miranda Technologies Inc.
|Method and apparatus for providing an indication of a level of distortion created by blocking artifacts
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|May 11, 1990
Owner name: BOARD OF REGENTS, THE UNIVERSITY OF TEXAS SYSTEM,
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNORS:BOVIK, ALAN C.;CHEN, DAPANG;REEL/FRAME:005310/0343
Effective date: 19900502
|Sep 21, 1993
|Certificate of correction
|Feb 20, 1996
|Fee payment
Year of fee payment: 4
|Mar 28, 2000
|Maintenance fee reminder mailed
|Sep 3, 2000
|Lapse for failure to pay maintenance fees
|Nov 7, 2000
|Expired due to failure to pay maintenance fee
Effective date: 20000901


text:
Dennis Basso Escaped an Assassination Attempt
A man shot at Basso after mistaking him for Bill Clinton.
Designer Dennis Basso, beloved by uptown ladies for his fancy fur coats, was once mistaken for Bill Clinton in 1994. Normally, this wouldn't be a bad thing, but in this case, the person who misidentified him was Francisco Martin Duran, an assassin who was trying to shoot the president and fired at Basso instead. (Clinton himself was inside the White House, watching a football game.)
Basso told his side of the story to the Post yesterday, explaining that he'd been at the White House to take a tour after holding a Clinton fundraiser. He was standing on the steps, he recalled:
All of a sudden we hear pop, pop, pop, and I go, oh, someone is shooting firecrackers ... Hundreds of Secret Service dragged us backwards... they put us in a holding room, there was pandemonium.
Of his resemblance to Clinton, he added:
I am wearing a navy suit, I'm tall, he's tall, white hair, white hair, he's a big guy ... [At Duran's trial, lawyers showed] a blow-up of me and a blow-up of the president at 300 yards ... we really do look like the same person.
Duran initially pled insanity, claiming that he'd been trying to save the world by destroying an alien "mist" that was connected by an umbilical cord to an alien in the Colorado mountains. (Also insane: that he assumed Clinton was the only white-haired, suit-clad white man in the White House.) Prosecutors proved that Duran was faking, and he was convicted in 1995 and sentenced to 40 years in prison.


text: Dining in Cyprus The Columbia Beach Resort Offers a Tantalising Treat The Columbia Beach Resort is well known when it comes to fine dining in Cyprus, thanks to the hard work and dedication of our of Chef de cuisine, Ioannis Giakoumidis, who oversees the wonderful culinary creations that make the Columbia Beach Resort such a gastronomic hotspot with one of the best Five Star Restaurants. In order to satisfy you, our guests, we go to every length to ensure that your eating experiences are exceptional in every way. Whether you're looking for local flavours or international influences, you can trust our restaurants to deliver the very best in traditional tastes and exquisite fine dining. Try our gourmet restaurant for fantastic fine dining Join us for a traditional 'meze' at the Apollo Tavern, one of the Top Restaurants in Limassol or if you'd prefer something other than the Cypriot food included on it's dinner menu, do sample some of our delectable dishes at our incredible Bacchus Italian Gourmet Restaurant, one of the Top Gourmet Restaurants in Cyprus. For the ultimate in fine dining in Cyprus, every item on the Bacchus menu has been cleverly created, incorporating perfectly balanced flavours and choices to sate every appetite. Overlooking the scenic Bay of Pissouri, our beach resort also houses the nautically-themed Eros Cocktail Bar, where you can enjoy our impressive selection of alcoholic and fruit cocktails or if you prefer a coffee, Cyprus style and the kids want an ice cream, try The Ouzeri. While you may want to try our fine dining provisions by night, life in Cyprus is very much about the sun by day; hot and cold snacks and a range of liquid refreshments can be found at the Poseidon Pool Bar and the COLUMBIA Beach Bar, allowing you to satisfy yourself without needing to move too far from the beach, pool or gardens, whilst our Apollo Tavern has a complete lunch menu for you too. Children have their own menu to choose from. The team of our Five Star Columbia Restaurants, will be happy to cater for any special requirements you may have, whether that be dietary, first class catering for an event, a relaxed BBQ on the seafront or anything at all; just ask and we'll do whatever we can to provide.


text:
Showing Suppliers 1 - 13 of 13
ANVER Corporation (591 Products)
Address: 36 Parmenter Road, Hudson, MA
Business Type: Manufacturer
Description: Suction Cups, Vacuum Cups, Vacuum Pumps, Vacuum Lifters, Vacuum Lifts, Vacuum System Components and Vacuum Lifting Equipment for All Applications - Trusted Quality Made in the USA since 1968 ANVER was founded by Anton Vernooy in 1968 (Anton Vernooy is the basis... (more)
Grainger Industrial Supply
Business Type: Distributor
Description: Grainger helps customers save time and money by providing them the right products to keep their facilities up and running. Grainger's customers are 2.0 million businesses and institutions in 157 countries. While each customer has a unique facility to operate and a different problem to solve, our... (more)
Address: 400 Arsenal St. Branch 096, Watertown, MA
Address: 209 Brooks St. Branch 090, Worcester, MA
Address: 125 John Hancock Rd. Branch 097, Taunton, MA
Address: 34 Blandin Ave. Branch 094, Framingham, MA
Address: 428 University Ave. Branch 088, Norwood, MA
Address: 121 Marston St. Branch 095, Lawrence, MA
Address: 790 Cottage St. Branch 808, Springfield, MA
Address: 31 Cabot Rd. Branch 089, Woburn, MA
Address: 160 Broadway Branch 091, Everett, MA
Address: 54 Newmarket Sq. Branch 098, Boston, MA
Northland Industrial Truck Co., Inc.
Address: 6 Jonspin Road, Wilmington, MA
Business Type: Distributor
PIAB USA, Inc.
Address: 65 Sharp Street, Hingham, MA
Business Type: Manufacturer


text:
THE DIY CLUB TOP 10 VOTING the CONTEST is ON... We all had a hard time choosing, just 2 each. There were so many great entries. Thank you for all your hard work. It was really fun. ~~~~~~~~~~~ You are welcome to send people over to vote for your project, if you would likeANYONE CAN VOTE You may post about it on Twitter, Your Blog, Facebook, etc. You only get one … [Read more...]
DIY Club — Please Vote!!
Some Exciting News!! The DIY CLub — Let the Magic Begin! Update!
I have some exciting news to share!!!I am happy to announce a fun blog-hop monthly party!I hope you will want to be a part of it! --The Suspense is OVER----The Secret is OUT----Now let the FUN & Magic begin.-- Welcomeandlet me introduce you toThe DIY Club.The DIY Club is a group of 5 bloggers: 504 Main Its So Very Cheri Tatertots & Jello WhisperWood Cottage Under the Table & … [Read more...]


text:
Computer Concepts - Illustrated Complete
Course Technology, Dec 1, 1998 - Computers - 376 pages
As part of the Illustrated Series, this text offers a quick visual approach to learning the basics of computers as well as how they impact our every day lives. n
What people are saying - Write a review
We haven't found any reviews in the usual places.
Concepts Review
Label each element shown in Figure A 22
2 other sections not shown
Other editions - View all
Computer Concepts Illustrated Brief - 7th Edition
June Jamrich Parsons,Dan Oja
No preview available - 2008
Common terms and phrases
application software backup browser button bytes called CD-ROM central processing unit chip Click complete this independent Computer programs computer system connected contains copy create data files database designed desktop display domain name e-mail electronic encryption example expansion card Explore filename format genetic algorithm graphics hard disk drive hard drive hardware icon images INDEPENDENT CHALLENGE infringement input instructions Internet mainframe memory menu microcomputer microprocessor Microsoft modem monitor mouse multimedia notebook computer operating system password patent Pentium peripheral devices printer processor protection public-key cryptography puter Quick Check referred robots screen shown in Figure Social Security number spreadsheet Steps storage device stored tape tion True or False user interface virus detection viruses Windows Windows 95 word worksheet workstation World Wide World Wide Web